From daa8f069102d8f3460bd54acbb912e902489bd1a Mon Sep 17 00:00:00 2001
From: bunnyxt-ci <bunnyxt-ci@users.noreply.github.com>
Date: Fri, 9 Aug 2024 00:09:46 +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 5a7681b..b7e75cc 100644
--- a/problems_all.json
+++ b/problems_all.json
@@ -1 +1 @@
-{"1": {"acRate": 53.33998595829619, "difficulty": "Easy", "likes": 57460, "dislikes": 2016, "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": 14055822, "totalSubmissionRaw": 26351381}, "2": {"acRate": 43.676263955333525, "difficulty": "Medium", "likes": 31348, "dislikes": 6269, "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": 4826100, "totalSubmissionRaw": 11049709}, "3": {"acRate": 35.199933310082436, "difficulty": "Medium", "likes": 39872, "dislikes": 1908, "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": 6114200, "totalSubmissionRaw": 17369918}, "4": {"acRate": 40.983823399731534, "difficulty": "Hard", "likes": 28458, "dislikes": 3181, "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": 2760672, "totalSubmissionRaw": 6736008}, "5": {"acRate": 34.22195595869385, "difficulty": "Medium", "likes": 29421, "dislikes": 1796, "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": 3218298, "totalSubmissionRaw": 9404206}, "6": {"acRate": 48.861607334435355, "difficulty": "Medium", "likes": 7716, "dislikes": 14731, "categoryTitle": "Algorithms", "frontendQuestionId": "6", "paidOnly": false, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1423252, "totalSubmissionRaw": 2912827}, "7": {"acRate": 28.957126268046974, "difficulty": "Medium", "likes": 13136, "dislikes": 13564, "categoryTitle": "Algorithms", "frontendQuestionId": "7", "paidOnly": false, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3398333, "totalSubmissionRaw": 11735746}, "8": {"acRate": 17.69373555180749, "difficulty": "Medium", "likes": 4617, "dislikes": 13824, "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": 1627611, "totalSubmissionRaw": 9198803}, "9": {"acRate": 57.14692010306332, "difficulty": "Easy", "likes": 12777, "dislikes": 2745, "categoryTitle": "Algorithms", "frontendQuestionId": "9", "paidOnly": false, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4999222, "totalSubmissionRaw": 8748012}, "10": {"acRate": 28.29116990988697, "difficulty": "Hard", "likes": 12177, "dislikes": 2178, "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": 997763, "totalSubmissionRaw": 3526776}, "11": {"acRate": 55.85474935409401, "difficulty": "Medium", "likes": 29263, "dislikes": 1796, "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": 3183789, "totalSubmissionRaw": 5700124}, "12": {"acRate": 65.78650173259825, "difficulty": "Medium", "likes": 7201, "dislikes": 5563, "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": 1398046, "totalSubmissionRaw": 2125128}, "13": {"acRate": 62.17910785763133, "difficulty": "Easy", "likes": 14363, "dislikes": 950, "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": 3887868, "totalSubmissionRaw": 6252696}, "14": {"acRate": 43.449413505320756, "difficulty": "Easy", "likes": 17700, "dislikes": 4564, "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": 3576888, "totalSubmissionRaw": 8232318}, "15": {"acRate": 35.05880763112067, "difficulty": "Medium", "likes": 31031, "dislikes": 2889, "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": 3772167, "totalSubmissionRaw": 10759548}, "16": {"acRate": 45.96856283154781, "difficulty": "Medium", "likes": 10479, "dislikes": 571, "categoryTitle": "Algorithms", "frontendQuestionId": "16", "paidOnly": false, "title": "3Sum Closest", "titleSlug": "3sum-closest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1273049, "totalSubmissionRaw": 2769390}, "17": {"acRate": 61.29617266701997, "difficulty": "Medium", "likes": 18668, "dislikes": 1007, "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": 2137464, "totalSubmissionRaw": 3487114}, "18": {"acRate": 36.54393545787357, "difficulty": "Medium", "likes": 11357, "dislikes": 1401, "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": 1022970, "totalSubmissionRaw": 2799284}, "19": {"acRate": 46.25836705918042, "difficulty": "Medium", "likes": 18935, "dislikes": 814, "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": 2885025, "totalSubmissionRaw": 6236781}, "20": {"acRate": 40.83933766080954, "difficulty": "Easy", "likes": 24176, "dislikes": 1781, "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": 4907713, "totalSubmissionRaw": 12017120}, "21": {"acRate": 64.94489448531662, "difficulty": "Easy", "likes": 21890, "dislikes": 2137, "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": 4400986, "totalSubmissionRaw": 6776508}, "22": {"acRate": 75.19797976656118, "difficulty": "Medium", "likes": 21177, "dislikes": 953, "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": 1934075, "totalSubmissionRaw": 2571978}, "23": {"acRate": 53.69006000736041, "difficulty": "Hard", "likes": 19510, "dislikes": 721, "categoryTitle": "Algorithms", "frontendQuestionId": "23", "paidOnly": false, "title": "Merge k Sorted Lists", "titleSlug": "merge-k-sorted-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2092038, "totalSubmissionRaw": 3896515}, "24": {"acRate": 64.97236856370051, "difficulty": "Medium", "likes": 11981, "dislikes": 449, "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": 1420358, "totalSubmissionRaw": 2186095}, "25": {"acRate": 59.865202798382676, "difficulty": "Hard", "likes": 13761, "dislikes": 706, "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": 993475, "totalSubmissionRaw": 1659523}, "26": {"acRate": 57.01297564696656, "difficulty": "Easy", "likes": 14809, "dislikes": 18774, "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": 4748946, "totalSubmissionRaw": 8329625}, "27": {"acRate": 57.73445552134054, "difficulty": "Easy", "likes": 2665, "dislikes": 3752, "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": 3190108, "totalSubmissionRaw": 5525490}, "28": {"acRate": 43.07651185948708, "difficulty": "Easy", "likes": 5919, "dislikes": 423, "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": 2647849, "totalSubmissionRaw": 6146850}, "29": {"acRate": 17.669795780067517, "difficulty": "Medium", "likes": 5181, "dislikes": 14839, "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": 784317, "totalSubmissionRaw": 4438744}, "30": {"acRate": 32.60375587627508, "difficulty": "Hard", "likes": 1885, "dislikes": 271, "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": 475216, "totalSubmissionRaw": 1457551}, "31": {"acRate": 40.718824265764944, "difficulty": "Medium", "likes": 18470, "dislikes": 4703, "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": 1444895, "totalSubmissionRaw": 3548474}, "32": {"acRate": 34.56439495765187, "difficulty": "Hard", "likes": 12375, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "32", "paidOnly": false, "title": "Longest Valid Parentheses", "titleSlug": "longest-valid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 771466, "totalSubmissionRaw": 2231958}, "33": {"acRate": 41.259513456905445, "difficulty": "Medium", "likes": 26375, "dislikes": 1591, "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": 2917420, "totalSubmissionRaw": 7070902}, "34": {"acRate": 44.89375776621486, "difficulty": "Medium", "likes": 20567, "dislikes": 523, "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": 2166298, "totalSubmissionRaw": 4825388}, "35": {"acRate": 46.741500824681566, "difficulty": "Easy", "likes": 16241, "dislikes": 751, "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": 3075069, "totalSubmissionRaw": 6578892}, "36": {"acRate": 60.283046409337274, "difficulty": "Medium", "likes": 10755, "dislikes": 1134, "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": 1614753, "totalSubmissionRaw": 2678626}, "37": {"acRate": 62.27937553641247, "difficulty": "Hard", "likes": 9564, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "37", "paidOnly": false, "title": "Sudoku Solver", "titleSlug": "sudoku-solver", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 626943, "totalSubmissionRaw": 1006663}, "38": {"acRate": 55.972959531822866, "difficulty": "Medium", "likes": 4028, "dislikes": 8349, "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": 967917, "totalSubmissionRaw": 1729259}, "39": {"acRate": 72.30158243107, "difficulty": "Medium", "likes": 18858, "dislikes": 425, "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": 2061760, "totalSubmissionRaw": 2851614}, "40": {"acRate": 55.002273135764355, "difficulty": "Medium", "likes": 10538, "dislikes": 302, "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": 1040448, "totalSubmissionRaw": 1891650}, "41": {"acRate": 39.79344015195381, "difficulty": "Hard", "likes": 16855, "dislikes": 1865, "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": 1262463, "totalSubmissionRaw": 3172541}, "42": {"acRate": 62.7236639875169, "difficulty": "Hard", "likes": 32164, "dislikes": 522, "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": 2247843, "totalSubmissionRaw": 3583724}, "43": {"acRate": 40.77658171422677, "difficulty": "Medium", "likes": 7080, "dislikes": 3357, "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": 830148, "totalSubmissionRaw": 2035845}, "44": {"acRate": 28.39043479896898, "difficulty": "Hard", "likes": 8276, "dislikes": 354, "categoryTitle": "Algorithms", "frontendQuestionId": "44", "paidOnly": false, "title": "Wildcard Matching", "titleSlug": "wildcard-matching", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 603591, "totalSubmissionRaw": 2126039}, "45": {"acRate": 40.62178165475536, "difficulty": "Medium", "likes": 14631, "dislikes": 584, "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": 1343035, "totalSubmissionRaw": 3306216}, "46": {"acRate": 78.95367338538755, "difficulty": "Medium", "likes": 19113, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "46", "paidOnly": false, "title": "Permutations", "titleSlug": "permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2184837, "totalSubmissionRaw": 2767240}, "47": {"acRate": 59.76393552407616, "difficulty": "Medium", "likes": 8525, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "47", "paidOnly": false, "title": "Permutations II", "titleSlug": "permutations-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 963810, "totalSubmissionRaw": 1612695}, "48": {"acRate": 75.38928484745118, "difficulty": "Medium", "likes": 17660, "dislikes": 820, "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": 1838811, "totalSubmissionRaw": 2439087}, "49": {"acRate": 69.1160588693853, "difficulty": "Medium", "likes": 19311, "dislikes": 630, "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": 3055274, "totalSubmissionRaw": 4420498}, "50": {"acRate": 35.28752071258053, "difficulty": "Medium", "likes": 9814, "dislikes": 9558, "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": 1770537, "totalSubmissionRaw": 5017464}, "51": {"acRate": 69.43698892967815, "difficulty": "Hard", "likes": 12430, "dislikes": 290, "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": 776637, "totalSubmissionRaw": 1118479}, "52": {"acRate": 74.63989157475972, "difficulty": "Hard", "likes": 3864, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "52", "paidOnly": false, "title": "N-Queens II", "titleSlug": "n-queens-ii", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 408634, "totalSubmissionRaw": 547474}, "53": {"acRate": 51.02215958811453, "difficulty": "Medium", "likes": 34144, "dislikes": 1447, "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": 4109937, "totalSubmissionRaw": 8055202}, "54": {"acRate": 50.61638182834297, "difficulty": "Medium", "likes": 14866, "dislikes": 1316, "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": 1519767, "totalSubmissionRaw": 3002521}, "55": {"acRate": 38.68461502508805, "difficulty": "Medium", "likes": 19459, "dislikes": 1251, "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": 2052623, "totalSubmissionRaw": 5306058}, "56": {"acRate": 47.77268458859656, "difficulty": "Medium", "likes": 22265, "dislikes": 783, "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": 2539063, "totalSubmissionRaw": 5314896}, "57": {"acRate": 41.963512893143886, "difficulty": "Medium", "likes": 10417, "dislikes": 819, "categoryTitle": "Algorithms", "frontendQuestionId": "57", "paidOnly": false, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1180993, "totalSubmissionRaw": 2814347}, "58": {"acRate": 53.02373631343373, "difficulty": "Easy", "likes": 5259, "dislikes": 288, "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": 2152595, "totalSubmissionRaw": 4059695}, "59": {"acRate": 71.63054960329649, "difficulty": "Medium", "likes": 6370, "dislikes": 263, "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": 594684, "totalSubmissionRaw": 830212}, "60": {"acRate": 47.765595106044536, "difficulty": "Hard", "likes": 6691, "dislikes": 480, "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": 414688, "totalSubmissionRaw": 868173}, "61": {"acRate": 38.36201445314186, "difficulty": "Medium", "likes": 9730, "dislikes": 1451, "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": 1031323, "totalSubmissionRaw": 2688405}, "62": {"acRate": 64.63290035033009, "difficulty": "Medium", "likes": 16691, "dislikes": 447, "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": 1938261, "totalSubmissionRaw": 2998876}, "63": {"acRate": 41.99652862195594, "difficulty": "Medium", "likes": 8777, "dislikes": 509, "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": 993241, "totalSubmissionRaw": 2365052}, "64": {"acRate": 64.60691983682409, "difficulty": "Medium", "likes": 12485, "dislikes": 170, "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": 1246079, "totalSubmissionRaw": 1928707}, "65": {"acRate": 20.191220538541643, "difficulty": "Hard", "likes": 1264, "dislikes": 2007, "categoryTitle": "Algorithms", "frontendQuestionId": "65", "paidOnly": false, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 380020, "totalSubmissionRaw": 1882114}, "66": {"acRate": 45.85913561135301, "difficulty": "Easy", "likes": 9409, "dislikes": 5407, "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": 2385912, "totalSubmissionRaw": 5202700}, "67": {"acRate": 54.08909436964805, "difficulty": "Easy", "likes": 9450, "dislikes": 980, "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": 1543117, "totalSubmissionRaw": 2852922}, "68": {"acRate": 44.52727381290931, "difficulty": "Hard", "likes": 3721, "dislikes": 4741, "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": 439978, "totalSubmissionRaw": 988109}, "69": {"acRate": 39.166456874669734, "difficulty": "Easy", "likes": 8216, "dislikes": 4514, "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": 2089383, "totalSubmissionRaw": 5334628}, "70": {"acRate": 53.04204608096449, "difficulty": "Easy", "likes": 22011, "dislikes": 848, "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": 3462991, "totalSubmissionRaw": 6528769}, "71": {"acRate": 43.60114228515912, "difficulty": "Medium", "likes": 5623, "dislikes": 1287, "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": 814545, "totalSubmissionRaw": 1868176}, "72": {"acRate": 57.06645993340377, "difficulty": "Medium", "likes": 14879, "dislikes": 234, "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": 925279, "totalSubmissionRaw": 1621405}, "73": {"acRate": 56.863480760622345, "difficulty": "Medium", "likes": 14576, "dislikes": 737, "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": 1538331, "totalSubmissionRaw": 2705304}, "74": {"acRate": 50.74914406890727, "difficulty": "Medium", "likes": 15827, "dislikes": 420, "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": 1909014, "totalSubmissionRaw": 3761668}, "75": {"acRate": 64.52865560869853, "difficulty": "Medium", "likes": 18630, "dislikes": 662, "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": 2257282, "totalSubmissionRaw": 3498107}, "76": {"acRate": 43.46001367760054, "difficulty": "Hard", "likes": 17936, "dislikes": 739, "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": 1430492, "totalSubmissionRaw": 3291513}, "77": {"acRate": 70.97185643504822, "difficulty": "Medium", "likes": 8244, "dislikes": 227, "categoryTitle": "Algorithms", "frontendQuestionId": "77", "paidOnly": false, "title": "Combinations", "titleSlug": "combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 944245, "totalSubmissionRaw": 1330454}, "78": {"acRate": 78.89857495300572, "difficulty": "Medium", "likes": 17310, "dislikes": 282, "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": 2063360, "totalSubmissionRaw": 2615207}, "79": {"acRate": 43.34736043233743, "difficulty": "Medium", "likes": 15922, "dislikes": 670, "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": 1758033, "totalSubmissionRaw": 4055700}, "80": {"acRate": 59.58950887767408, "difficulty": "Medium", "likes": 6965, "dislikes": 1348, "categoryTitle": "Algorithms", "frontendQuestionId": "80", "paidOnly": false, "title": "Remove Duplicates from Sorted Array II", "titleSlug": "remove-duplicates-from-sorted-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1084514, "totalSubmissionRaw": 1819983}, "81": {"acRate": 38.00393431581915, "difficulty": "Medium", "likes": 8522, "dislikes": 1048, "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": 776439, "totalSubmissionRaw": 2043041}, "82": {"acRate": 48.01656598074382, "difficulty": "Medium", "likes": 8841, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "82", "paidOnly": false, "title": "Remove Duplicates from Sorted List II", "titleSlug": "remove-duplicates-from-sorted-list-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 773206, "totalSubmissionRaw": 1610289}, "83": {"acRate": 53.12130031815199, "difficulty": "Easy", "likes": 8721, "dislikes": 309, "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": 1607236, "totalSubmissionRaw": 3025596}, "84": {"acRate": 45.15436975179246, "difficulty": "Hard", "likes": 17295, "dislikes": 289, "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": 955120, "totalSubmissionRaw": 2115229}, "85": {"acRate": 51.24874833320754, "difficulty": "Hard", "likes": 10587, "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": 509245, "totalSubmissionRaw": 993670}, "86": {"acRate": 56.89090600241299, "difficulty": "Medium", "likes": 7357, "dislikes": 879, "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": 653079, "totalSubmissionRaw": 1147952}, "87": {"acRate": 40.51034738508342, "difficulty": "Hard", "likes": 3334, "dislikes": 1280, "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": 235959, "totalSubmissionRaw": 582466}, "88": {"acRate": 50.56627295772774, "difficulty": "Easy", "likes": 15091, "dislikes": 1973, "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": 3459801, "totalSubmissionRaw": 6842124}, "89": {"acRate": 59.78434039246163, "difficulty": "Medium", "likes": 2252, "dislikes": 2723, "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": 307710, "totalSubmissionRaw": 514700}, "90": {"acRate": 57.83316635326092, "difficulty": "Medium", "likes": 9781, "dislikes": 320, "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": 984779, "totalSubmissionRaw": 1702794}, "91": {"acRate": 35.2653527989947, "difficulty": "Medium", "likes": 11949, "dislikes": 4519, "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": 1294564, "totalSubmissionRaw": 3670927}, "92": {"acRate": 48.094985554280285, "difficulty": "Medium", "likes": 11654, "dislikes": 624, "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": 911412, "totalSubmissionRaw": 1895025}, "93": {"acRate": 50.6751981867847, "difficulty": "Medium", "likes": 5234, "dislikes": 791, "categoryTitle": "Algorithms", "frontendQuestionId": "93", "paidOnly": false, "title": "Restore IP Addresses", "titleSlug": "restore-ip-addresses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 473990, "totalSubmissionRaw": 935351}, "94": {"acRate": 76.772819746632, "difficulty": "Easy", "likes": 13521, "dislikes": 794, "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": 2659693, "totalSubmissionRaw": 3464368}, "95": {"acRate": 58.369155454153976, "difficulty": "Medium", "likes": 7572, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "95", "paidOnly": false, "title": "Unique Binary Search Trees II", "titleSlug": "unique-binary-search-trees-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 463568, "totalSubmissionRaw": 794201}, "96": {"acRate": 61.36999550623319, "difficulty": "Medium", "likes": 10365, "dislikes": 407, "categoryTitle": "Algorithms", "frontendQuestionId": "96", "paidOnly": false, "title": "Unique Binary Search Trees", "titleSlug": "unique-binary-search-trees", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 681469, "totalSubmissionRaw": 1110427}, "97": {"acRate": 40.39527815856747, "difficulty": "Medium", "likes": 8232, "dislikes": 486, "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": 547207, "totalSubmissionRaw": 1354633}, "98": {"acRate": 33.250474297330506, "difficulty": "Medium", "likes": 16869, "dislikes": 1382, "categoryTitle": "Algorithms", "frontendQuestionId": "98", "paidOnly": false, "title": "Validate Binary Search Tree", "titleSlug": "validate-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2451189, "totalSubmissionRaw": 7371897}, "99": {"acRate": 53.90369139676875, "difficulty": "Medium", "likes": 7926, "dislikes": 257, "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": 473034, "totalSubmissionRaw": 877554}, "100": {"acRate": 62.93138736588638, "difficulty": "Easy", "likes": 11601, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "100", "paidOnly": false, "title": "Same Tree", "titleSlug": "same-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2301437, "totalSubmissionRaw": 3657060}, "101": {"acRate": 57.20917697274817, "difficulty": "Easy", "likes": 15343, "dislikes": 382, "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": 2090877, "totalSubmissionRaw": 3654796}, "102": {"acRate": 68.09664270755452, "difficulty": "Medium", "likes": 15370, "dislikes": 316, "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": 2362618, "totalSubmissionRaw": 3469512}, "103": {"acRate": 59.66759809675749, "difficulty": "Medium", "likes": 10865, "dislikes": 302, "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": 1237213, "totalSubmissionRaw": 2073511}, "104": {"acRate": 75.87095057945604, "difficulty": "Easy", "likes": 12887, "dislikes": 230, "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": 3285607, "totalSubmissionRaw": 4330520}, "105": {"acRate": 64.6447111129203, "difficulty": "Medium", "likes": 15046, "dislikes": 510, "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": 1302204, "totalSubmissionRaw": 2014401}, "106": {"acRate": 63.826476823143985, "difficulty": "Medium", "likes": 8038, "dislikes": 131, "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": 675638, "totalSubmissionRaw": 1058555}, "107": {"acRate": 64.00969534423096, "difficulty": "Medium", "likes": 4867, "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": 664436, "totalSubmissionRaw": 1038024}, "108": {"acRate": 72.31596782191856, "difficulty": "Easy", "likes": 10992, "dislikes": 562, "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": 1259964, "totalSubmissionRaw": 1742303}, "109": {"acRate": 62.4967108148408, "difficulty": "Medium", "likes": 7460, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "109", "paidOnly": false, "title": "Convert Sorted List to Binary Search Tree", "titleSlug": "convert-sorted-list-to-binary-search-tree", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 541519, "totalSubmissionRaw": 866476}, "110": {"acRate": 52.97915882888147, "difficulty": "Easy", "likes": 10761, "dislikes": 699, "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": 1588470, "totalSubmissionRaw": 2998292}, "111": {"acRate": 48.65652603494598, "difficulty": "Easy", "likes": 7304, "dislikes": 1312, "categoryTitle": "Algorithms", "frontendQuestionId": "111", "paidOnly": false, "title": "Minimum Depth of Binary Tree", "titleSlug": "minimum-depth-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1248868, "totalSubmissionRaw": 2566700}, "112": {"acRate": 51.04110802340487, "difficulty": "Easy", "likes": 9710, "dislikes": 1117, "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": 1529430, "totalSubmissionRaw": 2996468}, "113": {"acRate": 58.93626614728837, "difficulty": "Medium", "likes": 7968, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "113", "paidOnly": false, "title": "Path Sum II", "titleSlug": "path-sum-ii", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 887519, "totalSubmissionRaw": 1505897}, "114": {"acRate": 65.9035930624889, "difficulty": "Medium", "likes": 12293, "dislikes": 563, "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": 1002017, "totalSubmissionRaw": 1520429}, "115": {"acRate": 47.86266369277654, "difficulty": "Hard", "likes": 6649, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "115", "paidOnly": false, "title": "Distinct Subsequences", "titleSlug": "distinct-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433474, "totalSubmissionRaw": 905661}, "116": {"acRate": 63.34934878353234, "difficulty": "Medium", "likes": 9732, "dislikes": 303, "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": 1075899, "totalSubmissionRaw": 1698359}, "117": {"acRate": 53.21228437239382, "difficulty": "Medium", "likes": 5853, "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": 654642, "totalSubmissionRaw": 1230246}, "118": {"acRate": 75.03556922010263, "difficulty": "Easy", "likes": 12914, "dislikes": 456, "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": 1766232, "totalSubmissionRaw": 2353860}, "119": {"acRate": 64.4575364878292, "difficulty": "Easy", "likes": 4841, "dislikes": 344, "categoryTitle": "Algorithms", "frontendQuestionId": "119", "paidOnly": false, "title": "Pascal's Triangle II", "titleSlug": "pascals-triangle-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 917943, "totalSubmissionRaw": 1424105}, "120": {"acRate": 57.3673162101637, "difficulty": "Medium", "likes": 9558, "dislikes": 559, "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": 810004, "totalSubmissionRaw": 1411963}, "121": {"acRate": 53.978852721392215, "difficulty": "Easy", "likes": 31110, "dislikes": 1171, "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": 5008661, "totalSubmissionRaw": 9278944}, "122": {"acRate": 67.28653906192761, "difficulty": "Medium", "likes": 13656, "dislikes": 2705, "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": 2038814, "totalSubmissionRaw": 3030051}, "123": {"acRate": 48.836471439010445, "difficulty": "Hard", "likes": 9687, "dislikes": 195, "categoryTitle": "Algorithms", "frontendQuestionId": "123", "paidOnly": false, "title": "Best Time to Buy and Sell Stock III", "titleSlug": "best-time-to-buy-and-sell-stock-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 644931, "totalSubmissionRaw": 1320593}, "124": {"acRate": 40.26597355078177, "difficulty": "Hard", "likes": 16720, "dislikes": 736, "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": 1304714, "totalSubmissionRaw": 3240238}, "125": {"acRate": 48.3317680860748, "difficulty": "Easy", "likes": 9435, "dislikes": 8380, "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": 3235496, "totalSubmissionRaw": 6694349}, "126": {"acRate": 27.19609679597482, "difficulty": "Hard", "likes": 6017, "dislikes": 753, "categoryTitle": "Algorithms", "frontendQuestionId": "126", "paidOnly": false, "title": "Word Ladder II", "titleSlug": "word-ladder-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 374580, "totalSubmissionRaw": 1377329}, "127": {"acRate": 40.00116905163893, "difficulty": "Hard", "likes": 12099, "dislikes": 1881, "categoryTitle": "Algorithms", "frontendQuestionId": "127", "paidOnly": false, "title": "Word Ladder", "titleSlug": "word-ladder", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1122305, "totalSubmissionRaw": 2805679}, "128": {"acRate": 47.34438239638808, "difficulty": "Medium", "likes": 20106, "dislikes": 1031, "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": 1931984, "totalSubmissionRaw": 4080705}, "129": {"acRate": 66.42814451029388, "difficulty": "Medium", "likes": 8056, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "129", "paidOnly": false, "title": "Sum Root to Leaf Numbers", "titleSlug": "sum-root-to-leaf-numbers", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 922478, "totalSubmissionRaw": 1388687}, "130": {"acRate": 40.35654675615308, "difficulty": "Medium", "likes": 8682, "dislikes": 1865, "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": 757761, "totalSubmissionRaw": 1877668}, "131": {"acRate": 69.95006815666787, "difficulty": "Medium", "likes": 12898, "dislikes": 500, "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": 938050, "totalSubmissionRaw": 1341028}, "132": {"acRate": 34.21408961891024, "difficulty": "Hard", "likes": 5469, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "132", "paidOnly": false, "title": "Palindrome Partitioning II", "titleSlug": "palindrome-partitioning-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 294118, "totalSubmissionRaw": 859640}, "133": {"acRate": 58.50923080784358, "difficulty": "Medium", "likes": 9529, "dislikes": 3843, "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": 1305466, "totalSubmissionRaw": 2231218}, "134": {"acRate": 45.56690432258068, "difficulty": "Medium", "likes": 12022, "dislikes": 1172, "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": 866061, "totalSubmissionRaw": 1900632}, "135": {"acRate": 43.66423832861878, "difficulty": "Hard", "likes": 7879, "dislikes": 667, "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": 571440, "totalSubmissionRaw": 1308708}, "136": {"acRate": 73.71587652355365, "difficulty": "Easy", "likes": 16544, "dislikes": 729, "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": 2975188, "totalSubmissionRaw": 4036020}, "137": {"acRate": 63.440650877200135, "difficulty": "Medium", "likes": 7958, "dislikes": 694, "categoryTitle": "Algorithms", "frontendQuestionId": "137", "paidOnly": false, "title": "Single Number II", "titleSlug": "single-number-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 622398, "totalSubmissionRaw": 981072}, "138": {"acRate": 57.1637593008098, "difficulty": "Medium", "likes": 13913, "dislikes": 1484, "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": 1318177, "totalSubmissionRaw": 2305971}, "139": {"acRate": 47.08003143106025, "difficulty": "Medium", "likes": 17221, "dislikes": 794, "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": 1754913, "totalSubmissionRaw": 3727513}, "140": {"acRate": 51.402696507898746, "difficulty": "Hard", "likes": 7203, "dislikes": 538, "categoryTitle": "Algorithms", "frontendQuestionId": "140", "paidOnly": false, "title": "Word Break II", "titleSlug": "word-break-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 674133, "totalSubmissionRaw": 1311474}, "141": {"acRate": 50.8926266186132, "difficulty": "Easy", "likes": 15569, "dislikes": 1382, "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": 3165664, "totalSubmissionRaw": 6220279}, "142": {"acRate": 52.19586144746238, "difficulty": "Medium", "likes": 13623, "dislikes": 964, "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": 1366889, "totalSubmissionRaw": 2618779}, "143": {"acRate": 59.637568574610555, "difficulty": "Medium", "likes": 11140, "dislikes": 410, "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": 1040994, "totalSubmissionRaw": 1745537}, "144": {"acRate": 70.40384444907156, "difficulty": "Easy", "likes": 8008, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "144", "paidOnly": false, "title": "Binary Tree Preorder Traversal", "titleSlug": "binary-tree-preorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1707506, "totalSubmissionRaw": 2425306}, "145": {"acRate": 71.93454542568097, "difficulty": "Easy", "likes": 6916, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "145", "paidOnly": false, "title": "Binary Tree Postorder Traversal", "titleSlug": "binary-tree-postorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1268723, "totalSubmissionRaw": 1763721}, "146": {"acRate": 42.9739919339697, "difficulty": "Medium", "likes": 20787, "dislikes": 1040, "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": 1716603, "totalSubmissionRaw": 3994509}, "147": {"acRate": 54.24509755214728, "difficulty": "Medium", "likes": 3112, "dislikes": 867, "categoryTitle": "Algorithms", "frontendQuestionId": "147", "paidOnly": false, "title": "Insertion Sort List", "titleSlug": "insertion-sort-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 382153, "totalSubmissionRaw": 704494}, "148": {"acRate": 59.00771861424339, "difficulty": "Medium", "likes": 11663, "dislikes": 351, "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": 843916, "totalSubmissionRaw": 1430179}, "149": {"acRate": 27.268964491830044, "difficulty": "Hard", "likes": 4190, "dislikes": 499, "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": 407150, "totalSubmissionRaw": 1493089}, "150": {"acRate": 52.2873324351933, "difficulty": "Medium", "likes": 7681, "dislikes": 1090, "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": 1117373, "totalSubmissionRaw": 2136994}, "151": {"acRate": 45.009776171814494, "difficulty": "Medium", "likes": 8516, "dislikes": 5185, "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": 1697018, "totalSubmissionRaw": 3770363}, "152": {"acRate": 33.99033133675387, "difficulty": "Medium", "likes": 18557, "dislikes": 693, "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": 1339128, "totalSubmissionRaw": 3939728}, "153": {"acRate": 51.004189015634005, "difficulty": "Medium", "likes": 13273, "dislikes": 587, "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": 1936402, "totalSubmissionRaw": 3796570}, "154": {"acRate": 43.700628890680385, "difficulty": "Hard", "likes": 4687, "dislikes": 489, "categoryTitle": "Algorithms", "frontendQuestionId": "154", "paidOnly": false, "title": "Find Minimum in Rotated Sorted Array II", "titleSlug": "find-minimum-in-rotated-sorted-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 465641, "totalSubmissionRaw": 1065521}, "155": {"acRate": 54.726415306232646, "difficulty": "Medium", "likes": 14192, "dislikes": 882, "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": 1778661, "totalSubmissionRaw": 3250106}, "156": {"acRate": 63.07031931174508, "difficulty": "Medium", "likes": 262, "dislikes": 350, "categoryTitle": "Algorithms", "frontendQuestionId": "156", "paidOnly": true, "title": "Binary Tree Upside Down", "titleSlug": "binary-tree-upside-down", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 103441, "totalSubmissionRaw": 164009}, "157": {"acRate": 41.68005330216853, "difficulty": "Easy", "likes": 578, "dislikes": 3503, "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": 193300, "totalSubmissionRaw": 463770}, "158": {"acRate": 42.43818115212016, "difficulty": "Hard", "likes": 868, "dislikes": 1804, "categoryTitle": "Algorithms", "frontendQuestionId": "158", "paidOnly": true, "title": "Read N Characters Given read4 II - Call Multiple Times", "titleSlug": "read-n-characters-given-read4-ii-call-multiple-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 185353, "totalSubmissionRaw": 436760}, "159": {"acRate": 55.602243255077646, "difficulty": "Medium", "likes": 2215, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "159", "paidOnly": true, "title": "Longest Substring with At Most Two Distinct Characters", "titleSlug": "longest-substring-with-at-most-two-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 264124, "totalSubmissionRaw": 475024}, "160": {"acRate": 58.41655281705531, "difficulty": "Easy", "likes": 15025, "dislikes": 1363, "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": 1657321, "totalSubmissionRaw": 2837075}, "161": {"acRate": 34.34899962002594, "difficulty": "Medium", "likes": 1391, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "161", "paidOnly": true, "title": "One Edit Distance", "titleSlug": "one-edit-distance", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209724, "totalSubmissionRaw": 610568}, "162": {"acRate": 46.00443233817025, "difficulty": "Medium", "likes": 12107, "dislikes": 4696, "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": 1480486, "totalSubmissionRaw": 3218149}, "163": {"acRate": 34.061128225268675, "difficulty": "Easy", "likes": 1097, "dislikes": 2981, "categoryTitle": "Algorithms", "frontendQuestionId": "163", "paidOnly": true, "title": "Missing Ranges", "titleSlug": "missing-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249769, "totalSubmissionRaw": 733302}, "164": {"acRate": 46.8036095393176, "difficulty": "Medium", "likes": 3278, "dislikes": 401, "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": 223907, "totalSubmissionRaw": 478398}, "165": {"acRate": 41.12223072977696, "difficulty": "Medium", "likes": 2640, "dislikes": 2734, "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": 504307, "totalSubmissionRaw": 1226361}, "166": {"acRate": 25.264044791128747, "difficulty": "Medium", "likes": 2086, "dislikes": 3676, "categoryTitle": "Algorithms", "frontendQuestionId": "166", "paidOnly": false, "title": "Fraction to Recurring Decimal", "titleSlug": "fraction-to-recurring-decimal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232385, "totalSubmissionRaw": 919825}, "167": {"acRate": 61.814136756411706, "difficulty": "Medium", "likes": 11772, "dislikes": 1418, "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": 2165220, "totalSubmissionRaw": 3502790}, "168": {"acRate": 41.305947322612134, "difficulty": "Easy", "likes": 5576, "dislikes": 818, "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": 546241, "totalSubmissionRaw": 1322427}, "169": {"acRate": 65.08832847443658, "difficulty": "Easy", "likes": 19296, "dislikes": 639, "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": 3166933, "totalSubmissionRaw": 4865605}, "170": {"acRate": 38.24861673586017, "difficulty": "Easy", "likes": 670, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "170", "paidOnly": true, "title": "Two Sum III - Data structure design", "titleSlug": "two-sum-iii-data-structure-design", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157818, "totalSubmissionRaw": 412611}, "171": {"acRate": 64.23819565449953, "difficulty": "Easy", "likes": 4778, "dislikes": 371, "categoryTitle": "Algorithms", "frontendQuestionId": "171", "paidOnly": false, "title": "Excel Sheet Column Number", "titleSlug": "excel-sheet-column-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 708563, "totalSubmissionRaw": 1103025}, "172": {"acRate": 43.666599864980554, "difficulty": "Medium", "likes": 3208, "dislikes": 1957, "categoryTitle": "Algorithms", "frontendQuestionId": "172", "paidOnly": false, "title": "Factorial Trailing Zeroes", "titleSlug": "factorial-trailing-zeroes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 472825, "totalSubmissionRaw": 1082807}, "173": {"acRate": 72.74821508502444, "difficulty": "Medium", "likes": 8569, "dislikes": 509, "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": 820748, "totalSubmissionRaw": 1128204}, "174": {"acRate": 38.332077908102875, "difficulty": "Hard", "likes": 5805, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "174", "paidOnly": false, "title": "Dungeon Game", "titleSlug": "dungeon-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231543, "totalSubmissionRaw": 604045}, "175": {"acRate": 76.4746369330305, "difficulty": "Easy", "likes": 3528, "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": 1066646, "totalSubmissionRaw": 1394769}, "176": {"acRate": 41.18375587514536, "difficulty": "Medium", "likes": 3605, "dislikes": 957, "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": 919777, "totalSubmissionRaw": 2233349}, "177": {"acRate": 37.94305646953793, "difficulty": "Medium", "likes": 1978, "dislikes": 1034, "categoryTitle": "Database", "frontendQuestionId": "177", "paidOnly": false, "title": "Nth Highest Salary", "titleSlug": "nth-highest-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 412255, "totalSubmissionRaw": 1086507}, "178": {"acRate": 63.026071350095506, "difficulty": "Medium", "likes": 2166, "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": 410168, "totalSubmissionRaw": 650791}, "179": {"acRate": 36.68876817087557, "difficulty": "Medium", "likes": 8069, "dislikes": 671, "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": 496058, "totalSubmissionRaw": 1352077}, "180": {"acRate": 44.35615066267617, "difficulty": "Medium", "likes": 2121, "dislikes": 314, "categoryTitle": "Database", "frontendQuestionId": "180", "paidOnly": false, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 406524, "totalSubmissionRaw": 916497}, "181": {"acRate": 69.98506466615532, "difficulty": "Easy", "likes": 2608, "dislikes": 255, "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": 674296, "totalSubmissionRaw": 963486}, "182": {"acRate": 71.36630350503783, "difficulty": "Easy", "likes": 2081, "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": 700439, "totalSubmissionRaw": 981471}, "183": {"acRate": 69.44248562591632, "difficulty": "Easy", "likes": 2634, "dislikes": 137, "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": 846887, "totalSubmissionRaw": 1219552}, "184": {"acRate": 52.340776518285615, "difficulty": "Medium", "likes": 2060, "dislikes": 186, "categoryTitle": "Database", "frontendQuestionId": "184", "paidOnly": false, "title": "Department Highest Salary", "titleSlug": "department-highest-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 404858, "totalSubmissionRaw": 773504}, "185": {"acRate": 54.443232139755025, "difficulty": "Hard", "likes": 2111, "dislikes": 243, "categoryTitle": "Database", "frontendQuestionId": "185", "paidOnly": false, "title": "Department Top Three Salaries", "titleSlug": "department-top-three-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 357270, "totalSubmissionRaw": 656229}, "186": {"acRate": 54.97713753218949, "difficulty": "Medium", "likes": 1074, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "186", "paidOnly": true, "title": "Reverse Words in a String II", "titleSlug": "reverse-words-in-a-string-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 164601, "totalSubmissionRaw": 299399}, "187": {"acRate": 49.37926157886762, "difficulty": "Medium", "likes": 3337, "dislikes": 536, "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": 391064, "totalSubmissionRaw": 791960}, "188": {"acRate": 44.00388726919339, "difficulty": "Hard", "likes": 7438, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "188", "paidOnly": false, "title": "Best Time to Buy and Sell Stock IV", "titleSlug": "best-time-to-buy-and-sell-stock-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 486758, "totalSubmissionRaw": 1106173}, "189": {"acRate": 41.21580018111395, "difficulty": "Medium", "likes": 18058, "dislikes": 1981, "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": 2377621, "totalSubmissionRaw": 5768723}, "190": {"acRate": 59.670164810639605, "difficulty": "Easy", "likes": 5115, "dislikes": 1447, "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": 836839, "totalSubmissionRaw": 1402448}, "191": {"acRate": 71.97697721980056, "difficulty": "Easy", "likes": 6533, "dislikes": 1339, "categoryTitle": "Algorithms", "frontendQuestionId": "191", "paidOnly": false, "title": "Number of 1 Bits", "titleSlug": "number-of-1-bits", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1542906, "totalSubmissionRaw": 2143612}, "192": {"acRate": 25.915390904595682, "difficulty": "Medium", "likes": 543, "dislikes": 307, "categoryTitle": "Shell", "frontendQuestionId": "192", "paidOnly": false, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52934, "totalSubmissionRaw": 204257}, "193": {"acRate": 26.20961539041598, "difficulty": "Easy", "likes": 423, "dislikes": 967, "categoryTitle": "Shell", "frontendQuestionId": "193", "paidOnly": false, "title": "Valid Phone Numbers", "titleSlug": "valid-phone-numbers", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86893, "totalSubmissionRaw": 331531}, "194": {"acRate": 26.663284894419082, "difficulty": "Medium", "likes": 146, "dislikes": 287, "categoryTitle": "Shell", "frontendQuestionId": "194", "paidOnly": false, "title": "Transpose File", "titleSlug": "transpose-file", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26807, "totalSubmissionRaw": 100539}, "195": {"acRate": 33.521511550596564, "difficulty": "Easy", "likes": 389, "dislikes": 467, "categoryTitle": "Shell", "frontendQuestionId": "195", "paidOnly": false, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 110920, "totalSubmissionRaw": 330892}, "196": {"acRate": 62.548552425578706, "difficulty": "Easy", "likes": 1619, "dislikes": 331, "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": 566516, "totalSubmissionRaw": 905722}, "197": {"acRate": 48.34384827031143, "difficulty": "Easy", "likes": 2977, "dislikes": 622, "categoryTitle": "Database", "frontendQuestionId": "197", "paidOnly": false, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 737604, "totalSubmissionRaw": 1525745}, "198": {"acRate": 51.347955469398286, "difficulty": "Medium", "likes": 21128, "dislikes": 428, "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": 2356351, "totalSubmissionRaw": 4588981}, "199": {"acRate": 63.592908622856505, "difficulty": "Medium", "likes": 12040, "dislikes": 971, "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": 1413256, "totalSubmissionRaw": 2222349}, "200": {"acRate": 60.06459310397839, "difficulty": "Medium", "likes": 22831, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "200", "paidOnly": false, "title": "Number of Islands", "titleSlug": "number-of-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2859952, "totalSubmissionRaw": 4761468}, "201": {"acRate": 47.15042277254536, "difficulty": "Medium", "likes": 4012, "dislikes": 303, "categoryTitle": "Algorithms", "frontendQuestionId": "201", "paidOnly": false, "title": "Bitwise AND of Numbers Range", "titleSlug": "bitwise-and-of-numbers-range", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 407407, "totalSubmissionRaw": 864058}, "202": {"acRate": 56.57051411279238, "difficulty": "Easy", "likes": 10391, "dislikes": 1460, "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": 1543369, "totalSubmissionRaw": 2728225}, "203": {"acRate": 49.53493661240158, "difficulty": "Easy", "likes": 8329, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "203", "paidOnly": false, "title": "Remove Linked List Elements", "titleSlug": "remove-linked-list-elements", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1180475, "totalSubmissionRaw": 2383116}, "204": {"acRate": 33.87137992642724, "difficulty": "Medium", "likes": 7973, "dislikes": 1455, "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": 906569, "totalSubmissionRaw": 2676513}, "205": {"acRate": 45.51983114639699, "difficulty": "Easy", "likes": 9051, "dislikes": 2103, "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": 1432447, "totalSubmissionRaw": 3146860}, "206": {"acRate": 77.28185881144174, "difficulty": "Easy", "likes": 21642, "dislikes": 444, "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": 4388111, "totalSubmissionRaw": 5678073}, "207": {"acRate": 47.2430707203588, "difficulty": "Medium", "likes": 16243, "dislikes": 721, "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": 1663427, "totalSubmissionRaw": 3521007}, "208": {"acRate": 65.93130497719075, "difficulty": "Medium", "likes": 11572, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "208", "paidOnly": false, "title": "Implement Trie (Prefix Tree)", "titleSlug": "implement-trie-prefix-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1097671, "totalSubmissionRaw": 1664877}, "209": {"acRate": 47.58012883747157, "difficulty": "Medium", "likes": 12639, "dislikes": 440, "categoryTitle": "Algorithms", "frontendQuestionId": "209", "paidOnly": false, "title": "Minimum Size Subarray Sum", "titleSlug": "minimum-size-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1121419, "totalSubmissionRaw": 2356892}, "210": {"acRate": 51.14778355112338, "difficulty": "Medium", "likes": 10805, "dislikes": 349, "categoryTitle": "Algorithms", "frontendQuestionId": "210", "paidOnly": false, "title": "Course Schedule II", "titleSlug": "course-schedule-ii", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1100600, "totalSubmissionRaw": 2151818}, "211": {"acRate": 45.69639125854953, "difficulty": "Medium", "likes": 7596, "dislikes": 454, "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": 664170, "totalSubmissionRaw": 1453440}, "212": {"acRate": 36.497095452077495, "difficulty": "Hard", "likes": 9442, "dislikes": 461, "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": 683623, "totalSubmissionRaw": 1873085}, "213": {"acRate": 42.35233407679977, "difficulty": "Medium", "likes": 9869, "dislikes": 153, "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": 810057, "totalSubmissionRaw": 1912662}, "214": {"acRate": 33.82966902709638, "difficulty": "Hard", "likes": 3621, "dislikes": 246, "categoryTitle": "Algorithms", "frontendQuestionId": "214", "paidOnly": false, "title": "Shortest Palindrome", "titleSlug": "shortest-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 186937, "totalSubmissionRaw": 552583}, "215": {"acRate": 66.9761744332971, "difficulty": "Medium", "likes": 17111, "dislikes": 883, "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": 2430330, "totalSubmissionRaw": 3628652}, "216": {"acRate": 70.24435784401075, "difficulty": "Medium", "likes": 5999, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "216", "paidOnly": false, "title": "Combination Sum III", "titleSlug": "combination-sum-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 543998, "totalSubmissionRaw": 774437}, "217": {"acRate": 62.052468770148494, "difficulty": "Easy", "likes": 12051, "dislikes": 1301, "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": 4216351, "totalSubmissionRaw": 6794831}, "218": {"acRate": 42.9318045871119, "difficulty": "Hard", "likes": 5897, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "218", "paidOnly": false, "title": "The Skyline Problem", "titleSlug": "the-skyline-problem", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 294980, "totalSubmissionRaw": 687094}, "219": {"acRate": 46.01111324391915, "difficulty": "Easy", "likes": 6169, "dislikes": 3098, "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": 1011527, "totalSubmissionRaw": 2198447}, "220": {"acRate": 22.90916615306465, "difficulty": "Hard", "likes": 1009, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "220", "paidOnly": false, "title": "Contains Duplicate III", "titleSlug": "contains-duplicate-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 257965, "totalSubmissionRaw": 1126034}, "221": {"acRate": 47.05201427673312, "difficulty": "Medium", "likes": 10131, "dislikes": 226, "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": 707260, "totalSubmissionRaw": 1503145}, "222": {"acRate": 66.61006745596839, "difficulty": "Easy", "likes": 8677, "dislikes": 520, "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": 776735, "totalSubmissionRaw": 1166093}, "223": {"acRate": 46.48999412858401, "difficulty": "Medium", "likes": 1994, "dislikes": 1646, "categoryTitle": "Algorithms", "frontendQuestionId": "223", "paidOnly": false, "title": "Rectangle Area", "titleSlug": "rectangle-area", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 228039, "totalSubmissionRaw": 490512}, "224": {"acRate": 43.76364393634745, "difficulty": "Hard", "likes": 6321, "dislikes": 501, "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": 487545, "totalSubmissionRaw": 1114044}, "225": {"acRate": 64.75343044725653, "difficulty": "Easy", "likes": 6094, "dislikes": 1211, "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": 723141, "totalSubmissionRaw": 1116762}, "226": {"acRate": 77.55138237013789, "difficulty": "Easy", "likes": 13995, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "226", "paidOnly": false, "title": "Invert Binary Tree", "titleSlug": "invert-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2181869, "totalSubmissionRaw": 2813453}, "227": {"acRate": 44.03740742987941, "difficulty": "Medium", "likes": 6152, "dislikes": 847, "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": 660475, "totalSubmissionRaw": 1499807}, "228": {"acRate": 51.257498318648686, "difficulty": "Easy", "likes": 3965, "dislikes": 2174, "categoryTitle": "Algorithms", "frontendQuestionId": "228", "paidOnly": false, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 605143, "totalSubmissionRaw": 1180595}, "229": {"acRate": 52.2601949779677, "difficulty": "Medium", "likes": 9722, "dislikes": 430, "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": 745395, "totalSubmissionRaw": 1426315}, "230": {"acRate": 73.2960311108227, "difficulty": "Medium", "likes": 11509, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "230", "paidOnly": false, "title": "Kth Smallest Element in a BST", "titleSlug": "kth-smallest-element-in-a-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1524773, "totalSubmissionRaw": 2080294}, "231": {"acRate": 47.89992550353585, "difficulty": "Easy", "likes": 6838, "dislikes": 436, "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": 1399127, "totalSubmissionRaw": 2920935}, "232": {"acRate": 66.75235502494111, "difficulty": "Easy", "likes": 7661, "dislikes": 434, "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": 989854, "totalSubmissionRaw": 1482876}, "233": {"acRate": 34.79704704615153, "difficulty": "Hard", "likes": 1564, "dislikes": 1475, "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": 97240, "totalSubmissionRaw": 279449}, "234": {"acRate": 53.829541858491325, "difficulty": "Easy", "likes": 16532, "dislikes": 884, "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": 2032721, "totalSubmissionRaw": 3776222}, "235": {"acRate": 65.6507387855456, "difficulty": "Medium", "likes": 11156, "dislikes": 319, "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": 1581003, "totalSubmissionRaw": 2408205}, "236": {"acRate": 63.365552488398876, "difficulty": "Medium", "likes": 16628, "dislikes": 416, "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": 1733764, "totalSubmissionRaw": 2736134}, "237": {"acRate": 80.43404371027498, "difficulty": "Medium", "likes": 5119, "dislikes": 1577, "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": 1467190, "totalSubmissionRaw": 1824093}, "238": {"acRate": 66.54096991535762, "difficulty": "Medium", "likes": 22676, "dislikes": 1427, "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": 2836358, "totalSubmissionRaw": 4262577}, "239": {"acRate": 46.749774890716544, "difficulty": "Hard", "likes": 18274, "dislikes": 688, "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": 1086143, "totalSubmissionRaw": 2323314}, "240": {"acRate": 53.252712007268514, "difficulty": "Medium", "likes": 11937, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "240", "paidOnly": false, "title": "Search a 2D Matrix II", "titleSlug": "search-a-2d-matrix-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 972958, "totalSubmissionRaw": 1827059}, "241": {"acRate": 65.79055705272133, "difficulty": "Medium", "likes": 5377, "dislikes": 277, "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": 225332, "totalSubmissionRaw": 342499}, "242": {"acRate": 65.05462548751942, "difficulty": "Easy", "likes": 12183, "dislikes": 404, "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": 3767171, "totalSubmissionRaw": 5790783}, "243": {"acRate": 65.4386044335793, "difficulty": "Easy", "likes": 1266, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "243", "paidOnly": true, "title": "Shortest Word Distance", "titleSlug": "shortest-word-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216821, "totalSubmissionRaw": 331335}, "244": {"acRate": 61.3493880773786, "difficulty": "Medium", "likes": 1051, "dislikes": 337, "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": 155398, "totalSubmissionRaw": 253300}, "245": {"acRate": 58.57061242338536, "difficulty": "Medium", "likes": 504, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "245", "paidOnly": true, "title": "Shortest Word Distance III", "titleSlug": "shortest-word-distance-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83042, "totalSubmissionRaw": 141781}, "246": {"acRate": 47.681922505737816, "difficulty": "Easy", "likes": 595, "dislikes": 1016, "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": 176589, "totalSubmissionRaw": 370349}, "247": {"acRate": 52.55765943506382, "difficulty": "Medium", "likes": 926, "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": 143587, "totalSubmissionRaw": 273199}, "248": {"acRate": 42.17892836195099, "difficulty": "Hard", "likes": 301, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "248", "paidOnly": true, "title": "Strobogrammatic Number III", "titleSlug": "strobogrammatic-number-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36675, "totalSubmissionRaw": 86951}, "249": {"acRate": 65.95088417046207, "difficulty": "Medium", "likes": 1670, "dislikes": 384, "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": 246746, "totalSubmissionRaw": 374136}, "250": {"acRate": 56.55894265147891, "difficulty": "Medium", "likes": 1204, "dislikes": 429, "categoryTitle": "Algorithms", "frontendQuestionId": "250", "paidOnly": true, "title": "Count Univalue Subtrees", "titleSlug": "count-univalue-subtrees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154868, "totalSubmissionRaw": 273817}, "251": {"acRate": 49.626618372379774, "difficulty": "Medium", "likes": 716, "dislikes": 404, "categoryTitle": "Algorithms", "frontendQuestionId": "251", "paidOnly": true, "title": "Flatten 2D Vector", "titleSlug": "flatten-2d-vector", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128791, "totalSubmissionRaw": 259520}, "252": {"acRate": 58.285945637571544, "difficulty": "Easy", "likes": 2035, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "252", "paidOnly": true, "title": "Meeting Rooms", "titleSlug": "meeting-rooms", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 411735, "totalSubmissionRaw": 706406}, "253": {"acRate": 51.43352267796202, "difficulty": "Medium", "likes": 6947, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "253", "paidOnly": true, "title": "Meeting Rooms II", "titleSlug": "meeting-rooms-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 918589, "totalSubmissionRaw": 1785974}, "254": {"acRate": 49.65627386987015, "difficulty": "Medium", "likes": 1132, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "254", "paidOnly": true, "title": "Factor Combinations", "titleSlug": "factor-combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128718, "totalSubmissionRaw": 259218}, "255": {"acRate": 50.12482984684689, "difficulty": "Medium", "likes": 1203, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "255", "paidOnly": true, "title": "Verify Preorder Sequence in Binary Search Tree", "titleSlug": "verify-preorder-sequence-in-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82116, "totalSubmissionRaw": 163823}, "256": {"acRate": 62.75956356921547, "difficulty": "Medium", "likes": 2295, "dislikes": 130, "categoryTitle": "Algorithms", "frontendQuestionId": "256", "paidOnly": true, "title": "Paint House", "titleSlug": "paint-house", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 212079, "totalSubmissionRaw": 337923}, "257": {"acRate": 64.3541177342558, "difficulty": "Easy", "likes": 6586, "dislikes": 298, "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": 755397, "totalSubmissionRaw": 1173813}, "258": {"acRate": 66.96043464676835, "difficulty": "Easy", "likes": 4844, "dislikes": 1937, "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": 825129, "totalSubmissionRaw": 1232264}, "259": {"acRate": 50.816350142972844, "difficulty": "Medium", "likes": 1556, "dislikes": 159, "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": 153722, "totalSubmissionRaw": 302505}, "260": {"acRate": 70.78818748599959, "difficulty": "Medium", "likes": 6358, "dislikes": 264, "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": 470854, "totalSubmissionRaw": 665159}, "261": {"acRate": 48.393782624473126, "difficulty": "Medium", "likes": 3283, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "261", "paidOnly": true, "title": "Graph Valid Tree", "titleSlug": "graph-valid-tree", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 416077, "totalSubmissionRaw": 859770}, "262": {"acRate": 36.510387315899294, "difficulty": "Hard", "likes": 1241, "dislikes": 669, "categoryTitle": "Database", "frontendQuestionId": "262", "paidOnly": false, "title": "Trips and Users", "titleSlug": "trips-and-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191773, "totalSubmissionRaw": 525256}, "263": {"acRate": 42.01360918405058, "difficulty": "Easy", "likes": 3362, "dislikes": 1707, "categoryTitle": "Algorithms", "frontendQuestionId": "263", "paidOnly": false, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 537720, "totalSubmissionRaw": 1279871}, "264": {"acRate": 46.28335430156043, "difficulty": "Medium", "likes": 5977, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "264", "paidOnly": false, "title": "Ugly Number II", "titleSlug": "ugly-number-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 351329, "totalSubmissionRaw": 759083}, "265": {"acRate": 54.9553706804488, "difficulty": "Hard", "likes": 1304, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "265", "paidOnly": true, "title": "Paint House II", "titleSlug": "paint-house-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125046, "totalSubmissionRaw": 227541}, "266": {"acRate": 67.59122520541528, "difficulty": "Easy", "likes": 1054, "dislikes": 71, "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": 207793, "totalSubmissionRaw": 307426}, "267": {"acRate": 41.777738073968194, "difficulty": "Medium", "likes": 885, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "267", "paidOnly": true, "title": "Palindrome Permutation II", "titleSlug": "palindrome-permutation-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70149, "totalSubmissionRaw": 167910}, "268": {"acRate": 67.68673921728123, "difficulty": "Easy", "likes": 12190, "dislikes": 3336, "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": 2390675, "totalSubmissionRaw": 3531970}, "269": {"acRate": 35.903312941193775, "difficulty": "Hard", "likes": 4430, "dislikes": 994, "categoryTitle": "Algorithms", "frontendQuestionId": "269", "paidOnly": true, "title": "Alien Dictionary", "titleSlug": "alien-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 390509, "totalSubmissionRaw": 1087672}, "270": {"acRate": 51.254485966901456, "difficulty": "Easy", "likes": 1812, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "270", "paidOnly": true, "title": "Closest Binary Search Tree Value", "titleSlug": "closest-binary-search-tree-value", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 355758, "totalSubmissionRaw": 694103}, "271": {"acRate": 47.3067674492542, "difficulty": "Medium", "likes": 1463, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "271", "paidOnly": true, "title": "Encode and Decode Strings", "titleSlug": "encode-and-decode-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211289, "totalSubmissionRaw": 446637}, "272": {"acRate": 59.36820458324724, "difficulty": "Hard", "likes": 1293, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "272", "paidOnly": true, "title": "Closest Binary Search Tree Value II", "titleSlug": "closest-binary-search-tree-value-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120672, "totalSubmissionRaw": 203261}, "273": {"acRate": 33.814035254692705, "difficulty": "Hard", "likes": 3545, "dislikes": 6667, "categoryTitle": "Algorithms", "frontendQuestionId": "273", "paidOnly": false, "title": "Integer to English Words", "titleSlug": "integer-to-english-words", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 489902, "totalSubmissionRaw": 1449227}, "274": {"acRate": 39.19585525666031, "difficulty": "Medium", "likes": 1313, "dislikes": 592, "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": 519890, "totalSubmissionRaw": 1326394}, "275": {"acRate": 38.31601279445067, "difficulty": "Medium", "likes": 348, "dislikes": 98, "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": 211668, "totalSubmissionRaw": 552427}, "276": {"acRate": 46.897381025170695, "difficulty": "Medium", "likes": 1558, "dislikes": 388, "categoryTitle": "Algorithms", "frontendQuestionId": "276", "paidOnly": true, "title": "Paint Fence", "titleSlug": "paint-fence", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115051, "totalSubmissionRaw": 245325}, "277": {"acRate": 47.47830760295762, "difficulty": "Medium", "likes": 2841, "dislikes": 281, "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": 273862, "totalSubmissionRaw": 576815}, "278": {"acRate": 44.7058538044863, "difficulty": "Easy", "likes": 8382, "dislikes": 3309, "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": 1731767, "totalSubmissionRaw": 3873694}, "279": {"acRate": 55.01390002656296, "difficulty": "Medium", "likes": 11205, "dislikes": 471, "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": 876064, "totalSubmissionRaw": 1592442}, "280": {"acRate": 67.7846371347785, "difficulty": "Medium", "likes": 1210, "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": 143839, "totalSubmissionRaw": 212200}, "281": {"acRate": 64.17285399259544, "difficulty": "Medium", "likes": 680, "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": 95160, "totalSubmissionRaw": 148287}, "282": {"acRate": 40.14112660038254, "difficulty": "Hard", "likes": 3397, "dislikes": 628, "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": 232951, "totalSubmissionRaw": 580330}, "283": {"acRate": 61.96826368534127, "difficulty": "Easy", "likes": 16791, "dislikes": 465, "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": 3198740, "totalSubmissionRaw": 5161902}, "284": {"acRate": 59.749056689548574, "difficulty": "Medium", "likes": 1856, "dislikes": 1036, "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": 223431, "totalSubmissionRaw": 373949}, "285": {"acRate": 50.008902050735756, "difficulty": "Medium", "likes": 2571, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "285", "paidOnly": true, "title": "Inorder Successor in BST", "titleSlug": "inorder-successor-in-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 337061, "totalSubmissionRaw": 674002}, "286": {"acRate": 61.67834852853712, "difficulty": "Medium", "likes": 3133, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "286", "paidOnly": true, "title": "Walls and Gates", "titleSlug": "walls-and-gates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 327701, "totalSubmissionRaw": 531302}, "287": {"acRate": 61.32858380861496, "difficulty": "Medium", "likes": 23339, "dislikes": 4669, "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": 1832207, "totalSubmissionRaw": 2987525}, "288": {"acRate": 26.426105070912882, "difficulty": "Medium", "likes": 203, "dislikes": 1821, "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": 74084, "totalSubmissionRaw": 280344}, "289": {"acRate": 69.75768786192914, "difficulty": "Medium", "likes": 6361, "dislikes": 573, "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": 490638, "totalSubmissionRaw": 703347}, "290": {"acRate": 42.28409138138846, "difficulty": "Easy", "likes": 7271, "dislikes": 1033, "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": 763026, "totalSubmissionRaw": 1804523}, "291": {"acRate": 48.308014275837586, "difficulty": "Medium", "likes": 916, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "291", "paidOnly": true, "title": "Word Pattern II", "titleSlug": "word-pattern-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77559, "totalSubmissionRaw": 160551}, "292": {"acRate": 57.1321218346996, "difficulty": "Easy", "likes": 1724, "dislikes": 2694, "categoryTitle": "Algorithms", "frontendQuestionId": "292", "paidOnly": false, "title": "Nim Game", "titleSlug": "nim-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 391539, "totalSubmissionRaw": 685321}, "293": {"acRate": 64.67118561371716, "difficulty": "Easy", "likes": 225, "dislikes": 466, "categoryTitle": "Algorithms", "frontendQuestionId": "293", "paidOnly": true, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74227, "totalSubmissionRaw": 114776}, "294": {"acRate": 52.146485874054314, "difficulty": "Medium", "likes": 619, "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": 71339, "totalSubmissionRaw": 136805}, "295": {"acRate": 52.204023449669116, "difficulty": "Hard", "likes": 11935, "dislikes": 241, "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": 829488, "totalSubmissionRaw": 1588933}, "296": {"acRate": 60.974965933979696, "difficulty": "Hard", "likes": 1181, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "296", "paidOnly": true, "title": "Best Meeting Point", "titleSlug": "best-meeting-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85468, "totalSubmissionRaw": 140169}, "297": {"acRate": 57.274340700128455, "difficulty": "Hard", "likes": 10189, "dislikes": 397, "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": 904245, "totalSubmissionRaw": 1578796}, "298": {"acRate": 53.6703358088704, "difficulty": "Medium", "likes": 1140, "dislikes": 237, "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": 149883, "totalSubmissionRaw": 279266}, "299": {"acRate": 50.51504470961598, "difficulty": "Medium", "likes": 2438, "dislikes": 1782, "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": 381380, "totalSubmissionRaw": 754983}, "300": {"acRate": 56.00223622528182, "difficulty": "Medium", "likes": 20918, "dislikes": 445, "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": 1786077, "totalSubmissionRaw": 3189295}, "301": {"acRate": 48.445135593257696, "difficulty": "Hard", "likes": 5858, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "301", "paidOnly": false, "title": "Remove Invalid Parentheses", "titleSlug": "remove-invalid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 439565, "totalSubmissionRaw": 907345}, "302": {"acRate": 59.053856499619904, "difficulty": "Hard", "likes": 527, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "302", "paidOnly": true, "title": "Smallest Rectangle Enclosing Black Pixels", "titleSlug": "smallest-rectangle-enclosing-black-pixels", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50494, "totalSubmissionRaw": 85505}, "303": {"acRate": 64.36213953852639, "difficulty": "Easy", "likes": 3248, "dislikes": 1910, "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": 558830, "totalSubmissionRaw": 868254}, "304": {"acRate": 55.04722433715678, "difficulty": "Medium", "likes": 4970, "dislikes": 344, "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": 376681, "totalSubmissionRaw": 684287}, "305": {"acRate": 39.894485109958474, "difficulty": "Hard", "likes": 1867, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "305", "paidOnly": true, "title": "Number of Islands II", "titleSlug": "number-of-islands-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148135, "totalSubmissionRaw": 371318}, "306": {"acRate": 31.883756249893345, "difficulty": "Medium", "likes": 1175, "dislikes": 802, "categoryTitle": "Algorithms", "frontendQuestionId": "306", "paidOnly": false, "title": "Additive Number", "titleSlug": "additive-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93421, "totalSubmissionRaw": 293005}, "307": {"acRate": 41.19801533336105, "difficulty": "Medium", "likes": 4759, "dislikes": 255, "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": 277495, "totalSubmissionRaw": 673564}, "308": {"acRate": 44.20886739720747, "difficulty": "Hard", "likes": 800, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "308", "paidOnly": true, "title": "Range Sum Query 2D - Mutable", "titleSlug": "range-sum-query-2d-mutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77984, "totalSubmissionRaw": 176399}, "309": {"acRate": 58.831514184130384, "difficulty": "Medium", "likes": 9401, "dislikes": 323, "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": 539591, "totalSubmissionRaw": 917179}, "310": {"acRate": 41.821748408292684, "difficulty": "Medium", "likes": 8255, "dislikes": 382, "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": 383546, "totalSubmissionRaw": 917097}, "311": {"acRate": 68.203435447961, "difficulty": "Medium", "likes": 1063, "dislikes": 360, "categoryTitle": "Algorithms", "frontendQuestionId": "311", "paidOnly": true, "title": "Sparse Matrix Multiplication", "titleSlug": "sparse-matrix-multiplication", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193605, "totalSubmissionRaw": 283864}, "312": {"acRate": 59.523436648197524, "difficulty": "Hard", "likes": 8978, "dislikes": 252, "categoryTitle": "Algorithms", "frontendQuestionId": "312", "paidOnly": false, "title": "Burst Balloons", "titleSlug": "burst-balloons", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 300263, "totalSubmissionRaw": 504445}, "313": {"acRate": 45.298327872361725, "difficulty": "Medium", "likes": 2159, "dislikes": 386, "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": 131198, "totalSubmissionRaw": 289631}, "314": {"acRate": 54.88190383780609, "difficulty": "Medium", "likes": 3255, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "314", "paidOnly": true, "title": "Binary Tree Vertical Order Traversal", "titleSlug": "binary-tree-vertical-order-traversal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 429861, "totalSubmissionRaw": 783250}, "315": {"acRate": 42.55056637981865, "difficulty": "Hard", "likes": 8838, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "315", "paidOnly": false, "title": "Count of Smaller Numbers After Self", "titleSlug": "count-of-smaller-numbers-after-self", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 327630, "totalSubmissionRaw": 769978}, "316": {"acRate": 49.97939554417683, "difficulty": "Medium", "likes": 8665, "dislikes": 632, "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": 342018, "totalSubmissionRaw": 684318}, "317": {"acRate": 43.41570147121908, "difficulty": "Hard", "likes": 1875, "dislikes": 302, "categoryTitle": "Algorithms", "frontendQuestionId": "317", "paidOnly": true, "title": "Shortest Distance from All Buildings", "titleSlug": "shortest-distance-from-all-buildings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 181162, "totalSubmissionRaw": 417273}, "318": {"acRate": 60.080105352989776, "difficulty": "Medium", "likes": 3508, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "318", "paidOnly": false, "title": "Maximum Product of Word Lengths", "titleSlug": "maximum-product-of-word-lengths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220354, "totalSubmissionRaw": 366767}, "319": {"acRate": 52.986012444844576, "difficulty": "Medium", "likes": 2661, "dislikes": 3119, "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": 225997, "totalSubmissionRaw": 426522}, "320": {"acRate": 58.607734053519856, "difficulty": "Medium", "likes": 683, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "320", "paidOnly": true, "title": "Generalized Abbreviation", "titleSlug": "generalized-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68792, "totalSubmissionRaw": 117377}, "321": {"acRate": 30.54690973766118, "difficulty": "Hard", "likes": 1937, "dislikes": 354, "categoryTitle": "Algorithms", "frontendQuestionId": "321", "paidOnly": false, "title": "Create Maximum Number", "titleSlug": "create-maximum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62517, "totalSubmissionRaw": 204659}, "322": {"acRate": 44.534562678536396, "difficulty": "Medium", "likes": 18968, "dislikes": 453, "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": 1900271, "totalSubmissionRaw": 4266970}, "323": {"acRate": 63.108230081234105, "difficulty": "Medium", "likes": 2675, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "323", "paidOnly": true, "title": "Number of Connected Components in an Undirected Graph", "titleSlug": "number-of-connected-components-in-an-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 415313, "totalSubmissionRaw": 658097}, "324": {"acRate": 34.617808111645985, "difficulty": "Medium", "likes": 3072, "dislikes": 960, "categoryTitle": "Algorithms", "frontendQuestionId": "324", "paidOnly": false, "title": "Wiggle Sort II", "titleSlug": "wiggle-sort-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 163169, "totalSubmissionRaw": 471345}, "325": {"acRate": 49.577379993609874, "difficulty": "Medium", "likes": 2038, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "325", "paidOnly": true, "title": "Maximum Size Subarray Sum Equals k", "titleSlug": "maximum-size-subarray-sum-equals-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187754, "totalSubmissionRaw": 378707}, "326": {"acRate": 46.87918170826682, "difficulty": "Easy", "likes": 3097, "dislikes": 277, "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": 871607, "totalSubmissionRaw": 1859274}, "327": {"acRate": 36.03425019594976, "difficulty": "Hard", "likes": 2304, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "327", "paidOnly": false, "title": "Count of Range Sum", "titleSlug": "count-of-range-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79075, "totalSubmissionRaw": 219444}, "328": {"acRate": 61.53210656727217, "difficulty": "Medium", "likes": 10007, "dislikes": 534, "categoryTitle": "Algorithms", "frontendQuestionId": "328", "paidOnly": false, "title": "Odd Even Linked List", "titleSlug": "odd-even-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 989840, "totalSubmissionRaw": 1608656}, "329": {"acRate": 53.93063578067312, "difficulty": "Hard", "likes": 8964, "dislikes": 135, "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": 542365, "totalSubmissionRaw": 1005673}, "330": {"acRate": 53.12484292851614, "difficulty": "Hard", "likes": 2303, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "330", "paidOnly": false, "title": "Patching Array", "titleSlug": "patching-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158541, "totalSubmissionRaw": 298431}, "331": {"acRate": 45.422825403942646, "difficulty": "Medium", "likes": 2332, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "331", "paidOnly": false, "title": "Verify Preorder Serialization of a Binary Tree", "titleSlug": "verify-preorder-serialization-of-a-binary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143850, "totalSubmissionRaw": 316691}, "332": {"acRate": 43.25313417120766, "difficulty": "Hard", "likes": 5891, "dislikes": 1871, "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": 440364, "totalSubmissionRaw": 1018117}, "333": {"acRate": 44.15423285097088, "difficulty": "Medium", "likes": 1490, "dislikes": 130, "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": 109967, "totalSubmissionRaw": 249052}, "334": {"acRate": 39.526932361250715, "difficulty": "Medium", "likes": 8126, "dislikes": 546, "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": 615027, "totalSubmissionRaw": 1555969}, "335": {"acRate": 30.76496866017938, "difficulty": "Hard", "likes": 384, "dislikes": 510, "categoryTitle": "Algorithms", "frontendQuestionId": "335", "paidOnly": false, "title": "Self Crossing", "titleSlug": "self-crossing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35536, "totalSubmissionRaw": 115508}, "336": {"acRate": 35.482865515897885, "difficulty": "Hard", "likes": 4466, "dislikes": 468, "categoryTitle": "Algorithms", "frontendQuestionId": "336", "paidOnly": false, "title": "Palindrome Pairs", "titleSlug": "palindrome-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209465, "totalSubmissionRaw": 590329}, "337": {"acRate": 54.36388482348767, "difficulty": "Medium", "likes": 8536, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "337", "paidOnly": false, "title": "House Robber III", "titleSlug": "house-robber-iii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 392254, "totalSubmissionRaw": 721535}, "338": {"acRate": 78.67202552782979, "difficulty": "Easy", "likes": 11121, "dislikes": 544, "categoryTitle": "Algorithms", "frontendQuestionId": "338", "paidOnly": false, "title": "Counting Bits", "titleSlug": "counting-bits", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1163686, "totalSubmissionRaw": 1479162}, "339": {"acRate": 84.04865687351271, "difficulty": "Medium", "likes": 1729, "dislikes": 425, "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": 293861, "totalSubmissionRaw": 349632}, "340": {"acRate": 48.955757593507634, "difficulty": "Medium", "likes": 2833, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "340", "paidOnly": true, "title": "Longest Substring with At Most K Distinct Characters", "titleSlug": "longest-substring-with-at-most-k-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 351026, "totalSubmissionRaw": 717027}, "341": {"acRate": 64.67523137387484, "difficulty": "Medium", "likes": 4886, "dislikes": 1757, "categoryTitle": "Algorithms", "frontendQuestionId": "341", "paidOnly": false, "title": "Flatten Nested List Iterator", "titleSlug": "flatten-nested-list-iterator", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 459120, "totalSubmissionRaw": 709886}, "342": {"acRate": 48.27129226262554, "difficulty": "Easy", "likes": 3927, "dislikes": 398, "categoryTitle": "Algorithms", "frontendQuestionId": "342", "paidOnly": false, "title": "Power of Four", "titleSlug": "power-of-four", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 692429, "totalSubmissionRaw": 1434453}, "343": {"acRate": 60.52675104033661, "difficulty": "Medium", "likes": 5115, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "343", "paidOnly": false, "title": "Integer Break", "titleSlug": "integer-break", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 365952, "totalSubmissionRaw": 604612}, "344": {"acRate": 78.85927959052229, "difficulty": "Easy", "likes": 8659, "dislikes": 1177, "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": 2771981, "totalSubmissionRaw": 3515097}, "345": {"acRate": 53.87304849569776, "difficulty": "Easy", "likes": 4591, "dislikes": 2791, "categoryTitle": "Algorithms", "frontendQuestionId": "345", "paidOnly": false, "title": "Reverse Vowels of a String", "titleSlug": "reverse-vowels-of-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 936841, "totalSubmissionRaw": 1738979}, "346": {"acRate": 78.70158737639122, "difficulty": "Easy", "likes": 1658, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "346", "paidOnly": true, "title": "Moving Average from Data Stream", "titleSlug": "moving-average-from-data-stream", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 400796, "totalSubmissionRaw": 509261}, "347": {"acRate": 63.09222096260911, "difficulty": "Medium", "likes": 17382, "dislikes": 662, "categoryTitle": "Algorithms", "frontendQuestionId": "347", "paidOnly": false, "title": "Top K Frequent Elements", "titleSlug": "top-k-frequent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2251195, "totalSubmissionRaw": 3568107}, "348": {"acRate": 58.15136881979428, "difficulty": "Medium", "likes": 2068, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "348", "paidOnly": true, "title": "Design Tic-Tac-Toe", "titleSlug": "design-tic-tac-toe", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250834, "totalSubmissionRaw": 431349}, "349": {"acRate": 74.98705053905623, "difficulty": "Easy", "likes": 6091, "dislikes": 2294, "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": 1275411, "totalSubmissionRaw": 1700842}, "350": {"acRate": 58.59492674635271, "difficulty": "Easy", "likes": 7687, "dislikes": 974, "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": 1407848, "totalSubmissionRaw": 2402679}, "351": {"acRate": 52.06700585309165, "difficulty": "Medium", "likes": 162, "dislikes": 186, "categoryTitle": "Algorithms", "frontendQuestionId": "351", "paidOnly": true, "title": "Android Unlock Patterns", "titleSlug": "android-unlock-patterns", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73466, "totalSubmissionRaw": 141110}, "352": {"acRate": 60.12492586607468, "difficulty": "Hard", "likes": 1733, "dislikes": 364, "categoryTitle": "Algorithms", "frontendQuestionId": "352", "paidOnly": false, "title": "Data Stream as Disjoint Intervals", "titleSlug": "data-stream-as-disjoint-intervals", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110503, "totalSubmissionRaw": 183789}, "353": {"acRate": 38.84730572733391, "difficulty": "Medium", "likes": 943, "dislikes": 334, "categoryTitle": "Algorithms", "frontendQuestionId": "353", "paidOnly": true, "title": "Design Snake Game", "titleSlug": "design-snake-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85999, "totalSubmissionRaw": 221377}, "354": {"acRate": 37.070540557968656, "difficulty": "Hard", "likes": 5982, "dislikes": 147, "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": 224203, "totalSubmissionRaw": 604801}, "355": {"acRate": 40.23262507195235, "difficulty": "Medium", "likes": 3919, "dislikes": 534, "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": 192907, "totalSubmissionRaw": 479481}, "356": {"acRate": 35.67880581649723, "difficulty": "Medium", "likes": 300, "dislikes": 620, "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": 41589, "totalSubmissionRaw": 116565}, "357": {"acRate": 53.26288165456127, "difficulty": "Medium", "likes": 1535, "dislikes": 1495, "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": 143291, "totalSubmissionRaw": 269026}, "358": {"acRate": 38.917748405495274, "difficulty": "Hard", "likes": 963, "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": 65778, "totalSubmissionRaw": 169018}, "359": {"acRate": 76.04256616041042, "difficulty": "Easy", "likes": 1733, "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": 329351, "totalSubmissionRaw": 433114}, "360": {"acRate": 55.98175444524222, "difficulty": "Medium", "likes": 673, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "360", "paidOnly": true, "title": "Sort Transformed Array", "titleSlug": "sort-transformed-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66274, "totalSubmissionRaw": 118385}, "361": {"acRate": 51.83723148787789, "difficulty": "Medium", "likes": 961, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "361", "paidOnly": true, "title": "Bomb Enemy", "titleSlug": "bomb-enemy", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78790, "totalSubmissionRaw": 151995}, "362": {"acRate": 68.78707811954735, "difficulty": "Medium", "likes": 2035, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "362", "paidOnly": true, "title": "Design Hit Counter", "titleSlug": "design-hit-counter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 248364, "totalSubmissionRaw": 361062}, "363": {"acRate": 44.2316933040844, "difficulty": "Hard", "likes": 3459, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "363", "paidOnly": false, "title": "Max Sum of Rectangle No Larger Than K", "titleSlug": "max-sum-of-rectangle-no-larger-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127029, "totalSubmissionRaw": 287190}, "364": {"acRate": 64.84385946885129, "difficulty": "Medium", "likes": 1125, "dislikes": 455, "categoryTitle": "Algorithms", "frontendQuestionId": "364", "paidOnly": true, "title": "Nested List Weight Sum II", "titleSlug": "nested-list-weight-sum-ii", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138832, "totalSubmissionRaw": 214101}, "365": {"acRate": 41.23305725074303, "difficulty": "Medium", "likes": 1513, "dislikes": 1472, "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": 106686, "totalSubmissionRaw": 258739}, "366": {"acRate": 80.67774185433302, "difficulty": "Medium", "likes": 3223, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "366", "paidOnly": true, "title": "Find Leaves of Binary Tree", "titleSlug": "find-leaves-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 259767, "totalSubmissionRaw": 321981}, "367": {"acRate": 43.79731410589617, "difficulty": "Easy", "likes": 4247, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "367", "paidOnly": false, "title": "Valid Perfect Square", "titleSlug": "valid-perfect-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 641198, "totalSubmissionRaw": 1464013}, "368": {"acRate": 45.55573303044286, "difficulty": "Medium", "likes": 5951, "dislikes": 282, "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": 308026, "totalSubmissionRaw": 676152}, "369": {"acRate": 61.09210377251615, "difficulty": "Medium", "likes": 943, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "369", "paidOnly": true, "title": "Plus One Linked List", "titleSlug": "plus-one-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 80889, "totalSubmissionRaw": 132405}, "370": {"acRate": 71.74883489058924, "difficulty": "Medium", "likes": 1639, "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": 94989, "totalSubmissionRaw": 132391}, "371": {"acRate": 52.310238046546296, "difficulty": "Medium", "likes": 4210, "dislikes": 5546, "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": 503901, "totalSubmissionRaw": 963295}, "372": {"acRate": 35.07363923392509, "difficulty": "Medium", "likes": 941, "dislikes": 1440, "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": 74206, "totalSubmissionRaw": 211572}, "373": {"acRate": 40.0695352644966, "difficulty": "Medium", "likes": 6241, "dislikes": 449, "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": 311288, "totalSubmissionRaw": 776871}, "374": {"acRate": 53.98724502413835, "difficulty": "Easy", "likes": 3754, "dislikes": 539, "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": 687634, "totalSubmissionRaw": 1273698}, "375": {"acRate": 49.60549030815397, "difficulty": "Medium", "likes": 2153, "dislikes": 2122, "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": 128443, "totalSubmissionRaw": 258929}, "376": {"acRate": 48.56382741496691, "difficulty": "Medium", "likes": 5115, "dislikes": 165, "categoryTitle": "Algorithms", "frontendQuestionId": "376", "paidOnly": false, "title": "Wiggle Subsequence", "titleSlug": "wiggle-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250447, "totalSubmissionRaw": 515709}, "377": {"acRate": 54.246221508604144, "difficulty": "Medium", "likes": 7397, "dislikes": 664, "categoryTitle": "Algorithms", "frontendQuestionId": "377", "paidOnly": false, "title": "Combination Sum IV", "titleSlug": "combination-sum-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 497312, "totalSubmissionRaw": 916768}, "378": {"acRate": 62.66870124119636, "difficulty": "Medium", "likes": 9930, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "378", "paidOnly": false, "title": "Kth Smallest Element in a Sorted Matrix", "titleSlug": "kth-smallest-element-in-a-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 631233, "totalSubmissionRaw": 1007253}, "379": {"acRate": 51.8293959388108, "difficulty": "Medium", "likes": 353, "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": 66848, "totalSubmissionRaw": 128977}, "380": {"acRate": 54.57486394213661, "difficulty": "Medium", "likes": 9234, "dislikes": 626, "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": 960063, "totalSubmissionRaw": 1759166}, "381": {"acRate": 35.550295169121966, "difficulty": "Hard", "likes": 2292, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "381", "paidOnly": false, "title": "Insert Delete GetRandom O(1) - Duplicates allowed", "titleSlug": "insert-delete-getrandom-o1-duplicates-allowed", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146575, "totalSubmissionRaw": 412305}, "382": {"acRate": 63.33403472396857, "difficulty": "Medium", "likes": 3078, "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": 246814, "totalSubmissionRaw": 389702}, "383": {"acRate": 62.21735377479385, "difficulty": "Easy", "likes": 5008, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "383", "paidOnly": false, "title": "Ransom Note", "titleSlug": "ransom-note", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1240481, "totalSubmissionRaw": 1993788}, "384": {"acRate": 58.46704453995925, "difficulty": "Medium", "likes": 1349, "dislikes": 928, "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": 341430, "totalSubmissionRaw": 583970}, "385": {"acRate": 38.56370350830915, "difficulty": "Medium", "likes": 458, "dislikes": 1384, "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": 58478, "totalSubmissionRaw": 151640}, "386": {"acRate": 64.50195934549198, "difficulty": "Medium", "likes": 1972, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "386", "paidOnly": false, "title": "Lexicographical Numbers", "titleSlug": "lexicographical-numbers", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 126578, "totalSubmissionRaw": 196239}, "387": {"acRate": 62.42009439540074, "difficulty": "Easy", "likes": 8980, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "387", "paidOnly": false, "title": "First Unique Character in a String", "titleSlug": "first-unique-character-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1772579, "totalSubmissionRaw": 2839757}, "388": {"acRate": 47.69032654055957, "difficulty": "Medium", "likes": 1290, "dislikes": 2498, "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": 158503, "totalSubmissionRaw": 332361}, "389": {"acRate": 59.60573951091146, "difficulty": "Easy", "likes": 5001, "dislikes": 480, "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": 765594, "totalSubmissionRaw": 1284429}, "390": {"acRate": 45.84061029447436, "difficulty": "Medium", "likes": 1557, "dislikes": 709, "categoryTitle": "Algorithms", "frontendQuestionId": "390", "paidOnly": false, "title": "Elimination Game", "titleSlug": "elimination-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75593, "totalSubmissionRaw": 164904}, "391": {"acRate": 33.93746355031178, "difficulty": "Hard", "likes": 882, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "391", "paidOnly": false, "title": "Perfect Rectangle", "titleSlug": "perfect-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45390, "totalSubmissionRaw": 133746}, "392": {"acRate": 48.085909694833624, "difficulty": "Easy", "likes": 9651, "dislikes": 536, "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": 1559123, "totalSubmissionRaw": 3242384}, "393": {"acRate": 45.20722573916067, "difficulty": "Medium", "likes": 904, "dislikes": 2865, "categoryTitle": "Algorithms", "frontendQuestionId": "393", "paidOnly": false, "title": "UTF-8 Validation", "titleSlug": "utf-8-validation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124828, "totalSubmissionRaw": 276124}, "394": {"acRate": 59.59552845960062, "difficulty": "Medium", "likes": 12697, "dislikes": 617, "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": 841932, "totalSubmissionRaw": 1412748}, "395": {"acRate": 45.02361432986651, "difficulty": "Medium", "likes": 6230, "dislikes": 516, "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": 230604, "totalSubmissionRaw": 512187}, "396": {"acRate": 42.81761373307073, "difficulty": "Medium", "likes": 1562, "dislikes": 268, "categoryTitle": "Algorithms", "frontendQuestionId": "396", "paidOnly": false, "title": "Rotate Function", "titleSlug": "rotate-function", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88048, "totalSubmissionRaw": 205635}, "397": {"acRate": 35.9850982268407, "difficulty": "Medium", "likes": 1334, "dislikes": 479, "categoryTitle": "Algorithms", "frontendQuestionId": "397", "paidOnly": false, "title": "Integer Replacement", "titleSlug": "integer-replacement", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123349, "totalSubmissionRaw": 342778}, "398": {"acRate": 63.69758835251535, "difficulty": "Medium", "likes": 1287, "dislikes": 1288, "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": 234937, "totalSubmissionRaw": 368833}, "399": {"acRate": 62.03656066716693, "difficulty": "Medium", "likes": 9296, "dislikes": 940, "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": 494379, "totalSubmissionRaw": 796918}, "400": {"acRate": 35.0222441048726, "difficulty": "Medium", "likes": 1074, "dislikes": 2059, "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": 99584, "totalSubmissionRaw": 284345}, "401": {"acRate": 54.89888662507997, "difficulty": "Easy", "likes": 1397, "dislikes": 2569, "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": 148468, "totalSubmissionRaw": 270439}, "402": {"acRate": 33.76389686580398, "difficulty": "Medium", "likes": 9501, "dislikes": 492, "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": 503809, "totalSubmissionRaw": 1492153}, "403": {"acRate": 46.1573149520067, "difficulty": "Hard", "likes": 5582, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "403", "paidOnly": false, "title": "Frog Jump", "titleSlug": "frog-jump", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272270, "totalSubmissionRaw": 589874}, "404": {"acRate": 60.85378359686151, "difficulty": "Easy", "likes": 5488, "dislikes": 310, "categoryTitle": "Algorithms", "frontendQuestionId": "404", "paidOnly": false, "title": "Sum of Left Leaves", "titleSlug": "sum-of-left-leaves", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 637910, "totalSubmissionRaw": 1048268}, "405": {"acRate": 49.01227993739007, "difficulty": "Easy", "likes": 1312, "dislikes": 219, "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": 151863, "totalSubmissionRaw": 309851}, "406": {"acRate": 73.63910818204307, "difficulty": "Medium", "likes": 7076, "dislikes": 717, "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": 306606, "totalSubmissionRaw": 416363}, "407": {"acRate": 48.14294830887045, "difficulty": "Hard", "likes": 3743, "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": 90528, "totalSubmissionRaw": 188040}, "408": {"acRate": 36.00535111375363, "difficulty": "Easy", "likes": 737, "dislikes": 2216, "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": 203469, "totalSubmissionRaw": 565105}, "409": {"acRate": 55.34924256720822, "difficulty": "Easy", "likes": 5914, "dislikes": 409, "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": 806559, "totalSubmissionRaw": 1457218}, "410": {"acRate": 56.05163199472049, "difficulty": "Hard", "likes": 9858, "dislikes": 225, "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": 372013, "totalSubmissionRaw": 663697}, "411": {"acRate": 39.79622012527892, "difficulty": "Hard", "likes": 181, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "411", "paidOnly": true, "title": "Minimum Unique Word Abbreviation", "titleSlug": "minimum-unique-word-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14803, "totalSubmissionRaw": 37197}, "412": {"acRate": 72.71481012210546, "difficulty": "Easy", "likes": 2780, "dislikes": 381, "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": 1295289, "totalSubmissionRaw": 1781328}, "413": {"acRate": 65.02269206842274, "difficulty": "Medium", "likes": 5347, "dislikes": 295, "categoryTitle": "Algorithms", "frontendQuestionId": "413", "paidOnly": false, "title": "Arithmetic Slices", "titleSlug": "arithmetic-slices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 311470, "totalSubmissionRaw": 479018}, "414": {"acRate": 35.36702135002215, "difficulty": "Easy", "likes": 3039, "dislikes": 3180, "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": 563652, "totalSubmissionRaw": 1593722}, "415": {"acRate": 51.66996236003823, "difficulty": "Easy", "likes": 5044, "dislikes": 755, "categoryTitle": "Algorithms", "frontendQuestionId": "415", "paidOnly": false, "title": "Add Strings", "titleSlug": "add-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 695840, "totalSubmissionRaw": 1346702}, "416": {"acRate": 46.58895830557101, "difficulty": "Medium", "likes": 12293, "dislikes": 250, "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": 891502, "totalSubmissionRaw": 1913552}, "417": {"acRate": 55.72530433137204, "difficulty": "Medium", "likes": 7407, "dislikes": 1480, "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": 494755, "totalSubmissionRaw": 887847}, "418": {"acRate": 36.23305426883686, "difficulty": "Medium", "likes": 1117, "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": 102311, "totalSubmissionRaw": 282369}, "419": {"acRate": 75.54280495833835, "difficulty": "Medium", "likes": 2292, "dislikes": 971, "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": 213419, "totalSubmissionRaw": 282514}, "420": {"acRate": 13.903424202660952, "difficulty": "Hard", "likes": 880, "dislikes": 1731, "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": 43336, "totalSubmissionRaw": 311692}, "421": {"acRate": 53.29529289033604, "difficulty": "Medium", "likes": 5518, "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": 168589, "totalSubmissionRaw": 316330}, "422": {"acRate": 41.318169854968076, "difficulty": "Easy", "likes": 429, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "422", "paidOnly": true, "title": "Valid Word Square", "titleSlug": "valid-word-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59656, "totalSubmissionRaw": 144382}, "423": {"acRate": 51.19339198240528, "difficulty": "Medium", "likes": 828, "dislikes": 2728, "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": 81934, "totalSubmissionRaw": 160048}, "424": {"acRate": 54.80251856483489, "difficulty": "Medium", "likes": 10720, "dislikes": 541, "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": 815108, "totalSubmissionRaw": 1487354}, "425": {"acRate": 53.49997864130203, "difficulty": "Hard", "likes": 1090, "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": 75145, "totalSubmissionRaw": 140458}, "426": {"acRate": 64.88434801753472, "difficulty": "Medium", "likes": 2609, "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": 297654, "totalSubmissionRaw": 458745}, "427": {"acRate": 75.75847623042993, "difficulty": "Medium", "likes": 1511, "dislikes": 1838, "categoryTitle": "Algorithms", "frontendQuestionId": "427", "paidOnly": false, "title": "Construct Quad Tree", "titleSlug": "construct-quad-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130022, "totalSubmissionRaw": 171627}, "428": {"acRate": 67.45340120453844, "difficulty": "Hard", "likes": 1050, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "428", "paidOnly": true, "title": "Serialize and Deserialize N-ary Tree", "titleSlug": "serialize-and-deserialize-n-ary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89711, "totalSubmissionRaw": 132997}, "429": {"acRate": 70.90851211387383, "difficulty": "Medium", "likes": 3622, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "429", "paidOnly": false, "title": "N-ary Tree Level Order Traversal", "titleSlug": "n-ary-tree-level-order-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 311845, "totalSubmissionRaw": 439785}, "430": {"acRate": 60.322514379622014, "difficulty": "Medium", "likes": 5035, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "430", "paidOnly": false, "title": "Flatten a Multilevel Doubly Linked List", "titleSlug": "flatten-a-multilevel-doubly-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 334760, "totalSubmissionRaw": 554951}, "431": {"acRate": 79.61203626774555, "difficulty": "Hard", "likes": 519, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "431", "paidOnly": true, "title": "Encode N-ary Tree to Binary Tree", "titleSlug": "encode-n-ary-tree-to-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22039, "totalSubmissionRaw": 27683}, "432": {"acRate": 37.00790171445657, "difficulty": "Hard", "likes": 1576, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "432", "paidOnly": false, "title": "All O`one Data Structure", "titleSlug": "all-oone-data-structure", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 84163, "totalSubmissionRaw": 227419}, "433": {"acRate": 54.182456396055, "difficulty": "Medium", "likes": 2976, "dislikes": 323, "categoryTitle": "Algorithms", "frontendQuestionId": "433", "paidOnly": false, "title": "Minimum Genetic Mutation", "titleSlug": "minimum-genetic-mutation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178439, "totalSubmissionRaw": 329329}, "434": {"acRate": 36.356590325374995, "difficulty": "Easy", "likes": 790, "dislikes": 1263, "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": 191384, "totalSubmissionRaw": 526408}, "435": {"acRate": 53.818239428252056, "difficulty": "Medium", "likes": 8180, "dislikes": 221, "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": 611464, "totalSubmissionRaw": 1136165}, "436": {"acRate": 52.46003442096485, "difficulty": "Medium", "likes": 2153, "dislikes": 357, "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": 118268, "totalSubmissionRaw": 225444}, "437": {"acRate": 46.137766071896934, "difficulty": "Medium", "likes": 10967, "dislikes": 520, "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": 587528, "totalSubmissionRaw": 1273421}, "438": {"acRate": 51.15076593657817, "difficulty": "Medium", "likes": 12344, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "438", "paidOnly": false, "title": "Find All Anagrams in a String", "titleSlug": "find-all-anagrams-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 900121, "totalSubmissionRaw": 1759741}, "439": {"acRate": 61.06039261603762, "difficulty": "Medium", "likes": 495, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "439", "paidOnly": true, "title": "Ternary Expression Parser", "titleSlug": "ternary-expression-parser", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33375, "totalSubmissionRaw": 54659}, "440": {"acRate": 32.54648718018731, "difficulty": "Hard", "likes": 766, "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": 23839, "totalSubmissionRaw": 73246}, "441": {"acRate": 46.7598567406976, "difficulty": "Easy", "likes": 3884, "dislikes": 1328, "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": 457610, "totalSubmissionRaw": 978638}, "442": {"acRate": 75.85733959826193, "difficulty": "Medium", "likes": 10453, "dislikes": 404, "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": 802535, "totalSubmissionRaw": 1057953}, "443": {"acRate": 55.33424283765348, "difficulty": "Medium", "likes": 5073, "dislikes": 7947, "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": 632724, "totalSubmissionRaw": 1143466}, "444": {"acRate": 28.42658085668316, "difficulty": "Medium", "likes": 571, "dislikes": 1510, "categoryTitle": "Algorithms", "frontendQuestionId": "444", "paidOnly": true, "title": "Sequence Reconstruction", "titleSlug": "sequence-reconstruction", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56184, "totalSubmissionRaw": 197646}, "445": {"acRate": 61.30038942670474, "difficulty": "Medium", "likes": 5886, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "445", "paidOnly": false, "title": "Add Two Numbers II", "titleSlug": "add-two-numbers-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 484986, "totalSubmissionRaw": 791163}, "446": {"acRate": 54.573323752541135, "difficulty": "Hard", "likes": 3349, "dislikes": 154, "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": 151137, "totalSubmissionRaw": 276943}, "447": {"acRate": 55.624654732017355, "difficulty": "Medium", "likes": 837, "dislikes": 1015, "categoryTitle": "Algorithms", "frontendQuestionId": "447", "paidOnly": false, "title": "Number of Boomerangs", "titleSlug": "number-of-boomerangs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101698, "totalSubmissionRaw": 182829}, "448": {"acRate": 61.22007472423989, "difficulty": "Easy", "likes": 9423, "dislikes": 492, "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": 920541, "totalSubmissionRaw": 1503660}, "449": {"acRate": 57.859689407214944, "difficulty": "Medium", "likes": 3487, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "449", "paidOnly": false, "title": "Serialize and Deserialize BST", "titleSlug": "serialize-and-deserialize-bst", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239380, "totalSubmissionRaw": 413725}, "450": {"acRate": 51.743973625040184, "difficulty": "Medium", "likes": 9153, "dislikes": 282, "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": 542414, "totalSubmissionRaw": 1048265}, "451": {"acRate": 72.86733794045873, "difficulty": "Medium", "likes": 8317, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "451", "paidOnly": false, "title": "Sort Characters By Frequency", "titleSlug": "sort-characters-by-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 774256, "totalSubmissionRaw": 1062555}, "452": {"acRate": 59.210878457079396, "difficulty": "Medium", "likes": 7466, "dislikes": 241, "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": 546462, "totalSubmissionRaw": 922913}, "453": {"acRate": 56.90640209538389, "difficulty": "Medium", "likes": 2576, "dislikes": 1893, "categoryTitle": "Algorithms", "frontendQuestionId": "453", "paidOnly": false, "title": "Minimum Moves to Equal Array Elements", "titleSlug": "minimum-moves-to-equal-array-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176201, "totalSubmissionRaw": 309633}, "454": {"acRate": 57.32954604391919, "difficulty": "Medium", "likes": 4907, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "454", "paidOnly": false, "title": "4Sum II", "titleSlug": "4sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 331608, "totalSubmissionRaw": 578425}, "455": {"acRate": 52.8931882115178, "difficulty": "Easy", "likes": 3956, "dislikes": 374, "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": 492816, "totalSubmissionRaw": 931721}, "456": {"acRate": 33.7722281792013, "difficulty": "Medium", "likes": 7209, "dislikes": 436, "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": 263625, "totalSubmissionRaw": 780597}, "457": {"acRate": 34.370224120412054, "difficulty": "Medium", "likes": 691, "dislikes": 786, "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": 83211, "totalSubmissionRaw": 242102}, "458": {"acRate": 59.568555903308265, "difficulty": "Hard", "likes": 1787, "dislikes": 3356, "categoryTitle": "Algorithms", "frontendQuestionId": "458", "paidOnly": false, "title": "Poor Pigs", "titleSlug": "poor-pigs", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120478, "totalSubmissionRaw": 202251}, "459": {"acRate": 46.19925258622493, "difficulty": "Easy", "likes": 6399, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "459", "paidOnly": false, "title": "Repeated Substring Pattern", "titleSlug": "repeated-substring-pattern", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 463962, "totalSubmissionRaw": 1004263}, "460": {"acRate": 44.6443026685875, "difficulty": "Hard", "likes": 5679, "dislikes": 330, "categoryTitle": "Algorithms", "frontendQuestionId": "460", "paidOnly": false, "title": "LFU Cache", "titleSlug": "lfu-cache", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 260312, "totalSubmissionRaw": 583080}, "461": {"acRate": 75.52542118940478, "difficulty": "Easy", "likes": 3838, "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": 584745, "totalSubmissionRaw": 774236}, "462": {"acRate": 60.28427577285241, "difficulty": "Medium", "likes": 3353, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "462", "paidOnly": false, "title": "Minimum Moves to Equal Array Elements II", "titleSlug": "minimum-moves-to-equal-array-elements-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 185470, "totalSubmissionRaw": 307659}, "463": {"acRate": 72.99927357224486, "difficulty": "Easy", "likes": 6838, "dislikes": 386, "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": 652185, "totalSubmissionRaw": 893413}, "464": {"acRate": 29.75102022100968, "difficulty": "Medium", "likes": 2658, "dislikes": 400, "categoryTitle": "Algorithms", "frontendQuestionId": "464", "paidOnly": false, "title": "Can I Win", "titleSlug": "can-i-win", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97326, "totalSubmissionRaw": 327135}, "465": {"acRate": 49.614967263043674, "difficulty": "Hard", "likes": 1459, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "465", "paidOnly": true, "title": "Optimal Account Balancing", "titleSlug": "optimal-account-balancing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94647, "totalSubmissionRaw": 190763}, "466": {"acRate": 30.482600646396186, "difficulty": "Hard", "likes": 405, "dislikes": 358, "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": 19429, "totalSubmissionRaw": 63738}, "467": {"acRate": 39.9798713516825, "difficulty": "Medium", "likes": 1442, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "467", "paidOnly": false, "title": "Unique Substrings in Wraparound String", "titleSlug": "unique-substrings-in-wraparound-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45683, "totalSubmissionRaw": 114265}, "468": {"acRate": 27.261133425195695, "difficulty": "Medium", "likes": 1018, "dislikes": 2708, "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": 167373, "totalSubmissionRaw": 613961}, "469": {"acRate": 39.52638503142815, "difficulty": "Medium", "likes": 99, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "469", "paidOnly": true, "title": "Convex Polygon", "titleSlug": "convex-polygon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10816, "totalSubmissionRaw": 27364}, "470": {"acRate": 45.80594746194524, "difficulty": "Medium", "likes": 1109, "dislikes": 372, "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": 85582, "totalSubmissionRaw": 186836}, "471": {"acRate": 50.46511249042894, "difficulty": "Hard", "likes": 625, "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": 30977, "totalSubmissionRaw": 61383}, "472": {"acRate": 49.37243626440319, "difficulty": "Hard", "likes": 3869, "dislikes": 283, "categoryTitle": "Algorithms", "frontendQuestionId": "472", "paidOnly": false, "title": "Concatenated Words", "titleSlug": "concatenated-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229411, "totalSubmissionRaw": 464654}, "473": {"acRate": 40.32584796164798, "difficulty": "Medium", "likes": 3825, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "473", "paidOnly": false, "title": "Matchsticks to Square", "titleSlug": "matchsticks-to-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167813, "totalSubmissionRaw": 416143}, "474": {"acRate": 47.83798626586846, "difficulty": "Medium", "likes": 5437, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "474", "paidOnly": false, "title": "Ones and Zeroes", "titleSlug": "ones-and-zeroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210800, "totalSubmissionRaw": 440654}, "475": {"acRate": 38.31564680237097, "difficulty": "Medium", "likes": 2108, "dislikes": 1167, "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": 122689, "totalSubmissionRaw": 320206}, "476": {"acRate": 67.70016399887227, "difficulty": "Easy", "likes": 2672, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "476", "paidOnly": false, "title": "Number Complement", "titleSlug": "number-complement", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 340980, "totalSubmissionRaw": 503662}, "477": {"acRate": 52.88424697384666, "difficulty": "Medium", "likes": 2213, "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": 111800, "totalSubmissionRaw": 211406}, "478": {"acRate": 39.99503167308409, "difficulty": "Medium", "likes": 456, "dislikes": 770, "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": 41860, "totalSubmissionRaw": 104662}, "479": {"acRate": 33.551785139916376, "difficulty": "Hard", "likes": 177, "dislikes": 1560, "categoryTitle": "Algorithms", "frontendQuestionId": "479", "paidOnly": false, "title": "Largest Palindrome Product", "titleSlug": "largest-palindrome-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25035, "totalSubmissionRaw": 74616}, "480": {"acRate": 38.97464265504825, "difficulty": "Hard", "likes": 3218, "dislikes": 200, "categoryTitle": "Algorithms", "frontendQuestionId": "480", "paidOnly": false, "title": "Sliding Window Median", "titleSlug": "sliding-window-median", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153594, "totalSubmissionRaw": 394087}, "481": {"acRate": 51.46712736869312, "difficulty": "Medium", "likes": 318, "dislikes": 1303, "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": 37834, "totalSubmissionRaw": 73511}, "482": {"acRate": 43.973686175944735, "difficulty": "Easy", "likes": 1104, "dislikes": 1416, "categoryTitle": "Algorithms", "frontendQuestionId": "482", "paidOnly": false, "title": "License Key Formatting", "titleSlug": "license-key-formatting", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288503, "totalSubmissionRaw": 656081}, "483": {"acRate": 41.1677806402796, "difficulty": "Hard", "likes": 386, "dislikes": 505, "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": 22851, "totalSubmissionRaw": 55507}, "484": {"acRate": 66.9143785760233, "difficulty": "Medium", "likes": 700, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "484", "paidOnly": true, "title": "Find Permutation", "titleSlug": "find-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39529, "totalSubmissionRaw": 59074}, "485": {"acRate": 60.03039068056963, "difficulty": "Easy", "likes": 5779, "dislikes": 457, "categoryTitle": "Algorithms", "frontendQuestionId": "485", "paidOnly": false, "title": "Max Consecutive Ones", "titleSlug": "max-consecutive-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1269320, "totalSubmissionRaw": 2114463}, "486": {"acRate": 55.41794304646793, "difficulty": "Medium", "likes": 5835, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "486", "paidOnly": false, "title": "Predict the Winner", "titleSlug": "predict-the-winner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 239520, "totalSubmissionRaw": 432208}, "487": {"acRate": 50.47776359925399, "difficulty": "Medium", "likes": 1542, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "487", "paidOnly": true, "title": "Max Consecutive Ones II", "titleSlug": "max-consecutive-ones-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149131, "totalSubmissionRaw": 295439}, "488": {"acRate": 32.61075992294962, "difficulty": "Hard", "likes": 455, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "488", "paidOnly": false, "title": "Zuma Game", "titleSlug": "zuma-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24040, "totalSubmissionRaw": 73718}, "489": {"acRate": 76.83206210965554, "difficulty": "Hard", "likes": 2772, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "489", "paidOnly": true, "title": "Robot Room Cleaner", "titleSlug": "robot-room-cleaner", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169029, "totalSubmissionRaw": 219998}, "490": {"acRate": 58.28367024814446, "difficulty": "Medium", "likes": 1845, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "490", "paidOnly": true, "title": "The Maze", "titleSlug": "the-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176135, "totalSubmissionRaw": 302203}, "491": {"acRate": 60.92664393156829, "difficulty": "Medium", "likes": 3645, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "491", "paidOnly": false, "title": "Non-decreasing Subsequences", "titleSlug": "non-decreasing-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172225, "totalSubmissionRaw": 282676}, "492": {"acRate": 58.34473291611655, "difficulty": "Easy", "likes": 701, "dislikes": 389, "categoryTitle": "Algorithms", "frontendQuestionId": "492", "paidOnly": false, "title": "Construct the Rectangle", "titleSlug": "construct-the-rectangle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 122409, "totalSubmissionRaw": 209803}, "493": {"acRate": 30.852933055548583, "difficulty": "Hard", "likes": 6185, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "493", "paidOnly": false, "title": "Reverse Pairs", "titleSlug": "reverse-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 196664, "totalSubmissionRaw": 637424}, "494": {"acRate": 47.253570592367126, "difficulty": "Medium", "likes": 10913, "dislikes": 361, "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": 635728, "totalSubmissionRaw": 1345359}, "495": {"acRate": 56.66360542380207, "difficulty": "Easy", "likes": 1151, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "495", "paidOnly": false, "title": "Teemo Attacking", "titleSlug": "teemo-attacking", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157334, "totalSubmissionRaw": 277664}, "496": {"acRate": 72.76899412696933, "difficulty": "Easy", "likes": 8041, "dislikes": 763, "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": 780593, "totalSubmissionRaw": 1072700}, "497": {"acRate": 40.15376366734964, "difficulty": "Medium", "likes": 481, "dislikes": 674, "categoryTitle": "Algorithms", "frontendQuestionId": "497", "paidOnly": false, "title": "Random Point in Non-overlapping Rectangles", "titleSlug": "random-point-in-non-overlapping-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41939, "totalSubmissionRaw": 104446}, "498": {"acRate": 60.72865643692303, "difficulty": "Medium", "likes": 3448, "dislikes": 687, "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": 313921, "totalSubmissionRaw": 516924}, "499": {"acRate": 49.09673481843149, "difficulty": "Hard", "likes": 483, "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": 32178, "totalSubmissionRaw": 65540}, "500": {"acRate": 71.05470852017937, "difficulty": "Easy", "likes": 1607, "dislikes": 1136, "categoryTitle": "Algorithms", "frontendQuestionId": "500", "paidOnly": false, "title": "Keyboard Row", "titleSlug": "keyboard-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 237677, "totalSubmissionRaw": 334499}, "501": {"acRate": 56.45074103243359, "difficulty": "Easy", "likes": 3895, "dislikes": 783, "categoryTitle": "Algorithms", "frontendQuestionId": "501", "paidOnly": false, "title": "Find Mode in Binary Search Tree", "titleSlug": "find-mode-in-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 315379, "totalSubmissionRaw": 558680}, "502": {"acRate": 53.15455994390458, "difficulty": "Hard", "likes": 3789, "dislikes": 257, "categoryTitle": "Algorithms", "frontendQuestionId": "502", "paidOnly": false, "title": "IPO", "titleSlug": "ipo", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230450, "totalSubmissionRaw": 433547}, "503": {"acRate": 64.4249872007093, "difficulty": "Medium", "likes": 7999, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "503", "paidOnly": false, "title": "Next Greater Element II", "titleSlug": "next-greater-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 431620, "totalSubmissionRaw": 669958}, "504": {"acRate": 50.47367349609574, "difficulty": "Easy", "likes": 801, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "504", "paidOnly": false, "title": "Base 7", "titleSlug": "base-7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 138845, "totalSubmissionRaw": 275084}, "505": {"acRate": 53.53325241292899, "difficulty": "Medium", "likes": 1326, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "505", "paidOnly": true, "title": "The Maze II", "titleSlug": "the-maze-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109377, "totalSubmissionRaw": 204316}, "506": {"acRate": 71.94436790972364, "difficulty": "Easy", "likes": 1908, "dislikes": 124, "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": 300285, "totalSubmissionRaw": 417385}, "507": {"acRate": 41.53190918950537, "difficulty": "Easy", "likes": 1087, "dislikes": 1226, "categoryTitle": "Algorithms", "frontendQuestionId": "507", "paidOnly": false, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 204489, "totalSubmissionRaw": 492366}, "508": {"acRate": 66.85253091252021, "difficulty": "Medium", "likes": 2256, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "508", "paidOnly": false, "title": "Most Frequent Subtree Sum", "titleSlug": "most-frequent-subtree-sum", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146032, "totalSubmissionRaw": 218439}, "509": {"acRate": 71.5468218106568, "difficulty": "Easy", "likes": 8193, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "509", "paidOnly": false, "title": "Fibonacci Number", "titleSlug": "fibonacci-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1919548, "totalSubmissionRaw": 2682926}, "510": {"acRate": 60.900437167446995, "difficulty": "Medium", "likes": 863, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "510", "paidOnly": true, "title": "Inorder Successor in BST II", "titleSlug": "inorder-successor-in-bst-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66728, "totalSubmissionRaw": 109569}, "511": {"acRate": 74.85710926156929, "difficulty": "Easy", "likes": 856, "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": 292847, "totalSubmissionRaw": 391208}, "512": {"acRate": 53.0171456691732, "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": 88343, "totalSubmissionRaw": 166631}, "513": {"acRate": 71.31141517898581, "difficulty": "Medium", "likes": 3798, "dislikes": 295, "categoryTitle": "Algorithms", "frontendQuestionId": "513", "paidOnly": false, "title": "Find Bottom Left Tree Value", "titleSlug": "find-bottom-left-tree-value", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 368777, "totalSubmissionRaw": 517136}, "514": {"acRate": 58.97027887156805, "difficulty": "Hard", "likes": 1483, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "514", "paidOnly": false, "title": "Freedom Trail", "titleSlug": "freedom-trail", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109325, "totalSubmissionRaw": 185390}, "515": {"acRate": 65.68720414532531, "difficulty": "Medium", "likes": 3614, "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": 351910, "totalSubmissionRaw": 535736}, "516": {"acRate": 63.006082557525936, "difficulty": "Medium", "likes": 9562, "dislikes": 330, "categoryTitle": "Algorithms", "frontendQuestionId": "516", "paidOnly": false, "title": "Longest Palindromic Subsequence", "titleSlug": "longest-palindromic-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 516992, "totalSubmissionRaw": 820543}, "517": {"acRate": 41.45854419126296, "difficulty": "Hard", "likes": 770, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "517", "paidOnly": false, "title": "Super Washing Machines", "titleSlug": "super-washing-machines", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30312, "totalSubmissionRaw": 73114}, "518": {"acRate": 64.48328565041162, "difficulty": "Medium", "likes": 9371, "dislikes": 168, "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": 661962, "totalSubmissionRaw": 1026565}, "519": {"acRate": 42.26709674956578, "difficulty": "Medium", "likes": 432, "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": 22145, "totalSubmissionRaw": 52393}, "520": {"acRate": 56.407450906878964, "difficulty": "Easy", "likes": 3402, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "520", "paidOnly": false, "title": "Detect Capital", "titleSlug": "detect-capital", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 442332, "totalSubmissionRaw": 784173}, "521": {"acRate": 60.888423181787374, "difficulty": "Easy", "likes": 39, "dislikes": 127, "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": 116797, "totalSubmissionRaw": 191821}, "522": {"acRate": 41.90848862887916, "difficulty": "Medium", "likes": 514, "dislikes": 1308, "categoryTitle": "Algorithms", "frontendQuestionId": "522", "paidOnly": false, "title": "Longest Uncommon Subsequence II", "titleSlug": "longest-uncommon-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54085, "totalSubmissionRaw": 129055}, "523": {"acRate": 30.28100447361312, "difficulty": "Medium", "likes": 6273, "dislikes": 652, "categoryTitle": "Algorithms", "frontendQuestionId": "523", "paidOnly": false, "title": "Continuous Subarray Sum", "titleSlug": "continuous-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 586243, "totalSubmissionRaw": 1936014}, "524": {"acRate": 51.300952759937765, "difficulty": "Medium", "likes": 1796, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "524", "paidOnly": false, "title": "Longest Word in Dictionary through Deleting", "titleSlug": "longest-word-in-dictionary-through-deleting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157280, "totalSubmissionRaw": 306583}, "525": {"acRate": 48.95984589076718, "difficulty": "Medium", "likes": 7962, "dislikes": 379, "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": 470696, "totalSubmissionRaw": 961392}, "526": {"acRate": 64.30084745762711, "difficulty": "Medium", "likes": 3218, "dislikes": 370, "categoryTitle": "Algorithms", "frontendQuestionId": "526", "paidOnly": false, "title": "Beautiful Arrangement", "titleSlug": "beautiful-arrangement", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 179065, "totalSubmissionRaw": 278480}, "527": {"acRate": 61.15563427053354, "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": 27624, "totalSubmissionRaw": 45170}, "528": {"acRate": 47.09625026272139, "difficulty": "Medium", "likes": 1907, "dislikes": 843, "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": 477286, "totalSubmissionRaw": 1013427}, "529": {"acRate": 66.95802180428839, "difficulty": "Medium", "likes": 1962, "dislikes": 1064, "categoryTitle": "Algorithms", "frontendQuestionId": "529", "paidOnly": false, "title": "Minesweeper", "titleSlug": "minesweeper", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 162633, "totalSubmissionRaw": 242888}, "530": {"acRate": 58.483061545644766, "difficulty": "Easy", "likes": 4396, "dislikes": 227, "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": 405827, "totalSubmissionRaw": 693923}, "531": {"acRate": 62.34506054447084, "difficulty": "Medium", "likes": 433, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "531", "paidOnly": true, "title": "Lonely Pixel I", "titleSlug": "lonely-pixel-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 43558, "totalSubmissionRaw": 69866}, "532": {"acRate": 43.20551226794562, "difficulty": "Medium", "likes": 3878, "dislikes": 2252, "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": 348449, "totalSubmissionRaw": 806492}, "533": {"acRate": 48.639208266627854, "difficulty": "Medium", "likes": 87, "dislikes": 774, "categoryTitle": "Algorithms", "frontendQuestionId": "533", "paidOnly": true, "title": "Lonely Pixel II", "titleSlug": "lonely-pixel-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13368, "totalSubmissionRaw": 27484}, "534": {"acRate": 80.92705794886622, "difficulty": "Medium", "likes": 397, "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": 78373, "totalSubmissionRaw": 96844}, "535": {"acRate": 86.4559266946, "difficulty": "Medium", "likes": 2020, "dislikes": 3782, "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": 264939, "totalSubmissionRaw": 306444}, "536": {"acRate": 57.191817373258225, "difficulty": "Medium", "likes": 1063, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "536", "paidOnly": true, "title": "Construct Binary Tree from String", "titleSlug": "construct-binary-tree-from-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96454, "totalSubmissionRaw": 168650}, "537": {"acRate": 71.98280963370614, "difficulty": "Medium", "likes": 715, "dislikes": 1251, "categoryTitle": "Algorithms", "frontendQuestionId": "537", "paidOnly": false, "title": "Complex Number Multiplication", "titleSlug": "complex-number-multiplication", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97315, "totalSubmissionRaw": 135192}, "538": {"acRate": 69.61751333807777, "difficulty": "Medium", "likes": 5241, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "538", "paidOnly": false, "title": "Convert BST to Greater Tree", "titleSlug": "convert-bst-to-greater-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 307164, "totalSubmissionRaw": 441217}, "539": {"acRate": 56.97281383345445, "difficulty": "Medium", "likes": 1868, "dislikes": 263, "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": 152878, "totalSubmissionRaw": 268335}, "540": {"acRate": 59.20185474845269, "difficulty": "Medium", "likes": 11241, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "540", "paidOnly": false, "title": "Single Element in a Sorted Array", "titleSlug": "single-element-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 702469, "totalSubmissionRaw": 1186568}, "541": {"acRate": 50.96509932658263, "difficulty": "Easy", "likes": 1994, "dislikes": 3838, "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": 256938, "totalSubmissionRaw": 504145}, "542": {"acRate": 49.15901756857852, "difficulty": "Medium", "likes": 9516, "dislikes": 423, "categoryTitle": "Algorithms", "frontendQuestionId": "542", "paidOnly": false, "title": "01 Matrix", "titleSlug": "01-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 597312, "totalSubmissionRaw": 1215064}, "543": {"acRate": 61.12469912629972, "difficulty": "Easy", "likes": 13904, "dislikes": 1029, "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": 1604685, "totalSubmissionRaw": 2625266}, "544": {"acRate": 77.17305077062557, "difficulty": "Medium", "likes": 390, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "544", "paidOnly": true, "title": "Output Contest Matches", "titleSlug": "output-contest-matches", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27239, "totalSubmissionRaw": 35296}, "545": {"acRate": 45.73456157852417, "difficulty": "Medium", "likes": 1329, "dislikes": 2196, "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": 137077, "totalSubmissionRaw": 299723}, "546": {"acRate": 47.885568326947634, "difficulty": "Hard", "likes": 2261, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "546", "paidOnly": false, "title": "Remove Boxes", "titleSlug": "remove-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46868, "totalSubmissionRaw": 97875}, "547": {"acRate": 66.86725101208056, "difficulty": "Medium", "likes": 9763, "dislikes": 362, "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": 955189, "totalSubmissionRaw": 1428486}, "548": {"acRate": 50.12625472150921, "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": 24020, "totalSubmissionRaw": 47919}, "549": {"acRate": 49.5039610436805, "difficulty": "Medium", "likes": 1156, "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": 54490, "totalSubmissionRaw": 110072}, "550": {"acRate": 37.215404014692865, "difficulty": "Medium", "likes": 922, "dislikes": 195, "categoryTitle": "Database", "frontendQuestionId": "550", "paidOnly": false, "title": "Game Play Analysis IV", "titleSlug": "game-play-analysis-iv", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190064, "totalSubmissionRaw": 510720}, "551": {"acRate": 49.20885799993024, "difficulty": "Easy", "likes": 770, "dislikes": 50, "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": 225723, "totalSubmissionRaw": 458704}, "552": {"acRate": 55.19207313439358, "difficulty": "Hard", "likes": 2270, "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": 138919, "totalSubmissionRaw": 251701}, "553": {"acRate": 61.002403527139215, "difficulty": "Medium", "likes": 377, "dislikes": 1601, "categoryTitle": "Algorithms", "frontendQuestionId": "553", "paidOnly": false, "title": "Optimal Division", "titleSlug": "optimal-division", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41370, "totalSubmissionRaw": 67817}, "554": {"acRate": 55.16761119895966, "difficulty": "Medium", "likes": 2525, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "554", "paidOnly": false, "title": "Brick Wall", "titleSlug": "brick-wall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 143389, "totalSubmissionRaw": 259911}, "555": {"acRate": 43.36958595687846, "difficulty": "Medium", "likes": 76, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "555", "paidOnly": true, "title": "Split Concatenated Strings", "titleSlug": "split-concatenated-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6819, "totalSubmissionRaw": 15723}, "556": {"acRate": 34.149753875840474, "difficulty": "Medium", "likes": 3680, "dislikes": 468, "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": 159632, "totalSubmissionRaw": 467447}, "557": {"acRate": 83.22156689690343, "difficulty": "Easy", "likes": 5922, "dislikes": 250, "categoryTitle": "Algorithms", "frontendQuestionId": "557", "paidOnly": false, "title": "Reverse Words in a String III", "titleSlug": "reverse-words-in-a-string-iii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 926905, "totalSubmissionRaw": 1113780}, "558": {"acRate": 49.914106375949785, "difficulty": "Medium", "likes": 190, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "558", "paidOnly": false, "title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "titleSlug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15109, "totalSubmissionRaw": 30270}, "559": {"acRate": 72.32008102559242, "difficulty": "Easy", "likes": 2769, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "559", "paidOnly": false, "title": "Maximum Depth of N-ary Tree", "titleSlug": "maximum-depth-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 289903, "totalSubmissionRaw": 400861}, "560": {"acRate": 43.94550444877731, "difficulty": "Medium", "likes": 21691, "dislikes": 664, "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": 1337884, "totalSubmissionRaw": 3044418}, "561": {"acRate": 79.1631602731873, "difficulty": "Easy", "likes": 2060, "dislikes": 263, "categoryTitle": "Algorithms", "frontendQuestionId": "561", "paidOnly": false, "title": "Array Partition", "titleSlug": "array-partition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 495749, "totalSubmissionRaw": 626237}, "562": {"acRate": 50.400884892039244, "difficulty": "Medium", "likes": 890, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "562", "paidOnly": true, "title": "Longest Line of Consecutive One in Matrix", "titleSlug": "longest-line-of-consecutive-one-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77006, "totalSubmissionRaw": 152787}, "563": {"acRate": 62.340988010688925, "difficulty": "Easy", "likes": 2235, "dislikes": 2185, "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": 218128, "totalSubmissionRaw": 349895}, "564": {"acRate": 22.552387013448886, "difficulty": "Hard", "likes": 776, "dislikes": 1449, "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": 48194, "totalSubmissionRaw": 213699}, "565": {"acRate": 56.3045431894749, "difficulty": "Medium", "likes": 2208, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "565", "paidOnly": false, "title": "Array Nesting", "titleSlug": "array-nesting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132197, "totalSubmissionRaw": 234790}, "566": {"acRate": 63.19470820652201, "difficulty": "Easy", "likes": 3496, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "566", "paidOnly": false, "title": "Reshape the Matrix", "titleSlug": "reshape-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 384342, "totalSubmissionRaw": 608187}, "567": {"acRate": 44.62164977275482, "difficulty": "Medium", "likes": 11318, "dislikes": 419, "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": 901778, "totalSubmissionRaw": 2020944}, "568": {"acRate": 45.806150978564766, "difficulty": "Hard", "likes": 569, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "568", "paidOnly": true, "title": "Maximum Vacation Days", "titleSlug": "maximum-vacation-days", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38337, "totalSubmissionRaw": 83694}, "569": {"acRate": 65.85521284731072, "difficulty": "Hard", "likes": 323, "dislikes": 152, "categoryTitle": "Database", "frontendQuestionId": "569", "paidOnly": true, "title": "Median Employee Salary", "titleSlug": "median-employee-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41336, "totalSubmissionRaw": 62768}, "570": {"acRate": 49.75187851062884, "difficulty": "Medium", "likes": 1141, "dislikes": 127, "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": 402827, "totalSubmissionRaw": 809674}, "571": {"acRate": 42.35866104466053, "difficulty": "Hard", "likes": 308, "dislikes": 78, "categoryTitle": "Database", "frontendQuestionId": "571", "paidOnly": true, "title": "Find Median Given Frequency of Numbers", "titleSlug": "find-median-given-frequency-of-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29535, "totalSubmissionRaw": 69726}, "572": {"acRate": 48.405847207666625, "difficulty": "Easy", "likes": 8220, "dislikes": 517, "categoryTitle": "Algorithms", "frontendQuestionId": "572", "paidOnly": false, "title": "Subtree of Another Tree", "titleSlug": "subtree-of-another-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 896059, "totalSubmissionRaw": 1851139}, "573": {"acRate": 57.113821138211385, "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": 22480, "totalSubmissionRaw": 39360}, "574": {"acRate": 60.99902601920134, "difficulty": "Medium", "likes": 173, "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": 65760, "totalSubmissionRaw": 107805}, "575": {"acRate": 68.0857274578533, "difficulty": "Easy", "likes": 1530, "dislikes": 1368, "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": 293890, "totalSubmissionRaw": 431647}, "576": {"acRate": 48.08481015267018, "difficulty": "Medium", "likes": 3879, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "576", "paidOnly": false, "title": "Out of Boundary Paths", "titleSlug": "out-of-boundary-paths", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209983, "totalSubmissionRaw": 436693}, "577": {"acRate": 75.8638517880224, "difficulty": "Easy", "likes": 942, "dislikes": 223, "categoryTitle": "Database", "frontendQuestionId": "577", "paidOnly": false, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 431388, "totalSubmissionRaw": 568627}, "578": {"acRate": 40.23039401734632, "difficulty": "Medium", "likes": 129, "dislikes": 914, "categoryTitle": "Database", "frontendQuestionId": "578", "paidOnly": true, "title": "Get Highest Answer Rate Question", "titleSlug": "get-highest-answer-rate-question", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57239, "totalSubmissionRaw": 142278}, "579": {"acRate": 47.230755032893434, "difficulty": "Hard", "likes": 239, "dislikes": 403, "categoryTitle": "Database", "frontendQuestionId": "579", "paidOnly": true, "title": "Find Cumulative Salary of an Employee", "titleSlug": "find-cumulative-salary-of-an-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35824, "totalSubmissionRaw": 75850}, "580": {"acRate": 59.12272515165655, "difficulty": "Medium", "likes": 245, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "580", "paidOnly": true, "title": "Count Student Number in Departments", "titleSlug": "count-student-number-in-departments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68418, "totalSubmissionRaw": 115722}, "581": {"acRate": 36.98224622714331, "difficulty": "Medium", "likes": 7755, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "581", "paidOnly": false, "title": "Shortest Unsorted Continuous Subarray", "titleSlug": "shortest-unsorted-continuous-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 333936, "totalSubmissionRaw": 902963}, "582": {"acRate": 69.56083190573015, "difficulty": "Medium", "likes": 1107, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "582", "paidOnly": true, "title": "Kill Process", "titleSlug": "kill-process", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 86894, "totalSubmissionRaw": 124918}, "583": {"acRate": 62.33008436705988, "difficulty": "Medium", "likes": 5779, "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": 266409, "totalSubmissionRaw": 427417}, "584": {"acRate": 70.43964338271984, "difficulty": "Easy", "likes": 2079, "dislikes": 367, "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": 1002296, "totalSubmissionRaw": 1422917}, "585": {"acRate": 48.350851069487234, "difficulty": "Medium", "likes": 578, "dislikes": 492, "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": 127284, "totalSubmissionRaw": 263252}, "586": {"acRate": 64.66485940322623, "difficulty": "Easy", "likes": 991, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "586", "paidOnly": false, "title": "Customer Placing the Largest Number of Orders", "titleSlug": "customer-placing-the-largest-number-of-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274554, "totalSubmissionRaw": 424580}, "587": {"acRate": 51.933044589605224, "difficulty": "Hard", "likes": 1477, "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": 58514, "totalSubmissionRaw": 112672}, "588": {"acRate": 48.07473758624084, "difficulty": "Hard", "likes": 1489, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "588", "paidOnly": true, "title": "Design In-Memory File System", "titleSlug": "design-in-memory-file-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107447, "totalSubmissionRaw": 223501}, "589": {"acRate": 75.63211499717666, "difficulty": "Easy", "likes": 3138, "dislikes": 202, "categoryTitle": "Algorithms", "frontendQuestionId": "589", "paidOnly": false, "title": "N-ary Tree Preorder Traversal", "titleSlug": "n-ary-tree-preorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433968, "totalSubmissionRaw": 573788}, "590": {"acRate": 78.03892349417339, "difficulty": "Easy", "likes": 2337, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "590", "paidOnly": false, "title": "N-ary Tree Postorder Traversal", "titleSlug": "n-ary-tree-postorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 261844, "totalSubmissionRaw": 335530}, "591": {"acRate": 38.97501412672285, "difficulty": "Hard", "likes": 170, "dislikes": 648, "categoryTitle": "Algorithms", "frontendQuestionId": "591", "paidOnly": false, "title": "Tag Validator", "titleSlug": "tag-validator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 15864, "totalSubmissionRaw": 40703}, "592": {"acRate": 53.553259026278035, "difficulty": "Medium", "likes": 398, "dislikes": 507, "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": 36948, "totalSubmissionRaw": 68993}, "593": {"acRate": 44.092883381261395, "difficulty": "Medium", "likes": 1050, "dislikes": 908, "categoryTitle": "Algorithms", "frontendQuestionId": "593", "paidOnly": false, "title": "Valid Square", "titleSlug": "valid-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110551, "totalSubmissionRaw": 250723}, "594": {"acRate": 55.0554289647246, "difficulty": "Easy", "likes": 2158, "dislikes": 246, "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": 164782, "totalSubmissionRaw": 299302}, "595": {"acRate": 68.07891769893529, "difficulty": "Easy", "likes": 2715, "dislikes": 1321, "categoryTitle": "Database", "frontendQuestionId": "595", "paidOnly": false, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1303663, "totalSubmissionRaw": 1914930}, "596": {"acRate": 56.456594046961825, "difficulty": "Easy", "likes": 1042, "dislikes": 1078, "categoryTitle": "Database", "frontendQuestionId": "596", "paidOnly": false, "title": "Classes More Than 5 Students", "titleSlug": "classes-more-than-5-students", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 450986, "totalSubmissionRaw": 798819}, "597": {"acRate": 41.79483114000317, "difficulty": "Easy", "likes": 305, "dislikes": 766, "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": 76444, "totalSubmissionRaw": 182903}, "598": {"acRate": 56.32868844083274, "difficulty": "Easy", "likes": 942, "dislikes": 968, "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": 104735, "totalSubmissionRaw": 185937}, "599": {"acRate": 55.98217039843462, "difficulty": "Easy", "likes": 1940, "dislikes": 395, "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": 237749, "totalSubmissionRaw": 424687}, "600": {"acRate": 39.98750111597179, "difficulty": "Hard", "likes": 1532, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "600", "paidOnly": false, "title": "Non-negative Integers without Consecutive Ones", "titleSlug": "non-negative-integers-without-consecutive-ones", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40311, "totalSubmissionRaw": 100809}, "601": {"acRate": 48.75817710547609, "difficulty": "Hard", "likes": 681, "dislikes": 568, "categoryTitle": "Database", "frontendQuestionId": "601", "paidOnly": false, "title": "Human Traffic of Stadium", "titleSlug": "human-traffic-of-stadium", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 106659, "totalSubmissionRaw": 218751}, "602": {"acRate": 57.83849980864906, "difficulty": "Medium", "likes": 643, "dislikes": 125, "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": 151130, "totalSubmissionRaw": 261298}, "603": {"acRate": 65.92641820802126, "difficulty": "Easy", "likes": 641, "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": 88288, "totalSubmissionRaw": 133919}, "604": {"acRate": 39.92354740061162, "difficulty": "Easy", "likes": 440, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "604", "paidOnly": true, "title": "Design Compressed String Iterator", "titleSlug": "design-compressed-string-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33943, "totalSubmissionRaw": 85019}, "605": {"acRate": 28.985467550192002, "difficulty": "Easy", "likes": 6563, "dislikes": 1183, "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": 857169, "totalSubmissionRaw": 2957234}, "606": {"acRate": 69.42445347054536, "difficulty": "Medium", "likes": 73, "dislikes": 35, "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": 322873, "totalSubmissionRaw": 465071}, "607": {"acRate": 65.75756868556626, "difficulty": "Easy", "likes": 1170, "dislikes": 101, "categoryTitle": "Database", "frontendQuestionId": "607", "paidOnly": false, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 225413, "totalSubmissionRaw": 342794}, "608": {"acRate": 72.62245180333917, "difficulty": "Medium", "likes": 1237, "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": 165333, "totalSubmissionRaw": 227661}, "609": {"acRate": 67.6509995887558, "difficulty": "Medium", "likes": 1512, "dislikes": 1649, "categoryTitle": "Algorithms", "frontendQuestionId": "609", "paidOnly": false, "title": "Find Duplicate File in System", "titleSlug": "find-duplicate-file-in-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152988, "totalSubmissionRaw": 226143}, "610": {"acRate": 72.09821662595276, "difficulty": "Easy", "likes": 593, "dislikes": 167, "categoryTitle": "Database", "frontendQuestionId": "610", "paidOnly": false, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 206304, "totalSubmissionRaw": 286143}, "611": {"acRate": 51.338368085737365, "difficulty": "Medium", "likes": 3819, "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": 200809, "totalSubmissionRaw": 391148}, "612": {"acRate": 61.30434782608696, "difficulty": "Medium", "likes": 218, "dislikes": 70, "categoryTitle": "Database", "frontendQuestionId": "612", "paidOnly": true, "title": "Shortest Distance in a Plane", "titleSlug": "shortest-distance-in-a-plane", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41736, "totalSubmissionRaw": 68080}, "613": {"acRate": 80.17162019989479, "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": 73155, "totalSubmissionRaw": 91248}, "614": {"acRate": 38.87826274538003, "difficulty": "Medium", "likes": 158, "dislikes": 744, "categoryTitle": "Database", "frontendQuestionId": "614", "paidOnly": true, "title": "Second Degree Follower", "titleSlug": "second-degree-follower", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54068, "totalSubmissionRaw": 139070}, "615": {"acRate": 56.17344847997329, "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": 37011, "totalSubmissionRaw": 65887}, "616": {"acRate": 49.92962606715684, "difficulty": "Medium", "likes": 1076, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "616", "paidOnly": true, "title": "Add Bold Tag in String", "titleSlug": "add-bold-tag-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91879, "totalSubmissionRaw": 184017}, "617": {"acRate": 79.04949259648717, "difficulty": "Easy", "likes": 8782, "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": 785582, "totalSubmissionRaw": 993785}, "618": {"acRate": 63.42820347714102, "difficulty": "Hard", "likes": 186, "dislikes": 170, "categoryTitle": "Database", "frontendQuestionId": "618", "paidOnly": true, "title": "Students Report By Geography", "titleSlug": "students-report-by-geography", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24626, "totalSubmissionRaw": 38825}, "619": {"acRate": 64.99074971859083, "difficulty": "Easy", "likes": 638, "dislikes": 182, "categoryTitle": "Database", "frontendQuestionId": "619", "paidOnly": false, "title": "Biggest Single Number", "titleSlug": "biggest-single-number", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233254, "totalSubmissionRaw": 358905}, "620": {"acRate": 74.00068079804967, "difficulty": "Easy", "likes": 1137, "dislikes": 543, "categoryTitle": "Database", "frontendQuestionId": "620", "paidOnly": false, "title": "Not Boring Movies", "titleSlug": "not-boring-movies", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 536950, "totalSubmissionRaw": 725605}, "621": {"acRate": 60.21184203555424, "difficulty": "Medium", "likes": 10511, "dislikes": 2079, "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": 659186, "totalSubmissionRaw": 1094778}, "622": {"acRate": 51.705495634794914, "difficulty": "Medium", "likes": 3535, "dislikes": 290, "categoryTitle": "Algorithms", "frontendQuestionId": "622", "paidOnly": false, "title": "Design Circular Queue", "titleSlug": "design-circular-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 328042, "totalSubmissionRaw": 634446}, "623": {"acRate": 64.04446285236972, "difficulty": "Medium", "likes": 3550, "dislikes": 265, "categoryTitle": "Algorithms", "frontendQuestionId": "623", "paidOnly": false, "title": "Add One Row to Tree", "titleSlug": "add-one-row-to-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 276788, "totalSubmissionRaw": 432181}, "624": {"acRate": 42.42834327981844, "difficulty": "Medium", "likes": 764, "dislikes": 73, "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": 50477, "totalSubmissionRaw": 118970}, "625": {"acRate": 33.648855862231656, "difficulty": "Medium", "likes": 128, "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": 11411, "totalSubmissionRaw": 33912}, "626": {"acRate": 70.41092664547274, "difficulty": "Medium", "likes": 1448, "dislikes": 588, "categoryTitle": "Database", "frontendQuestionId": "626", "paidOnly": false, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239199, "totalSubmissionRaw": 339719}, "627": {"acRate": 83.38299153697423, "difficulty": "Easy", "likes": 1725, "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": 420903, "totalSubmissionRaw": 504783}, "628": {"acRate": 45.17615085893943, "difficulty": "Easy", "likes": 4213, "dislikes": 676, "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": 339108, "totalSubmissionRaw": 750635}, "629": {"acRate": 49.45838496096571, "difficulty": "Hard", "likes": 2678, "dislikes": 324, "categoryTitle": "Algorithms", "frontendQuestionId": "629", "paidOnly": false, "title": "K Inverse Pairs Array", "titleSlug": "k-inverse-pairs-array", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130126, "totalSubmissionRaw": 263100}, "630": {"acRate": 40.253453041118, "difficulty": "Hard", "likes": 3791, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "630", "paidOnly": false, "title": "Course Schedule III", "titleSlug": "course-schedule-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 113747, "totalSubmissionRaw": 282577}, "631": {"acRate": 44.06450830605068, "difficulty": "Hard", "likes": 237, "dislikes": 275, "categoryTitle": "Algorithms", "frontendQuestionId": "631", "paidOnly": true, "title": "Design Excel Sum Formula", "titleSlug": "design-excel-sum-formula", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18170, "totalSubmissionRaw": 41235}, "632": {"acRate": 62.98483151786623, "difficulty": "Hard", "likes": 3463, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "632", "paidOnly": false, "title": "Smallest Range Covering Elements from K Lists", "titleSlug": "smallest-range-covering-elements-from-k-lists", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111365, "totalSubmissionRaw": 176813}, "633": {"acRate": 36.61185487400996, "difficulty": "Medium", "likes": 3201, "dislikes": 607, "categoryTitle": "Algorithms", "frontendQuestionId": "633", "paidOnly": false, "title": "Sum of Square Numbers", "titleSlug": "sum-of-square-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 354640, "totalSubmissionRaw": 968648}, "634": {"acRate": 41.890841813135985, "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": 11321, "totalSubmissionRaw": 27025}, "635": {"acRate": 60.66188485817982, "difficulty": "Medium", "likes": 472, "dislikes": 211, "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": 35267, "totalSubmissionRaw": 58137}, "636": {"acRate": 62.29625099080369, "difficulty": "Medium", "likes": 1948, "dislikes": 2797, "categoryTitle": "Algorithms", "frontendQuestionId": "636", "paidOnly": false, "title": "Exclusive Time of Functions", "titleSlug": "exclusive-time-of-functions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 227132, "totalSubmissionRaw": 364601}, "637": {"acRate": 73.04380589924683, "difficulty": "Easy", "likes": 5274, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "637", "paidOnly": false, "title": "Average of Levels in Binary Tree", "titleSlug": "average-of-levels-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 538930, "totalSubmissionRaw": 737819}, "638": {"acRate": 51.89504373177842, "difficulty": "Medium", "likes": 1505, "dislikes": 760, "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": 62300, "totalSubmissionRaw": 120050}, "639": {"acRate": 30.78170678798347, "difficulty": "Hard", "likes": 1567, "dislikes": 817, "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": 75916, "totalSubmissionRaw": 246627}, "640": {"acRate": 43.87056017252834, "difficulty": "Medium", "likes": 495, "dislikes": 834, "categoryTitle": "Algorithms", "frontendQuestionId": "640", "paidOnly": false, "title": "Solve the Equation", "titleSlug": "solve-the-equation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40278, "totalSubmissionRaw": 91811}, "641": {"acRate": 57.20774030924349, "difficulty": "Medium", "likes": 1177, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "641", "paidOnly": false, "title": "Design Circular Deque", "titleSlug": "design-circular-deque", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74441, "totalSubmissionRaw": 130124}, "642": {"acRate": 49.05001202945352, "difficulty": "Hard", "likes": 2108, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "642", "paidOnly": true, "title": "Design Search Autocomplete System", "titleSlug": "design-search-autocomplete-system", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144751, "totalSubmissionRaw": 295109}, "643": {"acRate": 43.60086731909148, "difficulty": "Easy", "likes": 3522, "dislikes": 321, "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": 525630, "totalSubmissionRaw": 1205549}, "644": {"acRate": 36.781670583208715, "difficulty": "Hard", "likes": 622, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "644", "paidOnly": true, "title": "Maximum Average Subarray II", "titleSlug": "maximum-average-subarray-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 20660, "totalSubmissionRaw": 56171}, "645": {"acRate": 44.509123207472385, "difficulty": "Easy", "likes": 4741, "dislikes": 1159, "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": 466032, "totalSubmissionRaw": 1047052}, "646": {"acRate": 60.08514408051775, "difficulty": "Medium", "likes": 4594, "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": 244167, "totalSubmissionRaw": 406369}, "647": {"acRate": 70.46786783593473, "difficulty": "Medium", "likes": 10787, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "647", "paidOnly": false, "title": "Palindromic Substrings", "titleSlug": "palindromic-substrings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 848226, "totalSubmissionRaw": 1203709}, "648": {"acRate": 68.05255426144767, "difficulty": "Medium", "likes": 2932, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "648", "paidOnly": false, "title": "Replace Words", "titleSlug": "replace-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 271463, "totalSubmissionRaw": 398902}, "649": {"acRate": 47.82603581961405, "difficulty": "Medium", "likes": 2371, "dislikes": 1821, "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": 162651, "totalSubmissionRaw": 340087}, "650": {"acRate": 54.274705982879425, "difficulty": "Medium", "likes": 3524, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "650", "paidOnly": false, "title": "2 Keys Keyboard", "titleSlug": "2-keys-keyboard", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139740, "totalSubmissionRaw": 257468}, "651": {"acRate": 55.83633060180206, "difficulty": "Medium", "likes": 709, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "651", "paidOnly": true, "title": "4 Keys Keyboard", "titleSlug": "4-keys-keyboard", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30117, "totalSubmissionRaw": 53938}, "652": {"acRate": 59.56973803491833, "difficulty": "Medium", "likes": 5835, "dislikes": 474, "categoryTitle": "Algorithms", "frontendQuestionId": "652", "paidOnly": false, "title": "Find Duplicate Subtrees", "titleSlug": "find-duplicate-subtrees", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 268759, "totalSubmissionRaw": 451167}, "653": {"acRate": 61.44975773071164, "difficulty": "Easy", "likes": 6752, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "653", "paidOnly": false, "title": "Two Sum IV - Input is a BST", "titleSlug": "two-sum-iv-input-is-a-bst", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 563846, "totalSubmissionRaw": 917571}, "654": {"acRate": 85.52942580197951, "difficulty": "Medium", "likes": 5215, "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": 301067, "totalSubmissionRaw": 352004}, "655": {"acRate": 64.40130617546772, "difficulty": "Medium", "likes": 492, "dislikes": 452, "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": 71394, "totalSubmissionRaw": 110858}, "656": {"acRate": 32.130549361443336, "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": 14265, "totalSubmissionRaw": 44397}, "657": {"acRate": 75.88634830506001, "difficulty": "Easy", "likes": 2428, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "657", "paidOnly": false, "title": "Robot Return to Origin", "titleSlug": "robot-return-to-origin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 442103, "totalSubmissionRaw": 582586}, "658": {"acRate": 47.659399177133174, "difficulty": "Medium", "likes": 8202, "dislikes": 698, "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": 571542, "totalSubmissionRaw": 1199222}, "659": {"acRate": 51.14755881530285, "difficulty": "Medium", "likes": 4431, "dislikes": 804, "categoryTitle": "Algorithms", "frontendQuestionId": "659", "paidOnly": false, "title": "Split Array into Consecutive Subsequences", "titleSlug": "split-array-into-consecutive-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131662, "totalSubmissionRaw": 257416}, "660": {"acRate": 57.42237345810294, "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": 10800, "totalSubmissionRaw": 18808}, "661": {"acRate": 67.48036060527315, "difficulty": "Easy", "likes": 1131, "dislikes": 2912, "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": 168792, "totalSubmissionRaw": 250135}, "662": {"acRate": 43.087893556855896, "difficulty": "Medium", "likes": 8783, "dislikes": 1210, "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": 400128, "totalSubmissionRaw": 928637}, "663": {"acRate": 41.54757477554056, "difficulty": "Medium", "likes": 483, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "663", "paidOnly": true, "title": "Equal Tree Partition", "titleSlug": "equal-tree-partition", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31282, "totalSubmissionRaw": 75292}, "664": {"acRate": 54.9688369463878, "difficulty": "Hard", "likes": 2205, "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": 74878, "totalSubmissionRaw": 136219}, "665": {"acRate": 24.78966429994438, "difficulty": "Medium", "likes": 5720, "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": 266535, "totalSubmissionRaw": 1075186}, "666": {"acRate": 61.41947383073497, "difficulty": "Medium", "likes": 399, "dislikes": 508, "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": 35299, "totalSubmissionRaw": 57472}, "667": {"acRate": 60.23076412988219, "difficulty": "Medium", "likes": 793, "dislikes": 1053, "categoryTitle": "Algorithms", "frontendQuestionId": "667", "paidOnly": false, "title": "Beautiful Arrangement II", "titleSlug": "beautiful-arrangement-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54498, "totalSubmissionRaw": 90482}, "668": {"acRate": 51.89576444654384, "difficulty": "Hard", "likes": 2153, "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": 65918, "totalSubmissionRaw": 127020}, "669": {"acRate": 66.28794501085487, "difficulty": "Medium", "likes": 5846, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "669", "paidOnly": false, "title": "Trim a Binary Search Tree", "titleSlug": "trim-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 299536, "totalSubmissionRaw": 451871}, "670": {"acRate": 48.92442923321058, "difficulty": "Medium", "likes": 3385, "dislikes": 206, "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": 259592, "totalSubmissionRaw": 530599}, "671": {"acRate": 44.65485216029901, "difficulty": "Easy", "likes": 1854, "dislikes": 1876, "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": 197373, "totalSubmissionRaw": 441998}, "672": {"acRate": 50.15105097438516, "difficulty": "Medium", "likes": 163, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "672", "paidOnly": false, "title": "Bulb Switcher II", "titleSlug": "bulb-switcher-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23573, "totalSubmissionRaw": 47004}, "673": {"acRate": 48.49592669868435, "difficulty": "Medium", "likes": 6796, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "673", "paidOnly": false, "title": "Number of Longest Increasing Subsequence", "titleSlug": "number-of-longest-increasing-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241033, "totalSubmissionRaw": 497017}, "674": {"acRate": 50.431201164918484, "difficulty": "Easy", "likes": 2343, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "674", "paidOnly": false, "title": "Longest Continuous Increasing Subsequence", "titleSlug": "longest-continuous-increasing-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272561, "totalSubmissionRaw": 540463}, "675": {"acRate": 34.491804892454596, "difficulty": "Hard", "likes": 1229, "dislikes": 673, "categoryTitle": "Algorithms", "frontendQuestionId": "675", "paidOnly": false, "title": "Cut Off Trees for Golf Event", "titleSlug": "cut-off-trees-for-golf-event", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70077, "totalSubmissionRaw": 203170}, "676": {"acRate": 57.59372943057104, "difficulty": "Medium", "likes": 1403, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "676", "paidOnly": false, "title": "Implement Magic Dictionary", "titleSlug": "implement-magic-dictionary", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85749, "totalSubmissionRaw": 148886}, "677": {"acRate": 56.811390067952104, "difficulty": "Medium", "likes": 1651, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "677", "paidOnly": false, "title": "Map Sum Pairs", "titleSlug": "map-sum-pairs", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119388, "totalSubmissionRaw": 210148}, "678": {"acRate": 38.135561088431935, "difficulty": "Medium", "likes": 6171, "dislikes": 189, "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": 392262, "totalSubmissionRaw": 1028599}, "679": {"acRate": 49.42884956624606, "difficulty": "Hard", "likes": 1470, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "679", "paidOnly": false, "title": "24 Game", "titleSlug": "24-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80225, "totalSubmissionRaw": 162304}, "680": {"acRate": 41.11314600574227, "difficulty": "Easy", "likes": 8249, "dislikes": 445, "categoryTitle": "Algorithms", "frontendQuestionId": "680", "paidOnly": false, "title": "Valid Palindrome II", "titleSlug": "valid-palindrome-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 778977, "totalSubmissionRaw": 1894716}, "681": {"acRate": 46.75709524719268, "difficulty": "Medium", "likes": 730, "dislikes": 1065, "categoryTitle": "Algorithms", "frontendQuestionId": "681", "paidOnly": true, "title": "Next Closest Time", "titleSlug": "next-closest-time", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110134, "totalSubmissionRaw": 235545}, "682": {"acRate": 76.96308837641422, "difficulty": "Easy", "likes": 2861, "dislikes": 1909, "categoryTitle": "Algorithms", "frontendQuestionId": "682", "paidOnly": false, "title": "Baseball Game", "titleSlug": "baseball-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 377750, "totalSubmissionRaw": 490820}, "683": {"acRate": 37.13376832288033, "difficulty": "Hard", "likes": 800, "dislikes": 693, "categoryTitle": "Algorithms", "frontendQuestionId": "683", "paidOnly": true, "title": "K Empty Slots", "titleSlug": "k-empty-slots", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61635, "totalSubmissionRaw": 165981}, "684": {"acRate": 63.25884189667941, "difficulty": "Medium", "likes": 6203, "dislikes": 403, "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": 379252, "totalSubmissionRaw": 599527}, "685": {"acRate": 34.549874865927784, "difficulty": "Hard", "likes": 2339, "dislikes": 316, "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": 72477, "totalSubmissionRaw": 209775}, "686": {"acRate": 35.37478362384767, "difficulty": "Medium", "likes": 2554, "dislikes": 983, "categoryTitle": "Algorithms", "frontendQuestionId": "686", "paidOnly": false, "title": "Repeated String Match", "titleSlug": "repeated-string-match", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 175749, "totalSubmissionRaw": 496820}, "687": {"acRate": 41.74936805753347, "difficulty": "Medium", "likes": 4246, "dislikes": 673, "categoryTitle": "Algorithms", "frontendQuestionId": "687", "paidOnly": false, "title": "Longest Univalue Path", "titleSlug": "longest-univalue-path", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187625, "totalSubmissionRaw": 449408}, "688": {"acRate": 56.259736581220785, "difficulty": "Medium", "likes": 3844, "dislikes": 475, "categoryTitle": "Algorithms", "frontendQuestionId": "688", "paidOnly": false, "title": "Knight Probability in Chessboard", "titleSlug": "knight-probability-in-chessboard", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158900, "totalSubmissionRaw": 282440}, "689": {"acRate": 50.22424117813359, "difficulty": "Hard", "likes": 1971, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "689", "paidOnly": false, "title": "Maximum Sum of 3 Non-Overlapping Subarrays", "titleSlug": "maximum-sum-of-3-non-overlapping-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78167, "totalSubmissionRaw": 155636}, "690": {"acRate": 67.28519238243295, "difficulty": "Medium", "likes": 2104, "dislikes": 1337, "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": 216406, "totalSubmissionRaw": 321625}, "691": {"acRate": 48.94906453043864, "difficulty": "Hard", "likes": 1221, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "691", "paidOnly": false, "title": "Stickers to Spell Word", "titleSlug": "stickers-to-spell-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75034, "totalSubmissionRaw": 153291}, "692": {"acRate": 58.29241584600867, "difficulty": "Medium", "likes": 7652, "dislikes": 346, "categoryTitle": "Algorithms", "frontendQuestionId": "692", "paidOnly": false, "title": "Top K Frequent Words", "titleSlug": "top-k-frequent-words", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 631346, "totalSubmissionRaw": 1083068}, "693": {"acRate": 62.74387665558774, "difficulty": "Easy", "likes": 1358, "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": 137997, "totalSubmissionRaw": 219937}, "694": {"acRate": 61.49380457171204, "difficulty": "Medium", "likes": 2230, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "694", "paidOnly": true, "title": "Number of Distinct Islands", "titleSlug": "number-of-distinct-islands", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 171069, "totalSubmissionRaw": 278189}, "695": {"acRate": 72.3654822496932, "difficulty": "Medium", "likes": 9968, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "695", "paidOnly": false, "title": "Max Area of Island", "titleSlug": "max-area-of-island", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 907525, "totalSubmissionRaw": 1254087}, "696": {"acRate": 65.62679585493508, "difficulty": "Easy", "likes": 3978, "dislikes": 867, "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": 212409, "totalSubmissionRaw": 323661}, "697": {"acRate": 56.670766241551085, "difficulty": "Easy", "likes": 3036, "dislikes": 1736, "categoryTitle": "Algorithms", "frontendQuestionId": "697", "paidOnly": false, "title": "Degree of an Array", "titleSlug": "degree-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219334, "totalSubmissionRaw": 387032}, "698": {"acRate": 38.20101951309701, "difficulty": "Medium", "likes": 7125, "dislikes": 510, "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": 274804, "totalSubmissionRaw": 719363}, "699": {"acRate": 45.345690150086114, "difficulty": "Hard", "likes": 629, "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": 27645, "totalSubmissionRaw": 60965}, "700": {"acRate": 80.34278797452055, "difficulty": "Easy", "likes": 5959, "dislikes": 194, "categoryTitle": "Algorithms", "frontendQuestionId": "700", "paidOnly": false, "title": "Search in a Binary Search Tree", "titleSlug": "search-in-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 935875, "totalSubmissionRaw": 1164854}, "701": {"acRate": 73.68832712007155, "difficulty": "Medium", "likes": 5853, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "701", "paidOnly": false, "title": "Insert into a Binary Search Tree", "titleSlug": "insert-into-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 564327, "totalSubmissionRaw": 765831}, "702": {"acRate": 72.2495381347919, "difficulty": "Medium", "likes": 910, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "702", "paidOnly": true, "title": "Search in a Sorted Array of Unknown Size", "titleSlug": "search-in-a-sorted-array-of-unknown-size", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99333, "totalSubmissionRaw": 137486}, "703": {"acRate": 57.06712400439535, "difficulty": "Easy", "likes": 5495, "dislikes": 3575, "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": 576988, "totalSubmissionRaw": 1011069}, "704": {"acRate": 58.10369266312784, "difficulty": "Easy", "likes": 11879, "dislikes": 252, "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": 2569763, "totalSubmissionRaw": 4422724}, "705": {"acRate": 67.13107397090684, "difficulty": "Easy", "likes": 3780, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "705", "paidOnly": false, "title": "Design HashSet", "titleSlug": "design-hashset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433801, "totalSubmissionRaw": 646200}, "706": {"acRate": 65.58820235944029, "difficulty": "Easy", "likes": 5108, "dislikes": 467, "categoryTitle": "Algorithms", "frontendQuestionId": "706", "paidOnly": false, "title": "Design HashMap", "titleSlug": "design-hashmap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 597439, "totalSubmissionRaw": 910894}, "707": {"acRate": 28.349295663548702, "difficulty": "Medium", "likes": 2657, "dislikes": 1621, "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": 345017, "totalSubmissionRaw": 1217025}, "708": {"acRate": 36.464682899941636, "difficulty": "Medium", "likes": 1220, "dislikes": 777, "categoryTitle": "Algorithms", "frontendQuestionId": "708", "paidOnly": true, "title": "Insert into a Sorted Circular Linked List", "titleSlug": "insert-into-a-sorted-circular-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 179943, "totalSubmissionRaw": 493472}, "709": {"acRate": 83.55342155382901, "difficulty": "Easy", "likes": 1846, "dislikes": 2773, "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": 541361, "totalSubmissionRaw": 647922}, "710": {"acRate": 33.4859692379946, "difficulty": "Hard", "likes": 865, "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": 42780, "totalSubmissionRaw": 127753}, "711": {"acRate": 53.07692307692308, "difficulty": "Hard", "likes": 262, "dislikes": 271, "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": 11380, "totalSubmissionRaw": 21444}, "712": {"acRate": 65.1964796479648, "difficulty": "Medium", "likes": 3983, "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": 148159, "totalSubmissionRaw": 227250}, "713": {"acRate": 51.64434379592669, "difficulty": "Medium", "likes": 6849, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "713", "paidOnly": false, "title": "Subarray Product Less Than K", "titleSlug": "subarray-product-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 420983, "totalSubmissionRaw": 815158}, "714": {"acRate": 69.08453881884539, "difficulty": "Medium", "likes": 7159, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "714", "paidOnly": false, "title": "Best Time to Buy and Sell Stock with Transaction Fee", "titleSlug": "best-time-to-buy-and-sell-stock-with-transaction-fee", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 390414, "totalSubmissionRaw": 565125}, "715": {"acRate": 43.91302066021727, "difficulty": "Hard", "likes": 1493, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "715", "paidOnly": false, "title": "Range Module", "titleSlug": "range-module", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75306, "totalSubmissionRaw": 171489}, "716": {"acRate": 45.06551135005277, "difficulty": "Hard", "likes": 1921, "dislikes": 510, "categoryTitle": "Algorithms", "frontendQuestionId": "716", "paidOnly": true, "title": "Max Stack", "titleSlug": "max-stack", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154572, "totalSubmissionRaw": 342994}, "717": {"acRate": 45.23252022881532, "difficulty": "Easy", "likes": 869, "dislikes": 2111, "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": 137349, "totalSubmissionRaw": 303651}, "718": {"acRate": 50.95072978787587, "difficulty": "Medium", "likes": 6799, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "718", "paidOnly": false, "title": "Maximum Length of Repeated Subarray", "titleSlug": "maximum-length-of-repeated-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 307399, "totalSubmissionRaw": 603326}, "719": {"acRate": 38.367358677387145, "difficulty": "Hard", "likes": 2985, "dislikes": 99, "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": 93385, "totalSubmissionRaw": 243397}, "720": {"acRate": 52.63987471437781, "difficulty": "Medium", "likes": 1965, "dislikes": 1493, "categoryTitle": "Algorithms", "frontendQuestionId": "720", "paidOnly": false, "title": "Longest Word in Dictionary", "titleSlug": "longest-word-in-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155963, "totalSubmissionRaw": 296283}, "721": {"acRate": 57.684930107745025, "difficulty": "Medium", "likes": 6772, "dislikes": 1164, "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": 412299, "totalSubmissionRaw": 714743}, "722": {"acRate": 38.88107170901119, "difficulty": "Medium", "likes": 719, "dislikes": 1807, "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": 73778, "totalSubmissionRaw": 189753}, "723": {"acRate": 76.90333708444201, "difficulty": "Medium", "likes": 1016, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "723", "paidOnly": true, "title": "Candy Crush", "titleSlug": "candy-crush", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73122, "totalSubmissionRaw": 95083}, "724": {"acRate": 58.29073978690915, "difficulty": "Easy", "likes": 8372, "dislikes": 852, "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": 1152076, "totalSubmissionRaw": 1976432}, "725": {"acRate": 64.25289387646903, "difficulty": "Medium", "likes": 3950, "dislikes": 316, "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": 203602, "totalSubmissionRaw": 316876}, "726": {"acRate": 65.2075578590492, "difficulty": "Hard", "likes": 1872, "dislikes": 405, "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": 147328, "totalSubmissionRaw": 225937}, "727": {"acRate": 43.52107849810127, "difficulty": "Hard", "likes": 1456, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "727", "paidOnly": true, "title": "Minimum Window Subsequence", "titleSlug": "minimum-window-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92716, "totalSubmissionRaw": 213037}, "728": {"acRate": 78.86203607244613, "difficulty": "Easy", "likes": 1783, "dislikes": 375, "categoryTitle": "Algorithms", "frontendQuestionId": "728", "paidOnly": false, "title": "Self Dividing Numbers", "titleSlug": "self-dividing-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251327, "totalSubmissionRaw": 318692}, "729": {"acRate": 56.59239781092694, "difficulty": "Medium", "likes": 4214, "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": 288821, "totalSubmissionRaw": 510353}, "730": {"acRate": 45.733850663488084, "difficulty": "Hard", "likes": 1926, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "730", "paidOnly": false, "title": "Count Different Palindromic Subsequences", "titleSlug": "count-different-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37601, "totalSubmissionRaw": 82217}, "731": {"acRate": 55.69547641338406, "difficulty": "Medium", "likes": 1752, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "731", "paidOnly": false, "title": "My Calendar II", "titleSlug": "my-calendar-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102918, "totalSubmissionRaw": 184787}, "732": {"acRate": 71.64722010188027, "difficulty": "Hard", "likes": 1961, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "732", "paidOnly": false, "title": "My Calendar III", "titleSlug": "my-calendar-iii", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91985, "totalSubmissionRaw": 128386}, "733": {"acRate": 64.53530608700471, "difficulty": "Easy", "likes": 8443, "dislikes": 875, "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": 954967, "totalSubmissionRaw": 1479758}, "734": {"acRate": 44.356929474778575, "difficulty": "Easy", "likes": 47, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "734", "paidOnly": true, "title": "Sentence Similarity", "titleSlug": "sentence-similarity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67411, "totalSubmissionRaw": 151974}, "735": {"acRate": 44.59581720584253, "difficulty": "Medium", "likes": 7996, "dislikes": 1090, "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": 559950, "totalSubmissionRaw": 1255612}, "736": {"acRate": 51.95674090367519, "difficulty": "Hard", "likes": 476, "dislikes": 362, "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": 22676, "totalSubmissionRaw": 43644}, "737": {"acRate": 50.14193548387097, "difficulty": "Medium", "likes": 840, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "737", "paidOnly": true, "title": "Sentence Similarity II", "titleSlug": "sentence-similarity-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71891, "totalSubmissionRaw": 143375}, "738": {"acRate": 48.24225761542436, "difficulty": "Medium", "likes": 1324, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "738", "paidOnly": false, "title": "Monotone Increasing Digits", "titleSlug": "monotone-increasing-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55097, "totalSubmissionRaw": 114209}, "739": {"acRate": 66.22593475112996, "difficulty": "Medium", "likes": 13215, "dislikes": 324, "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": 1040012, "totalSubmissionRaw": 1570397}, "740": {"acRate": 56.5177824821806, "difficulty": "Medium", "likes": 7533, "dislikes": 381, "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": 352137, "totalSubmissionRaw": 623056}, "741": {"acRate": 37.12838846861947, "difficulty": "Hard", "likes": 4277, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "741", "paidOnly": false, "title": "Cherry Pickup", "titleSlug": "cherry-pickup", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83289, "totalSubmissionRaw": 224327}, "742": {"acRate": 46.408872782302225, "difficulty": "Medium", "likes": 858, "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": 46614, "totalSubmissionRaw": 100442}, "743": {"acRate": 54.67156186519935, "difficulty": "Medium", "likes": 7455, "dislikes": 366, "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": 526697, "totalSubmissionRaw": 963381}, "744": {"acRate": 52.53972516058665, "difficulty": "Easy", "likes": 4446, "dislikes": 2194, "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": 504829, "totalSubmissionRaw": 960851}, "745": {"acRate": 41.145341541922136, "difficulty": "Hard", "likes": 2276, "dislikes": 484, "categoryTitle": "Algorithms", "frontendQuestionId": "745", "paidOnly": false, "title": "Prefix and Suffix Search", "titleSlug": "prefix-and-suffix-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98044, "totalSubmissionRaw": 238287}, "746": {"acRate": 66.06035117232678, "difficulty": "Easy", "likes": 11441, "dislikes": 1770, "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": 1237741, "totalSubmissionRaw": 1873654}, "747": {"acRate": 49.23631517471288, "difficulty": "Easy", "likes": 1202, "dislikes": 904, "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": 254180, "totalSubmissionRaw": 516246}, "748": {"acRate": 60.322538671728495, "difficulty": "Easy", "likes": 549, "dislikes": 1107, "categoryTitle": "Algorithms", "frontendQuestionId": "748", "paidOnly": false, "title": "Shortest Completing Word", "titleSlug": "shortest-completing-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78812, "totalSubmissionRaw": 130651}, "749": {"acRate": 51.31475667189953, "difficulty": "Hard", "likes": 395, "dislikes": 458, "categoryTitle": "Algorithms", "frontendQuestionId": "749", "paidOnly": false, "title": "Contain Virus", "titleSlug": "contain-virus", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13075, "totalSubmissionRaw": 25480}, "750": {"acRate": 67.79666958808063, "difficulty": "Medium", "likes": 620, "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": 38678, "totalSubmissionRaw": 57050}, "751": {"acRate": 55.62913907284768, "difficulty": "Medium", "likes": 88, "dislikes": 317, "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": 24864, "totalSubmissionRaw": 44696}, "752": {"acRate": 60.343682149683595, "difficulty": "Medium", "likes": 4770, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "752", "paidOnly": false, "title": "Open the Lock", "titleSlug": "open-the-lock", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 325174, "totalSubmissionRaw": 538869}, "753": {"acRate": 57.02591048413197, "difficulty": "Hard", "likes": 563, "dislikes": 102, "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": 59908, "totalSubmissionRaw": 105054}, "754": {"acRate": 43.2881517608505, "difficulty": "Medium", "likes": 1815, "dislikes": 812, "categoryTitle": "Algorithms", "frontendQuestionId": "754", "paidOnly": false, "title": "Reach a Number", "titleSlug": "reach-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56272, "totalSubmissionRaw": 129994}, "755": {"acRate": 47.0673381014937, "difficulty": "Medium", "likes": 301, "dislikes": 763, "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": 38694, "totalSubmissionRaw": 82211}, "756": {"acRate": 52.913366298265466, "difficulty": "Medium", "likes": 537, "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": 34136, "totalSubmissionRaw": 64513}, "757": {"acRate": 44.63287470119897, "difficulty": "Hard", "likes": 712, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "757", "paidOnly": false, "title": "Set Intersection Size At Least Two", "titleSlug": "set-intersection-size-at-least-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23713, "totalSubmissionRaw": 53129}, "758": {"acRate": 51.5598900802845, "difficulty": "Medium", "likes": 269, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "758", "paidOnly": true, "title": "Bold Words in String", "titleSlug": "bold-words-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19138, "totalSubmissionRaw": 37118}, "759": {"acRate": 72.24890591587761, "difficulty": "Hard", "likes": 1900, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "759", "paidOnly": true, "title": "Employee Free Time", "titleSlug": "employee-free-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 152378, "totalSubmissionRaw": 210907}, "760": {"acRate": 83.69923071908207, "difficulty": "Easy", "likes": 612, "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": 102709, "totalSubmissionRaw": 122712}, "761": {"acRate": 61.35528643352836, "difficulty": "Hard", "likes": 705, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "761", "paidOnly": false, "title": "Special Binary String", "titleSlug": "special-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18036, "totalSubmissionRaw": 29396}, "762": {"acRate": 69.79423017268121, "difficulty": "Easy", "likes": 716, "dislikes": 509, "categoryTitle": "Algorithms", "frontendQuestionId": "762", "paidOnly": false, "title": "Prime Number of Set Bits in Binary Representation", "titleSlug": "prime-number-of-set-bits-in-binary-representation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101247, "totalSubmissionRaw": 145065}, "763": {"acRate": 79.95029766306223, "difficulty": "Medium", "likes": 10292, "dislikes": 399, "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": 551422, "totalSubmissionRaw": 689706}, "764": {"acRate": 48.35310045154962, "difficulty": "Medium", "likes": 1460, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "764", "paidOnly": false, "title": "Largest Plus Sign", "titleSlug": "largest-plus-sign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59645, "totalSubmissionRaw": 123353}, "765": {"acRate": 57.52989130434783, "difficulty": "Hard", "likes": 2350, "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": 63513, "totalSubmissionRaw": 110400}, "766": {"acRate": 69.10907610660945, "difficulty": "Easy", "likes": 3538, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "766", "paidOnly": false, "title": "Toeplitz Matrix", "titleSlug": "toeplitz-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 342087, "totalSubmissionRaw": 494996}, "767": {"acRate": 54.87265669253713, "difficulty": "Medium", "likes": 8507, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "767", "paidOnly": false, "title": "Reorganize String", "titleSlug": "reorganize-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 408796, "totalSubmissionRaw": 744992}, "768": {"acRate": 53.38582677165354, "difficulty": "Hard", "likes": 1835, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "768", "paidOnly": false, "title": "Max Chunks To Make Sorted II", "titleSlug": "max-chunks-to-make-sorted-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65427, "totalSubmissionRaw": 122555}, "769": {"acRate": 58.51400835454184, "difficulty": "Medium", "likes": 2819, "dislikes": 245, "categoryTitle": "Algorithms", "frontendQuestionId": "769", "paidOnly": false, "title": "Max Chunks To Make Sorted", "titleSlug": "max-chunks-to-make-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 108980, "totalSubmissionRaw": 186246}, "770": {"acRate": 55.65117613310384, "difficulty": "Hard", "likes": 167, "dislikes": 1411, "categoryTitle": "Algorithms", "frontendQuestionId": "770", "paidOnly": false, "title": "Basic Calculator IV", "titleSlug": "basic-calculator-iv", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10670, "totalSubmissionRaw": 19173}, "771": {"acRate": 88.77085907256404, "difficulty": "Easy", "likes": 5099, "dislikes": 595, "categoryTitle": "Algorithms", "frontendQuestionId": "771", "paidOnly": false, "title": "Jewels and Stones", "titleSlug": "jewels-and-stones", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1077766, "totalSubmissionRaw": 1214099}, "772": {"acRate": 50.95005653456882, "difficulty": "Hard", "likes": 1135, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "772", "paidOnly": true, "title": "Basic Calculator III", "titleSlug": "basic-calculator-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129324, "totalSubmissionRaw": 253826}, "773": {"acRate": 64.99342615379429, "difficulty": "Hard", "likes": 2025, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "773", "paidOnly": false, "title": "Sliding Puzzle", "titleSlug": "sliding-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96395, "totalSubmissionRaw": 148315}, "774": {"acRate": 52.368840505985695, "difficulty": "Hard", "likes": 681, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "774", "paidOnly": true, "title": "Minimize Max Distance to Gas Station", "titleSlug": "minimize-max-distance-to-gas-station", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30884, "totalSubmissionRaw": 58974}, "775": {"acRate": 42.419523186268826, "difficulty": "Medium", "likes": 1830, "dislikes": 376, "categoryTitle": "Algorithms", "frontendQuestionId": "775", "paidOnly": false, "title": "Global and Local Inversions", "titleSlug": "global-and-local-inversions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76812, "totalSubmissionRaw": 181077}, "776": {"acRate": 82.62514463187381, "difficulty": "Medium", "likes": 1058, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "776", "paidOnly": true, "title": "Split BST", "titleSlug": "split-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108543, "totalSubmissionRaw": 131368}, "777": {"acRate": 36.85354152501676, "difficulty": "Medium", "likes": 1221, "dislikes": 933, "categoryTitle": "Algorithms", "frontendQuestionId": "777", "paidOnly": false, "title": "Swap Adjacent in LR String", "titleSlug": "swap-adjacent-in-lr-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77510, "totalSubmissionRaw": 210319}, "778": {"acRate": 61.299588733270205, "difficulty": "Hard", "likes": 3714, "dislikes": 248, "categoryTitle": "Algorithms", "frontendQuestionId": "778", "paidOnly": false, "title": "Swim in Rising Water", "titleSlug": "swim-in-rising-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 173494, "totalSubmissionRaw": 283023}, "779": {"acRate": 46.68932143434307, "difficulty": "Medium", "likes": 3792, "dislikes": 396, "categoryTitle": "Algorithms", "frontendQuestionId": "779", "paidOnly": false, "title": "K-th Symbol in Grammar", "titleSlug": "k-th-symbol-in-grammar", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208014, "totalSubmissionRaw": 445528}, "780": {"acRate": 33.2825371267557, "difficulty": "Hard", "likes": 1525, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "780", "paidOnly": false, "title": "Reaching Points", "titleSlug": "reaching-points", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69453, "totalSubmissionRaw": 208677}, "781": {"acRate": 53.05805296059564, "difficulty": "Medium", "likes": 1333, "dislikes": 620, "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": 60431, "totalSubmissionRaw": 113896}, "782": {"acRate": 50.91670439112721, "difficulty": "Hard", "likes": 357, "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": 17996, "totalSubmissionRaw": 35344}, "783": {"acRate": 59.70145117636735, "difficulty": "Easy", "likes": 3491, "dislikes": 419, "categoryTitle": "Algorithms", "frontendQuestionId": "783", "paidOnly": false, "title": "Minimum Distance Between BST Nodes", "titleSlug": "minimum-distance-between-bst-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 258524, "totalSubmissionRaw": 433027}, "784": {"acRate": 74.38193521624731, "difficulty": "Medium", "likes": 4656, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "784", "paidOnly": false, "title": "Letter Case Permutation", "titleSlug": "letter-case-permutation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 308418, "totalSubmissionRaw": 414641}, "785": {"acRate": 56.17650542754663, "difficulty": "Medium", "likes": 8294, "dislikes": 384, "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": 592811, "totalSubmissionRaw": 1055265}, "786": {"acRate": 68.1424152837692, "difficulty": "Medium", "likes": 2002, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "786", "paidOnly": false, "title": "K-th Smallest Prime Fraction", "titleSlug": "k-th-smallest-prime-fraction", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149591, "totalSubmissionRaw": 219527}, "787": {"acRate": 39.497903396305546, "difficulty": "Medium", "likes": 9939, "dislikes": 414, "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": 595214, "totalSubmissionRaw": 1506953}, "788": {"acRate": 56.45398747563555, "difficulty": "Medium", "likes": 747, "dislikes": 1927, "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": 108902, "totalSubmissionRaw": 192904}, "789": {"acRate": 61.98105890517206, "difficulty": "Medium", "likes": 290, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "789", "paidOnly": false, "title": "Escape The Ghosts", "titleSlug": "escape-the-ghosts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30367, "totalSubmissionRaw": 48994}, "790": {"acRate": 50.116096331639085, "difficulty": "Medium", "likes": 3452, "dislikes": 1116, "categoryTitle": "Algorithms", "frontendQuestionId": "790", "paidOnly": false, "title": "Domino and Tromino Tiling", "titleSlug": "domino-and-tromino-tiling", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141590, "totalSubmissionRaw": 282524}, "791": {"acRate": 70.91535503423825, "difficulty": "Medium", "likes": 3611, "dislikes": 414, "categoryTitle": "Algorithms", "frontendQuestionId": "791", "paidOnly": false, "title": "Custom Sort String", "titleSlug": "custom-sort-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 446454, "totalSubmissionRaw": 629559}, "792": {"acRate": 50.889589519383506, "difficulty": "Medium", "likes": 5497, "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": 232913, "totalSubmissionRaw": 457682}, "793": {"acRate": 44.79491596443037, "difficulty": "Hard", "likes": 434, "dislikes": 99, "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": 19243, "totalSubmissionRaw": 42958}, "794": {"acRate": 34.70218167533435, "difficulty": "Medium", "likes": 549, "dislikes": 1150, "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": 59187, "totalSubmissionRaw": 170557}, "795": {"acRate": 53.276901946733545, "difficulty": "Medium", "likes": 2297, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "795", "paidOnly": false, "title": "Number of Subarrays with Bounded Maximum", "titleSlug": "number-of-subarrays-with-bounded-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71374, "totalSubmissionRaw": 133968}, "796": {"acRate": 58.8409481207958, "difficulty": "Easy", "likes": 3632, "dislikes": 179, "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": 346744, "totalSubmissionRaw": 589291}, "797": {"acRate": 82.58813024420405, "difficulty": "Medium", "likes": 7241, "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": 538302, "totalSubmissionRaw": 651791}, "798": {"acRate": 51.54927530967343, "difficulty": "Hard", "likes": 540, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "798", "paidOnly": false, "title": "Smallest Rotation with Highest Score", "titleSlug": "smallest-rotation-with-highest-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14191, "totalSubmissionRaw": 27529}, "799": {"acRate": 58.19379242292857, "difficulty": "Medium", "likes": 3648, "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": 155694, "totalSubmissionRaw": 267544}, "800": {"acRate": 67.48459123153854, "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": 17409, "totalSubmissionRaw": 25797}, "801": {"acRate": 40.173787762820226, "difficulty": "Hard", "likes": 2811, "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": 80307, "totalSubmissionRaw": 199899}, "802": {"acRate": 63.67955029239491, "difficulty": "Medium", "likes": 5768, "dislikes": 458, "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": 269836, "totalSubmissionRaw": 423740}, "803": {"acRate": 34.88598316894399, "difficulty": "Hard", "likes": 1113, "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": 30842, "totalSubmissionRaw": 88408}, "804": {"acRate": 82.93014569236772, "difficulty": "Easy", "likes": 2517, "dislikes": 1536, "categoryTitle": "Algorithms", "frontendQuestionId": "804", "paidOnly": false, "title": "Unique Morse Code Words", "titleSlug": "unique-morse-code-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 359231, "totalSubmissionRaw": 433172}, "805": {"acRate": 25.53092360541285, "difficulty": "Hard", "likes": 1270, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "805", "paidOnly": false, "title": "Split Array With Same Average", "titleSlug": "split-array-with-same-average", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36715, "totalSubmissionRaw": 143806}, "806": {"acRate": 68.8416428364209, "difficulty": "Easy", "likes": 601, "dislikes": 1332, "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": 83054, "totalSubmissionRaw": 120645}, "807": {"acRate": 86.20070116191074, "difficulty": "Medium", "likes": 2568, "dislikes": 527, "categoryTitle": "Algorithms", "frontendQuestionId": "807", "paidOnly": false, "title": "Max Increase to Keep City Skyline", "titleSlug": "max-increase-to-keep-city-skyline", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167444, "totalSubmissionRaw": 194249}, "808": {"acRate": 53.822603149292405, "difficulty": "Medium", "likes": 983, "dislikes": 2670, "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": 67507, "totalSubmissionRaw": 125425}, "809": {"acRate": 46.206539146427474, "difficulty": "Medium", "likes": 865, "dislikes": 1905, "categoryTitle": "Algorithms", "frontendQuestionId": "809", "paidOnly": false, "title": "Expressive Words", "titleSlug": "expressive-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 118584, "totalSubmissionRaw": 256639}, "810": {"acRate": 60.42138530418752, "difficulty": "Hard", "likes": 222, "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": 11471, "totalSubmissionRaw": 18985}, "811": {"acRate": 76.33667008223641, "difficulty": "Medium", "likes": 1556, "dislikes": 1299, "categoryTitle": "Algorithms", "frontendQuestionId": "811", "paidOnly": false, "title": "Subdomain Visit Count", "titleSlug": "subdomain-visit-count", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232436, "totalSubmissionRaw": 304488}, "812": {"acRate": 60.91246215085224, "difficulty": "Easy", "likes": 529, "dislikes": 1590, "categoryTitle": "Algorithms", "frontendQuestionId": "812", "paidOnly": false, "title": "Largest Triangle Area", "titleSlug": "largest-triangle-area", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53712, "totalSubmissionRaw": 88179}, "813": {"acRate": 53.58141177162922, "difficulty": "Medium", "likes": 2101, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "813", "paidOnly": false, "title": "Largest Sum of Averages", "titleSlug": "largest-sum-of-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54630, "totalSubmissionRaw": 101957}, "814": {"acRate": 72.25830881710408, "difficulty": "Medium", "likes": 4524, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "814", "paidOnly": false, "title": "Binary Tree Pruning", "titleSlug": "binary-tree-pruning", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 248070, "totalSubmissionRaw": 343310}, "815": {"acRate": 47.61789396456953, "difficulty": "Hard", "likes": 4258, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "815", "paidOnly": false, "title": "Bus Routes", "titleSlug": "bus-routes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208343, "totalSubmissionRaw": 437524}, "816": {"acRate": 56.83871812620433, "difficulty": "Medium", "likes": 322, "dislikes": 661, "categoryTitle": "Algorithms", "frontendQuestionId": "816", "paidOnly": false, "title": "Ambiguous Coordinates", "titleSlug": "ambiguous-coordinates", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30382, "totalSubmissionRaw": 53453}, "817": {"acRate": 56.89868743203085, "difficulty": "Medium", "likes": 1100, "dislikes": 2229, "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": 97839, "totalSubmissionRaw": 171953}, "818": {"acRate": 43.78045803017726, "difficulty": "Hard", "likes": 1905, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "818", "paidOnly": false, "title": "Race Car", "titleSlug": "race-car", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 89658, "totalSubmissionRaw": 204790}, "819": {"acRate": 44.31817078852351, "difficulty": "Easy", "likes": 1707, "dislikes": 3057, "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": 365281, "totalSubmissionRaw": 824224}, "820": {"acRate": 60.463076980484345, "difficulty": "Medium", "likes": 1752, "dislikes": 653, "categoryTitle": "Algorithms", "frontendQuestionId": "820", "paidOnly": false, "title": "Short Encoding of Words", "titleSlug": "short-encoding-of-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97218, "totalSubmissionRaw": 160789}, "821": {"acRate": 71.70083948870585, "difficulty": "Easy", "likes": 3140, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "821", "paidOnly": false, "title": "Shortest Distance to a Character", "titleSlug": "shortest-distance-to-a-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190550, "totalSubmissionRaw": 265757}, "822": {"acRate": 47.86248276195776, "difficulty": "Medium", "likes": 174, "dislikes": 756, "categoryTitle": "Algorithms", "frontendQuestionId": "822", "paidOnly": false, "title": "Card Flipping Game", "titleSlug": "card-flipping-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19783, "totalSubmissionRaw": 41333}, "823": {"acRate": 52.89012055650119, "difficulty": "Medium", "likes": 3300, "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": 150392, "totalSubmissionRaw": 284348}, "824": {"acRate": 68.41795388151998, "difficulty": "Easy", "likes": 909, "dislikes": 1242, "categoryTitle": "Algorithms", "frontendQuestionId": "824", "paidOnly": false, "title": "Goat Latin", "titleSlug": "goat-latin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 182444, "totalSubmissionRaw": 266661}, "825": {"acRate": 47.837454440026505, "difficulty": "Medium", "likes": 763, "dislikes": 1215, "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": 92399, "totalSubmissionRaw": 193152}, "826": {"acRate": 55.90026702664619, "difficulty": "Medium", "likes": 2363, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "826", "paidOnly": false, "title": "Most Profit Assigning Work", "titleSlug": "most-profit-assigning-work", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 207878, "totalSubmissionRaw": 371873}, "827": {"acRate": 48.1128456565092, "difficulty": "Hard", "likes": 3916, "dislikes": 76, "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": 189389, "totalSubmissionRaw": 393635}, "828": {"acRate": 52.52439024390244, "difficulty": "Hard", "likes": 2154, "dislikes": 250, "categoryTitle": "Algorithms", "frontendQuestionId": "828", "paidOnly": false, "title": "Count Unique Characters of All Substrings of a Given String", "titleSlug": "count-unique-characters-of-all-substrings-of-a-given-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73219, "totalSubmissionRaw": 139399}, "829": {"acRate": 41.86935487714783, "difficulty": "Hard", "likes": 1373, "dislikes": 1380, "categoryTitle": "Algorithms", "frontendQuestionId": "829", "paidOnly": false, "title": "Consecutive Numbers Sum", "titleSlug": "consecutive-numbers-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87844, "totalSubmissionRaw": 209805}, "830": {"acRate": 52.38064623280883, "difficulty": "Easy", "likes": 877, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "830", "paidOnly": false, "title": "Positions of Large Groups", "titleSlug": "positions-of-large-groups", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97769, "totalSubmissionRaw": 186651}, "831": {"acRate": 49.11116028619901, "difficulty": "Medium", "likes": 168, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "831", "paidOnly": false, "title": "Masking Personal Information", "titleSlug": "masking-personal-information", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19974, "totalSubmissionRaw": 40671}, "832": {"acRate": 82.23712135472607, "difficulty": "Easy", "likes": 3453, "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": 445615, "totalSubmissionRaw": 541866}, "833": {"acRate": 52.30715187518042, "difficulty": "Medium", "likes": 1190, "dislikes": 1016, "categoryTitle": "Algorithms", "frontendQuestionId": "833", "paidOnly": false, "title": "Find And Replace in String", "titleSlug": "find-and-replace-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 150392, "totalSubmissionRaw": 287516}, "834": {"acRate": 65.2527573907958, "difficulty": "Hard", "likes": 5578, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "834", "paidOnly": false, "title": "Sum of Distances in Tree", "titleSlug": "sum-of-distances-in-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158435, "totalSubmissionRaw": 242802}, "835": {"acRate": 63.70171073304608, "difficulty": "Medium", "likes": 1329, "dislikes": 481, "categoryTitle": "Algorithms", "frontendQuestionId": "835", "paidOnly": false, "title": "Image Overlap", "titleSlug": "image-overlap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94469, "totalSubmissionRaw": 148299}, "836": {"acRate": 44.98413053128746, "difficulty": "Easy", "likes": 1993, "dislikes": 470, "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": 148960, "totalSubmissionRaw": 331138}, "837": {"acRate": 44.947792197168454, "difficulty": "Medium", "likes": 1983, "dislikes": 1832, "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": 76925, "totalSubmissionRaw": 171143}, "838": {"acRate": 57.20512097251162, "difficulty": "Medium", "likes": 3384, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "838", "paidOnly": false, "title": "Push Dominoes", "titleSlug": "push-dominoes", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125738, "totalSubmissionRaw": 219802}, "839": {"acRate": 55.02204713025878, "difficulty": "Hard", "likes": 2337, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "839", "paidOnly": false, "title": "Similar String Groups", "titleSlug": "similar-string-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 121788, "totalSubmissionRaw": 221344}, "840": {"acRate": 39.19929738691087, "difficulty": "Medium", "likes": 334, "dislikes": 1596, "categoryTitle": "Algorithms", "frontendQuestionId": "840", "paidOnly": false, "title": "Magic Squares In Grid", "titleSlug": "magic-squares-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39723, "totalSubmissionRaw": 101336}, "841": {"acRate": 73.42283438485558, "difficulty": "Medium", "likes": 6136, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "841", "paidOnly": false, "title": "Keys and Rooms", "titleSlug": "keys-and-rooms", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 467702, "totalSubmissionRaw": 637002}, "842": {"acRate": 39.0976273823415, "difficulty": "Medium", "likes": 1133, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "842", "paidOnly": false, "title": "Split Array into Fibonacci Sequence", "titleSlug": "split-array-into-fibonacci-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40208, "totalSubmissionRaw": 102840}, "843": {"acRate": 38.868593231568276, "difficulty": "Hard", "likes": 1542, "dislikes": 1785, "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": 146079, "totalSubmissionRaw": 375831}, "844": {"acRate": 49.22876288839855, "difficulty": "Easy", "likes": 7529, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "844", "paidOnly": false, "title": "Backspace String Compare", "titleSlug": "backspace-string-compare", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 845566, "totalSubmissionRaw": 1717628}, "845": {"acRate": 40.54763105994588, "difficulty": "Medium", "likes": 2779, "dislikes": 79, "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": 132609, "totalSubmissionRaw": 327045}, "846": {"acRate": 56.73216342816857, "difficulty": "Medium", "likes": 3267, "dislikes": 257, "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": 312230, "totalSubmissionRaw": 550358}, "847": {"acRate": 65.39398396628434, "difficulty": "Hard", "likes": 4313, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "847", "paidOnly": false, "title": "Shortest Path Visiting All Nodes", "titleSlug": "shortest-path-visiting-all-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125374, "totalSubmissionRaw": 191721}, "848": {"acRate": 44.79845555003113, "difficulty": "Medium", "likes": 1372, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "848", "paidOnly": false, "title": "Shifting Letters", "titleSlug": "shifting-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100013, "totalSubmissionRaw": 223251}, "849": {"acRate": 48.24103928627328, "difficulty": "Medium", "likes": 3221, "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": 231159, "totalSubmissionRaw": 479175}, "850": {"acRate": 54.24346923828125, "difficulty": "Hard", "likes": 968, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "850", "paidOnly": false, "title": "Rectangle Area II", "titleSlug": "rectangle-area-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35549, "totalSubmissionRaw": 65536}, "851": {"acRate": 59.95629476751244, "difficulty": "Medium", "likes": 1304, "dislikes": 814, "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": 49386, "totalSubmissionRaw": 82370}, "852": {"acRate": 68.26164710566154, "difficulty": "Medium", "likes": 7545, "dislikes": 1920, "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": 850435, "totalSubmissionRaw": 1245846}, "853": {"acRate": 51.60575492586212, "difficulty": "Medium", "likes": 3571, "dislikes": 985, "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": 281319, "totalSubmissionRaw": 545131}, "854": {"acRate": 39.97347119243589, "difficulty": "Hard", "likes": 1133, "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": 47012, "totalSubmissionRaw": 117608}, "855": {"acRate": 43.54979736856714, "difficulty": "Medium", "likes": 1333, "dislikes": 486, "categoryTitle": "Algorithms", "frontendQuestionId": "855", "paidOnly": false, "title": "Exam Room", "titleSlug": "exam-room", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62757, "totalSubmissionRaw": 144104}, "856": {"acRate": 64.05291062321896, "difficulty": "Medium", "likes": 5423, "dislikes": 209, "categoryTitle": "Algorithms", "frontendQuestionId": "856", "paidOnly": false, "title": "Score of Parentheses", "titleSlug": "score-of-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190159, "totalSubmissionRaw": 296878}, "857": {"acRate": 63.42225795669103, "difficulty": "Hard", "likes": 2903, "dislikes": 393, "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": 140406, "totalSubmissionRaw": 221384}, "858": {"acRate": 62.50775001550003, "difficulty": "Medium", "likes": 1107, "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": 80655, "totalSubmissionRaw": 129032}, "859": {"acRate": 33.14940321875472, "difficulty": "Easy", "likes": 3181, "dislikes": 1797, "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": 247934, "totalSubmissionRaw": 747929}, "860": {"acRate": 53.89809824061833, "difficulty": "Easy", "likes": 2405, "dislikes": 166, "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": 211992, "totalSubmissionRaw": 393320}, "861": {"acRate": 80.38654651494222, "difficulty": "Medium", "likes": 2288, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "861", "paidOnly": false, "title": "Score After Flipping Matrix", "titleSlug": "score-after-flipping-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146654, "totalSubmissionRaw": 182436}, "862": {"acRate": 26.07054183568166, "difficulty": "Hard", "likes": 4276, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "862", "paidOnly": false, "title": "Shortest Subarray with Sum at Least K", "titleSlug": "shortest-subarray-with-sum-at-least-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102062, "totalSubmissionRaw": 391484}, "863": {"acRate": 64.8240684512498, "difficulty": "Medium", "likes": 10996, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "863", "paidOnly": false, "title": "All Nodes Distance K in Binary Tree", "titleSlug": "all-nodes-distance-k-in-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 462216, "totalSubmissionRaw": 713029}, "864": {"acRate": 53.51708732910947, "difficulty": "Hard", "likes": 2331, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "864", "paidOnly": false, "title": "Shortest Path to Get All Keys", "titleSlug": "shortest-path-to-get-all-keys", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77626, "totalSubmissionRaw": 145049}, "865": {"acRate": 70.91644029555812, "difficulty": "Medium", "likes": 2644, "dislikes": 374, "categoryTitle": "Algorithms", "frontendQuestionId": "865", "paidOnly": false, "title": "Smallest Subtree with all the Deepest Nodes", "titleSlug": "smallest-subtree-with-all-the-deepest-nodes", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141756, "totalSubmissionRaw": 199892}, "866": {"acRate": 26.07446598850871, "difficulty": "Medium", "likes": 437, "dislikes": 829, "categoryTitle": "Algorithms", "frontendQuestionId": "866", "paidOnly": false, "title": "Prime Palindrome", "titleSlug": "prime-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34399, "totalSubmissionRaw": 131926}, "867": {"acRate": 72.17694368112805, "difficulty": "Easy", "likes": 3758, "dislikes": 443, "categoryTitle": "Algorithms", "frontendQuestionId": "867", "paidOnly": false, "title": "Transpose Matrix", "titleSlug": "transpose-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 416050, "totalSubmissionRaw": 576431}, "868": {"acRate": 63.698624965076675, "difficulty": "Easy", "likes": 638, "dislikes": 662, "categoryTitle": "Algorithms", "frontendQuestionId": "868", "paidOnly": false, "title": "Binary Gap", "titleSlug": "binary-gap", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84358, "totalSubmissionRaw": 132433}, "869": {"acRate": 62.597965923467456, "difficulty": "Medium", "likes": 2117, "dislikes": 436, "categoryTitle": "Algorithms", "frontendQuestionId": "869", "paidOnly": false, "title": "Reordered Power of 2", "titleSlug": "reordered-power-of-2", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114297, "totalSubmissionRaw": 182589}, "870": {"acRate": 52.66517788387495, "difficulty": "Medium", "likes": 1615, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "870", "paidOnly": false, "title": "Advantage Shuffle", "titleSlug": "advantage-shuffle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68391, "totalSubmissionRaw": 129860}, "871": {"acRate": 40.07809532579045, "difficulty": "Hard", "likes": 4664, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "871", "paidOnly": false, "title": "Minimum Number of Refueling Stops", "titleSlug": "minimum-number-of-refueling-stops", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139280, "totalSubmissionRaw": 347523}, "872": {"acRate": 70.0470748921288, "difficulty": "Easy", "likes": 4121, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "872", "paidOnly": false, "title": "Leaf-Similar Trees", "titleSlug": "leaf-similar-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 499519, "totalSubmissionRaw": 713119}, "873": {"acRate": 48.409928037293135, "difficulty": "Medium", "likes": 2022, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "873", "paidOnly": false, "title": "Length of Longest Fibonacci Subsequence", "titleSlug": "length-of-longest-fibonacci-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65320, "totalSubmissionRaw": 134931}, "874": {"acRate": 40.4640579737856, "difficulty": "Medium", "likes": 205, "dislikes": 49, "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": 42325, "totalSubmissionRaw": 104599}, "875": {"acRate": 48.42365928363897, "difficulty": "Medium", "likes": 10731, "dislikes": 675, "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": 737993, "totalSubmissionRaw": 1524034}, "876": {"acRate": 79.05156076263027, "difficulty": "Easy", "likes": 11693, "dislikes": 376, "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": 2034716, "totalSubmissionRaw": 2573913}, "877": {"acRate": 70.76675179021214, "difficulty": "Medium", "likes": 3243, "dislikes": 2884, "categoryTitle": "Algorithms", "frontendQuestionId": "877", "paidOnly": false, "title": "Stone Game", "titleSlug": "stone-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 243306, "totalSubmissionRaw": 343814}, "878": {"acRate": 35.4991579173684, "difficulty": "Hard", "likes": 1276, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "878", "paidOnly": false, "title": "Nth Magical Number", "titleSlug": "nth-magical-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39627, "totalSubmissionRaw": 111628}, "879": {"acRate": 48.22421236130751, "difficulty": "Hard", "likes": 1836, "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": 64456, "totalSubmissionRaw": 133659}, "880": {"acRate": 36.463595508123966, "difficulty": "Medium", "likes": 2515, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "880", "paidOnly": false, "title": "Decoded String at Index", "titleSlug": "decoded-string-at-index", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98094, "totalSubmissionRaw": 269019}, "881": {"acRate": 59.49782026425794, "difficulty": "Medium", "likes": 6427, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "881", "paidOnly": false, "title": "Boats to Save People", "titleSlug": "boats-to-save-people", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 424723, "totalSubmissionRaw": 713845}, "882": {"acRate": 50.528604766282434, "difficulty": "Hard", "likes": 812, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "882", "paidOnly": false, "title": "Reachable Nodes In Subdivided Graph", "titleSlug": "reachable-nodes-in-subdivided-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28581, "totalSubmissionRaw": 56564}, "883": {"acRate": 72.98763179237632, "difficulty": "Easy", "likes": 587, "dislikes": 1411, "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": 57596, "totalSubmissionRaw": 78912}, "884": {"acRate": 67.63207595802812, "difficulty": "Easy", "likes": 1338, "dislikes": 168, "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": 144314, "totalSubmissionRaw": 213381}, "885": {"acRate": 74.81405862622138, "difficulty": "Medium", "likes": 942, "dislikes": 870, "categoryTitle": "Algorithms", "frontendQuestionId": "885", "paidOnly": false, "title": "Spiral Matrix III", "titleSlug": "spiral-matrix-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51118, "totalSubmissionRaw": 68372}, "886": {"acRate": 50.71040222506473, "difficulty": "Medium", "likes": 4670, "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": 213684, "totalSubmissionRaw": 421381}, "887": {"acRate": 27.890661713697497, "difficulty": "Hard", "likes": 3621, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "887", "paidOnly": false, "title": "Super Egg Drop", "titleSlug": "super-egg-drop", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74781, "totalSubmissionRaw": 268121}, "888": {"acRate": 61.99664306371817, "difficulty": "Easy", "likes": 2106, "dislikes": 381, "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": 126692, "totalSubmissionRaw": 204353}, "889": {"acRate": 71.57819648405616, "difficulty": "Medium", "likes": 2740, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "889", "paidOnly": false, "title": "Construct Binary Tree from Preorder and Postorder Traversal", "titleSlug": "construct-binary-tree-from-preorder-and-postorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104356, "totalSubmissionRaw": 145793}, "890": {"acRate": 76.80066458645702, "difficulty": "Medium", "likes": 3917, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "890", "paidOnly": false, "title": "Find and Replace Pattern", "titleSlug": "find-and-replace-pattern", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 189521, "totalSubmissionRaw": 246770}, "891": {"acRate": 37.9750400450617, "difficulty": "Hard", "likes": 713, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "891", "paidOnly": false, "title": "Sum of Subsequence Widths", "titleSlug": "sum-of-subsequence-widths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21574, "totalSubmissionRaw": 56811}, "892": {"acRate": 66.3933637122136, "difficulty": "Easy", "likes": 570, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "892", "paidOnly": false, "title": "Surface Area of 3D Shapes", "titleSlug": "surface-area-of-3d-shapes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41379, "totalSubmissionRaw": 62324}, "893": {"acRate": 71.95207289033603, "difficulty": "Medium", "likes": 533, "dislikes": 1481, "categoryTitle": "Algorithms", "frontendQuestionId": "893", "paidOnly": false, "title": "Groups of Special-Equivalent Strings", "titleSlug": "groups-of-special-equivalent-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50383, "totalSubmissionRaw": 70023}, "894": {"acRate": 82.76104240282686, "difficulty": "Medium", "likes": 5068, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "894", "paidOnly": false, "title": "All Possible Full Binary Trees", "titleSlug": "all-possible-full-binary-trees", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187370, "totalSubmissionRaw": 226399}, "895": {"acRate": 66.44237443740344, "difficulty": "Hard", "likes": 4695, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "895", "paidOnly": false, "title": "Maximum Frequency Stack", "titleSlug": "maximum-frequency-stack", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178035, "totalSubmissionRaw": 267954}, "896": {"acRate": 61.26973735784495, "difficulty": "Easy", "likes": 3048, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "896", "paidOnly": false, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 445499, "totalSubmissionRaw": 727109}, "897": {"acRate": 78.36101996079563, "difficulty": "Easy", "likes": 4328, "dislikes": 672, "categoryTitle": "Algorithms", "frontendQuestionId": "897", "paidOnly": false, "title": "Increasing Order Search Tree", "titleSlug": "increasing-order-search-tree", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290623, "totalSubmissionRaw": 370877}, "898": {"acRate": 39.25851219179089, "difficulty": "Medium", "likes": 1469, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "898", "paidOnly": false, "title": "Bitwise ORs of Subarrays", "titleSlug": "bitwise-ors-of-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37369, "totalSubmissionRaw": 95187}, "899": {"acRate": 65.97918076398996, "difficulty": "Hard", "likes": 1753, "dislikes": 613, "categoryTitle": "Algorithms", "frontendQuestionId": "899", "paidOnly": false, "title": "Orderly Queue", "titleSlug": "orderly-queue", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71179, "totalSubmissionRaw": 107881}, "900": {"acRate": 59.605101108418424, "difficulty": "Medium", "likes": 746, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "900", "paidOnly": false, "title": "RLE Iterator", "titleSlug": "rle-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75016, "totalSubmissionRaw": 125855}, "901": {"acRate": 66.29587954358861, "difficulty": "Medium", "likes": 6362, "dislikes": 412, "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": 339952, "totalSubmissionRaw": 512781}, "902": {"acRate": 42.57674602502189, "difficulty": "Hard", "likes": 1394, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "902", "paidOnly": false, "title": "Numbers At Most N Given Digit Set", "titleSlug": "numbers-at-most-n-given-digit-set", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45228, "totalSubmissionRaw": 106227}, "903": {"acRate": 57.43264438325607, "difficulty": "Hard", "likes": 723, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "903", "paidOnly": false, "title": "Valid Permutations for DI Sequence", "titleSlug": "valid-permutations-for-di-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16478, "totalSubmissionRaw": 28691}, "904": {"acRate": 44.70109350161376, "difficulty": "Medium", "likes": 4678, "dislikes": 348, "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": 426857, "totalSubmissionRaw": 954914}, "905": {"acRate": 76.24437585988919, "difficulty": "Easy", "likes": 5373, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "905", "paidOnly": false, "title": "Sort Array By Parity", "titleSlug": "sort-array-by-parity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 820169, "totalSubmissionRaw": 1075713}, "906": {"acRate": 38.957569242443405, "difficulty": "Hard", "likes": 362, "dislikes": 420, "categoryTitle": "Algorithms", "frontendQuestionId": "906", "paidOnly": false, "title": "Super Palindromes", "titleSlug": "super-palindromes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24643, "totalSubmissionRaw": 63256}, "907": {"acRate": 37.26484846323309, "difficulty": "Medium", "likes": 8098, "dislikes": 627, "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": 271659, "totalSubmissionRaw": 728997}, "908": {"acRate": 70.3950654658291, "difficulty": "Easy", "likes": 713, "dislikes": 2039, "categoryTitle": "Algorithms", "frontendQuestionId": "908", "paidOnly": false, "title": "Smallest Range I", "titleSlug": "smallest-range-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93013, "totalSubmissionRaw": 132130}, "909": {"acRate": 43.83830272431027, "difficulty": "Medium", "likes": 2906, "dislikes": 1032, "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": 197620, "totalSubmissionRaw": 450793}, "910": {"acRate": 36.40480422395316, "difficulty": "Medium", "likes": 1652, "dislikes": 460, "categoryTitle": "Algorithms", "frontendQuestionId": "910", "paidOnly": false, "title": "Smallest Range II", "titleSlug": "smallest-range-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55711, "totalSubmissionRaw": 153032}, "911": {"acRate": 52.073453134746686, "difficulty": "Medium", "likes": 1013, "dislikes": 660, "categoryTitle": "Algorithms", "frontendQuestionId": "911", "paidOnly": false, "title": "Online Election", "titleSlug": "online-election", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60940, "totalSubmissionRaw": 117027}, "912": {"acRate": 58.0511320859625, "difficulty": "Medium", "likes": 6464, "dislikes": 796, "categoryTitle": "Algorithms", "frontendQuestionId": "912", "paidOnly": false, "title": "Sort an Array", "titleSlug": "sort-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Radix Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYx", "slug": "radix-sort"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 772598, "totalSubmissionRaw": 1330893}, "913": {"acRate": 33.82414526693134, "difficulty": "Hard", "likes": 914, "dislikes": 161, "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": 20192, "totalSubmissionRaw": 59697}, "914": {"acRate": 29.912025556182865, "difficulty": "Easy", "likes": 1818, "dislikes": 515, "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": 125561, "totalSubmissionRaw": 419777}, "915": {"acRate": 48.79301429791486, "difficulty": "Medium", "likes": 1660, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "915", "paidOnly": false, "title": "Partition Array into Disjoint Intervals", "titleSlug": "partition-array-into-disjoint-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83984, "totalSubmissionRaw": 172123}, "916": {"acRate": 51.928360410268404, "difficulty": "Medium", "likes": 2710, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "916", "paidOnly": false, "title": "Word Subsets", "titleSlug": "word-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115484, "totalSubmissionRaw": 222391}, "917": {"acRate": 65.17733051938023, "difficulty": "Easy", "likes": 2256, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "917", "paidOnly": false, "title": "Reverse Only Letters", "titleSlug": "reverse-only-letters", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227916, "totalSubmissionRaw": 349686}, "918": {"acRate": 45.41134364953689, "difficulty": "Medium", "likes": 6636, "dislikes": 303, "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": 275590, "totalSubmissionRaw": 606876}, "919": {"acRate": 65.8495705007333, "difficulty": "Medium", "likes": 1109, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "919", "paidOnly": false, "title": "Complete Binary Tree Inserter", "titleSlug": "complete-binary-tree-inserter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56574, "totalSubmissionRaw": 85914}, "920": {"acRate": 60.39025059369186, "difficulty": "Hard", "likes": 2355, "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": 70441, "totalSubmissionRaw": 116643}, "921": {"acRate": 74.93633702379384, "difficulty": "Medium", "likes": 4094, "dislikes": 205, "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": 369895, "totalSubmissionRaw": 493612}, "922": {"acRate": 70.81634969888962, "difficulty": "Easy", "likes": 2610, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "922", "paidOnly": false, "title": "Sort Array By Parity II", "titleSlug": "sort-array-by-parity-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 261995, "totalSubmissionRaw": 369964}, "923": {"acRate": 45.478499845385294, "difficulty": "Medium", "likes": 2615, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "923", "paidOnly": false, "title": "3Sum With Multiplicity", "titleSlug": "3sum-with-multiplicity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104420, "totalSubmissionRaw": 229603}, "924": {"acRate": 42.050655131339724, "difficulty": "Hard", "likes": 993, "dislikes": 594, "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": 53660, "totalSubmissionRaw": 127608}, "925": {"acRate": 32.293547640308226, "difficulty": "Easy", "likes": 2428, "dislikes": 378, "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": 146469, "totalSubmissionRaw": 453555}, "926": {"acRate": 61.49168618899735, "difficulty": "Medium", "likes": 4425, "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": 193451, "totalSubmissionRaw": 314597}, "927": {"acRate": 39.96472384562734, "difficulty": "Hard", "likes": 831, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "927", "paidOnly": false, "title": "Three Equal Parts", "titleSlug": "three-equal-parts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30362, "totalSubmissionRaw": 75972}, "928": {"acRate": 44.049311583358275, "difficulty": "Hard", "likes": 671, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "928", "paidOnly": false, "title": "Minimize Malware Spread II", "titleSlug": "minimize-malware-spread-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23547, "totalSubmissionRaw": 53456}, "929": {"acRate": 67.24970374132386, "difficulty": "Easy", "likes": 2690, "dislikes": 340, "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": 496555, "totalSubmissionRaw": 738375}, "930": {"acRate": 63.42506673599026, "difficulty": "Medium", "likes": 3926, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "930", "paidOnly": false, "title": "Binary Subarrays With Sum", "titleSlug": "binary-subarrays-with-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 263493, "totalSubmissionRaw": 415441}, "931": {"acRate": 63.18053601454995, "difficulty": "Medium", "likes": 6348, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "931", "paidOnly": false, "title": "Minimum Falling Path Sum", "titleSlug": "minimum-falling-path-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 460286, "totalSubmissionRaw": 728525}, "932": {"acRate": 65.93518829245517, "difficulty": "Medium", "likes": 1068, "dislikes": 1518, "categoryTitle": "Algorithms", "frontendQuestionId": "932", "paidOnly": false, "title": "Beautiful Array", "titleSlug": "beautiful-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45190, "totalSubmissionRaw": 68537}, "933": {"acRate": 75.88624657708549, "difficulty": "Easy", "likes": 554, "dislikes": 858, "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": 286270, "totalSubmissionRaw": 377236}, "934": {"acRate": 57.84121266367034, "difficulty": "Medium", "likes": 5382, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "934", "paidOnly": false, "title": "Shortest Bridge", "titleSlug": "shortest-bridge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210671, "totalSubmissionRaw": 364223}, "935": {"acRate": 60.3984066450914, "difficulty": "Medium", "likes": 3034, "dislikes": 444, "categoryTitle": "Algorithms", "frontendQuestionId": "935", "paidOnly": false, "title": "Knight Dialer", "titleSlug": "knight-dialer", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 177857, "totalSubmissionRaw": 294473}, "936": {"acRate": 62.52705053676751, "difficulty": "Hard", "likes": 1545, "dislikes": 219, "categoryTitle": "Algorithms", "frontendQuestionId": "936", "paidOnly": false, "title": "Stamping The Sequence", "titleSlug": "stamping-the-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58943, "totalSubmissionRaw": 94268}, "937": {"acRate": 56.478989952115064, "difficulty": "Medium", "likes": 2099, "dislikes": 4385, "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": 369411, "totalSubmissionRaw": 654068}, "938": {"acRate": 86.97096244416468, "difficulty": "Easy", "likes": 6951, "dislikes": 377, "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": 1088782, "totalSubmissionRaw": 1251892}, "939": {"acRate": 54.093114407557195, "difficulty": "Medium", "likes": 1974, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "939", "paidOnly": false, "title": "Minimum Area Rectangle", "titleSlug": "minimum-area-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 147394, "totalSubmissionRaw": 272482}, "940": {"acRate": 43.159802446107214, "difficulty": "Hard", "likes": 1718, "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": 40723, "totalSubmissionRaw": 94354}, "941": {"acRate": 33.52499615443778, "difficulty": "Easy", "likes": 2936, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "941", "paidOnly": false, "title": "Valid Mountain Array", "titleSlug": "valid-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 435892, "totalSubmissionRaw": 1300200}, "942": {"acRate": 79.02636400152835, "difficulty": "Easy", "likes": 2464, "dislikes": 1020, "categoryTitle": "Algorithms", "frontendQuestionId": "942", "paidOnly": false, "title": "DI String Match", "titleSlug": "di-string-match", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161326, "totalSubmissionRaw": 204142}, "943": {"acRate": 44.10112359550562, "difficulty": "Hard", "likes": 1445, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "943", "paidOnly": false, "title": "Find the Shortest Superstring", "titleSlug": "find-the-shortest-superstring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29673, "totalSubmissionRaw": 67284}, "944": {"acRate": 74.60950662086219, "difficulty": "Easy", "likes": 1707, "dislikes": 2879, "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": 192641, "totalSubmissionRaw": 258199}, "945": {"acRate": 60.0187096384815, "difficulty": "Medium", "likes": 2647, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "945", "paidOnly": false, "title": "Minimum Increment to Make Array Unique", "titleSlug": "minimum-increment-to-make-array-unique", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 238668, "totalSubmissionRaw": 397656}, "946": {"acRate": 69.52694486988261, "difficulty": "Medium", "likes": 5904, "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": 312775, "totalSubmissionRaw": 449862}, "947": {"acRate": 58.956855491823866, "difficulty": "Medium", "likes": 5388, "dislikes": 649, "categoryTitle": "Algorithms", "frontendQuestionId": "947", "paidOnly": false, "title": "Most Stones Removed with Same Row or Column", "titleSlug": "most-stones-removed-with-same-row-or-column", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220580, "totalSubmissionRaw": 374138}, "948": {"acRate": 58.975683890577514, "difficulty": "Medium", "likes": 3257, "dislikes": 534, "categoryTitle": "Algorithms", "frontendQuestionId": "948", "paidOnly": false, "title": "Bag of Tokens", "titleSlug": "bag-of-tokens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232836, "totalSubmissionRaw": 394800}, "949": {"acRate": 35.333473129468366, "difficulty": "Medium", "likes": 713, "dislikes": 1058, "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": 89305, "totalSubmissionRaw": 252749}, "950": {"acRate": 83.02518773401819, "difficulty": "Medium", "likes": 3469, "dislikes": 656, "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": 199786, "totalSubmissionRaw": 240633}, "951": {"acRate": 67.04754505349266, "difficulty": "Medium", "likes": 2304, "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": 150157, "totalSubmissionRaw": 223956}, "952": {"acRate": 40.83768460211102, "difficulty": "Hard", "likes": 1628, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "952", "paidOnly": false, "title": "Largest Component Size by Common Factor", "titleSlug": "largest-component-size-by-common-factor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54669, "totalSubmissionRaw": 133869}, "953": {"acRate": 55.14213429395183, "difficulty": "Easy", "likes": 4884, "dislikes": 1631, "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": 515243, "totalSubmissionRaw": 934394}, "954": {"acRate": 39.187871654559984, "difficulty": "Medium", "likes": 1526, "dislikes": 158, "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": 89229, "totalSubmissionRaw": 227695}, "955": {"acRate": 35.311279067783595, "difficulty": "Medium", "likes": 662, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "955", "paidOnly": false, "title": "Delete Columns to Make Sorted II", "titleSlug": "delete-columns-to-make-sorted-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20697, "totalSubmissionRaw": 58613}, "956": {"acRate": 52.14038935157386, "difficulty": "Hard", "likes": 2363, "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": 59914, "totalSubmissionRaw": 114909}, "957": {"acRate": 38.9877975595119, "difficulty": "Medium", "likes": 1490, "dislikes": 1750, "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": 161767, "totalSubmissionRaw": 414917}, "958": {"acRate": 57.14683598083414, "difficulty": "Medium", "likes": 4284, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "958", "paidOnly": false, "title": "Check Completeness of a Binary Tree", "titleSlug": "check-completeness-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242114, "totalSubmissionRaw": 423668}, "959": {"acRate": 69.52036102717022, "difficulty": "Medium", "likes": 3079, "dislikes": 584, "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": 52223, "totalSubmissionRaw": 75119}, "960": {"acRate": 58.23561388522172, "difficulty": "Hard", "likes": 601, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "960", "paidOnly": false, "title": "Delete Columns to Make Sorted III", "titleSlug": "delete-columns-to-make-sorted-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14998, "totalSubmissionRaw": 25754}, "961": {"acRate": 76.89343232801792, "difficulty": "Easy", "likes": 1348, "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": 241824, "totalSubmissionRaw": 314493}, "962": {"acRate": 50.413231614782006, "difficulty": "Medium", "likes": 1687, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "962", "paidOnly": false, "title": "Maximum Width Ramp", "titleSlug": "maximum-width-ramp", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49165, "totalSubmissionRaw": 97524}, "963": {"acRate": 55.16402947667677, "difficulty": "Medium", "likes": 382, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "963", "paidOnly": false, "title": "Minimum Area Rectangle II", "titleSlug": "minimum-area-rectangle-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29494, "totalSubmissionRaw": 53466}, "964": {"acRate": 48.584566748095995, "difficulty": "Hard", "likes": 317, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "964", "paidOnly": false, "title": "Least Operators to Express Number", "titleSlug": "least-operators-to-express-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10143, "totalSubmissionRaw": 20877}, "965": {"acRate": 71.19879824765401, "difficulty": "Easy", "likes": 1896, "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": 226556, "totalSubmissionRaw": 318202}, "966": {"acRate": 51.3276275581636, "difficulty": "Medium", "likes": 423, "dislikes": 811, "categoryTitle": "Algorithms", "frontendQuestionId": "966", "paidOnly": false, "title": "Vowel Spellchecker", "titleSlug": "vowel-spellchecker", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42160, "totalSubmissionRaw": 82139}, "967": {"acRate": 58.16251213985109, "difficulty": "Medium", "likes": 2809, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "967", "paidOnly": false, "title": "Numbers With Same Consecutive Differences", "titleSlug": "numbers-with-same-consecutive-differences", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134748, "totalSubmissionRaw": 231675}, "968": {"acRate": 46.74502859107466, "difficulty": "Hard", "likes": 5343, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "968", "paidOnly": false, "title": "Binary Tree Cameras", "titleSlug": "binary-tree-cameras", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144121, "totalSubmissionRaw": 308313}, "969": {"acRate": 70.89168743521316, "difficulty": "Medium", "likes": 1498, "dislikes": 1532, "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": 96429, "totalSubmissionRaw": 136023}, "970": {"acRate": 43.86042056001382, "difficulty": "Medium", "likes": 391, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "970", "paidOnly": false, "title": "Powerful Integers", "titleSlug": "powerful-integers", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55858, "totalSubmissionRaw": 127354}, "971": {"acRate": 50.668994973688555, "difficulty": "Medium", "likes": 953, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "971", "paidOnly": false, "title": "Flip Binary Tree To Match Preorder Traversal", "titleSlug": "flip-binary-tree-to-match-preorder-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42944, "totalSubmissionRaw": 84754}, "972": {"acRate": 44.12751677852349, "difficulty": "Hard", "likes": 95, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "972", "paidOnly": false, "title": "Equal Rational Numbers", "titleSlug": "equal-rational-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7627, "totalSubmissionRaw": 17284}, "973": {"acRate": 66.69664609971124, "difficulty": "Medium", "likes": 8409, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "973", "paidOnly": false, "title": "K Closest Points to Origin", "titleSlug": "k-closest-points-to-origin", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1253268, "totalSubmissionRaw": 1879057}, "974": {"acRate": 55.464133350106145, "difficulty": "Medium", "likes": 7214, "dislikes": 319, "categoryTitle": "Algorithms", "frontendQuestionId": "974", "paidOnly": false, "title": "Subarray Sums Divisible by K", "titleSlug": "subarray-sums-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 357132, "totalSubmissionRaw": 643898}, "975": {"acRate": 40.1825084621718, "difficulty": "Hard", "likes": 2000, "dislikes": 506, "categoryTitle": "Algorithms", "frontendQuestionId": "975", "paidOnly": false, "title": "Odd Even Jump", "titleSlug": "odd-even-jump", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87847, "totalSubmissionRaw": 218620}, "976": {"acRate": 56.24537538686393, "difficulty": "Easy", "likes": 2975, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "976", "paidOnly": false, "title": "Largest Perimeter Triangle", "titleSlug": "largest-perimeter-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 245524, "totalSubmissionRaw": 436523}, "977": {"acRate": 72.92043967487993, "difficulty": "Easy", "likes": 9337, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "977", "paidOnly": false, "title": "Squares of a Sorted Array", "titleSlug": "squares-of-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1915763, "totalSubmissionRaw": 2627197}, "978": {"acRate": 47.56413478012564, "difficulty": "Medium", "likes": 1976, "dislikes": 233, "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": 104106, "totalSubmissionRaw": 218875}, "979": {"acRate": 77.12080669457363, "difficulty": "Medium", "likes": 5812, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "979", "paidOnly": false, "title": "Distribute Coins in Binary Tree", "titleSlug": "distribute-coins-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199156, "totalSubmissionRaw": 258239}, "980": {"acRate": 81.89504477185973, "difficulty": "Hard", "likes": 5150, "dislikes": 189, "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": 206604, "totalSubmissionRaw": 252279}, "981": {"acRate": 49.29150756827453, "difficulty": "Medium", "likes": 4792, "dislikes": 589, "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": 468073, "totalSubmissionRaw": 949598}, "982": {"acRate": 58.3124373119358, "difficulty": "Hard", "likes": 440, "dislikes": 219, "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": 18604, "totalSubmissionRaw": 31904}, "983": {"acRate": 65.23399059860164, "difficulty": "Medium", "likes": 7882, "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": 302946, "totalSubmissionRaw": 464399}, "984": {"acRate": 44.01639713500608, "difficulty": "Medium", "likes": 814, "dislikes": 368, "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": 48856, "totalSubmissionRaw": 110995}, "985": {"acRate": 68.19724099153684, "difficulty": "Medium", "likes": 2081, "dislikes": 318, "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": 140695, "totalSubmissionRaw": 206306}, "986": {"acRate": 71.82195391605657, "difficulty": "Medium", "likes": 5557, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "986", "paidOnly": false, "title": "Interval List Intersections", "titleSlug": "interval-list-intersections", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 426156, "totalSubmissionRaw": 593350}, "987": {"acRate": 48.4247659851907, "difficulty": "Hard", "likes": 7628, "dislikes": 4332, "categoryTitle": "Algorithms", "frontendQuestionId": "987", "paidOnly": false, "title": "Vertical Order Traversal of a Binary Tree", "titleSlug": "vertical-order-traversal-of-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 457523, "totalSubmissionRaw": 944812}, "988": {"acRate": 60.535061167864804, "difficulty": "Medium", "likes": 2279, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "988", "paidOnly": false, "title": "Smallest String Starting From Leaf", "titleSlug": "smallest-string-starting-from-leaf", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191993, "totalSubmissionRaw": 317160}, "989": {"acRate": 45.14560809211816, "difficulty": "Easy", "likes": 3447, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "989", "paidOnly": false, "title": "Add to Array-Form of Integer", "titleSlug": "add-to-array-form-of-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267076, "totalSubmissionRaw": 591588}, "990": {"acRate": 50.57422850120952, "difficulty": "Medium", "likes": 3738, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "990", "paidOnly": false, "title": "Satisfiability of Equality Equations", "titleSlug": "satisfiability-of-equality-equations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130874, "totalSubmissionRaw": 258778}, "991": {"acRate": 54.544003065525615, "difficulty": "Medium", "likes": 2700, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "991", "paidOnly": false, "title": "Broken Calculator", "titleSlug": "broken-calculator", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102486, "totalSubmissionRaw": 187896}, "992": {"acRate": 63.85024720198428, "difficulty": "Hard", "likes": 6048, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "992", "paidOnly": false, "title": "Subarrays with K Different Integers", "titleSlug": "subarrays-with-k-different-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230138, "totalSubmissionRaw": 360432}, "993": {"acRate": 56.50619168247006, "difficulty": "Easy", "likes": 4027, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "993", "paidOnly": false, "title": "Cousins in Binary Tree", "titleSlug": "cousins-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 283960, "totalSubmissionRaw": 502529}, "994": {"acRate": 54.69184305941934, "difficulty": "Medium", "likes": 12931, "dislikes": 403, "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": 924203, "totalSubmissionRaw": 1689836}, "995": {"acRate": 62.72047294692199, "difficulty": "Hard", "likes": 1871, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "995", "paidOnly": false, "title": "Minimum Number of K Consecutive Bit Flips", "titleSlug": "minimum-number-of-k-consecutive-bit-flips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122007, "totalSubmissionRaw": 194525}, "996": {"acRate": 50.14350856702657, "difficulty": "Hard", "likes": 987, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "996", "paidOnly": false, "title": "Number of Squareful Arrays", "titleSlug": "number-of-squareful-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40357, "totalSubmissionRaw": 80483}, "997": {"acRate": 49.75594466930482, "difficulty": "Easy", "likes": 6630, "dislikes": 597, "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": 606415, "totalSubmissionRaw": 1218780}, "998": {"acRate": 69.53552683560021, "difficulty": "Medium", "likes": 533, "dislikes": 786, "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": 36963, "totalSubmissionRaw": 53157}, "999": {"acRate": 69.28773886806255, "difficulty": "Easy", "likes": 709, "dislikes": 636, "categoryTitle": "Algorithms", "frontendQuestionId": "999", "paidOnly": false, "title": "Available Captures for Rook", "titleSlug": "available-captures-for-rook", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68202, "totalSubmissionRaw": 98433}, "1000": {"acRate": 43.2847464147556, "difficulty": "Hard", "likes": 2468, "dislikes": 110, "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": 40505, "totalSubmissionRaw": 93578}, "1001": {"acRate": 37.23525157557599, "difficulty": "Hard", "likes": 611, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1001", "paidOnly": false, "title": "Grid Illumination", "titleSlug": "grid-illumination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21624, "totalSubmissionRaw": 58074}, "1002": {"acRate": 74.5923175516556, "difficulty": "Easy", "likes": 4252, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "1002", "paidOnly": false, "title": "Find Common Characters", "titleSlug": "find-common-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 361402, "totalSubmissionRaw": 484504}, "1003": {"acRate": 59.91597178266414, "difficulty": "Medium", "likes": 994, "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": 65315, "totalSubmissionRaw": 109011}, "1004": {"acRate": 63.73752752668992, "difficulty": "Medium", "likes": 8636, "dislikes": 135, "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": 624601, "totalSubmissionRaw": 979958}, "1005": {"acRate": 51.33918389069305, "difficulty": "Easy", "likes": 1551, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "1005", "paidOnly": false, "title": "Maximize Sum Of Array After K Negations", "titleSlug": "maximize-sum-of-array-after-k-negations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 94536, "totalSubmissionRaw": 184141}, "1006": {"acRate": 57.56651294785385, "difficulty": "Medium", "likes": 374, "dislikes": 354, "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": 32456, "totalSubmissionRaw": 56380}, "1007": {"acRate": 52.259068701629985, "difficulty": "Medium", "likes": 2838, "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": 205479, "totalSubmissionRaw": 393193}, "1008": {"acRate": 82.36823101598777, "difficulty": "Medium", "likes": 6163, "dislikes": 82, "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": 384387, "totalSubmissionRaw": 466669}, "1009": {"acRate": 60.79650163985632, "difficulty": "Easy", "likes": 2421, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1009", "paidOnly": false, "title": "Complement of Base 10 Integer", "titleSlug": "complement-of-base-10-integer", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 253032, "totalSubmissionRaw": 416195}, "1010": {"acRate": 52.986976029443845, "difficulty": "Medium", "likes": 4204, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "1010", "paidOnly": false, "title": "Pairs of Songs With Total Durations Divisible by 60", "titleSlug": "pairs-of-songs-with-total-durations-divisible-by-60", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 279294, "totalSubmissionRaw": 527101}, "1011": {"acRate": 70.11198503951177, "difficulty": "Medium", "likes": 9521, "dislikes": 229, "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": 416909, "totalSubmissionRaw": 594633}, "1012": {"acRate": 42.437177446582744, "difficulty": "Hard", "likes": 774, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1012", "paidOnly": false, "title": "Numbers With Repeated Digits", "titleSlug": "numbers-with-repeated-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17597, "totalSubmissionRaw": 41466}, "1013": {"acRate": 41.98406938897894, "difficulty": "Easy", "likes": 1705, "dislikes": 156, "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": 96615, "totalSubmissionRaw": 230123}, "1014": {"acRate": 59.127367882132084, "difficulty": "Medium", "likes": 2496, "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": 93546, "totalSubmissionRaw": 158211}, "1015": {"acRate": 46.58944847999648, "difficulty": "Medium", "likes": 1142, "dislikes": 853, "categoryTitle": "Algorithms", "frontendQuestionId": "1015", "paidOnly": false, "title": "Smallest Integer Divisible by K", "titleSlug": "smallest-integer-divisible-by-k", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63432, "totalSubmissionRaw": 136151}, "1016": {"acRate": 57.401655545482924, "difficulty": "Medium", "likes": 356, "dislikes": 532, "categoryTitle": "Algorithms", "frontendQuestionId": "1016", "paidOnly": false, "title": "Binary String With Substrings Representing 1 To N", "titleSlug": "binary-string-with-substrings-representing-1-to-n", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38625, "totalSubmissionRaw": 67289}, "1017": {"acRate": 60.88482375907526, "difficulty": "Medium", "likes": 515, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "1017", "paidOnly": false, "title": "Convert to Base -2", "titleSlug": "convert-to-base-2", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27758, "totalSubmissionRaw": 45591}, "1018": {"acRate": 46.77514792899408, "difficulty": "Easy", "likes": 728, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "1018", "paidOnly": false, "title": "Binary Prefix Divisible By 5", "titleSlug": "binary-prefix-divisible-by-5", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56916, "totalSubmissionRaw": 121680}, "1019": {"acRate": 61.12051081007064, "difficulty": "Medium", "likes": 3299, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1019", "paidOnly": false, "title": "Next Greater Node In Linked List", "titleSlug": "next-greater-node-in-linked-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162921, "totalSubmissionRaw": 266557}, "1020": {"acRate": 69.20715349368345, "difficulty": "Medium", "likes": 4061, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "1020", "paidOnly": false, "title": "Number of Enclaves", "titleSlug": "number-of-enclaves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241203, "totalSubmissionRaw": 348524}, "1021": {"acRate": 83.44272879534749, "difficulty": "Easy", "likes": 2964, "dislikes": 1604, "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": 350232, "totalSubmissionRaw": 419728}, "1022": {"acRate": 73.13651335854581, "difficulty": "Easy", "likes": 3346, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1022", "paidOnly": false, "title": "Sum of Root To Leaf Binary Numbers", "titleSlug": "sum-of-root-to-leaf-binary-numbers", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 215820, "totalSubmissionRaw": 295092}, "1023": {"acRate": 62.570097543307476, "difficulty": "Medium", "likes": 901, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "1023", "paidOnly": false, "title": "Camelcase Matching", "titleSlug": "camelcase-matching", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50098, "totalSubmissionRaw": 80067}, "1024": {"acRate": 51.43547480528202, "difficulty": "Medium", "likes": 1760, "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": 70463, "totalSubmissionRaw": 136993}, "1025": {"acRate": 69.09452005169327, "difficulty": "Easy", "likes": 2185, "dislikes": 4135, "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": 268927, "totalSubmissionRaw": 389213}, "1026": {"acRate": 78.1046760783833, "difficulty": "Medium", "likes": 4928, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1026", "paidOnly": false, "title": "Maximum Difference Between Node and Ancestor", "titleSlug": "maximum-difference-between-node-and-ancestor", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 331338, "totalSubmissionRaw": 424223}, "1027": {"acRate": 49.16655481014981, "difficulty": "Medium", "likes": 4678, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "1027", "paidOnly": false, "title": "Longest Arithmetic Subsequence", "titleSlug": "longest-arithmetic-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 179483, "totalSubmissionRaw": 365051}, "1028": {"acRate": 75.02626234330135, "difficulty": "Hard", "likes": 1635, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1028", "paidOnly": false, "title": "Recover a Tree From Preorder Traversal", "titleSlug": "recover-a-tree-from-preorder-traversal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53565, "totalSubmissionRaw": 71395}, "1029": {"acRate": 66.87505410318559, "difficulty": "Medium", "likes": 4724, "dislikes": 352, "categoryTitle": "Algorithms", "frontendQuestionId": "1029", "paidOnly": false, "title": "Two City Scheduling", "titleSlug": "two-city-scheduling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 247213, "totalSubmissionRaw": 369664}, "1030": {"acRate": 71.45593198565906, "difficulty": "Easy", "likes": 756, "dislikes": 326, "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": 61187, "totalSubmissionRaw": 85629}, "1031": {"acRate": 59.820999021218, "difficulty": "Medium", "likes": 2553, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1031", "paidOnly": false, "title": "Maximum Sum of Two Non-Overlapping Subarrays", "titleSlug": "maximum-sum-of-two-non-overlapping-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72119, "totalSubmissionRaw": 120558}, "1032": {"acRate": 52.104990800367986, "difficulty": "Hard", "likes": 1813, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "1032", "paidOnly": false, "title": "Stream of Characters", "titleSlug": "stream-of-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90621, "totalSubmissionRaw": 173920}, "1033": {"acRate": 48.43791219144526, "difficulty": "Medium", "likes": 219, "dislikes": 648, "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": 25706, "totalSubmissionRaw": 53070}, "1034": {"acRate": 49.1317877493837, "difficulty": "Medium", "likes": 736, "dislikes": 883, "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": 36472, "totalSubmissionRaw": 74233}, "1035": {"acRate": 63.33814763062207, "difficulty": "Medium", "likes": 3820, "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": 161822, "totalSubmissionRaw": 255489}, "1036": {"acRate": 34.793818460240324, "difficulty": "Hard", "likes": 670, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "1036", "paidOnly": false, "title": "Escape a Large Maze", "titleSlug": "escape-a-large-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22267, "totalSubmissionRaw": 63997}, "1037": {"acRate": 37.15322294661611, "difficulty": "Easy", "likes": 419, "dislikes": 528, "categoryTitle": "Algorithms", "frontendQuestionId": "1037", "paidOnly": false, "title": "Valid Boomerang", "titleSlug": "valid-boomerang", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54480, "totalSubmissionRaw": 146636}, "1038": {"acRate": 88.24909460186953, "difficulty": "Medium", "likes": 4310, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1038", "paidOnly": false, "title": "Binary Search Tree to Greater Sum Tree", "titleSlug": "binary-search-tree-to-greater-sum-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288511, "totalSubmissionRaw": 326928}, "1039": {"acRate": 59.45982413924933, "difficulty": "Medium", "likes": 1834, "dislikes": 176, "categoryTitle": "Algorithms", "frontendQuestionId": "1039", "paidOnly": false, "title": "Minimum Score Triangulation of Polygon", "titleSlug": "minimum-score-triangulation-of-polygon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52880, "totalSubmissionRaw": 88934}, "1040": {"acRate": 56.77208754749291, "difficulty": "Medium", "likes": 373, "dislikes": 646, "categoryTitle": "Algorithms", "frontendQuestionId": "1040", "paidOnly": false, "title": "Moving Stones Until Consecutive II", "titleSlug": "moving-stones-until-consecutive-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10609, "totalSubmissionRaw": 18687}, "1041": {"acRate": 55.84381404881684, "difficulty": "Medium", "likes": 3734, "dislikes": 702, "categoryTitle": "Algorithms", "frontendQuestionId": "1041", "paidOnly": false, "title": "Robot Bounded In Circle", "titleSlug": "robot-bounded-in-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239769, "totalSubmissionRaw": 429358}, "1042": {"acRate": 51.50291979577246, "difficulty": "Medium", "likes": 1450, "dislikes": 716, "categoryTitle": "Algorithms", "frontendQuestionId": "1042", "paidOnly": false, "title": "Flower Planting With No Adjacent", "titleSlug": "flower-planting-with-no-adjacent", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81405, "totalSubmissionRaw": 158059}, "1043": {"acRate": 76.64077842209028, "difficulty": "Medium", "likes": 4710, "dislikes": 421, "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": 198646, "totalSubmissionRaw": 259191}, "1044": {"acRate": 30.559217874647942, "difficulty": "Hard", "likes": 2225, "dislikes": 385, "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": 69767, "totalSubmissionRaw": 228301}, "1045": {"acRate": 62.05901680383015, "difficulty": "Medium", "likes": 744, "dislikes": 66, "categoryTitle": "Database", "frontendQuestionId": "1045", "paidOnly": false, "title": "Customers Who Bought All Products", "titleSlug": "customers-who-bought-all-products", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 198322, "totalSubmissionRaw": 319569}, "1046": {"acRate": 65.5276023526885, "difficulty": "Easy", "likes": 6027, "dislikes": 125, "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": 646839, "totalSubmissionRaw": 987123}, "1047": {"acRate": 69.92113476106476, "difficulty": "Easy", "likes": 6609, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "1047", "paidOnly": false, "title": "Remove All Adjacent Duplicates In String", "titleSlug": "remove-all-adjacent-duplicates-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 597738, "totalSubmissionRaw": 854875}, "1048": {"acRate": 61.27371131312069, "difficulty": "Medium", "likes": 7299, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1048", "paidOnly": false, "title": "Longest String Chain", "titleSlug": "longest-string-chain", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 419796, "totalSubmissionRaw": 685116}, "1049": {"acRate": 55.862199300145086, "difficulty": "Medium", "likes": 3115, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1049", "paidOnly": false, "title": "Last Stone Weight II", "titleSlug": "last-stone-weight-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91633, "totalSubmissionRaw": 164034}, "1050": {"acRate": 70.13452580585057, "difficulty": "Easy", "likes": 653, "dislikes": 51, "categoryTitle": "Database", "frontendQuestionId": "1050", "paidOnly": false, "title": "Actors and Directors Who Cooperated At Least Three Times", "titleSlug": "actors-and-directors-who-cooperated-at-least-three-times", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188206, "totalSubmissionRaw": 268350}, "1051": {"acRate": 80.77451547008914, "difficulty": "Easy", "likes": 1599, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1051", "paidOnly": false, "title": "Height Checker", "titleSlug": "height-checker", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 507331, "totalSubmissionRaw": 628083}, "1052": {"acRate": 64.32075132119309, "difficulty": "Medium", "likes": 2438, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1052", "paidOnly": false, "title": "Grumpy Bookstore Owner", "titleSlug": "grumpy-bookstore-owner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 196561, "totalSubmissionRaw": 305595}, "1053": {"acRate": 49.683452891050024, "difficulty": "Medium", "likes": 448, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1053", "paidOnly": false, "title": "Previous Permutation With One Swap", "titleSlug": "previous-permutation-with-one-swap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41279, "totalSubmissionRaw": 83084}, "1054": {"acRate": 46.63168120288049, "difficulty": "Medium", "likes": 1267, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1054", "paidOnly": false, "title": "Distant Barcodes", "titleSlug": "distant-barcodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44163, "totalSubmissionRaw": 94706}, "1055": {"acRate": 60.35531727572568, "difficulty": "Medium", "likes": 1271, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1055", "paidOnly": true, "title": "Shortest Way to Form String", "titleSlug": "shortest-way-to-form-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91862, "totalSubmissionRaw": 152202}, "1056": {"acRate": 48.82222501150579, "difficulty": "Easy", "likes": 314, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "1056", "paidOnly": true, "title": "Confusing Number", "titleSlug": "confusing-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 46676, "totalSubmissionRaw": 95604}, "1057": {"acRate": 58.634932485068816, "difficulty": "Medium", "likes": 982, "dislikes": 195, "categoryTitle": "Algorithms", "frontendQuestionId": "1057", "paidOnly": true, "title": "Campus Bikes", "titleSlug": "campus-bikes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72257, "totalSubmissionRaw": 123232}, "1058": {"acRate": 45.049696033966995, "difficulty": "Medium", "likes": 149, "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": 9337, "totalSubmissionRaw": 20726}, "1059": {"acRate": 37.524006232561504, "difficulty": "Medium", "likes": 709, "dislikes": 390, "categoryTitle": "Algorithms", "frontendQuestionId": "1059", "paidOnly": true, "title": "All Paths from Source Lead to Destination", "titleSlug": "all-paths-from-source-lead-to-destination", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 62133, "totalSubmissionRaw": 165582}, "1060": {"acRate": 57.281242691678045, "difficulty": "Medium", "likes": 1657, "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": 139611, "totalSubmissionRaw": 243730}, "1061": {"acRate": 76.61529787633904, "difficulty": "Medium", "likes": 2349, "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": 81534, "totalSubmissionRaw": 106420}, "1062": {"acRate": 62.30894097785858, "difficulty": "Medium", "likes": 703, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1062", "paidOnly": true, "title": "Longest Repeating Substring", "titleSlug": "longest-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47971, "totalSubmissionRaw": 76991}, "1063": {"acRate": 79.13812631465402, "difficulty": "Hard", "likes": 310, "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": 14673, "totalSubmissionRaw": 18541}, "1064": {"acRate": 64.13514833003073, "difficulty": "Easy", "likes": 437, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1064", "paidOnly": true, "title": "Fixed Point", "titleSlug": "fixed-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44665, "totalSubmissionRaw": 69642}, "1065": {"acRate": 67.5257608147383, "difficulty": "Easy", "likes": 377, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1065", "paidOnly": true, "title": "Index Pairs of a String", "titleSlug": "index-pairs-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28113, "totalSubmissionRaw": 41633}, "1066": {"acRate": 55.18421193757709, "difficulty": "Medium", "likes": 935, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1066", "paidOnly": true, "title": "Campus Bikes II", "titleSlug": "campus-bikes-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51451, "totalSubmissionRaw": 93235}, "1067": {"acRate": 46.3768115942029, "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": 4160, "totalSubmissionRaw": 8970}, "1068": {"acRate": 83.6737686139748, "difficulty": "Easy", "likes": 888, "dislikes": 216, "categoryTitle": "Database", "frontendQuestionId": "1068", "paidOnly": false, "title": "Product Sales Analysis I", "titleSlug": "product-sales-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 547841, "totalSubmissionRaw": 654737}, "1069": {"acRate": 81.88088149489086, "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": 54730, "totalSubmissionRaw": 66841}, "1070": {"acRate": 43.18088316807292, "difficulty": "Medium", "likes": 429, "dislikes": 894, "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": 175281, "totalSubmissionRaw": 405923}, "1071": {"acRate": 51.589134057461806, "difficulty": "Easy", "likes": 5180, "dislikes": 1351, "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": 513899, "totalSubmissionRaw": 996137}, "1072": {"acRate": 64.07366684991753, "difficulty": "Medium", "likes": 743, "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": 23310, "totalSubmissionRaw": 36380}, "1073": {"acRate": 36.94285598410188, "difficulty": "Medium", "likes": 320, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1073", "paidOnly": false, "title": "Adding Two Negabinary Numbers", "titleSlug": "adding-two-negabinary-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18218, "totalSubmissionRaw": 49314}, "1074": {"acRate": 74.44539085828038, "difficulty": "Hard", "likes": 3721, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1074", "paidOnly": false, "title": "Number of Submatrices That Sum to Target", "titleSlug": "number-of-submatrices-that-sum-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155573, "totalSubmissionRaw": 208976}, "1075": {"acRate": 62.58793225284369, "difficulty": "Easy", "likes": 603, "dislikes": 168, "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": 274562, "totalSubmissionRaw": 438678}, "1076": {"acRate": 49.95720790113313, "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": 58372, "totalSubmissionRaw": 116844}, "1077": {"acRate": 76.60118108696501, "difficulty": "Medium", "likes": 269, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1077", "paidOnly": true, "title": "Project Employees III", "titleSlug": "project-employees-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58760, "totalSubmissionRaw": 76709}, "1078": {"acRate": 63.485399757440064, "difficulty": "Easy", "likes": 493, "dislikes": 360, "categoryTitle": "Algorithms", "frontendQuestionId": "1078", "paidOnly": false, "title": "Occurrences After Bigram", "titleSlug": "occurrences-after-bigram", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74855, "totalSubmissionRaw": 117909}, "1079": {"acRate": 76.42419901496747, "difficulty": "Medium", "likes": 2488, "dislikes": 69, "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": 103499, "totalSubmissionRaw": 135427}, "1080": {"acRate": 55.86847686514405, "difficulty": "Medium", "likes": 700, "dislikes": 714, "categoryTitle": "Algorithms", "frontendQuestionId": "1080", "paidOnly": false, "title": "Insufficient Nodes in Root to Leaf Paths", "titleSlug": "insufficient-nodes-in-root-to-leaf-paths", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38723, "totalSubmissionRaw": 69311}, "1081": {"acRate": 61.101852089262664, "difficulty": "Medium", "likes": 2607, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1081", "paidOnly": false, "title": "Smallest Subsequence of Distinct Characters", "titleSlug": "smallest-subsequence-of-distinct-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71491, "totalSubmissionRaw": 117003}, "1082": {"acRate": 74.3917623328436, "difficulty": "Easy", "likes": 195, "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": 59747, "totalSubmissionRaw": 80314}, "1083": {"acRate": 49.732821870079405, "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": 59379, "totalSubmissionRaw": 119396}, "1084": {"acRate": 46.55075160067689, "difficulty": "Easy", "likes": 729, "dislikes": 153, "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": 141120, "totalSubmissionRaw": 303153}, "1085": {"acRate": 76.44112644112644, "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": 24267, "totalSubmissionRaw": 31746}, "1086": {"acRate": 74.51173396405456, "difficulty": "Easy", "likes": 798, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1086", "paidOnly": true, "title": "High Five", "titleSlug": "high-five", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105221, "totalSubmissionRaw": 141214}, "1087": {"acRate": 66.41460299972456, "difficulty": "Medium", "likes": 644, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1087", "paidOnly": true, "title": "Brace Expansion", "titleSlug": "brace-expansion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53048, "totalSubmissionRaw": 79874}, "1088": {"acRate": 47.161918681567904, "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": 37431, "totalSubmissionRaw": 79367}, "1089": {"acRate": 52.056679229530964, "difficulty": "Easy", "likes": 2608, "dislikes": 752, "categoryTitle": "Algorithms", "frontendQuestionId": "1089", "paidOnly": false, "title": "Duplicate Zeros", "titleSlug": "duplicate-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433983, "totalSubmissionRaw": 833674}, "1090": {"acRate": 62.30620002208097, "difficulty": "Medium", "likes": 451, "dislikes": 628, "categoryTitle": "Algorithms", "frontendQuestionId": "1090", "paidOnly": false, "title": "Largest Values From Labels", "titleSlug": "largest-values-from-labels", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39504, "totalSubmissionRaw": 63403}, "1091": {"acRate": 47.874255248857956, "difficulty": "Medium", "likes": 6539, "dislikes": 241, "categoryTitle": "Algorithms", "frontendQuestionId": "1091", "paidOnly": false, "title": "Shortest Path in Binary Matrix", "titleSlug": "shortest-path-in-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 504293, "totalSubmissionRaw": 1053367}, "1092": {"acRate": 59.412161787279686, "difficulty": "Hard", "likes": 4892, "dislikes": 68, "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": 128499, "totalSubmissionRaw": 216284}, "1093": {"acRate": 41.98681518526938, "difficulty": "Medium", "likes": 156, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1093", "paidOnly": false, "title": "Statistics from a Large Sample", "titleSlug": "statistics-from-a-large-sample", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20317, "totalSubmissionRaw": 48389}, "1094": {"acRate": 55.981805592858244, "difficulty": "Medium", "likes": 4458, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "1094", "paidOnly": false, "title": "Car Pooling", "titleSlug": "car-pooling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227195, "totalSubmissionRaw": 405838}, "1095": {"acRate": 40.27446451602027, "difficulty": "Hard", "likes": 3252, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "1095", "paidOnly": false, "title": "Find in Mountain Array", "titleSlug": "find-in-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143334, "totalSubmissionRaw": 355893}, "1096": {"acRate": 63.78297635323308, "difficulty": "Hard", "likes": 482, "dislikes": 288, "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": 25193, "totalSubmissionRaw": 39498}, "1097": {"acRate": 51.036363249046715, "difficulty": "Hard", "likes": 183, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1097", "paidOnly": true, "title": "Game Play Analysis V", "titleSlug": "game-play-analysis-v", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23958, "totalSubmissionRaw": 46943}, "1098": {"acRate": 43.13777345237592, "difficulty": "Medium", "likes": 202, "dislikes": 605, "categoryTitle": "Database", "frontendQuestionId": "1098", "paidOnly": true, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40779, "totalSubmissionRaw": 94532}, "1099": {"acRate": 61.83983038509135, "difficulty": "Easy", "likes": 1135, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "1099", "paidOnly": true, "title": "Two Sum Less Than K", "titleSlug": "two-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 135919, "totalSubmissionRaw": 219792}, "1100": {"acRate": 74.78365974144273, "difficulty": "Medium", "likes": 572, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1100", "paidOnly": true, "title": "Find K-Length Substrings With No Repeated Characters", "titleSlug": "find-k-length-substrings-with-no-repeated-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42691, "totalSubmissionRaw": 57086}, "1101": {"acRate": 65.30285400515106, "difficulty": "Medium", "likes": 1038, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1101", "paidOnly": true, "title": "The Earliest Moment When Everyone Become Friends", "titleSlug": "the-earliest-moment-when-everyone-become-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99899, "totalSubmissionRaw": 152978}, "1102": {"acRate": 53.77743399690598, "difficulty": "Medium", "likes": 1295, "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": 63267, "totalSubmissionRaw": 117646}, "1103": {"acRate": 65.43322219472067, "difficulty": "Easy", "likes": 980, "dislikes": 196, "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": 89883, "totalSubmissionRaw": 137366}, "1104": {"acRate": 75.47446923089475, "difficulty": "Medium", "likes": 1491, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "1104", "paidOnly": false, "title": "Path In Zigzag Labelled Binary Tree", "titleSlug": "path-in-zigzag-labelled-binary-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46250, "totalSubmissionRaw": 61279}, "1105": {"acRate": 68.87001238356218, "difficulty": "Medium", "likes": 2512, "dislikes": 241, "categoryTitle": "Algorithms", "frontendQuestionId": "1105", "paidOnly": false, "title": "Filling Bookcase Shelves", "titleSlug": "filling-bookcase-shelves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138478, "totalSubmissionRaw": 201071}, "1106": {"acRate": 59.680233080948874, "difficulty": "Hard", "likes": 1187, "dislikes": 62, "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": 33183, "totalSubmissionRaw": 55602}, "1107": {"acRate": 44.59801440529492, "difficulty": "Medium", "likes": 150, "dislikes": 166, "categoryTitle": "Database", "frontendQuestionId": "1107", "paidOnly": true, "title": "New Users Daily Count", "titleSlug": "new-users-daily-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36656, "totalSubmissionRaw": 82192}, "1108": {"acRate": 89.23237524675449, "difficulty": "Easy", "likes": 2109, "dislikes": 1754, "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": 674425, "totalSubmissionRaw": 755808}, "1109": {"acRate": 62.358620433067934, "difficulty": "Medium", "likes": 1647, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "1109", "paidOnly": false, "title": "Corporate Flight Bookings", "titleSlug": "corporate-flight-bookings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 67043, "totalSubmissionRaw": 107512}, "1110": {"acRate": 72.41689204836376, "difficulty": "Medium", "likes": 4562, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1110", "paidOnly": false, "title": "Delete Nodes And Return Forest", "titleSlug": "delete-nodes-and-return-forest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 340854, "totalSubmissionRaw": 470683}, "1111": {"acRate": 72.01624661528848, "difficulty": "Medium", "likes": 439, "dislikes": 1767, "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": 27660, "totalSubmissionRaw": 38408}, "1112": {"acRate": 70.87206278128322, "difficulty": "Medium", "likes": 300, "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": 62675, "totalSubmissionRaw": 88434}, "1113": {"acRate": 64.8360655737705, "difficulty": "Easy", "likes": 110, "dislikes": 403, "categoryTitle": "Database", "frontendQuestionId": "1113", "paidOnly": true, "title": "Reported Posts", "titleSlug": "reported-posts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47460, "totalSubmissionRaw": 73200}, "1114": {"acRate": 69.72771981352778, "difficulty": "Easy", "likes": 1475, "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": 163333, "totalSubmissionRaw": 234244}, "1115": {"acRate": 66.5874955275919, "difficulty": "Medium", "likes": 683, "dislikes": 55, "categoryTitle": "Concurrency", "frontendQuestionId": "1115", "paidOnly": false, "title": "Print FooBar Alternately", "titleSlug": "print-foobar-alternately", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87470, "totalSubmissionRaw": 131361}, "1116": {"acRate": 61.39949851303284, "difficulty": "Medium", "likes": 490, "dislikes": 333, "categoryTitle": "Concurrency", "frontendQuestionId": "1116", "paidOnly": false, "title": "Print Zero Even Odd", "titleSlug": "print-zero-even-odd", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52647, "totalSubmissionRaw": 85745}, "1117": {"acRate": 56.556346443601605, "difficulty": "Medium", "likes": 519, "dislikes": 163, "categoryTitle": "Concurrency", "frontendQuestionId": "1117", "paidOnly": false, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54427, "totalSubmissionRaw": 96234}, "1118": {"acRate": 58.33220796758947, "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": 8639, "totalSubmissionRaw": 14810}, "1119": {"acRate": 91.16535962173546, "difficulty": "Easy", "likes": 360, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1119", "paidOnly": true, "title": "Remove Vowels from a String", "titleSlug": "remove-vowels-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111250, "totalSubmissionRaw": 122031}, "1120": {"acRate": 66.64623224360386, "difficulty": "Medium", "likes": 836, "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": 69578, "totalSubmissionRaw": 104399}, "1121": {"acRate": 61.33032694475761, "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": 4896, "totalSubmissionRaw": 7983}, "1122": {"acRate": 74.76428913865658, "difficulty": "Easy", "likes": 3148, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "1122", "paidOnly": false, "title": "Relative Sort Array", "titleSlug": "relative-sort-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 336852, "totalSubmissionRaw": 450552}, "1123": {"acRate": 72.52282089618149, "difficulty": "Medium", "likes": 1969, "dislikes": 846, "categoryTitle": "Algorithms", "frontendQuestionId": "1123", "paidOnly": false, "title": "Lowest Common Ancestor of Deepest Leaves", "titleSlug": "lowest-common-ancestor-of-deepest-leaves", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 114961, "totalSubmissionRaw": 158517}, "1124": {"acRate": 35.18853616442655, "difficulty": "Medium", "likes": 1429, "dislikes": 115, "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": 33642, "totalSubmissionRaw": 95605}, "1125": {"acRate": 55.49972228008054, "difficulty": "Hard", "likes": 2177, "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": 63949, "totalSubmissionRaw": 115224}, "1126": {"acRate": 65.67846396331852, "difficulty": "Medium", "likes": 270, "dislikes": 30, "categoryTitle": "Database", "frontendQuestionId": "1126", "paidOnly": true, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45837, "totalSubmissionRaw": 69790}, "1127": {"acRate": 47.024125523506164, "difficulty": "Hard", "likes": 181, "dislikes": 133, "categoryTitle": "Database", "frontendQuestionId": "1127", "paidOnly": true, "title": "User Purchase Platform", "titleSlug": "user-purchase-platform", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15944, "totalSubmissionRaw": 33906}, "1128": {"acRate": 48.43493150684932, "difficulty": "Easy", "likes": 687, "dislikes": 334, "categoryTitle": "Algorithms", "frontendQuestionId": "1128", "paidOnly": false, "title": "Number of Equivalent Domino Pairs", "titleSlug": "number-of-equivalent-domino-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70714, "totalSubmissionRaw": 145999}, "1129": {"acRate": 47.129317091294276, "difficulty": "Medium", "likes": 3488, "dislikes": 187, "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": 119240, "totalSubmissionRaw": 253006}, "1130": {"acRate": 67.70420537832501, "difficulty": "Medium", "likes": 4279, "dislikes": 274, "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": 102167, "totalSubmissionRaw": 150902}, "1131": {"acRate": 48.48271959096852, "difficulty": "Medium", "likes": 646, "dislikes": 405, "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": 24844, "totalSubmissionRaw": 51243}, "1132": {"acRate": 32.25195839002172, "difficulty": "Medium", "likes": 153, "dislikes": 566, "categoryTitle": "Database", "frontendQuestionId": "1132", "paidOnly": true, "title": "Reported Posts II", "titleSlug": "reported-posts-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38165, "totalSubmissionRaw": 118335}, "1133": {"acRate": 69.12136436580275, "difficulty": "Easy", "likes": 318, "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": 65901, "totalSubmissionRaw": 95341}, "1134": {"acRate": 77.77893487180555, "difficulty": "Easy", "likes": 207, "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": 37343, "totalSubmissionRaw": 48012}, "1135": {"acRate": 62.07918014390389, "difficulty": "Medium", "likes": 1120, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1135", "paidOnly": true, "title": "Connecting Cities With Minimum Cost", "titleSlug": "connecting-cities-with-minimum-cost", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75235, "totalSubmissionRaw": 121192}, "1136": {"acRate": 61.48481392890916, "difficulty": "Medium", "likes": 1163, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1136", "paidOnly": true, "title": "Parallel Courses", "titleSlug": "parallel-courses", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88425, "totalSubmissionRaw": 143816}, "1137": {"acRate": 63.78663789502329, "difficulty": "Easy", "likes": 4447, "dislikes": 192, "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": 801664, "totalSubmissionRaw": 1256790}, "1138": {"acRate": 51.65773494071381, "difficulty": "Medium", "likes": 903, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "1138", "paidOnly": false, "title": "Alphabet Board Path", "titleSlug": "alphabet-board-path", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52149, "totalSubmissionRaw": 100951}, "1139": {"acRate": 50.25928027708745, "difficulty": "Medium", "likes": 708, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1139", "paidOnly": false, "title": "Largest 1-Bordered Square", "titleSlug": "largest-1-bordered-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25684, "totalSubmissionRaw": 51103}, "1140": {"acRate": 67.4428813311315, "difficulty": "Medium", "likes": 2838, "dislikes": 626, "categoryTitle": "Algorithms", "frontendQuestionId": "1140", "paidOnly": false, "title": "Stone Game II", "titleSlug": "stone-game-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96792, "totalSubmissionRaw": 143517}, "1141": {"acRate": 48.70551744099632, "difficulty": "Easy", "likes": 677, "dislikes": 804, "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": 249043, "totalSubmissionRaw": 511324}, "1142": {"acRate": 35.71647795611961, "difficulty": "Easy", "likes": 99, "dislikes": 369, "categoryTitle": "Database", "frontendQuestionId": "1142", "paidOnly": true, "title": "User Activity for the Past 30 Days II", "titleSlug": "user-activity-for-the-past-30-days-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43058, "totalSubmissionRaw": 120555}, "1143": {"acRate": 57.74305997075373, "difficulty": "Medium", "likes": 13562, "dislikes": 196, "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": 1162497, "totalSubmissionRaw": 2013223}, "1144": {"acRate": 47.95647193585338, "difficulty": "Medium", "likes": 435, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "1144", "paidOnly": false, "title": "Decrease Elements To Make Array Zigzag", "titleSlug": "decrease-elements-to-make-array-zigzag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20933, "totalSubmissionRaw": 43650}, "1145": {"acRate": 52.10656615219913, "difficulty": "Medium", "likes": 1352, "dislikes": 213, "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": 46725, "totalSubmissionRaw": 89672}, "1146": {"acRate": 36.9043394821408, "difficulty": "Medium", "likes": 3712, "dislikes": 501, "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": 221529, "totalSubmissionRaw": 600278}, "1147": {"acRate": 58.68687584106523, "difficulty": "Hard", "likes": 672, "dislikes": 30, "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": 24858, "totalSubmissionRaw": 42357}, "1148": {"acRate": 76.01232738187596, "difficulty": "Easy", "likes": 1468, "dislikes": 84, "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": 710315, "totalSubmissionRaw": 934474}, "1149": {"acRate": 47.04919658797858, "difficulty": "Medium", "likes": 130, "dislikes": 27, "categoryTitle": "Database", "frontendQuestionId": "1149", "paidOnly": true, "title": "Article Views II", "titleSlug": "article-views-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37948, "totalSubmissionRaw": 80656}, "1150": {"acRate": 58.95752534928275, "difficulty": "Easy", "likes": 455, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1150", "paidOnly": true, "title": "Check If a Number Is Majority Element in a Sorted Array", "titleSlug": "check-if-a-number-is-majority-element-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50470, "totalSubmissionRaw": 85604}, "1151": {"acRate": 60.27437688365812, "difficulty": "Medium", "likes": 1204, "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": 67397, "totalSubmissionRaw": 111817}, "1152": {"acRate": 42.74819054946249, "difficulty": "Medium", "likes": 495, "dislikes": 3746, "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": 102237, "totalSubmissionRaw": 239161}, "1153": {"acRate": 34.952046377431074, "difficulty": "Hard", "likes": 879, "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": 52333, "totalSubmissionRaw": 149728}, "1154": {"acRate": 48.888509820037065, "difficulty": "Easy", "likes": 454, "dislikes": 477, "categoryTitle": "Algorithms", "frontendQuestionId": "1154", "paidOnly": false, "title": "Day of the Year", "titleSlug": "day-of-the-year", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63052, "totalSubmissionRaw": 128971}, "1155": {"acRate": 61.05707704120809, "difficulty": "Medium", "likes": 5054, "dislikes": 170, "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": 295802, "totalSubmissionRaw": 484468}, "1156": {"acRate": 44.05790896197383, "difficulty": "Medium", "likes": 1020, "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": 32928, "totalSubmissionRaw": 74738}, "1157": {"acRate": 41.826430557588175, "difficulty": "Hard", "likes": 632, "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": 17148, "totalSubmissionRaw": 40998}, "1158": {"acRate": 57.112280813013285, "difficulty": "Medium", "likes": 646, "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": 108069, "totalSubmissionRaw": 189222}, "1159": {"acRate": 57.06622653187539, "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": 19362, "totalSubmissionRaw": 33929}, "1160": {"acRate": 70.6400893456387, "difficulty": "Easy", "likes": 2114, "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": 266287, "totalSubmissionRaw": 376963}, "1161": {"acRate": 67.14983513916793, "difficulty": "Medium", "likes": 3537, "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": 296114, "totalSubmissionRaw": 440976}, "1162": {"acRate": 51.608000526350416, "difficulty": "Medium", "likes": 4135, "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": 156878, "totalSubmissionRaw": 303980}, "1163": {"acRate": 34.559846817414645, "difficulty": "Hard", "likes": 594, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "1163", "paidOnly": false, "title": "Last Substring in Lexicographical Order", "titleSlug": "last-substring-in-lexicographical-order", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35015, "totalSubmissionRaw": 101317}, "1164": {"acRate": 56.089232332541684, "difficulty": "Medium", "likes": 897, "dislikes": 243, "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": 142408, "totalSubmissionRaw": 253896}, "1165": {"acRate": 87.53821236967305, "difficulty": "Easy", "likes": 527, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1165", "paidOnly": true, "title": "Single-Row Keyboard", "titleSlug": "single-row-keyboard", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 86479, "totalSubmissionRaw": 98790}, "1166": {"acRate": 63.12947804609198, "difficulty": "Medium", "likes": 575, "dislikes": 69, "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": 61853, "totalSubmissionRaw": 97978}, "1167": {"acRate": 70.16366841059788, "difficulty": "Medium", "likes": 1313, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "1167", "paidOnly": true, "title": "Minimum Cost to Connect Sticks", "titleSlug": "minimum-cost-to-connect-sticks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 125393, "totalSubmissionRaw": 178715}, "1168": {"acRate": 64.84195818943928, "difficulty": "Hard", "likes": 1153, "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": 49193, "totalSubmissionRaw": 75866}, "1169": {"acRate": 31.113113224847115, "difficulty": "Medium", "likes": 547, "dislikes": 2324, "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": 78046, "totalSubmissionRaw": 250846}, "1170": {"acRate": 62.38906705872495, "difficulty": "Medium", "likes": 708, "dislikes": 975, "categoryTitle": "Algorithms", "frontendQuestionId": "1170", "paidOnly": false, "title": "Compare Strings by Frequency of the Smallest Character", "titleSlug": "compare-strings-by-frequency-of-the-smallest-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81900, "totalSubmissionRaw": 131273}, "1171": {"acRate": 52.75089197601154, "difficulty": "Medium", "likes": 3299, "dislikes": 214, "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": 166772, "totalSubmissionRaw": 316151}, "1172": {"acRate": 32.68660362215166, "difficulty": "Hard", "likes": 483, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1172", "paidOnly": false, "title": "Dinner Plate Stacks", "titleSlug": "dinner-plate-stacks", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18734, "totalSubmissionRaw": 57314}, "1173": {"acRate": 80.92750114158888, "difficulty": "Easy", "likes": 291, "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": 76207, "totalSubmissionRaw": 94167}, "1174": {"acRate": 51.92505704696991, "difficulty": "Medium", "likes": 727, "dislikes": 128, "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": 174988, "totalSubmissionRaw": 337002}, "1175": {"acRate": 57.708998314385106, "difficulty": "Easy", "likes": 406, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "1175", "paidOnly": false, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32182, "totalSubmissionRaw": 55766}, "1176": {"acRate": 53.512074785769926, "difficulty": "Easy", "likes": 154, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "1176", "paidOnly": true, "title": "Diet Plan Performance", "titleSlug": "diet-plan-performance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32972, "totalSubmissionRaw": 61616}, "1177": {"acRate": 39.238150384647206, "difficulty": "Medium", "likes": 804, "dislikes": 277, "categoryTitle": "Algorithms", "frontendQuestionId": "1177", "paidOnly": false, "title": "Can Make Palindrome from Substring", "titleSlug": "can-make-palindrome-from-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28461, "totalSubmissionRaw": 72534}, "1178": {"acRate": 46.7910291968626, "difficulty": "Hard", "likes": 1269, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1178", "paidOnly": false, "title": "Number of Valid Words for Each Puzzle", "titleSlug": "number-of-valid-words-for-each-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31379, "totalSubmissionRaw": 67062}, "1179": {"acRate": 76.97893604908597, "difficulty": "Easy", "likes": 739, "dislikes": 605, "categoryTitle": "Database", "frontendQuestionId": "1179", "paidOnly": false, "title": "Reformat Department Table", "titleSlug": "reformat-department-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 121696, "totalSubmissionRaw": 158090}, "1180": {"acRate": 79.99654666321334, "difficulty": "Easy", "likes": 355, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1180", "paidOnly": true, "title": "Count Substrings with Only One Distinct Letter", "titleSlug": "count-substrings-with-only-one-distinct-letter", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27798, "totalSubmissionRaw": 34749}, "1181": {"acRate": 45.95195308805447, "difficulty": "Medium", "likes": 74, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1181", "paidOnly": true, "title": "Before and After Puzzle", "titleSlug": "before-and-after-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9717, "totalSubmissionRaw": 21146}, "1182": {"acRate": 55.41235525991623, "difficulty": "Medium", "likes": 516, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1182", "paidOnly": true, "title": "Shortest Distance to Target Color", "titleSlug": "shortest-distance-to-target-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35987, "totalSubmissionRaw": 64944}, "1183": {"acRate": 68.1265206812652, "difficulty": "Hard", "likes": 163, "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": 5040, "totalSubmissionRaw": 7398}, "1184": {"acRate": 54.12053154638815, "difficulty": "Easy", "likes": 758, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1184", "paidOnly": false, "title": "Distance Between Bus Stops", "titleSlug": "distance-between-bus-stops", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62027, "totalSubmissionRaw": 114609}, "1185": {"acRate": 57.68823440415552, "difficulty": "Easy", "likes": 402, "dislikes": 2448, "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": 68634, "totalSubmissionRaw": 118974}, "1186": {"acRate": 44.131436225823315, "difficulty": "Medium", "likes": 1820, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1186", "paidOnly": false, "title": "Maximum Subarray Sum with One Deletion", "titleSlug": "maximum-subarray-sum-with-one-deletion", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54031, "totalSubmissionRaw": 122432}, "1187": {"acRate": 58.14798633727858, "difficulty": "Hard", "likes": 2232, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1187", "paidOnly": false, "title": "Make Array Strictly Increasing", "titleSlug": "make-array-strictly-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58562, "totalSubmissionRaw": 100712}, "1188": {"acRate": 72.45554722532641, "difficulty": "Medium", "likes": 520, "dislikes": 41, "categoryTitle": "Concurrency", "frontendQuestionId": "1188", "paidOnly": true, "title": "Design Bounded Blocking Queue", "titleSlug": "design-bounded-blocking-queue", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51221, "totalSubmissionRaw": 70693}, "1189": {"acRate": 59.67926434529459, "difficulty": "Easy", "likes": 1702, "dislikes": 103, "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": 214427, "totalSubmissionRaw": 359299}, "1190": {"acRate": 71.6850093998936, "difficulty": "Medium", "likes": 2807, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1190", "paidOnly": false, "title": "Reverse Substrings Between Each Pair of Parentheses", "titleSlug": "reverse-substrings-between-each-pair-of-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216964, "totalSubmissionRaw": 302662}, "1191": {"acRate": 23.830387001123572, "difficulty": "Medium", "likes": 1444, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "1191", "paidOnly": false, "title": "K-Concatenation Maximum Sum", "titleSlug": "k-concatenation-maximum-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35844, "totalSubmissionRaw": 150413}, "1192": {"acRate": 56.25921266348076, "difficulty": "Hard", "likes": 6187, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "1192", "paidOnly": false, "title": "Critical Connections in a Network", "titleSlug": "critical-connections-in-a-network", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Biconnected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg0", "slug": "biconnected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239687, "totalSubmissionRaw": 426042}, "1193": {"acRate": 57.86838180044187, "difficulty": "Medium", "likes": 816, "dislikes": 81, "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": 206395, "totalSubmissionRaw": 356664}, "1194": {"acRate": 49.14576602124544, "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": 21143, "totalSubmissionRaw": 43021}, "1195": {"acRate": 72.68319353121449, "difficulty": "Medium", "likes": 604, "dislikes": 408, "categoryTitle": "Concurrency", "frontendQuestionId": "1195", "paidOnly": false, "title": "Fizz Buzz Multithreaded", "titleSlug": "fizz-buzz-multithreaded", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50517, "totalSubmissionRaw": 69503}, "1196": {"acRate": 67.02331405841406, "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": 36395, "totalSubmissionRaw": 54302}, "1197": {"acRate": 40.65379938357369, "difficulty": "Medium", "likes": 1513, "dislikes": 406, "categoryTitle": "Algorithms", "frontendQuestionId": "1197", "paidOnly": true, "title": "Minimum Knight Moves", "titleSlug": "minimum-knight-moves", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159469, "totalSubmissionRaw": 392261}, "1198": {"acRate": 76.49765701378823, "difficulty": "Medium", "likes": 574, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1198", "paidOnly": true, "title": "Find Smallest Common Element in All Rows", "titleSlug": "find-smallest-common-element-in-all-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 45383, "totalSubmissionRaw": 59326}, "1199": {"acRate": 45.74733342568223, "difficulty": "Hard", "likes": 234, "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": 6605, "totalSubmissionRaw": 14438}, "1200": {"acRate": 69.66430250140557, "difficulty": "Easy", "likes": 2351, "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": 199490, "totalSubmissionRaw": 286359}, "1201": {"acRate": 29.700875858530395, "difficulty": "Medium", "likes": 1218, "dislikes": 499, "categoryTitle": "Algorithms", "frontendQuestionId": "1201", "paidOnly": false, "title": "Ugly Number III", "titleSlug": "ugly-number-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32995, "totalSubmissionRaw": 111091}, "1202": {"acRate": 58.47134961030698, "difficulty": "Medium", "likes": 3687, "dislikes": 141, "categoryTitle": "Algorithms", "frontendQuestionId": "1202", "paidOnly": false, "title": "Smallest String With Swaps", "titleSlug": "smallest-string-with-swaps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 117635, "totalSubmissionRaw": 201184}, "1203": {"acRate": 66.23973806485783, "difficulty": "Hard", "likes": 1767, "dislikes": 297, "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": 55028, "totalSubmissionRaw": 83074}, "1204": {"acRate": 67.36530702855048, "difficulty": "Medium", "likes": 715, "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": 139580, "totalSubmissionRaw": 207203}, "1205": {"acRate": 41.80701723250572, "difficulty": "Medium", "likes": 156, "dislikes": 546, "categoryTitle": "Database", "frontendQuestionId": "1205", "paidOnly": true, "title": "Monthly Transactions II", "titleSlug": "monthly-transactions-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23557, "totalSubmissionRaw": 56347}, "1206": {"acRate": 61.711079943899016, "difficulty": "Hard", "likes": 665, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1206", "paidOnly": false, "title": "Design Skiplist", "titleSlug": "design-skiplist", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24200, "totalSubmissionRaw": 39215}, "1207": {"acRate": 77.34930171946536, "difficulty": "Easy", "likes": 5081, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "1207", "paidOnly": false, "title": "Unique Number of Occurrences", "titleSlug": "unique-number-of-occurrences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 670715, "totalSubmissionRaw": 867126}, "1208": {"acRate": 58.30100853374709, "difficulty": "Medium", "likes": 1789, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "1208", "paidOnly": false, "title": "Get Equal Substrings Within Budget", "titleSlug": "get-equal-substrings-within-budget", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160821, "totalSubmissionRaw": 275846}, "1209": {"acRate": 58.13918802546188, "difficulty": "Medium", "likes": 5777, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1209", "paidOnly": false, "title": "Remove All Adjacent Duplicates in String II", "titleSlug": "remove-all-adjacent-duplicates-in-string-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 327433, "totalSubmissionRaw": 563191}, "1210": {"acRate": 49.799827699792225, "difficulty": "Hard", "likes": 270, "dislikes": 71, "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": 9827, "totalSubmissionRaw": 19733}, "1211": {"acRate": 45.36325761836391, "difficulty": "Easy", "likes": 625, "dislikes": 418, "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": 205680, "totalSubmissionRaw": 453405}, "1212": {"acRate": 55.70760460482621, "difficulty": "Medium", "likes": 307, "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": 40261, "totalSubmissionRaw": 72272}, "1213": {"acRate": 79.80075170945976, "difficulty": "Easy", "likes": 583, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1213", "paidOnly": true, "title": "Intersection of Three Sorted Arrays", "titleSlug": "intersection-of-three-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88112, "totalSubmissionRaw": 110415}, "1214": {"acRate": 67.26890756302521, "difficulty": "Medium", "likes": 546, "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": 49631, "totalSubmissionRaw": 73780}, "1215": {"acRate": 47.28590445200414, "difficulty": "Medium", "likes": 183, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1215", "paidOnly": true, "title": "Stepping Numbers", "titleSlug": "stepping-numbers", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9591, "totalSubmissionRaw": 20283}, "1216": {"acRate": 49.29752520119757, "difficulty": "Hard", "likes": 768, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1216", "paidOnly": true, "title": "Valid Palindrome III", "titleSlug": "valid-palindrome-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71787, "totalSubmissionRaw": 145624}, "1217": {"acRate": 71.79294458623524, "difficulty": "Easy", "likes": 2303, "dislikes": 314, "categoryTitle": "Algorithms", "frontendQuestionId": "1217", "paidOnly": false, "title": "Minimum Cost to Move Chips to The Same Position", "titleSlug": "minimum-cost-to-move-chips-to-the-same-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132771, "totalSubmissionRaw": 184936}, "1218": {"acRate": 54.664308179040624, "difficulty": "Medium", "likes": 3212, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1218", "paidOnly": false, "title": "Longest Arithmetic Subsequence of Given Difference", "titleSlug": "longest-arithmetic-subsequence-of-given-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146174, "totalSubmissionRaw": 267403}, "1219": {"acRate": 68.02118875126587, "difficulty": "Medium", "likes": 3284, "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": 218297, "totalSubmissionRaw": 320925}, "1220": {"acRate": 61.82992189357771, "difficulty": "Hard", "likes": 3249, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "1220", "paidOnly": false, "title": "Count Vowels Permutation", "titleSlug": "count-vowels-permutation", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169009, "totalSubmissionRaw": 273345}, "1221": {"acRate": 86.30523209661614, "difficulty": "Easy", "likes": 2743, "dislikes": 940, "categoryTitle": "Algorithms", "frontendQuestionId": "1221", "paidOnly": false, "title": "Split a String in Balanced Strings", "titleSlug": "split-a-string-in-balanced-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 315292, "totalSubmissionRaw": 365322}, "1222": {"acRate": 71.98349153941395, "difficulty": "Medium", "likes": 943, "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": 43604, "totalSubmissionRaw": 60575}, "1223": {"acRate": 49.350332954360894, "difficulty": "Hard", "likes": 931, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "1223", "paidOnly": false, "title": "Dice Roll Simulation", "titleSlug": "dice-roll-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30385, "totalSubmissionRaw": 61570}, "1224": {"acRate": 37.130184608007674, "difficulty": "Hard", "likes": 540, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1224", "paidOnly": false, "title": "Maximum Equal Frequency", "titleSlug": "maximum-equal-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15487, "totalSubmissionRaw": 41710}, "1225": {"acRate": 57.53999855208861, "difficulty": "Hard", "likes": 322, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1225", "paidOnly": true, "title": "Report Contiguous Dates", "titleSlug": "report-contiguous-dates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23844, "totalSubmissionRaw": 41439}, "1226": {"acRate": 53.94376864460485, "difficulty": "Medium", "likes": 351, "dislikes": 332, "categoryTitle": "Concurrency", "frontendQuestionId": "1226", "paidOnly": false, "title": "The Dining Philosophers", "titleSlug": "the-dining-philosophers", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34900, "totalSubmissionRaw": 64697}, "1227": {"acRate": 66.50249319342898, "difficulty": "Medium", "likes": 617, "dislikes": 972, "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": 43478, "totalSubmissionRaw": 65378}, "1228": {"acRate": 51.94126570898807, "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": 27733, "totalSubmissionRaw": 53393}, "1229": {"acRate": 55.00487058168662, "difficulty": "Medium", "likes": 882, "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": 79053, "totalSubmissionRaw": 143720}, "1230": {"acRate": 58.16953824948311, "difficulty": "Medium", "likes": 400, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1230", "paidOnly": true, "title": "Toss Strange Coins", "titleSlug": "toss-strange-coins", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21101, "totalSubmissionRaw": 36275}, "1231": {"acRate": 58.83026318553215, "difficulty": "Hard", "likes": 988, "dislikes": 61, "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": 56016, "totalSubmissionRaw": 95217}, "1232": {"acRate": 39.51098715143896, "difficulty": "Easy", "likes": 2601, "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": 261509, "totalSubmissionRaw": 661864}, "1233": {"acRate": 66.02054259783351, "difficulty": "Medium", "likes": 812, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1233", "paidOnly": false, "title": "Remove Sub-Folders from the Filesystem", "titleSlug": "remove-sub-folders-from-the-filesystem", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54121, "totalSubmissionRaw": 81976}, "1234": {"acRate": 38.52478654817912, "difficulty": "Medium", "likes": 1195, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "1234", "paidOnly": false, "title": "Replace the Substring for Balanced String", "titleSlug": "replace-the-substring-for-balanced-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35375, "totalSubmissionRaw": 91824}, "1235": {"acRate": 54.359784905595546, "difficulty": "Hard", "likes": 6802, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1235", "paidOnly": false, "title": "Maximum Profit in Job Scheduling", "titleSlug": "maximum-profit-in-job-scheduling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 316412, "totalSubmissionRaw": 582070}, "1236": {"acRate": 67.96055171445619, "difficulty": "Medium", "likes": 288, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "1236", "paidOnly": true, "title": "Web Crawler", "titleSlug": "web-crawler", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38728, "totalSubmissionRaw": 56986}, "1237": {"acRate": 69.65043014661335, "difficulty": "Medium", "likes": 517, "dislikes": 1427, "categoryTitle": "Algorithms", "frontendQuestionId": "1237", "paidOnly": false, "title": "Find Positive Integer Solution for a Given Equation", "titleSlug": "find-positive-integer-solution-for-a-given-equation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68979, "totalSubmissionRaw": 99036}, "1238": {"acRate": 70.33538204719629, "difficulty": "Medium", "likes": 421, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "1238", "paidOnly": false, "title": "Circular Permutation in Binary Representation", "titleSlug": "circular-permutation-in-binary-representation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18539, "totalSubmissionRaw": 26358}, "1239": {"acRate": 54.10073225040253, "difficulty": "Medium", "likes": 4421, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "1239", "paidOnly": false, "title": "Maximum Length of a Concatenated String with Unique Characters", "titleSlug": "maximum-length-of-a-concatenated-string-with-unique-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 291320, "totalSubmissionRaw": 538477}, "1240": {"acRate": 54.33629117839644, "difficulty": "Hard", "likes": 687, "dislikes": 568, "categoryTitle": "Algorithms", "frontendQuestionId": "1240", "paidOnly": false, "title": "Tiling a Rectangle with the Fewest Squares", "titleSlug": "tiling-a-rectangle-with-the-fewest-squares", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24065, "totalSubmissionRaw": 44289}, "1241": {"acRate": 65.904263111632, "difficulty": "Easy", "likes": 177, "dislikes": 536, "categoryTitle": "Database", "frontendQuestionId": "1241", "paidOnly": true, "title": "Number of Comments per Post", "titleSlug": "number-of-comments-per-post", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35989, "totalSubmissionRaw": 54608}, "1242": {"acRate": 49.344015063680665, "difficulty": "Medium", "likes": 534, "dislikes": 90, "categoryTitle": "Concurrency", "frontendQuestionId": "1242", "paidOnly": true, "title": "Web Crawler Multithreaded", "titleSlug": "web-crawler-multithreaded", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56604, "totalSubmissionRaw": 114713}, "1243": {"acRate": 52.335769216053876, "difficulty": "Easy", "likes": 151, "dislikes": 71, "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": 13679, "totalSubmissionRaw": 26137}, "1244": {"acRate": 67.89486568084354, "difficulty": "Medium", "likes": 773, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1244", "paidOnly": true, "title": "Design A Leaderboard", "titleSlug": "design-a-leaderboard", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74886, "totalSubmissionRaw": 110297}, "1245": {"acRate": 61.213250073700856, "difficulty": "Medium", "likes": 853, "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": 45681, "totalSubmissionRaw": 74626}, "1246": {"acRate": 46.42658806441967, "difficulty": "Hard", "likes": 310, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1246", "paidOnly": true, "title": "Palindrome Removal", "titleSlug": "palindrome-removal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10868, "totalSubmissionRaw": 23409}, "1247": {"acRate": 64.4383379921353, "difficulty": "Medium", "likes": 1382, "dislikes": 241, "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": 40803, "totalSubmissionRaw": 63321}, "1248": {"acRate": 71.27273120418621, "difficulty": "Medium", "likes": 4568, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1248", "paidOnly": false, "title": "Count Number of Nice Subarrays", "titleSlug": "count-number-of-nice-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 263692, "totalSubmissionRaw": 369976}, "1249": {"acRate": 69.13366596040372, "difficulty": "Medium", "likes": 6879, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1249", "paidOnly": false, "title": "Minimum Remove to Make Valid Parentheses", "titleSlug": "minimum-remove-to-make-valid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 758619, "totalSubmissionRaw": 1097322}, "1250": {"acRate": 59.76328442855382, "difficulty": "Hard", "likes": 508, "dislikes": 377, "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": 24237, "totalSubmissionRaw": 40555}, "1251": {"acRate": 37.93373964859017, "difficulty": "Easy", "likes": 1181, "dislikes": 166, "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": 267879, "totalSubmissionRaw": 706169}, "1252": {"acRate": 78.77991945151601, "difficulty": "Easy", "likes": 1218, "dislikes": 1520, "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": 116974, "totalSubmissionRaw": 148482}, "1253": {"acRate": 46.71112358252315, "difficulty": "Medium", "likes": 463, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1253", "paidOnly": false, "title": "Reconstruct a 2-Row Binary Matrix", "titleSlug": "reconstruct-a-2-row-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28299, "totalSubmissionRaw": 60583}, "1254": {"acRate": 66.4094327457143, "difficulty": "Medium", "likes": 4541, "dislikes": 165, "categoryTitle": "Algorithms", "frontendQuestionId": "1254", "paidOnly": false, "title": "Number of Closed Islands", "titleSlug": "number-of-closed-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229683, "totalSubmissionRaw": 345859}, "1255": {"acRate": 82.11039491731397, "difficulty": "Hard", "likes": 1740, "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": 115540, "totalSubmissionRaw": 140713}, "1256": {"acRate": 69.7941726811013, "difficulty": "Medium", "likes": 78, "dislikes": 251, "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": 7833, "totalSubmissionRaw": 11223}, "1257": {"acRate": 65.89627511714717, "difficulty": "Medium", "likes": 435, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1257", "paidOnly": true, "title": "Smallest Common Region", "titleSlug": "smallest-common-region", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24891, "totalSubmissionRaw": 37773}, "1258": {"acRate": 56.38765455950541, "difficulty": "Medium", "likes": 353, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "1258", "paidOnly": true, "title": "Synonymous Sentences", "titleSlug": "synonymous-sentences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23349, "totalSubmissionRaw": 41408}, "1259": {"acRate": 59.64388689362132, "difficulty": "Hard", "likes": 232, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1259", "paidOnly": true, "title": "Handshakes That Don't Cross", "titleSlug": "handshakes-that-dont-cross", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11791, "totalSubmissionRaw": 19769}, "1260": {"acRate": 67.41350413398214, "difficulty": "Easy", "likes": 1726, "dislikes": 342, "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": 108198, "totalSubmissionRaw": 160499}, "1261": {"acRate": 77.47702394193058, "difficulty": "Medium", "likes": 992, "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": 66177, "totalSubmissionRaw": 85415}, "1262": {"acRate": 50.585536533552315, "difficulty": "Medium", "likes": 1811, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1262", "paidOnly": false, "title": "Greatest Sum Divisible by Three", "titleSlug": "greatest-sum-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56673, "totalSubmissionRaw": 112034}, "1263": {"acRate": 49.052300568446874, "difficulty": "Hard", "likes": 849, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1263", "paidOnly": false, "title": "Minimum Moves to Move a Box to Their Target Location", "titleSlug": "minimum-moves-to-move-a-box-to-their-target-location", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28390, "totalSubmissionRaw": 57877}, "1264": {"acRate": 65.20589745913774, "difficulty": "Medium", "likes": 249, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1264", "paidOnly": true, "title": "Page Recommendations", "titleSlug": "page-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43165, "totalSubmissionRaw": 66198}, "1265": {"acRate": 94.04942328861094, "difficulty": "Medium", "likes": 578, "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": 58953, "totalSubmissionRaw": 62683}, "1266": {"acRate": 82.47010973508469, "difficulty": "Easy", "likes": 2198, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1266", "paidOnly": false, "title": "Minimum Time Visiting All Points", "titleSlug": "minimum-time-visiting-all-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235006, "totalSubmissionRaw": 284959}, "1267": {"acRate": 60.59314828707176, "difficulty": "Medium", "likes": 1299, "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": 60578, "totalSubmissionRaw": 99975}, "1268": {"acRate": 65.09235587500051, "difficulty": "Medium", "likes": 4727, "dislikes": 241, "categoryTitle": "Algorithms", "frontendQuestionId": "1268", "paidOnly": false, "title": "Search Suggestions System", "titleSlug": "search-suggestions-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 321314, "totalSubmissionRaw": 493628}, "1269": {"acRate": 50.29335709163606, "difficulty": "Hard", "likes": 1548, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1269", "paidOnly": false, "title": "Number of Ways to Stay in the Same Place After Some Steps", "titleSlug": "number-of-ways-to-stay-in-the-same-place-after-some-steps", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92578, "totalSubmissionRaw": 184076}, "1270": {"acRate": 84.74622233605014, "difficulty": "Medium", "likes": 420, "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": 56252, "totalSubmissionRaw": 66377}, "1271": {"acRate": 58.06717919611991, "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": 11254, "totalSubmissionRaw": 19381}, "1272": {"acRate": 66.21010304096507, "difficulty": "Medium", "likes": 462, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1272", "paidOnly": true, "title": "Remove Interval", "titleSlug": "remove-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 36883, "totalSubmissionRaw": 55706}, "1273": {"acRate": 61.1349855772061, "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": 10385, "totalSubmissionRaw": 16987}, "1274": {"acRate": 68.66338951310863, "difficulty": "Hard", "likes": 526, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1274", "paidOnly": true, "title": "Number of Ships in a Rectangle", "titleSlug": "number-of-ships-in-a-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29333, "totalSubmissionRaw": 42720}, "1275": {"acRate": 53.91167611255404, "difficulty": "Easy", "likes": 1489, "dislikes": 348, "categoryTitle": "Algorithms", "frontendQuestionId": "1275", "paidOnly": false, "title": "Find Winner on a Tic Tac Toe Game", "titleSlug": "find-winner-on-a-tic-tac-toe-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129939, "totalSubmissionRaw": 241022}, "1276": {"acRate": 51.14067712127602, "difficulty": "Medium", "likes": 330, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "1276", "paidOnly": false, "title": "Number of Burgers with No Waste of Ingredients", "titleSlug": "number-of-burgers-with-no-waste-of-ingredients", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26676, "totalSubmissionRaw": 52162}, "1277": {"acRate": 75.4164783260945, "difficulty": "Medium", "likes": 4866, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "1277", "paidOnly": false, "title": "Count Square Submatrices with All Ones", "titleSlug": "count-square-submatrices-with-all-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 230245, "totalSubmissionRaw": 305298}, "1278": {"acRate": 61.10062436474517, "difficulty": "Hard", "likes": 1148, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1278", "paidOnly": false, "title": "Palindrome Partitioning III", "titleSlug": "palindrome-partitioning-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29456, "totalSubmissionRaw": 48209}, "1279": {"acRate": 72.8732747804266, "difficulty": "Easy", "likes": 75, "dislikes": 352, "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": 14520, "totalSubmissionRaw": 19925}, "1280": {"acRate": 58.0135770947747, "difficulty": "Easy", "likes": 1759, "dislikes": 239, "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": 289019, "totalSubmissionRaw": 498192}, "1281": {"acRate": 86.5478092360356, "difficulty": "Easy", "likes": 2570, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "1281", "paidOnly": false, "title": "Subtract the Product and Sum of Digits of an Integer", "titleSlug": "subtract-the-product-and-sum-of-digits-of-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 508696, "totalSubmissionRaw": 587763}, "1282": {"acRate": 87.4392063837922, "difficulty": "Medium", "likes": 2993, "dislikes": 707, "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": 212688, "totalSubmissionRaw": 243241}, "1283": {"acRate": 60.88153208937979, "difficulty": "Medium", "likes": 2924, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "1283", "paidOnly": false, "title": "Find the Smallest Divisor Given a Threshold", "titleSlug": "find-the-smallest-divisor-given-a-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 205490, "totalSubmissionRaw": 337525}, "1284": {"acRate": 72.14317807398533, "difficulty": "Hard", "likes": 966, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "1284", "paidOnly": false, "title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "titleSlug": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33719, "totalSubmissionRaw": 46739}, "1285": {"acRate": 82.32753275740917, "difficulty": "Medium", "likes": 559, "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": 39835, "totalSubmissionRaw": 48386}, "1286": {"acRate": 73.29571374734712, "difficulty": "Medium", "likes": 1363, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1286", "paidOnly": false, "title": "Iterator for Combination", "titleSlug": "iterator-for-combination", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73907, "totalSubmissionRaw": 100834}, "1287": {"acRate": 60.97555549375679, "difficulty": "Easy", "likes": 1701, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1287", "paidOnly": false, "title": "Element Appearing More Than 25% In Sorted Array", "titleSlug": "element-appearing-more-than-25-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219256, "totalSubmissionRaw": 359582}, "1288": {"acRate": 56.31525548791736, "difficulty": "Medium", "likes": 2227, "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": 122114, "totalSubmissionRaw": 216840}, "1289": {"acRate": 64.32345395504045, "difficulty": "Hard", "likes": 2250, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "1289", "paidOnly": false, "title": "Minimum Falling Path Sum II", "titleSlug": "minimum-falling-path-sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143413, "totalSubmissionRaw": 222956}, "1290": {"acRate": 81.10108782170336, "difficulty": "Easy", "likes": 4153, "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": 489070, "totalSubmissionRaw": 603038}, "1291": {"acRate": 65.2685494855732, "difficulty": "Medium", "likes": 2860, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "1291", "paidOnly": false, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [{"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219940, "totalSubmissionRaw": 336977}, "1292": {"acRate": 53.57350013325182, "difficulty": "Medium", "likes": 1082, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1292", "paidOnly": false, "title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "titleSlug": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34174, "totalSubmissionRaw": 63789}, "1293": {"acRate": 45.288081717655885, "difficulty": "Hard", "likes": 4510, "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": 214850, "totalSubmissionRaw": 474410}, "1294": {"acRate": 66.74392808066092, "difficulty": "Easy", "likes": 140, "dislikes": 30, "categoryTitle": "Database", "frontendQuestionId": "1294", "paidOnly": true, "title": "Weather Type in Each Country", "titleSlug": "weather-type-in-each-country", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40314, "totalSubmissionRaw": 60401}, "1295": {"acRate": 77.38077716853037, "difficulty": "Easy", "likes": 2387, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1295", "paidOnly": false, "title": "Find Numbers with Even Number of Digits", "titleSlug": "find-numbers-with-even-number-of-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 699262, "totalSubmissionRaw": 903664}, "1296": {"acRate": 58.49990233739176, "difficulty": "Medium", "likes": 1862, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1296", "paidOnly": false, "title": "Divide Array in Sets of K Consecutive Numbers", "titleSlug": "divide-array-in-sets-of-k-consecutive-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 98835, "totalSubmissionRaw": 168949}, "1297": {"acRate": 52.08522126566984, "difficulty": "Medium", "likes": 1084, "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": 55177, "totalSubmissionRaw": 105936}, "1298": {"acRate": 57.8083466241361, "difficulty": "Hard", "likes": 344, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1298", "paidOnly": false, "title": "Maximum Candies You Can Get from Boxes", "titleSlug": "maximum-candies-you-can-get-from-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17398, "totalSubmissionRaw": 30096}, "1299": {"acRate": 71.23672660090631, "difficulty": "Easy", "likes": 2584, "dislikes": 244, "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": 400235, "totalSubmissionRaw": 561838}, "1300": {"acRate": 44.60992666643998, "difficulty": "Medium", "likes": 1145, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "1300", "paidOnly": false, "title": "Sum of Mutated Array Closest to Target", "titleSlug": "sum-of-mutated-array-closest-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39358, "totalSubmissionRaw": 88227}, "1301": {"acRate": 39.63913006589553, "difficulty": "Hard", "likes": 513, "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": 14016, "totalSubmissionRaw": 35359}, "1302": {"acRate": 86.32124246761647, "difficulty": "Medium", "likes": 4696, "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": 338928, "totalSubmissionRaw": 392636}, "1303": {"acRate": 89.54497434349533, "difficulty": "Easy", "likes": 333, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "1303", "paidOnly": true, "title": "Find the Team Size", "titleSlug": "find-the-team-size", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71199, "totalSubmissionRaw": 79512}, "1304": {"acRate": 76.16233147215034, "difficulty": "Easy", "likes": 1987, "dislikes": 598, "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": 223704, "totalSubmissionRaw": 293720}, "1305": {"acRate": 79.82286338419613, "difficulty": "Medium", "likes": 3063, "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": 221439, "totalSubmissionRaw": 277413}, "1306": {"acRate": 65.09324582991523, "difficulty": "Medium", "likes": 4146, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1306", "paidOnly": false, "title": "Jump Game III", "titleSlug": "jump-game-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 238046, "totalSubmissionRaw": 365700}, "1307": {"acRate": 34.519685807679174, "difficulty": "Hard", "likes": 503, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1307", "paidOnly": false, "title": "Verbal Arithmetic Puzzle", "titleSlug": "verbal-arithmetic-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14151, "totalSubmissionRaw": 40994}, "1308": {"acRate": 86.40724057390725, "difficulty": "Medium", "likes": 215, "dislikes": 62, "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": 41434, "totalSubmissionRaw": 47952}, "1309": {"acRate": 79.81127825194604, "difficulty": "Easy", "likes": 1538, "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": 127548, "totalSubmissionRaw": 159812}, "1310": {"acRate": 73.18957859255023, "difficulty": "Medium", "likes": 1498, "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": 60145, "totalSubmissionRaw": 82177}, "1311": {"acRate": 47.53879335025671, "difficulty": "Medium", "likes": 401, "dislikes": 421, "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": 24907, "totalSubmissionRaw": 52393}, "1312": {"acRate": 71.10376347815364, "difficulty": "Hard", "likes": 5056, "dislikes": 65, "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": 184510, "totalSubmissionRaw": 259494}, "1313": {"acRate": 85.80755092059384, "difficulty": "Easy", "likes": 1267, "dislikes": 1318, "categoryTitle": "Algorithms", "frontendQuestionId": "1313", "paidOnly": false, "title": "Decompress Run-Length Encoded List", "titleSlug": "decompress-run-length-encoded-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 271937, "totalSubmissionRaw": 316915}, "1314": {"acRate": 75.56466797773965, "difficulty": "Medium", "likes": 2395, "dislikes": 376, "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": 90296, "totalSubmissionRaw": 119495}, "1315": {"acRate": 85.5835501268174, "difficulty": "Medium", "likes": 2748, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1315", "paidOnly": false, "title": "Sum of Nodes with Even-Valued Grandparent", "titleSlug": "sum-of-nodes-with-even-valued-grandparent", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157579, "totalSubmissionRaw": 184123}, "1316": {"acRate": 50.72044407700484, "difficulty": "Hard", "likes": 316, "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": 17178, "totalSubmissionRaw": 33868}, "1317": {"acRate": 53.95100551719507, "difficulty": "Easy", "likes": 412, "dislikes": 314, "categoryTitle": "Algorithms", "frontendQuestionId": "1317", "paidOnly": false, "title": "Convert Integer to the Sum of Two No-Zero Integers", "titleSlug": "convert-integer-to-the-sum-of-two-no-zero-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48209, "totalSubmissionRaw": 89357}, "1318": {"acRate": 71.10866569087277, "difficulty": "Medium", "likes": 1977, "dislikes": 99, "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": 133114, "totalSubmissionRaw": 187198}, "1319": {"acRate": 63.17370666346211, "difficulty": "Medium", "likes": 5022, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1319", "paidOnly": false, "title": "Number of Operations to Make Network Connected", "titleSlug": "number-of-operations-to-make-network-connected", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231308, "totalSubmissionRaw": 366146}, "1320": {"acRate": 59.0749360660865, "difficulty": "Hard", "likes": 1003, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1320", "paidOnly": false, "title": "Minimum Distance to Type a Word Using Two Fingers", "titleSlug": "minimum-distance-to-type-a-word-using-two-fingers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32109, "totalSubmissionRaw": 54353}, "1321": {"acRate": 52.06900856365316, "difficulty": "Medium", "likes": 779, "dislikes": 292, "categoryTitle": "Database", "frontendQuestionId": "1321", "paidOnly": false, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104275, "totalSubmissionRaw": 200264}, "1322": {"acRate": 59.39793218212074, "difficulty": "Easy", "likes": 259, "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": 43547, "totalSubmissionRaw": 73314}, "1323": {"acRate": 82.39496207555669, "difficulty": "Easy", "likes": 2794, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "1323", "paidOnly": false, "title": "Maximum 69 Number", "titleSlug": "maximum-69-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 270707, "totalSubmissionRaw": 328548}, "1324": {"acRate": 64.39645115736477, "difficulty": "Medium", "likes": 782, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1324", "paidOnly": false, "title": "Print Words Vertically", "titleSlug": "print-words-vertically", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41953, "totalSubmissionRaw": 65148}, "1325": {"acRate": 77.44593538301199, "difficulty": "Medium", "likes": 2744, "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": 214010, "totalSubmissionRaw": 276335}, "1326": {"acRate": 50.82326326703742, "difficulty": "Hard", "likes": 3400, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1326", "paidOnly": false, "title": "Minimum Number of Taps to Open to Water a Garden", "titleSlug": "minimum-number-of-taps-to-open-to-water-a-garden", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134796, "totalSubmissionRaw": 265225}, "1327": {"acRate": 70.92605423870833, "difficulty": "Easy", "likes": 372, "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": 132045, "totalSubmissionRaw": 186174}, "1328": {"acRate": 51.722777881483, "difficulty": "Medium", "likes": 2334, "dislikes": 748, "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": 171791, "totalSubmissionRaw": 332138}, "1329": {"acRate": 82.92019950124688, "difficulty": "Medium", "likes": 3393, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "1329", "paidOnly": false, "title": "Sort the Matrix Diagonally", "titleSlug": "sort-the-matrix-diagonally", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 166255, "totalSubmissionRaw": 200500}, "1330": {"acRate": 41.684738411493626, "difficulty": "Hard", "likes": 479, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1330", "paidOnly": false, "title": "Reverse Subarray To Maximize Array Value", "titleSlug": "reverse-subarray-to-maximize-array-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6151, "totalSubmissionRaw": 14756}, "1331": {"acRate": 62.496250555952045, "difficulty": "Easy", "likes": 1696, "dislikes": 89, "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": 120844, "totalSubmissionRaw": 193362}, "1332": {"acRate": 76.48879228518312, "difficulty": "Easy", "likes": 1664, "dislikes": 1767, "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": 136186, "totalSubmissionRaw": 178047}, "1333": {"acRate": 61.6094351732991, "difficulty": "Medium", "likes": 306, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1333", "paidOnly": false, "title": "Filter Restaurants by Vegan-Friendly, Price and Distance", "titleSlug": "filter-restaurants-by-vegan-friendly-price-and-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30716, "totalSubmissionRaw": 49856}, "1334": {"acRate": 68.20414166218008, "difficulty": "Medium", "likes": 3157, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "1334", "paidOnly": false, "title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance", "titleSlug": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 207756, "totalSubmissionRaw": 304610}, "1335": {"acRate": 59.58065710904541, "difficulty": "Hard", "likes": 3413, "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": 197862, "totalSubmissionRaw": 332091}, "1336": {"acRate": 47.64226431947598, "difficulty": "Hard", "likes": 91, "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": 12801, "totalSubmissionRaw": 26869}, "1337": {"acRate": 73.5716561778061, "difficulty": "Easy", "likes": 4172, "dislikes": 232, "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": 369418, "totalSubmissionRaw": 502120}, "1338": {"acRate": 68.94564747549396, "difficulty": "Medium", "likes": 3255, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1338", "paidOnly": false, "title": "Reduce Array Size to The Half", "titleSlug": "reduce-array-size-to-the-half", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 197783, "totalSubmissionRaw": 286868}, "1339": {"acRate": 47.68845951540333, "difficulty": "Medium", "likes": 3010, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1339", "paidOnly": false, "title": "Maximum Product of Splitted Binary Tree", "titleSlug": "maximum-product-of-splitted-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126022, "totalSubmissionRaw": 264261}, "1340": {"acRate": 63.44739305706807, "difficulty": "Hard", "likes": 1106, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1340", "paidOnly": false, "title": "Jump Game V", "titleSlug": "jump-game-v", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33209, "totalSubmissionRaw": 52341}, "1341": {"acRate": 40.12551138226448, "difficulty": "Medium", "likes": 583, "dislikes": 188, "categoryTitle": "Database", "frontendQuestionId": "1341", "paidOnly": false, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 112597, "totalSubmissionRaw": 280612}, "1342": {"acRate": 85.25443769599671, "difficulty": "Easy", "likes": 3957, "dislikes": 170, "categoryTitle": "Algorithms", "frontendQuestionId": "1342", "paidOnly": false, "title": "Number of Steps to Reduce a Number to Zero", "titleSlug": "number-of-steps-to-reduce-a-number-to-zero", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 696510, "totalSubmissionRaw": 816978}, "1343": {"acRate": 68.69660359557629, "difficulty": "Medium", "likes": 1596, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1343", "paidOnly": false, "title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "titleSlug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104853, "totalSubmissionRaw": 152632}, "1344": {"acRate": 63.869212606508576, "difficulty": "Medium", "likes": 1315, "dislikes": 240, "categoryTitle": "Algorithms", "frontendQuestionId": "1344", "paidOnly": false, "title": "Angle Between Hands of a Clock", "titleSlug": "angle-between-hands-of-a-clock", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124430, "totalSubmissionRaw": 194820}, "1345": {"acRate": 46.17424899471734, "difficulty": "Hard", "likes": 3734, "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": 146407, "totalSubmissionRaw": 317075}, "1346": {"acRate": 37.34950286602465, "difficulty": "Easy", "likes": 1924, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "1346", "paidOnly": false, "title": "Check If N and Its Double Exist", "titleSlug": "check-if-n-and-its-double-exist", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 363327, "totalSubmissionRaw": 972773}, "1347": {"acRate": 82.0593426623444, "difficulty": "Medium", "likes": 2714, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "1347", "paidOnly": false, "title": "Minimum Number of Steps to Make Two Strings Anagram", "titleSlug": "minimum-number-of-steps-to-make-two-strings-anagram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 284524, "totalSubmissionRaw": 346729}, "1348": {"acRate": 44.629592451315, "difficulty": "Medium", "likes": 193, "dislikes": 299, "categoryTitle": "Algorithms", "frontendQuestionId": "1348", "paidOnly": false, "title": "Tweet Counts Per Frequency", "titleSlug": "tweet-counts-per-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33345, "totalSubmissionRaw": 74715}, "1349": {"acRate": 50.71138211382114, "difficulty": "Hard", "likes": 828, "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": 16966, "totalSubmissionRaw": 33456}, "1350": {"acRate": 89.72398417383658, "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": 57147, "totalSubmissionRaw": 63692}, "1351": {"acRate": 77.40371928199438, "difficulty": "Easy", "likes": 4969, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1351", "paidOnly": false, "title": "Count Negative Numbers in a Sorted Matrix", "titleSlug": "count-negative-numbers-in-a-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 431161, "totalSubmissionRaw": 557030}, "1352": {"acRate": 51.7373189755463, "difficulty": "Medium", "likes": 1483, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1352", "paidOnly": false, "title": "Product of the Last K Numbers", "titleSlug": "product-of-the-last-k-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90278, "totalSubmissionRaw": 174493}, "1353": {"acRate": 32.48537367332286, "difficulty": "Medium", "likes": 3043, "dislikes": 425, "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": 91395, "totalSubmissionRaw": 281342}, "1354": {"acRate": 36.17643718872853, "difficulty": "Hard", "likes": 2038, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1354", "paidOnly": false, "title": "Construct Target Array With Multiple Sums", "titleSlug": "construct-target-array-with-multiple-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66900, "totalSubmissionRaw": 184927}, "1355": {"acRate": 72.3907107126459, "difficulty": "Medium", "likes": 146, "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": 29956, "totalSubmissionRaw": 41381}, "1356": {"acRate": 78.29377118180825, "difficulty": "Easy", "likes": 2451, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1356", "paidOnly": false, "title": "Sort Integers by The Number of 1 Bits", "titleSlug": "sort-integers-by-the-number-of-1-bits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229168, "totalSubmissionRaw": 292703}, "1357": {"acRate": 71.17061214358847, "difficulty": "Medium", "likes": 193, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1357", "paidOnly": false, "title": "Apply Discount Every n Orders", "titleSlug": "apply-discount-every-n-orders", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22939, "totalSubmissionRaw": 32231}, "1358": {"acRate": 67.46951883300675, "difficulty": "Medium", "likes": 3251, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1358", "paidOnly": false, "title": "Number of Substrings Containing All Three Characters", "titleSlug": "number-of-substrings-containing-all-three-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123954, "totalSubmissionRaw": 183719}, "1359": {"acRate": 65.00267203168715, "difficulty": "Hard", "likes": 3032, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1359", "paidOnly": false, "title": "Count All Valid Pickup and Delivery Options", "titleSlug": "count-all-valid-pickup-and-delivery-options", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124068, "totalSubmissionRaw": 190866}, "1360": {"acRate": 50.08706071782966, "difficulty": "Easy", "likes": 371, "dislikes": 1279, "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": 53504, "totalSubmissionRaw": 106822}, "1361": {"acRate": 43.82336964722214, "difficulty": "Medium", "likes": 2129, "dislikes": 507, "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": 116174, "totalSubmissionRaw": 265096}, "1362": {"acRate": 60.858539162594106, "difficulty": "Medium", "likes": 322, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1362", "paidOnly": false, "title": "Closest Divisors", "titleSlug": "closest-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23038, "totalSubmissionRaw": 37855}, "1363": {"acRate": 32.64738346160243, "difficulty": "Hard", "likes": 603, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1363", "paidOnly": false, "title": "Largest Multiple of Three", "titleSlug": "largest-multiple-of-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21592, "totalSubmissionRaw": 66137}, "1364": {"acRate": 75.03945388483135, "difficulty": "Medium", "likes": 88, "dislikes": 385, "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": 20446, "totalSubmissionRaw": 27247}, "1365": {"acRate": 86.87877107677946, "difficulty": "Easy", "likes": 5463, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "1365", "paidOnly": false, "title": "How Many Numbers Are Smaller Than the Current Number", "titleSlug": "how-many-numbers-are-smaller-than-the-current-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 584449, "totalSubmissionRaw": 672718}, "1366": {"acRate": 58.52047454443272, "difficulty": "Medium", "likes": 1453, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "1366", "paidOnly": false, "title": "Rank Teams by Votes", "titleSlug": "rank-teams-by-votes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76014, "totalSubmissionRaw": 129893}, "1367": {"acRate": 43.998238512220325, "difficulty": "Medium", "likes": 2243, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1367", "paidOnly": false, "title": "Linked List in Binary Tree", "titleSlug": "linked-list-in-binary-tree", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77931, "totalSubmissionRaw": 177123}, "1368": {"acRate": 62.27012668573764, "difficulty": "Hard", "likes": 1767, "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": 48760, "totalSubmissionRaw": 78304}, "1369": {"acRate": 67.66498239167049, "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": 22096, "totalSubmissionRaw": 32655}, "1370": {"acRate": 76.52303262040753, "difficulty": "Easy", "likes": 780, "dislikes": 864, "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": 80252, "totalSubmissionRaw": 104873}, "1371": {"acRate": 64.07078427322178, "difficulty": "Medium", "likes": 1629, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1371", "paidOnly": false, "title": "Find the Longest Substring Containing Vowels in Even Counts", "titleSlug": "find-the-longest-substring-containing-vowels-in-even-counts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27915, "totalSubmissionRaw": 43569}, "1372": {"acRate": 65.9119822485207, "difficulty": "Medium", "likes": 3449, "dislikes": 74, "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": 178226, "totalSubmissionRaw": 270400}, "1373": {"acRate": 41.64994461657008, "difficulty": "Hard", "likes": 2661, "dislikes": 182, "categoryTitle": "Algorithms", "frontendQuestionId": "1373", "paidOnly": false, "title": "Maximum Sum BST in Binary Tree", "titleSlug": "maximum-sum-bst-in-binary-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77834, "totalSubmissionRaw": 186878}, "1374": {"acRate": 77.92913994779751, "difficulty": "Easy", "likes": 483, "dislikes": 1275, "categoryTitle": "Algorithms", "frontendQuestionId": "1374", "paidOnly": false, "title": "Generate a String With Characters That Have Odd Counts", "titleSlug": "generate-a-string-with-characters-that-have-odd-counts", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96735, "totalSubmissionRaw": 124132}, "1375": {"acRate": 65.75986256825573, "difficulty": "Medium", "likes": 942, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1375", "paidOnly": false, "title": "Number of Times Binary String Is Prefix-Aligned", "titleSlug": "number-of-times-binary-string-is-prefix-aligned", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53591, "totalSubmissionRaw": 81495}, "1376": {"acRate": 60.018946694100464, "difficulty": "Medium", "likes": 4085, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "1376", "paidOnly": false, "title": "Time Needed to Inform All Employees", "titleSlug": "time-needed-to-inform-all-employees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 221110, "totalSubmissionRaw": 368399}, "1377": {"acRate": 35.47634373994207, "difficulty": "Hard", "likes": 788, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "1377", "paidOnly": false, "title": "Frog Position After T Seconds", "titleSlug": "frog-position-after-t-seconds", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30863, "totalSubmissionRaw": 86996}, "1378": {"acRate": 83.12532501300052, "difficulty": "Easy", "likes": 1226, "dislikes": 114, "categoryTitle": "Database", "frontendQuestionId": "1378", "paidOnly": false, "title": "Replace Employee ID With The Unique Identifier", "titleSlug": "replace-employee-id-with-the-unique-identifier", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 537078, "totalSubmissionRaw": 646107}, "1379": {"acRate": 85.88382261086821, "difficulty": "Easy", "likes": 1749, "dislikes": 2004, "categoryTitle": "Algorithms", "frontendQuestionId": "1379", "paidOnly": false, "title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree", "titleSlug": "find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235125, "totalSubmissionRaw": 273771}, "1380": {"acRate": 79.89452952496381, "difficulty": "Easy", "likes": 2179, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1380", "paidOnly": false, "title": "Lucky Numbers in a Matrix", "titleSlug": "lucky-numbers-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 247856, "totalSubmissionRaw": 310229}, "1381": {"acRate": 77.17606543263021, "difficulty": "Medium", "likes": 1823, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1381", "paidOnly": false, "title": "Design a Stack With Increment Operation", "titleSlug": "design-a-stack-with-increment-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 116532, "totalSubmissionRaw": 150995}, "1382": {"acRate": 84.6758512403812, "difficulty": "Medium", "likes": 3641, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1382", "paidOnly": false, "title": "Balance a Binary Search Tree", "titleSlug": "balance-a-binary-search-tree", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 255622, "totalSubmissionRaw": 301883}, "1383": {"acRate": 47.71555740597553, "difficulty": "Hard", "likes": 3099, "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": 96269, "totalSubmissionRaw": 201756}, "1384": {"acRate": 61.3566593926841, "difficulty": "Hard", "likes": 228, "dislikes": 129, "categoryTitle": "Database", "frontendQuestionId": "1384", "paidOnly": true, "title": "Total Sales Amount by Year", "titleSlug": "total-sales-amount-by-year", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16589, "totalSubmissionRaw": 27037}, "1385": {"acRate": 68.77092638411362, "difficulty": "Easy", "likes": 909, "dislikes": 3051, "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": 107010, "totalSubmissionRaw": 155604}, "1386": {"acRate": 42.16012457348049, "difficulty": "Medium", "likes": 904, "dislikes": 398, "categoryTitle": "Algorithms", "frontendQuestionId": "1386", "paidOnly": false, "title": "Cinema Seat Allocation", "titleSlug": "cinema-seat-allocation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49547, "totalSubmissionRaw": 117521}, "1387": {"acRate": 70.12813766832427, "difficulty": "Medium", "likes": 1448, "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": 94626, "totalSubmissionRaw": 134933}, "1388": {"acRate": 52.06283378000352, "difficulty": "Hard", "likes": 1061, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1388", "paidOnly": false, "title": "Pizza With 3n Slices", "titleSlug": "pizza-with-3n-slices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26614, "totalSubmissionRaw": 51119}, "1389": {"acRate": 85.9508964669246, "difficulty": "Easy", "likes": 2043, "dislikes": 1866, "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": 257239, "totalSubmissionRaw": 299286}, "1390": {"acRate": 43.01338014803568, "difficulty": "Medium", "likes": 415, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "1390", "paidOnly": false, "title": "Four Divisors", "titleSlug": "four-divisors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36262, "totalSubmissionRaw": 84304}, "1391": {"acRate": 48.14405332899764, "difficulty": "Medium", "likes": 827, "dislikes": 315, "categoryTitle": "Algorithms", "frontendQuestionId": "1391", "paidOnly": false, "title": "Check if There is a Valid Path in a Grid", "titleSlug": "check-if-there-is-a-valid-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29611, "totalSubmissionRaw": 61505}, "1392": {"acRate": 46.3476466542203, "difficulty": "Hard", "likes": 1357, "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": 47168, "totalSubmissionRaw": 101770}, "1393": {"acRate": 85.35555899910715, "difficulty": "Medium", "likes": 817, "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": 115673, "totalSubmissionRaw": 135519}, "1394": {"acRate": 67.54169448023555, "difficulty": "Easy", "likes": 1150, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1394", "paidOnly": false, "title": "Find Lucky Integer in an Array", "titleSlug": "find-lucky-integer-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130524, "totalSubmissionRaw": 193250}, "1395": {"acRate": 70.15847667423455, "difficulty": "Medium", "likes": 3329, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1395", "paidOnly": false, "title": "Count Number of Teams", "titleSlug": "count-number-of-teams", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 218783, "totalSubmissionRaw": 311839}, "1396": {"acRate": 74.69936577217717, "difficulty": "Medium", "likes": 3506, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1396", "paidOnly": false, "title": "Design Underground System", "titleSlug": "design-underground-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233440, "totalSubmissionRaw": 312506}, "1397": {"acRate": 42.44127936031984, "difficulty": "Hard", "likes": 488, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "1397", "paidOnly": false, "title": "Find All Good Strings", "titleSlug": "find-all-good-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6794, "totalSubmissionRaw": 16008}, "1398": {"acRate": 72.60522298549776, "difficulty": "Medium", "likes": 303, "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": 53269, "totalSubmissionRaw": 73368}, "1399": {"acRate": 66.37350690621211, "difficulty": "Easy", "likes": 443, "dislikes": 983, "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": 47621, "totalSubmissionRaw": 71747}, "1400": {"acRate": 62.162912574185256, "difficulty": "Medium", "likes": 1053, "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": 53733, "totalSubmissionRaw": 86439}, "1401": {"acRate": 46.601811652462885, "difficulty": "Medium", "likes": 372, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "1401", "paidOnly": false, "title": "Circle and Rectangle Overlapping", "titleSlug": "circle-and-rectangle-overlapping", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17389, "totalSubmissionRaw": 37314}, "1402": {"acRate": 76.22676787692183, "difficulty": "Hard", "likes": 3306, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "1402", "paidOnly": false, "title": "Reducing Dishes", "titleSlug": "reducing-dishes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150028, "totalSubmissionRaw": 196818}, "1403": {"acRate": 72.68701550387597, "difficulty": "Easy", "likes": 585, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "1403", "paidOnly": false, "title": "Minimum Subsequence in Non-Increasing Order", "titleSlug": "minimum-subsequence-in-non-increasing-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75013, "totalSubmissionRaw": 103200}, "1404": {"acRate": 61.44840154074475, "difficulty": "Medium", "likes": 1372, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1404", "paidOnly": false, "title": "Number of Steps to Reduce a Number in Binary Representation to One", "titleSlug": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145331, "totalSubmissionRaw": 236509}, "1405": {"acRate": 57.47781831890458, "difficulty": "Medium", "likes": 2011, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "1405", "paidOnly": false, "title": "Longest Happy String", "titleSlug": "longest-happy-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85381, "totalSubmissionRaw": 148546}, "1406": {"acRate": 63.8143326610344, "difficulty": "Hard", "likes": 2186, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "1406", "paidOnly": false, "title": "Stone Game III", "titleSlug": "stone-game-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90490, "totalSubmissionRaw": 141802}, "1407": {"acRate": 57.61109912630784, "difficulty": "Easy", "likes": 632, "dislikes": 67, "categoryTitle": "Database", "frontendQuestionId": "1407", "paidOnly": false, "title": "Top Travellers", "titleSlug": "top-travellers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128187, "totalSubmissionRaw": 222504}, "1408": {"acRate": 64.03162055335969, "difficulty": "Easy", "likes": 902, "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": 91854, "totalSubmissionRaw": 143451}, "1409": {"acRate": 84.3277068752573, "difficulty": "Medium", "likes": 491, "dislikes": 627, "categoryTitle": "Algorithms", "frontendQuestionId": "1409", "paidOnly": false, "title": "Queries on a Permutation With Key", "titleSlug": "queries-on-a-permutation-with-key", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51208, "totalSubmissionRaw": 60725}, "1410": {"acRate": 50.8420144115935, "difficulty": "Medium", "likes": 191, "dislikes": 322, "categoryTitle": "Algorithms", "frontendQuestionId": "1410", "paidOnly": false, "title": "HTML Entity Parser", "titleSlug": "html-entity-parser", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25330, "totalSubmissionRaw": 49821}, "1411": {"acRate": 63.74429562571884, "difficulty": "Hard", "likes": 1081, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1411", "paidOnly": false, "title": "Number of Ways to Paint N \u00d7 3 Grid", "titleSlug": "number-of-ways-to-paint-n-3-grid", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34362, "totalSubmissionRaw": 53906}, "1412": {"acRate": 58.995689001538096, "difficulty": "Hard", "likes": 214, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1412", "paidOnly": true, "title": "Find the Quiet Students in All Exams", "titleSlug": "find-the-quiet-students-in-all-exams", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27233, "totalSubmissionRaw": 46161}, "1413": {"acRate": 65.44438814731987, "difficulty": "Easy", "likes": 1557, "dislikes": 334, "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": 149830, "totalSubmissionRaw": 228943}, "1414": {"acRate": 65.36961505254698, "difficulty": "Medium", "likes": 1014, "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": 43914, "totalSubmissionRaw": 67178}, "1415": {"acRate": 74.85096456474247, "difficulty": "Medium", "likes": 964, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1415", "paidOnly": false, "title": "The k-th Lexicographical String of All Happy Strings of Length n", "titleSlug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40430, "totalSubmissionRaw": 54014}, "1416": {"acRate": 47.51003181403974, "difficulty": "Hard", "likes": 1599, "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": 59436, "totalSubmissionRaw": 125102}, "1417": {"acRate": 52.73792901039675, "difficulty": "Easy", "likes": 589, "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": 59298, "totalSubmissionRaw": 112439}, "1418": {"acRate": 74.92518990255506, "difficulty": "Medium", "likes": 392, "dislikes": 479, "categoryTitle": "Algorithms", "frontendQuestionId": "1418", "paidOnly": false, "title": "Display Table of Food Orders in a Restaurant", "titleSlug": "display-table-of-food-orders-in-a-restaurant", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29295, "totalSubmissionRaw": 39099}, "1419": {"acRate": 50.36083401635247, "difficulty": "Medium", "likes": 1035, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1419", "paidOnly": false, "title": "Minimum Number of Frogs Croaking", "titleSlug": "minimum-number-of-frogs-croaking", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50384, "totalSubmissionRaw": 100046}, "1420": {"acRate": 68.22190492188813, "difficulty": "Hard", "likes": 1352, "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": 64980, "totalSubmissionRaw": 95248}, "1421": {"acRate": 82.797168808287, "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": 27256, "totalSubmissionRaw": 32919}, "1422": {"acRate": 62.23847593128083, "difficulty": "Easy", "likes": 1543, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1422", "paidOnly": false, "title": "Maximum Score After Splitting a String", "titleSlug": "maximum-score-after-splitting-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164655, "totalSubmissionRaw": 264555}, "1423": {"acRate": 53.546162857861965, "difficulty": "Medium", "likes": 6185, "dislikes": 241, "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": 295720, "totalSubmissionRaw": 552271}, "1424": {"acRate": 57.069266589057044, "difficulty": "Medium", "likes": 2164, "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": 137262, "totalSubmissionRaw": 240519}, "1425": {"acRate": 56.57076569468762, "difficulty": "Hard", "likes": 2126, "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": 78514, "totalSubmissionRaw": 138789}, "1426": {"acRate": 60.25444012926899, "difficulty": "Easy", "likes": 155, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1426", "paidOnly": true, "title": "Counting Elements", "titleSlug": "counting-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129394, "totalSubmissionRaw": 214746}, "1427": {"acRate": 54.789683343460936, "difficulty": "Easy", "likes": 246, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1427", "paidOnly": true, "title": "Perform String Shifts", "titleSlug": "perform-string-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81149, "totalSubmissionRaw": 148110}, "1428": {"acRate": 54.538041625030765, "difficulty": "Medium", "likes": 1222, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "1428", "paidOnly": true, "title": "Leftmost Column with at Least a One", "titleSlug": "leftmost-column-with-at-least-a-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 183929, "totalSubmissionRaw": 337249}, "1429": {"acRate": 53.877138723998605, "difficulty": "Medium", "likes": 555, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1429", "paidOnly": true, "title": "First Unique Number", "titleSlug": "first-unique-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86406, "totalSubmissionRaw": 160376}, "1430": {"acRate": 46.96172148060808, "difficulty": "Medium", "likes": 215, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1430", "paidOnly": true, "title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree", "titleSlug": "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44608, "totalSubmissionRaw": 94988}, "1431": {"acRate": 87.63143996206719, "difficulty": "Easy", "likes": 4451, "dislikes": 568, "categoryTitle": "Algorithms", "frontendQuestionId": "1431", "paidOnly": false, "title": "Kids With the Greatest Number of Candies", "titleSlug": "kids-with-the-greatest-number-of-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 973967, "totalSubmissionRaw": 1111434}, "1432": {"acRate": 41.002267873263314, "difficulty": "Medium", "likes": 232, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "1432", "paidOnly": false, "title": "Max Difference You Can Get From Changing an Integer", "titleSlug": "max-difference-you-can-get-from-changing-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18622, "totalSubmissionRaw": 45417}, "1433": {"acRate": 69.80732451356948, "difficulty": "Medium", "likes": 757, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "1433", "paidOnly": false, "title": "Check If a String Can Break Another String", "titleSlug": "check-if-a-string-can-break-another-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44165, "totalSubmissionRaw": 63267}, "1434": {"acRate": 43.8438695677003, "difficulty": "Hard", "likes": 897, "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": 15355, "totalSubmissionRaw": 35022}, "1435": {"acRate": 75.19399730648367, "difficulty": "Easy", "likes": 152, "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": 23450, "totalSubmissionRaw": 31186}, "1436": {"acRate": 79.48150123479692, "difficulty": "Easy", "likes": 2208, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1436", "paidOnly": false, "title": "Destination City", "titleSlug": "destination-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274206, "totalSubmissionRaw": 344994}, "1437": {"acRate": 58.02401113559912, "difficulty": "Easy", "likes": 629, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1437", "paidOnly": false, "title": "Check If All 1's Are at Least Length K Places Away", "titleSlug": "check-if-all-1s-are-at-least-length-k-places-away", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80036, "totalSubmissionRaw": 137936}, "1438": {"acRate": 56.60142374979734, "difficulty": "Medium", "likes": 4054, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1438", "paidOnly": false, "title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit", "titleSlug": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230421, "totalSubmissionRaw": 407094}, "1439": {"acRate": 61.773598171910706, "difficulty": "Hard", "likes": 1229, "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": 35142, "totalSubmissionRaw": 56889}, "1440": {"acRate": 72.55625320661602, "difficulty": "Medium", "likes": 211, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1440", "paidOnly": true, "title": "Evaluate Boolean Expression", "titleSlug": "evaluate-boolean-expression", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29698, "totalSubmissionRaw": 40931}, "1441": {"acRate": 79.99140755568564, "difficulty": "Medium", "likes": 982, "dislikes": 481, "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": 169433, "totalSubmissionRaw": 211814}, "1442": {"acRate": 84.9680177776577, "difficulty": "Medium", "likes": 1923, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1442", "paidOnly": false, "title": "Count Triplets That Can Form Two Arrays of Equal XOR", "titleSlug": "count-triplets-that-can-form-two-arrays-of-equal-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125795, "totalSubmissionRaw": 148050}, "1443": {"acRate": 62.43857728441582, "difficulty": "Medium", "likes": 3646, "dislikes": 321, "categoryTitle": "Algorithms", "frontendQuestionId": "1443", "paidOnly": false, "title": "Minimum Time to Collect All Apples in a Tree", "titleSlug": "minimum-time-to-collect-all-apples-in-a-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122620, "totalSubmissionRaw": 196385}, "1444": {"acRate": 62.044158449845, "difficulty": "Hard", "likes": 1834, "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": 68650, "totalSubmissionRaw": 110647}, "1445": {"acRate": 86.30567629557156, "difficulty": "Medium", "likes": 239, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1445", "paidOnly": true, "title": "Apples & Oranges", "titleSlug": "apples-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53809, "totalSubmissionRaw": 62347}, "1446": {"acRate": 60.321461894618245, "difficulty": "Easy", "likes": 1741, "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": 171322, "totalSubmissionRaw": 284015}, "1447": {"acRate": 67.03126834422572, "difficulty": "Medium", "likes": 415, "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": 34257, "totalSubmissionRaw": 51106}, "1448": {"acRate": 73.03683132046774, "difficulty": "Medium", "likes": 5850, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1448", "paidOnly": false, "title": "Count Good Nodes in Binary Tree", "titleSlug": "count-good-nodes-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 540704, "totalSubmissionRaw": 740317}, "1449": {"acRate": 48.306744301417794, "difficulty": "Hard", "likes": 692, "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": 18501, "totalSubmissionRaw": 38299}, "1450": {"acRate": 75.67993881745615, "difficulty": "Easy", "likes": 878, "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": 126662, "totalSubmissionRaw": 167366}, "1451": {"acRate": 64.7486312811696, "difficulty": "Medium", "likes": 757, "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": 53101, "totalSubmissionRaw": 82011}, "1452": {"acRate": 58.01355446071288, "difficulty": "Medium", "likes": 353, "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": 25081, "totalSubmissionRaw": 43233}, "1453": {"acRate": 38.17165524702488, "difficulty": "Hard", "likes": 146, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "1453", "paidOnly": false, "title": "Maximum Number of Darts Inside of a Circular Dartboard", "titleSlug": "maximum-number-of-darts-inside-of-a-circular-dartboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6351, "totalSubmissionRaw": 16638}, "1454": {"acRate": 36.63771930637553, "difficulty": "Medium", "likes": 404, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1454", "paidOnly": true, "title": "Active Users", "titleSlug": "active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39531, "totalSubmissionRaw": 107897}, "1455": {"acRate": 64.37632052891324, "difficulty": "Easy", "likes": 828, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1455", "paidOnly": false, "title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence", "titleSlug": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 82571, "totalSubmissionRaw": 128263}, "1456": {"acRate": 58.83615372004564, "difficulty": "Medium", "likes": 3496, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1456", "paidOnly": false, "title": "Maximum Number of Vowels in a Substring of Given Length", "titleSlug": "maximum-number-of-vowels-in-a-substring-of-given-length", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 355296, "totalSubmissionRaw": 603871}, "1457": {"acRate": 68.35150344520179, "difficulty": "Medium", "likes": 3254, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1457", "paidOnly": false, "title": "Pseudo-Palindromic Paths in a Binary Tree", "titleSlug": "pseudo-palindromic-paths-in-a-binary-tree", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220815, "totalSubmissionRaw": 323058}, "1458": {"acRate": 62.45346077209473, "difficulty": "Hard", "likes": 1656, "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": 78672, "totalSubmissionRaw": 125969}, "1459": {"acRate": 68.53133107948737, "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": 17433, "totalSubmissionRaw": 25438}, "1460": {"acRate": 75.99157993828774, "difficulty": "Easy", "likes": 1434, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "1460", "paidOnly": false, "title": "Make Two Arrays Equal by Reversing Subarrays", "titleSlug": "make-two-arrays-equal-by-reversing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290598, "totalSubmissionRaw": 382411}, "1461": {"acRate": 56.520979984928964, "difficulty": "Medium", "likes": 2242, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1461", "paidOnly": false, "title": "Check If a String Contains All Binary Codes of Size K", "titleSlug": "check-if-a-string-contains-all-binary-codes-of-size-k", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123010, "totalSubmissionRaw": 217636}, "1462": {"acRate": 50.04595369768805, "difficulty": "Medium", "likes": 1465, "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": 63165, "totalSubmissionRaw": 126214}, "1463": {"acRate": 71.85824932132407, "difficulty": "Hard", "likes": 4113, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1463", "paidOnly": false, "title": "Cherry Pickup II", "titleSlug": "cherry-pickup-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176554, "totalSubmissionRaw": 245698}, "1464": {"acRate": 82.80570874609177, "difficulty": "Easy", "likes": 2475, "dislikes": 236, "categoryTitle": "Algorithms", "frontendQuestionId": "1464", "paidOnly": false, "title": "Maximum Product of Two Elements in an Array", "titleSlug": "maximum-product-of-two-elements-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 386937, "totalSubmissionRaw": 467283}, "1465": {"acRate": 41.067424238723135, "difficulty": "Medium", "likes": 2619, "dislikes": 350, "categoryTitle": "Algorithms", "frontendQuestionId": "1465", "paidOnly": false, "title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "titleSlug": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168121, "totalSubmissionRaw": 409378}, "1466": {"acRate": 64.50248086464863, "difficulty": "Medium", "likes": 4169, "dislikes": 119, "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": 201240, "totalSubmissionRaw": 311988}, "1467": {"acRate": 60.543463191459864, "difficulty": "Hard", "likes": 284, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "1467", "paidOnly": false, "title": "Probability of a Two Boxes Having The Same Number of Distinct Balls", "titleSlug": "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8734, "totalSubmissionRaw": 14426}, "1468": {"acRate": 78.46880907372402, "difficulty": "Medium", "likes": 126, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1468", "paidOnly": true, "title": "Calculate Salaries", "titleSlug": "calculate-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24906, "totalSubmissionRaw": 31740}, "1469": {"acRate": 83.68452559114039, "difficulty": "Easy", "likes": 507, "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": 55918, "totalSubmissionRaw": 66820}, "1470": {"acRate": 88.57452681388013, "difficulty": "Easy", "likes": 5760, "dislikes": 307, "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": 718800, "totalSubmissionRaw": 811519}, "1471": {"acRate": 61.3503224302696, "difficulty": "Medium", "likes": 697, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1471", "paidOnly": false, "title": "The k Strongest Values in an Array", "titleSlug": "the-k-strongest-values-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39482, "totalSubmissionRaw": 64355}, "1472": {"acRate": 77.65556373606844, "difficulty": "Medium", "likes": 3850, "dislikes": 238, "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": 244699, "totalSubmissionRaw": 315109}, "1473": {"acRate": 60.98099183152027, "difficulty": "Hard", "likes": 2063, "dislikes": 152, "categoryTitle": "Algorithms", "frontendQuestionId": "1473", "paidOnly": false, "title": "Paint House III", "titleSlug": "paint-house-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63008, "totalSubmissionRaw": 103324}, "1474": {"acRate": 73.24989778767093, "difficulty": "Easy", "likes": 405, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1474", "paidOnly": true, "title": "Delete N Nodes After M Nodes of a Linked List", "titleSlug": "delete-n-nodes-after-m-nodes-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 32249, "totalSubmissionRaw": 44026}, "1475": {"acRate": 78.25459382235577, "difficulty": "Easy", "likes": 2126, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1475", "paidOnly": false, "title": "Final Prices With a Special Discount in a Shop", "titleSlug": "final-prices-with-a-special-discount-in-a-shop", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 158849, "totalSubmissionRaw": 202990}, "1476": {"acRate": 88.21831999173271, "difficulty": "Medium", "likes": 632, "dislikes": 1440, "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": 110976, "totalSubmissionRaw": 125797}, "1477": {"acRate": 36.512175251199416, "difficulty": "Medium", "likes": 1696, "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": 48403, "totalSubmissionRaw": 132565}, "1478": {"acRate": 55.433210268367986, "difficulty": "Hard", "likes": 1111, "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": 25675, "totalSubmissionRaw": 46317}, "1479": {"acRate": 77.43857994254599, "difficulty": "Hard", "likes": 151, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1479", "paidOnly": true, "title": "Sales by Day of the Week", "titleSlug": "sales-by-day-of-the-week", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18061, "totalSubmissionRaw": 23323}, "1480": {"acRate": 86.82038566139961, "difficulty": "Easy", "likes": 7878, "dislikes": 345, "categoryTitle": "Algorithms", "frontendQuestionId": "1480", "paidOnly": false, "title": "Running Sum of 1d Array", "titleSlug": "running-sum-of-1d-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1873590, "totalSubmissionRaw": 2158007}, "1481": {"acRate": 63.07907525037503, "difficulty": "Medium", "likes": 2244, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1481", "paidOnly": false, "title": "Least Number of Unique Integers after K Removals", "titleSlug": "least-number-of-unique-integers-after-k-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249352, "totalSubmissionRaw": 395302}, "1482": {"acRate": 55.87363261781867, "difficulty": "Medium", "likes": 4641, "dislikes": 221, "categoryTitle": "Algorithms", "frontendQuestionId": "1482", "paidOnly": false, "title": "Minimum Number of Days to Make m Bouquets", "titleSlug": "minimum-number-of-days-to-make-m-bouquets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 264017, "totalSubmissionRaw": 472525}, "1483": {"acRate": 34.79775480279809, "difficulty": "Hard", "likes": 1926, "dislikes": 118, "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": 37259, "totalSubmissionRaw": 107073}, "1484": {"acRate": 76.99489736829555, "difficulty": "Easy", "likes": 1420, "dislikes": 107, "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": 226035, "totalSubmissionRaw": 293572}, "1485": {"acRate": 80.69291945292936, "difficulty": "Medium", "likes": 420, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1485", "paidOnly": true, "title": "Clone Binary Tree With Random Pointer", "titleSlug": "clone-binary-tree-with-random-pointer", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29323, "totalSubmissionRaw": 36339}, "1486": {"acRate": 86.07147762782871, "difficulty": "Easy", "likes": 1386, "dislikes": 333, "categoryTitle": "Algorithms", "frontendQuestionId": "1486", "paidOnly": false, "title": "XOR Operation in an Array", "titleSlug": "xor-operation-in-an-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 200519, "totalSubmissionRaw": 232968}, "1487": {"acRate": 37.142919328334656, "difficulty": "Medium", "likes": 444, "dislikes": 719, "categoryTitle": "Algorithms", "frontendQuestionId": "1487", "paidOnly": false, "title": "Making File Names Unique", "titleSlug": "making-file-names-unique", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34131, "totalSubmissionRaw": 91891}, "1488": {"acRate": 27.00579081502253, "difficulty": "Medium", "likes": 1530, "dislikes": 291, "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": 36982, "totalSubmissionRaw": 136941}, "1489": {"acRate": 67.57739786421084, "difficulty": "Hard", "likes": 1843, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "1489", "paidOnly": false, "title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "titleSlug": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55181, "totalSubmissionRaw": 81656}, "1490": {"acRate": 83.12151053502792, "difficulty": "Medium", "likes": 409, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1490", "paidOnly": true, "title": "Clone N-ary Tree", "titleSlug": "clone-n-ary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29627, "totalSubmissionRaw": 35643}, "1491": {"acRate": 63.46840601243826, "difficulty": "Easy", "likes": 2224, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1491", "paidOnly": false, "title": "Average Salary Excluding the Minimum and Maximum Salary", "titleSlug": "average-salary-excluding-the-minimum-and-maximum-salary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 345145, "totalSubmissionRaw": 543806}, "1492": {"acRate": 68.12911502047574, "difficulty": "Medium", "likes": 1778, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "1492", "paidOnly": false, "title": "The kth Factor of n", "titleSlug": "the-kth-factor-of-n", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 248550, "totalSubmissionRaw": 364822}, "1493": {"acRate": 67.70515544417812, "difficulty": "Medium", "likes": 3956, "dislikes": 82, "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": 298269, "totalSubmissionRaw": 440542}, "1494": {"acRate": 29.452629615814995, "difficulty": "Hard", "likes": 1039, "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": 18951, "totalSubmissionRaw": 64344}, "1495": {"acRate": 49.01670382019727, "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": 32103, "totalSubmissionRaw": 65494}, "1496": {"acRate": 62.45546673141934, "difficulty": "Easy", "likes": 1470, "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": 164612, "totalSubmissionRaw": 263567}, "1497": {"acRate": 38.45945688980553, "difficulty": "Medium", "likes": 1744, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1497", "paidOnly": false, "title": "Check If Array Pairs Are Divisible by k", "titleSlug": "check-if-array-pairs-are-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52586, "totalSubmissionRaw": 136731}, "1498": {"acRate": 43.634721951737696, "difficulty": "Medium", "likes": 3910, "dislikes": 372, "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": 123231, "totalSubmissionRaw": 282415}, "1499": {"acRate": 44.14361739027025, "difficulty": "Hard", "likes": 1325, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1499", "paidOnly": false, "title": "Max Value of Equation", "titleSlug": "max-value-of-equation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44544, "totalSubmissionRaw": 100907}, "1500": {"acRate": 43.354244265830225, "difficulty": "Medium", "likes": 49, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1500", "paidOnly": true, "title": "Design a File Sharing System", "titleSlug": "design-a-file-sharing-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4423, "totalSubmissionRaw": 10202}, "1501": {"acRate": 50.16186549988619, "difficulty": "Medium", "likes": 296, "dislikes": 145, "categoryTitle": "Database", "frontendQuestionId": "1501", "paidOnly": true, "title": "Countries You Can Safely Invest In", "titleSlug": "countries-you-can-safely-invest-in", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39667, "totalSubmissionRaw": 79078}, "1502": {"acRate": 69.56439133188313, "difficulty": "Easy", "likes": 2168, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1502", "paidOnly": false, "title": "Can Make Arithmetic Progression From Sequence", "titleSlug": "can-make-arithmetic-progression-from-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 252637, "totalSubmissionRaw": 363168}, "1503": {"acRate": 68.49454523353694, "difficulty": "Medium", "likes": 1498, "dislikes": 409, "categoryTitle": "Algorithms", "frontendQuestionId": "1503", "paidOnly": false, "title": "Last Moment Before All Ants Fall Out of a Plank", "titleSlug": "last-moment-before-all-ants-fall-out-of-a-plank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90158, "totalSubmissionRaw": 131628}, "1504": {"acRate": 57.258134209048094, "difficulty": "Medium", "likes": 2107, "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": 53005, "totalSubmissionRaw": 92572}, "1505": {"acRate": 39.66794574674214, "difficulty": "Hard", "likes": 486, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1505", "paidOnly": false, "title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits", "titleSlug": "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10441, "totalSubmissionRaw": 26321}, "1506": {"acRate": 78.40689486661188, "difficulty": "Medium", "likes": 473, "dislikes": 201, "categoryTitle": "Algorithms", "frontendQuestionId": "1506", "paidOnly": true, "title": "Find Root of N-Ary Tree", "titleSlug": "find-root-of-n-ary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35298, "totalSubmissionRaw": 45019}, "1507": {"acRate": 66.38678643471664, "difficulty": "Easy", "likes": 468, "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": 77010, "totalSubmissionRaw": 116002}, "1508": {"acRate": 63.28586643823934, "difficulty": "Medium", "likes": 1483, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "1508", "paidOnly": false, "title": "Range Sum of Sorted Subarray Sums", "titleSlug": "range-sum-of-sorted-subarray-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 166958, "totalSubmissionRaw": 263821}, "1509": {"acRate": 59.19657031543588, "difficulty": "Medium", "likes": 2468, "dislikes": 275, "categoryTitle": "Algorithms", "frontendQuestionId": "1509", "paidOnly": false, "title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "titleSlug": "minimum-difference-between-largest-and-smallest-value-in-three-moves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231561, "totalSubmissionRaw": 391173}, "1510": {"acRate": 59.692626433479276, "difficulty": "Hard", "likes": 1595, "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": 73758, "totalSubmissionRaw": 123563}, "1511": {"acRate": 67.80470242008704, "difficulty": "Easy", "likes": 317, "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": 43315, "totalSubmissionRaw": 63881}, "1512": {"acRate": 89.18294677027832, "difficulty": "Easy", "likes": 5430, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "1512", "paidOnly": false, "title": "Number of Good Pairs", "titleSlug": "number-of-good-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 810474, "totalSubmissionRaw": 908777}, "1513": {"acRate": 46.944178054822984, "difficulty": "Medium", "likes": 872, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1513", "paidOnly": false, "title": "Number of Substrings With Only 1s", "titleSlug": "number-of-substrings-with-only-1s", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46993, "totalSubmissionRaw": 100104}, "1514": {"acRate": 55.47863004245488, "difficulty": "Medium", "likes": 3142, "dislikes": 74, "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": 147926, "totalSubmissionRaw": 266636}, "1515": {"acRate": 35.11577942229649, "difficulty": "Hard", "likes": 234, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "1515", "paidOnly": false, "title": "Best Position for a Service Centre", "titleSlug": "best-position-for-a-service-centre", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14710, "totalSubmissionRaw": 41890}, "1516": {"acRate": 62.055016181229774, "difficulty": "Hard", "likes": 33, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1516", "paidOnly": true, "title": "Move Sub-Tree of N-Ary Tree", "titleSlug": "move-sub-tree-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2301, "totalSubmissionRaw": 3708}, "1517": {"acRate": 44.23041141384673, "difficulty": "Easy", "likes": 458, "dislikes": 252, "categoryTitle": "Database", "frontendQuestionId": "1517", "paidOnly": false, "title": "Find Users With Valid E-Mails", "titleSlug": "find-users-with-valid-e-mails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125985, "totalSubmissionRaw": 284841}, "1518": {"acRate": 71.00885341337514, "difficulty": "Easy", "likes": 1669, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1518", "paidOnly": false, "title": "Water Bottles", "titleSlug": "water-bottles", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 234680, "totalSubmissionRaw": 330494}, "1519": {"acRate": 54.98682553898472, "difficulty": "Medium", "likes": 2250, "dislikes": 807, "categoryTitle": "Algorithms", "frontendQuestionId": "1519", "paidOnly": false, "title": "Number of Nodes in the Sub-Tree With the Same Label", "titleSlug": "number-of-nodes-in-the-sub-tree-with-the-same-label", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84727, "totalSubmissionRaw": 154086}, "1520": {"acRate": 39.586393683437386, "difficulty": "Hard", "likes": 822, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1520", "paidOnly": false, "title": "Maximum Number of Non-Overlapping Substrings", "titleSlug": "maximum-number-of-non-overlapping-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17247, "totalSubmissionRaw": 43568}, "1521": {"acRate": 45.490661861074706, "difficulty": "Hard", "likes": 385, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1521", "paidOnly": false, "title": "Find a Value of a Mysterious Function Closest to Target", "titleSlug": "find-a-value-of-a-mysterious-function-closest-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11107, "totalSubmissionRaw": 24416}, "1522": {"acRate": 74.45820663057184, "difficulty": "Medium", "likes": 608, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1522", "paidOnly": true, "title": "Diameter of N-Ary Tree", "titleSlug": "diameter-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50196, "totalSubmissionRaw": 67415}, "1523": {"acRate": 49.968620541532275, "difficulty": "Easy", "likes": 2746, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "1523", "paidOnly": false, "title": "Count Odd Numbers in an Interval Range", "titleSlug": "count-odd-numbers-in-an-interval-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343162, "totalSubmissionRaw": 686755}, "1524": {"acRate": 43.66229684735668, "difficulty": "Medium", "likes": 1352, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1524", "paidOnly": false, "title": "Number of Sub-arrays With Odd Sum", "titleSlug": "number-of-sub-arrays-with-odd-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39734, "totalSubmissionRaw": 91003}, "1525": {"acRate": 68.32177169842045, "difficulty": "Medium", "likes": 2050, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1525", "paidOnly": false, "title": "Number of Good Ways to Split a String", "titleSlug": "number-of-good-ways-to-split-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104891, "totalSubmissionRaw": 153525}, "1526": {"acRate": 70.62660538055968, "difficulty": "Hard", "likes": 1485, "dislikes": 69, "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": 41794, "totalSubmissionRaw": 59176}, "1527": {"acRate": 40.29984348074092, "difficulty": "Easy", "likes": 651, "dislikes": 570, "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": 234556, "totalSubmissionRaw": 582026}, "1528": {"acRate": 84.79864037317417, "difficulty": "Easy", "likes": 2747, "dislikes": 517, "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": 398661, "totalSubmissionRaw": 470127}, "1529": {"acRate": 73.39760497995358, "difficulty": "Medium", "likes": 1024, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1529", "paidOnly": false, "title": "Minimum Suffix Flips", "titleSlug": "minimum-suffix-flips", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55653, "totalSubmissionRaw": 75824}, "1530": {"acRate": 71.90743241245404, "difficulty": "Medium", "likes": 2383, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "1530", "paidOnly": false, "title": "Number of Good Leaf Nodes Pairs", "titleSlug": "number-of-good-leaf-nodes-pairs", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145916, "totalSubmissionRaw": 202922}, "1531": {"acRate": 52.50076597183336, "difficulty": "Hard", "likes": 2429, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "1531", "paidOnly": false, "title": "String Compression II", "titleSlug": "string-compression-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99385, "totalSubmissionRaw": 189302}, "1532": {"acRate": 68.47648238195102, "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": 29714, "totalSubmissionRaw": 43393}, "1533": {"acRate": 56.19412001610955, "difficulty": "Medium", "likes": 246, "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": 13953, "totalSubmissionRaw": 24830}, "1534": {"acRate": 81.36828878825162, "difficulty": "Easy", "likes": 761, "dislikes": 1198, "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": 124334, "totalSubmissionRaw": 152804}, "1535": {"acRate": 57.00671378439217, "difficulty": "Medium", "likes": 1574, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1535", "paidOnly": false, "title": "Find the Winner of an Array Game", "titleSlug": "find-the-winner-of-an-array-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115987, "totalSubmissionRaw": 203462}, "1536": {"acRate": 47.67064925442253, "difficulty": "Medium", "likes": 565, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "1536", "paidOnly": false, "title": "Minimum Swaps to Arrange a Binary Grid", "titleSlug": "minimum-swaps-to-arrange-a-binary-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15441, "totalSubmissionRaw": 32391}, "1537": {"acRate": 39.508776999205374, "difficulty": "Hard", "likes": 986, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1537", "paidOnly": false, "title": "Get the Maximum Score", "titleSlug": "get-the-maximum-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27346, "totalSubmissionRaw": 69215}, "1538": {"acRate": 69.77748256393225, "difficulty": "Medium", "likes": 138, "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": 4202, "totalSubmissionRaw": 6022}, "1539": {"acRate": 60.46566846210557, "difficulty": "Easy", "likes": 6657, "dislikes": 450, "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": 460931, "totalSubmissionRaw": 762302}, "1540": {"acRate": 35.298997580366404, "difficulty": "Medium", "likes": 393, "dislikes": 315, "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": 20424, "totalSubmissionRaw": 57860}, "1541": {"acRate": 52.6906943596009, "difficulty": "Medium", "likes": 1115, "dislikes": 263, "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": 64691, "totalSubmissionRaw": 122775}, "1542": {"acRate": 43.798280134091236, "difficulty": "Hard", "likes": 815, "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": 15025, "totalSubmissionRaw": 34305}, "1543": {"acRate": 59.371958550409346, "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": 20741, "totalSubmissionRaw": 34934}, "1544": {"acRate": 68.35350139099862, "difficulty": "Easy", "likes": 3021, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "1544", "paidOnly": false, "title": "Make The String Great", "titleSlug": "make-the-string-great", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 320391, "totalSubmissionRaw": 468726}, "1545": {"acRate": 58.94238400796373, "difficulty": "Medium", "likes": 926, "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": 43816, "totalSubmissionRaw": 74337}, "1546": {"acRate": 47.796408962754114, "difficulty": "Medium", "likes": 1063, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1546", "paidOnly": false, "title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "titleSlug": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28989, "totalSubmissionRaw": 60651}, "1547": {"acRate": 61.69821435173204, "difficulty": "Hard", "likes": 4265, "dislikes": 110, "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": 133510, "totalSubmissionRaw": 216392}, "1548": {"acRate": 59.217515663307, "difficulty": "Hard", "likes": 377, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "1548", "paidOnly": true, "title": "The Most Similar Path in a Graph", "titleSlug": "the-most-similar-path-in-a-graph", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17391, "totalSubmissionRaw": 29368}, "1549": {"acRate": 64.82358332060485, "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": 29708, "totalSubmissionRaw": 45829}, "1550": {"acRate": 68.34493920281226, "difficulty": "Easy", "likes": 1127, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1550", "paidOnly": false, "title": "Three Consecutive Odds", "titleSlug": "three-consecutive-odds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274910, "totalSubmissionRaw": 402239}, "1551": {"acRate": 82.4003880876815, "difficulty": "Medium", "likes": 1442, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1551", "paidOnly": false, "title": "Minimum Operations to Make Array Equal", "titleSlug": "minimum-operations-to-make-array-equal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100217, "totalSubmissionRaw": 121622}, "1552": {"acRate": 71.08430142156675, "difficulty": "Medium", "likes": 2874, "dislikes": 252, "categoryTitle": "Algorithms", "frontendQuestionId": "1552", "paidOnly": false, "title": "Magnetic Force Between Two Balls", "titleSlug": "magnetic-force-between-two-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 166864, "totalSubmissionRaw": 234741}, "1553": {"acRate": 35.4453326133701, "difficulty": "Hard", "likes": 992, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1553", "paidOnly": false, "title": "Minimum Number of Days to Eat N Oranges", "titleSlug": "minimum-number-of-days-to-eat-n-oranges", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36760, "totalSubmissionRaw": 103709}, "1554": {"acRate": 41.68056187155778, "difficulty": "Medium", "likes": 376, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1554", "paidOnly": true, "title": "Strings Differ by One Character", "titleSlug": "strings-differ-by-one-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24747, "totalSubmissionRaw": 59373}, "1555": {"acRate": 51.34859067443337, "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": 18600, "totalSubmissionRaw": 36223}, "1556": {"acRate": 53.70326125910883, "difficulty": "Easy", "likes": 489, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1556", "paidOnly": false, "title": "Thousand Separator", "titleSlug": "thousand-separator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53946, "totalSubmissionRaw": 100452}, "1557": {"acRate": 81.04590846228683, "difficulty": "Medium", "likes": 3690, "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": 185771, "totalSubmissionRaw": 229217}, "1558": {"acRate": 63.71318969744166, "difficulty": "Medium", "likes": 627, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1558", "paidOnly": false, "title": "Minimum Numbers of Function Calls to Make Target Array", "titleSlug": "minimum-numbers-of-function-calls-to-make-target-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22090, "totalSubmissionRaw": 34671}, "1559": {"acRate": 48.78273720235119, "difficulty": "Medium", "likes": 1161, "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": 43903, "totalSubmissionRaw": 89997}, "1560": {"acRate": 58.94750171858606, "difficulty": "Easy", "likes": 317, "dislikes": 633, "categoryTitle": "Algorithms", "frontendQuestionId": "1560", "paidOnly": false, "title": "Most Visited Sector in  a Circular Track", "titleSlug": "most-visited-sector-in-a-circular-track", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32585, "totalSubmissionRaw": 55278}, "1561": {"acRate": 84.56567182974436, "difficulty": "Medium", "likes": 1887, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "1561", "paidOnly": false, "title": "Maximum Number of Coins You Can Get", "titleSlug": "maximum-number-of-coins-you-can-get", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167884, "totalSubmissionRaw": 198525}, "1562": {"acRate": 42.929945118295436, "difficulty": "Medium", "likes": 648, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "1562", "paidOnly": false, "title": "Find Latest Group of Size M", "titleSlug": "find-latest-group-of-size-m", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18617, "totalSubmissionRaw": 43366}, "1563": {"acRate": 40.88234116657993, "difficulty": "Hard", "likes": 645, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1563", "paidOnly": false, "title": "Stone Game V", "titleSlug": "stone-game-v", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20424, "totalSubmissionRaw": 49958}, "1564": {"acRate": 67.36252132239461, "difficulty": "Medium", "likes": 337, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1564", "paidOnly": true, "title": "Put Boxes Into the Warehouse I", "titleSlug": "put-boxes-into-the-warehouse-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16586, "totalSubmissionRaw": 24622}, "1565": {"acRate": 82.08436541092092, "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": 22203, "totalSubmissionRaw": 27049}, "1566": {"acRate": 43.2451864489398, "difficulty": "Easy", "likes": 654, "dislikes": 134, "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": 35487, "totalSubmissionRaw": 82060}, "1567": {"acRate": 44.27479873228662, "difficulty": "Medium", "likes": 2410, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1567", "paidOnly": false, "title": "Maximum Length of Subarray With Positive Product", "titleSlug": "maximum-length-of-subarray-with-positive-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97231, "totalSubmissionRaw": 219608}, "1568": {"acRate": 44.90184049079755, "difficulty": "Hard", "likes": 713, "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": 14638, "totalSubmissionRaw": 32600}, "1569": {"acRate": 53.48486727267524, "difficulty": "Hard", "likes": 1788, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "1569", "paidOnly": false, "title": "Number of Ways to Reorder Array to Get Same BST", "titleSlug": "number-of-ways-to-reorder-array-to-get-same-bst", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56073, "totalSubmissionRaw": 104839}, "1570": {"acRate": 89.8182204458844, "difficulty": "Medium", "likes": 1211, "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": 270572, "totalSubmissionRaw": 301244}, "1571": {"acRate": 87.75790076960864, "difficulty": "Easy", "likes": 159, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1571", "paidOnly": true, "title": "Warehouse Manager", "titleSlug": "warehouse-manager", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42875, "totalSubmissionRaw": 48856}, "1572": {"acRate": 83.13414495442716, "difficulty": "Easy", "likes": 3484, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1572", "paidOnly": false, "title": "Matrix Diagonal Sum", "titleSlug": "matrix-diagonal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 372776, "totalSubmissionRaw": 448403}, "1573": {"acRate": 33.459528459364805, "difficulty": "Medium", "likes": 739, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1573", "paidOnly": false, "title": "Number of Ways to Split a String", "titleSlug": "number-of-ways-to-split-a-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30668, "totalSubmissionRaw": 91657}, "1574": {"acRate": 38.02629847210424, "difficulty": "Medium", "likes": 1617, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1574", "paidOnly": false, "title": "Shortest Subarray to be Removed to Make Array Sorted", "titleSlug": "shortest-subarray-to-be-removed-to-make-array-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31782, "totalSubmissionRaw": 83579}, "1575": {"acRate": 65.2614674294891, "difficulty": "Hard", "likes": 1623, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1575", "paidOnly": false, "title": "Count All Possible Routes", "titleSlug": "count-all-possible-routes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58518, "totalSubmissionRaw": 89667}, "1576": {"acRate": 46.222385145396466, "difficulty": "Easy", "likes": 561, "dislikes": 176, "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": 61785, "totalSubmissionRaw": 133669}, "1577": {"acRate": 41.40308972531494, "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": 21494, "totalSubmissionRaw": 51914}, "1578": {"acRate": 63.70529739867736, "difficulty": "Medium", "likes": 3817, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1578", "paidOnly": false, "title": "Minimum Time to Make Rope Colorful", "titleSlug": "minimum-time-to-make-rope-colorful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 260863, "totalSubmissionRaw": 409484}, "1579": {"acRate": 70.97448354341736, "difficulty": "Hard", "likes": 2528, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1579", "paidOnly": false, "title": "Remove Max Number of Edges to Keep Graph Fully Traversable", "titleSlug": "remove-max-number-of-edges-to-keep-graph-fully-traversable", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129730, "totalSubmissionRaw": 182784}, "1580": {"acRate": 66.24641401177715, "difficulty": "Medium", "likes": 220, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1580", "paidOnly": true, "title": "Put Boxes Into the Warehouse II", "titleSlug": "put-boxes-into-the-warehouse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8775, "totalSubmissionRaw": 13246}, "1581": {"acRate": 67.94927537238483, "difficulty": "Easy", "likes": 2086, "dislikes": 290, "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": 489158, "totalSubmissionRaw": 719887}, "1582": {"acRate": 68.63517788755064, "difficulty": "Easy", "likes": 1452, "dislikes": 68, "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": 148392, "totalSubmissionRaw": 216204}, "1583": {"acRate": 61.6071618885218, "difficulty": "Medium", "likes": 285, "dislikes": 860, "categoryTitle": "Algorithms", "frontendQuestionId": "1583", "paidOnly": false, "title": "Count Unhappy Friends", "titleSlug": "count-unhappy-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28903, "totalSubmissionRaw": 46915}, "1584": {"acRate": 67.30589222511722, "difficulty": "Medium", "likes": 5060, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1584", "paidOnly": false, "title": "Min Cost to Connect All Points", "titleSlug": "min-cost-to-connect-all-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 305593, "totalSubmissionRaw": 454037}, "1585": {"acRate": 48.649849983331485, "difficulty": "Hard", "likes": 438, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1585", "paidOnly": false, "title": "Check If String Is Transformable With Substring Sort Operations", "titleSlug": "check-if-string-is-transformable-with-substring-sort-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8756, "totalSubmissionRaw": 17998}, "1586": {"acRate": 63.963075820039435, "difficulty": "Medium", "likes": 261, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1586", "paidOnly": true, "title": "Binary Search Tree Iterator II", "titleSlug": "binary-search-tree-iterator-ii", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14274, "totalSubmissionRaw": 22316}, "1587": {"acRate": 83.36299896299278, "difficulty": "Easy", "likes": 476, "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": 107720, "totalSubmissionRaw": 129218}, "1588": {"acRate": 83.1670255556007, "difficulty": "Easy", "likes": 3701, "dislikes": 298, "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": 204699, "totalSubmissionRaw": 246130}, "1589": {"acRate": 38.16704473615708, "difficulty": "Medium", "likes": 767, "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": 20527, "totalSubmissionRaw": 53782}, "1590": {"acRate": 29.163680836223616, "difficulty": "Medium", "likes": 1547, "dislikes": 68, "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": 30522, "totalSubmissionRaw": 104659}, "1591": {"acRate": 59.13169770216298, "difficulty": "Hard", "likes": 627, "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": 11400, "totalSubmissionRaw": 19279}, "1592": {"acRate": 43.298422675256234, "difficulty": "Easy", "likes": 457, "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": 58003, "totalSubmissionRaw": 133961}, "1593": {"acRate": 56.702088158848596, "difficulty": "Medium", "likes": 841, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1593", "paidOnly": false, "title": "Split a String Into the Max Number of Unique Substrings", "titleSlug": "split-a-string-into-the-max-number-of-unique-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32069, "totalSubmissionRaw": 56557}, "1594": {"acRate": 33.859706540118914, "difficulty": "Medium", "likes": 832, "dislikes": 40, "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": 24830, "totalSubmissionRaw": 73332}, "1595": {"acRate": 48.199845480298734, "difficulty": "Hard", "likes": 472, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1595", "paidOnly": false, "title": "Minimum Cost to Connect Two Groups of Points", "titleSlug": "minimum-cost-to-connect-two-groups-of-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9358, "totalSubmissionRaw": 19415}, "1596": {"acRate": 78.36584806059214, "difficulty": "Medium", "likes": 242, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1596", "paidOnly": true, "title": "The Most Frequently Ordered Products for Each Customer", "titleSlug": "the-most-frequently-ordered-products-for-each-customer", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34144, "totalSubmissionRaw": 43570}, "1597": {"acRate": 62.508845591357264, "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": 13250, "totalSubmissionRaw": 21197}, "1598": {"acRate": 71.77082318139342, "difficulty": "Easy", "likes": 1444, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "1598", "paidOnly": false, "title": "Crawler Log Folder", "titleSlug": "crawler-log-folder", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250384, "totalSubmissionRaw": 348866}, "1599": {"acRate": 44.13686911890505, "difficulty": "Medium", "likes": 109, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "1599", "paidOnly": false, "title": "Maximum Profit of Operating a Centennial Wheel", "titleSlug": "maximum-profit-of-operating-a-centennial-wheel", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12899, "totalSubmissionRaw": 29225}, "1600": {"acRate": 65.52975848188615, "difficulty": "Medium", "likes": 292, "dislikes": 305, "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": 18233, "totalSubmissionRaw": 27824}, "1601": {"acRate": 64.52314772623713, "difficulty": "Hard", "likes": 1414, "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": 56641, "totalSubmissionRaw": 87784}, "1602": {"acRate": 75.45030452248282, "difficulty": "Medium", "likes": 329, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "1602", "paidOnly": true, "title": "Find Nearest Right Node in Binary Tree", "titleSlug": "find-nearest-right-node-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 23290, "totalSubmissionRaw": 30868}, "1603": {"acRate": 87.97476298203347, "difficulty": "Easy", "likes": 1946, "dislikes": 447, "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": 287380, "totalSubmissionRaw": 326662}, "1604": {"acRate": 45.84784240380947, "difficulty": "Medium", "likes": 309, "dislikes": 421, "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": 37261, "totalSubmissionRaw": 81271}, "1605": {"acRate": 83.1376606154831, "difficulty": "Medium", "likes": 2116, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1605", "paidOnly": false, "title": "Find Valid Matrix Given Row and Column Sums", "titleSlug": "find-valid-matrix-given-row-and-column-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145450, "totalSubmissionRaw": 174951}, "1606": {"acRate": 43.616379093515775, "difficulty": "Hard", "likes": 609, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1606", "paidOnly": false, "title": "Find Servers That Handled Most Number of Requests", "titleSlug": "find-servers-that-handled-most-number-of-requests", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17341, "totalSubmissionRaw": 39758}, "1607": {"acRate": 54.34751806546073, "difficulty": "Easy", "likes": 132, "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": 34521, "totalSubmissionRaw": 63519}, "1608": {"acRate": 66.89017894467145, "difficulty": "Easy", "likes": 2195, "dislikes": 424, "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": 198412, "totalSubmissionRaw": 296625}, "1609": {"acRate": 65.86513587425165, "difficulty": "Medium", "likes": 1770, "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": 160404, "totalSubmissionRaw": 243534}, "1610": {"acRate": 37.41678968961988, "difficulty": "Hard", "likes": 578, "dislikes": 747, "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": 41313, "totalSubmissionRaw": 110413}, "1611": {"acRate": 74.03910991233985, "difficulty": "Hard", "likes": 921, "dislikes": 1024, "categoryTitle": "Algorithms", "frontendQuestionId": "1611", "paidOnly": false, "title": "Minimum One Bit Operations to Make Integers Zero", "titleSlug": "minimum-one-bit-operations-to-make-integers-zero", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59292, "totalSubmissionRaw": 80082}, "1612": {"acRate": 70.62104168635976, "difficulty": "Medium", "likes": 140, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1612", "paidOnly": true, "title": "Check If Two Expression Trees are Equivalent", "titleSlug": "check-if-two-expression-trees-are-equivalent", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7471, "totalSubmissionRaw": 10579}, "1613": {"acRate": 73.01551181400994, "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": 19252, "totalSubmissionRaw": 26367}, "1614": {"acRate": 83.88552236001503, "difficulty": "Easy", "likes": 2457, "dislikes": 502, "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": 357151, "totalSubmissionRaw": 425760}, "1615": {"acRate": 65.14212639938977, "difficulty": "Medium", "likes": 2350, "dislikes": 368, "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": 145179, "totalSubmissionRaw": 222865}, "1616": {"acRate": 30.99024520126837, "difficulty": "Medium", "likes": 735, "dislikes": 248, "categoryTitle": "Algorithms", "frontendQuestionId": "1616", "paidOnly": false, "title": "Split Two Strings to Make Palindrome", "titleSlug": "split-two-strings-to-make-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25606, "totalSubmissionRaw": 82626}, "1617": {"acRate": 66.17664851784633, "difficulty": "Hard", "likes": 541, "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": 10939, "totalSubmissionRaw": 16530}, "1618": {"acRate": 60.925110132158586, "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": 6915, "totalSubmissionRaw": 11350}, "1619": {"acRate": 68.75248311481923, "difficulty": "Easy", "likes": 499, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "1619", "paidOnly": false, "title": "Mean of Array After Removing Some Elements", "titleSlug": "mean-of-array-after-removing-some-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62298, "totalSubmissionRaw": 90612}, "1620": {"acRate": 38.02255859784477, "difficulty": "Medium", "likes": 79, "dislikes": 265, "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": 9068, "totalSubmissionRaw": 23849}, "1621": {"acRate": 43.647723891698895, "difficulty": "Medium", "likes": 461, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "1621", "paidOnly": false, "title": "Number of Sets of K Non-Overlapping Line Segments", "titleSlug": "number-of-sets-of-k-non-overlapping-line-segments", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10269, "totalSubmissionRaw": 23527}, "1622": {"acRate": 17.39320580102703, "difficulty": "Hard", "likes": 370, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1622", "paidOnly": false, "title": "Fancy Sequence", "titleSlug": "fancy-sequence", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12329, "totalSubmissionRaw": 70884}, "1623": {"acRate": 81.98810881251019, "difficulty": "Easy", "likes": 73, "dislikes": 138, "categoryTitle": "Database", "frontendQuestionId": "1623", "paidOnly": true, "title": "All Valid Triplets That Can Represent a Country", "titleSlug": "all-valid-triplets-that-can-represent-a-country", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20133, "totalSubmissionRaw": 24556}, "1624": {"acRate": 68.5437987781963, "difficulty": "Easy", "likes": 1341, "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": 156855, "totalSubmissionRaw": 228840}, "1625": {"acRate": 65.54281279641286, "difficulty": "Medium", "likes": 354, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "1625", "paidOnly": false, "title": "Lexicographically Smallest String After Applying Operations", "titleSlug": "lexicographically-smallest-string-after-applying-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15201, "totalSubmissionRaw": 23193}, "1626": {"acRate": 50.36211333281588, "difficulty": "Medium", "likes": 2946, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1626", "paidOnly": false, "title": "Best Team With No Conflicts", "titleSlug": "best-team-with-no-conflicts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84351, "totalSubmissionRaw": 167489}, "1627": {"acRate": 47.20146328717011, "difficulty": "Hard", "likes": 580, "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": 18064, "totalSubmissionRaw": 38270}, "1628": {"acRate": 82.54609360547573, "difficulty": "Medium", "likes": 536, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1628", "paidOnly": true, "title": "Design an Expression Tree With Evaluate Function", "titleSlug": "design-an-expression-tree-with-evaluate-function", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26773, "totalSubmissionRaw": 32434}, "1629": {"acRate": 59.09571931946367, "difficulty": "Easy", "likes": 764, "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": 101634, "totalSubmissionRaw": 171982}, "1630": {"acRate": 83.76779675295761, "difficulty": "Medium", "likes": 1819, "dislikes": 202, "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": 139207, "totalSubmissionRaw": 166182}, "1631": {"acRate": 60.01303233593689, "difficulty": "Medium", "likes": 5910, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "1631", "paidOnly": false, "title": "Path With Minimum Effort", "titleSlug": "path-with-minimum-effort", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274454, "totalSubmissionRaw": 457324}, "1632": {"acRate": 40.957077625570776, "difficulty": "Hard", "likes": 872, "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": 22424, "totalSubmissionRaw": 54750}, "1633": {"acRate": 56.6157239041693, "difficulty": "Easy", "likes": 683, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "1633", "paidOnly": false, "title": "Percentage of Users Attended a Contest", "titleSlug": "percentage-of-users-attended-a-contest", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208451, "totalSubmissionRaw": 368183}, "1634": {"acRate": 55.48627064872552, "difficulty": "Medium", "likes": 144, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1634", "paidOnly": true, "title": "Add Two Polynomials Represented as Linked Lists", "titleSlug": "add-two-polynomials-represented-as-linked-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10144, "totalSubmissionRaw": 18282}, "1635": {"acRate": 47.706320728677895, "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": 8642, "totalSubmissionRaw": 18115}, "1636": {"acRate": 79.76472931568803, "difficulty": "Easy", "likes": 3392, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1636", "paidOnly": false, "title": "Sort Array by Increasing Frequency", "titleSlug": "sort-array-by-increasing-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272308, "totalSubmissionRaw": 341390}, "1637": {"acRate": 87.40964699757724, "difficulty": "Easy", "likes": 933, "dislikes": 1724, "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": 174620, "totalSubmissionRaw": 199772}, "1638": {"acRate": 71.25881490979027, "difficulty": "Medium", "likes": 1152, "dislikes": 347, "categoryTitle": "Algorithms", "frontendQuestionId": "1638", "paidOnly": false, "title": "Count Substrings That Differ by One Character", "titleSlug": "count-substrings-that-differ-by-one-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31123, "totalSubmissionRaw": 43676}, "1639": {"acRate": 51.0347868259777, "difficulty": "Hard", "likes": 1572, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1639", "paidOnly": false, "title": "Number of Ways to Form a Target String Given a Dictionary", "titleSlug": "number-of-ways-to-form-a-target-string-given-a-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57875, "totalSubmissionRaw": 113404}, "1640": {"acRate": 56.60748969230245, "difficulty": "Easy", "likes": 900, "dislikes": 140, "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": 83063, "totalSubmissionRaw": 146735}, "1641": {"acRate": 78.53529441276318, "difficulty": "Medium", "likes": 3859, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1641", "paidOnly": false, "title": "Count Sorted Vowel Strings", "titleSlug": "count-sorted-vowel-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187847, "totalSubmissionRaw": 239188}, "1642": {"acRate": 49.80459546505847, "difficulty": "Medium", "likes": 5891, "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": 230411, "totalSubmissionRaw": 462630}, "1643": {"acRate": 48.252029547282966, "difficulty": "Hard", "likes": 549, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1643", "paidOnly": false, "title": "Kth Smallest Instructions", "titleSlug": "kth-smallest-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13195, "totalSubmissionRaw": 27346}, "1644": {"acRate": 64.81578269925346, "difficulty": "Medium", "likes": 637, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1644", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree II", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83087, "totalSubmissionRaw": 128190}, "1645": {"acRate": 39.118215352186894, "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": 6681, "totalSubmissionRaw": 17079}, "1646": {"acRate": 50.50573100701653, "difficulty": "Easy", "likes": 760, "dislikes": 944, "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": 110203, "totalSubmissionRaw": 218199}, "1647": {"acRate": 61.248510461103656, "difficulty": "Medium", "likes": 4931, "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": 276526, "totalSubmissionRaw": 451482}, "1648": {"acRate": 29.950703947627872, "difficulty": "Medium", "likes": 1075, "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": 37973, "totalSubmissionRaw": 126785}, "1649": {"acRate": 39.08793824951572, "difficulty": "Hard", "likes": 653, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1649", "paidOnly": false, "title": "Create Sorted Array through Instructions", "titleSlug": "create-sorted-array-through-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26434, "totalSubmissionRaw": 67627}, "1650": {"acRate": 80.11486758586304, "difficulty": "Medium", "likes": 1386, "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": 250664, "totalSubmissionRaw": 312881}, "1651": {"acRate": 65.15424774560987, "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": 6864, "totalSubmissionRaw": 10535}, "1652": {"acRate": 66.2406517094017, "difficulty": "Easy", "likes": 803, "dislikes": 95, "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": 49601, "totalSubmissionRaw": 74880}, "1653": {"acRate": 65.84656314879969, "difficulty": "Medium", "likes": 2062, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1653", "paidOnly": false, "title": "Minimum Deletions to Make String Balanced", "titleSlug": "minimum-deletions-to-make-string-balanced", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158893, "totalSubmissionRaw": 241307}, "1654": {"acRate": 29.503348177029437, "difficulty": "Medium", "likes": 1482, "dislikes": 269, "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": 44191, "totalSubmissionRaw": 149783}, "1655": {"acRate": 39.541787182219515, "difficulty": "Hard", "likes": 426, "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": 15585, "totalSubmissionRaw": 39414}, "1656": {"acRate": 84.33026269602588, "difficulty": "Easy", "likes": 527, "dislikes": 3491, "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": 88890, "totalSubmissionRaw": 105407}, "1657": {"acRate": 54.54070760028576, "difficulty": "Medium", "likes": 3689, "dislikes": 296, "categoryTitle": "Algorithms", "frontendQuestionId": "1657", "paidOnly": false, "title": "Determine if Two Strings Are Close", "titleSlug": "determine-if-two-strings-are-close", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 360353, "totalSubmissionRaw": 660699}, "1658": {"acRate": 39.758549831205045, "difficulty": "Medium", "likes": 5458, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1658", "paidOnly": false, "title": "Minimum Operations to Reduce X to Zero", "titleSlug": "minimum-operations-to-reduce-x-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 195027, "totalSubmissionRaw": 490532}, "1659": {"acRate": 39.66374781085814, "difficulty": "Hard", "likes": 330, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1659", "paidOnly": false, "title": "Maximize Grid Happiness", "titleSlug": "maximize-grid-happiness", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5662, "totalSubmissionRaw": 14275}, "1660": {"acRate": 74.42218798151, "difficulty": "Medium", "likes": 267, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1660", "paidOnly": true, "title": "Correct a Binary Tree", "titleSlug": "correct-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19803, "totalSubmissionRaw": 26609}, "1661": {"acRate": 67.79156902921432, "difficulty": "Easy", "likes": 1367, "dislikes": 136, "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": 304053, "totalSubmissionRaw": 448512}, "1662": {"acRate": 85.55121714275039, "difficulty": "Easy", "likes": 2985, "dislikes": 200, "categoryTitle": "Algorithms", "frontendQuestionId": "1662", "paidOnly": false, "title": "Check If Two String Arrays are Equivalent", "titleSlug": "check-if-two-string-arrays-are-equivalent", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 503723, "totalSubmissionRaw": 588797}, "1663": {"acRate": 66.85555384335206, "difficulty": "Medium", "likes": 1873, "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": 95447, "totalSubmissionRaw": 142766}, "1664": {"acRate": 63.63607306665814, "difficulty": "Medium", "likes": 1313, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1664", "paidOnly": false, "title": "Ways to Make a Fair Array", "titleSlug": "ways-to-make-a-fair-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39819, "totalSubmissionRaw": 62573}, "1665": {"acRate": 58.26283500161446, "difficulty": "Hard", "likes": 577, "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": 18044, "totalSubmissionRaw": 30970}, "1666": {"acRate": 73.86466165413533, "difficulty": "Medium", "likes": 63, "dislikes": 189, "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": 4912, "totalSubmissionRaw": 6650}, "1667": {"acRate": 61.44677624934172, "difficulty": "Easy", "likes": 873, "dislikes": 107, "categoryTitle": "Database", "frontendQuestionId": "1667", "paidOnly": false, "title": "Fix Names in a Table", "titleSlug": "fix-names-in-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241524, "totalSubmissionRaw": 393064}, "1668": {"acRate": 38.83405775033914, "difficulty": "Easy", "likes": 699, "dislikes": 266, "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": 56109, "totalSubmissionRaw": 144484}, "1669": {"acRate": 81.68582489466384, "difficulty": "Medium", "likes": 2082, "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": 219654, "totalSubmissionRaw": 268901}, "1670": {"acRate": 56.453598577374784, "difficulty": "Medium", "likes": 747, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1670", "paidOnly": false, "title": "Design Front Middle Back Queue", "titleSlug": "design-front-middle-back-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28889, "totalSubmissionRaw": 51173}, "1671": {"acRate": 41.920892068167475, "difficulty": "Hard", "likes": 1588, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "1671", "paidOnly": false, "title": "Minimum Number of Removals to Make Mountain Array", "titleSlug": "minimum-number-of-removals-to-make-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31880, "totalSubmissionRaw": 76048}, "1672": {"acRate": 88.15454311345077, "difficulty": "Easy", "likes": 4359, "dislikes": 366, "categoryTitle": "Algorithms", "frontendQuestionId": "1672", "paidOnly": false, "title": "Richest Customer Wealth", "titleSlug": "richest-customer-wealth", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 913996, "totalSubmissionRaw": 1036811}, "1673": {"acRate": 50.597020730426664, "difficulty": "Medium", "likes": 2039, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1673", "paidOnly": false, "title": "Find the Most Competitive Subsequence", "titleSlug": "find-the-most-competitive-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65045, "totalSubmissionRaw": 128555}, "1674": {"acRate": 39.9694589877836, "difficulty": "Medium", "likes": 664, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1674", "paidOnly": false, "title": "Minimum Moves to Make Array Complementary", "titleSlug": "minimum-moves-to-make-array-complementary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9161, "totalSubmissionRaw": 22920}, "1675": {"acRate": 54.04125764689145, "difficulty": "Hard", "likes": 3034, "dislikes": 170, "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": 94964, "totalSubmissionRaw": 175725}, "1676": {"acRate": 78.57492055732095, "difficulty": "Medium", "likes": 473, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1676", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree IV", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iv", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45003, "totalSubmissionRaw": 57274}, "1677": {"acRate": 38.163985012122545, "difficulty": "Easy", "likes": 37, "dislikes": 134, "categoryTitle": "Database", "frontendQuestionId": "1677", "paidOnly": true, "title": "Product's Worth Over Invoices", "titleSlug": "products-worth-over-invoices", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17315, "totalSubmissionRaw": 45370}, "1678": {"acRate": 87.34904236641603, "difficulty": "Easy", "likes": 1571, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1678", "paidOnly": false, "title": "Goal Parser Interpretation", "titleSlug": "goal-parser-interpretation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 262193, "totalSubmissionRaw": 300167}, "1679": {"acRate": 55.14080921233011, "difficulty": "Medium", "likes": 3147, "dislikes": 89, "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": 323790, "totalSubmissionRaw": 587205}, "1680": {"acRate": 57.11825415781468, "difficulty": "Medium", "likes": 1420, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "1680", "paidOnly": false, "title": "Concatenation of Consecutive Binary Numbers", "titleSlug": "concatenation-of-consecutive-binary-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90874, "totalSubmissionRaw": 159098}, "1681": {"acRate": 38.88537335020792, "difficulty": "Hard", "likes": 276, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1681", "paidOnly": false, "title": "Minimum Incompatibility", "titleSlug": "minimum-incompatibility", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8603, "totalSubmissionRaw": 22124}, "1682": {"acRate": 50.09022013713461, "difficulty": "Medium", "likes": 149, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1682", "paidOnly": true, "title": "Longest Palindromic Subsequence II", "titleSlug": "longest-palindromic-subsequence-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5552, "totalSubmissionRaw": 11084}, "1683": {"acRate": 85.3352401881275, "difficulty": "Easy", "likes": 979, "dislikes": 363, "categoryTitle": "Database", "frontendQuestionId": "1683", "paidOnly": false, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 587124, "totalSubmissionRaw": 688022}, "1684": {"acRate": 83.45390324599839, "difficulty": "Easy", "likes": 1720, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1684", "paidOnly": false, "title": "Count the Number of Consistent Strings", "titleSlug": "count-the-number-of-consistent-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 186652, "totalSubmissionRaw": 223659}, "1685": {"acRate": 68.41695501730104, "difficulty": "Medium", "likes": 2063, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1685", "paidOnly": false, "title": "Sum of Absolute Differences in a Sorted Array", "titleSlug": "sum-of-absolute-differences-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110726, "totalSubmissionRaw": 161840}, "1686": {"acRate": 57.34193186597505, "difficulty": "Medium", "likes": 832, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1686", "paidOnly": false, "title": "Stone Game VI", "titleSlug": "stone-game-vi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20451, "totalSubmissionRaw": 35665}, "1687": {"acRate": 39.01787304791877, "difficulty": "Hard", "likes": 374, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1687", "paidOnly": false, "title": "Delivering Boxes from Storage to Ports", "titleSlug": "delivering-boxes-from-storage-to-ports", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6571, "totalSubmissionRaw": 16841}, "1688": {"acRate": 85.72608566964254, "difficulty": "Easy", "likes": 1757, "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": 249084, "totalSubmissionRaw": 290558}, "1689": {"acRate": 88.73125382068768, "difficulty": "Medium", "likes": 2415, "dislikes": 1491, "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": 223530, "totalSubmissionRaw": 251918}, "1690": {"acRate": 58.09018144711248, "difficulty": "Medium", "likes": 987, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "1690", "paidOnly": false, "title": "Stone Game VII", "titleSlug": "stone-game-vii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36433, "totalSubmissionRaw": 62718}, "1691": {"acRate": 57.92246020372593, "difficulty": "Hard", "likes": 1154, "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": 29910, "totalSubmissionRaw": 51638}, "1692": {"acRate": 62.646286123716266, "difficulty": "Hard", "likes": 73, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "1692", "paidOnly": true, "title": "Count Ways to Distribute Candies", "titleSlug": "count-ways-to-distribute-candies", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2623, "totalSubmissionRaw": 4187}, "1693": {"acRate": 86.56501269572577, "difficulty": "Easy", "likes": 552, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1693", "paidOnly": false, "title": "Daily Leads and Partners", "titleSlug": "daily-leads-and-partners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130913, "totalSubmissionRaw": 151231}, "1694": {"acRate": 65.9514956620775, "difficulty": "Easy", "likes": 349, "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": 39377, "totalSubmissionRaw": 59706}, "1695": {"acRate": 58.40625110929679, "difficulty": "Medium", "likes": 2799, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1695", "paidOnly": false, "title": "Maximum Erasure Value", "titleSlug": "maximum-erasure-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131629, "totalSubmissionRaw": 225368}, "1696": {"acRate": 45.66474715743471, "difficulty": "Medium", "likes": 3409, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "1696", "paidOnly": false, "title": "Jump Game VI", "titleSlug": "jump-game-vi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108878, "totalSubmissionRaw": 238429}, "1697": {"acRate": 62.532722513089, "difficulty": "Hard", "likes": 1961, "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": 51597, "totalSubmissionRaw": 82512}, "1698": {"acRate": 64.19198895027624, "difficulty": "Medium", "likes": 194, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1698", "paidOnly": true, "title": "Number of Distinct Substrings in a String", "titleSlug": "number-of-distinct-substrings-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11153, "totalSubmissionRaw": 17375}, "1699": {"acRate": 81.192929388411, "difficulty": "Medium", "likes": 292, "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": 42947, "totalSubmissionRaw": 52895}, "1700": {"acRate": 78.29786445774764, "difficulty": "Easy", "likes": 2398, "dislikes": 237, "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": 253606, "totalSubmissionRaw": 323899}, "1701": {"acRate": 73.05792848197095, "difficulty": "Medium", "likes": 1206, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "1701", "paidOnly": false, "title": "Average Waiting Time", "titleSlug": "average-waiting-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 195418, "totalSubmissionRaw": 267483}, "1702": {"acRate": 46.92721903769324, "difficulty": "Medium", "likes": 494, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1702", "paidOnly": false, "title": "Maximum Binary String After Change", "titleSlug": "maximum-binary-string-after-change", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13508, "totalSubmissionRaw": 28785}, "1703": {"acRate": 42.653831634579085, "difficulty": "Hard", "likes": 713, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1703", "paidOnly": false, "title": "Minimum Adjacent Swaps for K Consecutive Ones", "titleSlug": "minimum-adjacent-swaps-for-k-consecutive-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11299, "totalSubmissionRaw": 26490}, "1704": {"acRate": 78.65425188749978, "difficulty": "Easy", "likes": 2244, "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": 360872, "totalSubmissionRaw": 458808}, "1705": {"acRate": 39.31528343459972, "difficulty": "Medium", "likes": 831, "dislikes": 186, "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": 23553, "totalSubmissionRaw": 59908}, "1706": {"acRate": 71.84528228964311, "difficulty": "Medium", "likes": 3089, "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": 141278, "totalSubmissionRaw": 196642}, "1707": {"acRate": 51.200065254185446, "difficulty": "Hard", "likes": 1220, "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": 25108, "totalSubmissionRaw": 49039}, "1708": {"acRate": 64.91896332810516, "difficulty": "Easy", "likes": 103, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1708", "paidOnly": true, "title": "Largest Subarray Length K", "titleSlug": "largest-subarray-length-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8692, "totalSubmissionRaw": 13389}, "1709": {"acRate": 70.47677982083923, "difficulty": "Medium", "likes": 209, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "1709", "paidOnly": true, "title": "Biggest Window Between Visits", "titleSlug": "biggest-window-between-visits", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23917, "totalSubmissionRaw": 33936}, "1710": {"acRate": 73.73323565740405, "difficulty": "Easy", "likes": 3827, "dislikes": 222, "categoryTitle": "Algorithms", "frontendQuestionId": "1710", "paidOnly": false, "title": "Maximum Units on a Truck", "titleSlug": "maximum-units-on-a-truck", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 311009, "totalSubmissionRaw": 421803}, "1711": {"acRate": 30.41192540500004, "difficulty": "Medium", "likes": 1043, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1711", "paidOnly": false, "title": "Count Good Meals", "titleSlug": "count-good-meals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39742, "totalSubmissionRaw": 130679}, "1712": {"acRate": 32.9991662365506, "difficulty": "Medium", "likes": 1403, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1712", "paidOnly": false, "title": "Ways to Split Array Into Three Subarrays", "titleSlug": "ways-to-split-array-into-three-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33246, "totalSubmissionRaw": 100748}, "1713": {"acRate": 47.72357723577236, "difficulty": "Hard", "likes": 717, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1713", "paidOnly": false, "title": "Minimum Operations to Make a Subsequence", "titleSlug": "minimum-operations-to-make-a-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12327, "totalSubmissionRaw": 25830}, "1714": {"acRate": 49.61294862772696, "difficulty": "Hard", "likes": 31, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1714", "paidOnly": true, "title": "Sum Of Special Evenly-Spaced Elements In Array", "titleSlug": "sum-of-special-evenly-spaced-elements-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1410, "totalSubmissionRaw": 2842}, "1715": {"acRate": 75.54486408467645, "difficulty": "Medium", "likes": 82, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1715", "paidOnly": true, "title": "Count Apples and Oranges", "titleSlug": "count-apples-and-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15702, "totalSubmissionRaw": 20785}, "1716": {"acRate": 78.34334813782692, "difficulty": "Easy", "likes": 1433, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1716", "paidOnly": false, "title": "Calculate Money in Leetcode Bank", "titleSlug": "calculate-money-in-leetcode-bank", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161931, "totalSubmissionRaw": 206694}, "1717": {"acRate": 63.08352743240901, "difficulty": "Medium", "likes": 1398, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "1717", "paidOnly": false, "title": "Maximum Score From Removing Substrings", "titleSlug": "maximum-score-from-removing-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134607, "totalSubmissionRaw": 213379}, "1718": {"acRate": 53.805625047380786, "difficulty": "Medium", "likes": 564, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1718", "paidOnly": false, "title": "Construct the Lexicographically Largest Valid Sequence", "titleSlug": "construct-the-lexicographically-largest-valid-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14195, "totalSubmissionRaw": 26382}, "1719": {"acRate": 44.56563706563706, "difficulty": "Hard", "likes": 218, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "1719", "paidOnly": false, "title": "Number Of Ways To Reconstruct A Tree", "titleSlug": "number-of-ways-to-reconstruct-a-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4617, "totalSubmissionRaw": 10360}, "1720": {"acRate": 86.49658971668416, "difficulty": "Easy", "likes": 1592, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "1720", "paidOnly": false, "title": "Decode XORed Array", "titleSlug": "decode-xored-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 158268, "totalSubmissionRaw": 182976}, "1721": {"acRate": 68.02113606340819, "difficulty": "Medium", "likes": 5352, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "1721", "paidOnly": false, "title": "Swapping Nodes in a Linked List", "titleSlug": "swapping-nodes-in-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 347570, "totalSubmissionRaw": 510973}, "1722": {"acRate": 48.86042920283295, "difficulty": "Medium", "likes": 838, "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": 18351, "totalSubmissionRaw": 37558}, "1723": {"acRate": 42.48059678999322, "difficulty": "Hard", "likes": 1045, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1723", "paidOnly": false, "title": "Find Minimum Time to Finish All Jobs", "titleSlug": "find-minimum-time-to-finish-all-jobs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28188, "totalSubmissionRaw": 66355}, "1724": {"acRate": 51.421319796954315, "difficulty": "Hard", "likes": 105, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1724", "paidOnly": true, "title": "Checking Existence of Edge Length Limited Paths II", "titleSlug": "checking-existence-of-edge-length-limited-paths-ii", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3039, "totalSubmissionRaw": 5910}, "1725": {"acRate": 78.77703287197232, "difficulty": "Easy", "likes": 588, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1725", "paidOnly": false, "title": "Number Of Rectangles That Can Form The Largest Square", "titleSlug": "number-of-rectangles-that-can-form-the-largest-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72853, "totalSubmissionRaw": 92480}, "1726": {"acRate": 61.18062995500322, "difficulty": "Medium", "likes": 626, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1726", "paidOnly": false, "title": "Tuple with Same Product", "titleSlug": "tuple-with-same-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28553, "totalSubmissionRaw": 46670}, "1727": {"acRate": 75.38234866878332, "difficulty": "Medium", "likes": 1911, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "1727", "paidOnly": false, "title": "Largest Submatrix With Rearrangements", "titleSlug": "largest-submatrix-with-rearrangements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72652, "totalSubmissionRaw": 96378}, "1728": {"acRate": 39.977027840070015, "difficulty": "Hard", "likes": 270, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1728", "paidOnly": false, "title": "Cat and Mouse II", "titleSlug": "cat-and-mouse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7309, "totalSubmissionRaw": 18283}, "1729": {"acRate": 69.1392051648341, "difficulty": "Easy", "likes": 573, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1729", "paidOnly": false, "title": "Find Followers Count", "titleSlug": "find-followers-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 212469, "totalSubmissionRaw": 307306}, "1730": {"acRate": 54.99423645567083, "difficulty": "Medium", "likes": 674, "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": 65838, "totalSubmissionRaw": 119718}, "1731": {"acRate": 48.69646274502053, "difficulty": "Easy", "likes": 530, "dislikes": 72, "categoryTitle": "Database", "frontendQuestionId": "1731", "paidOnly": false, "title": "The Number of Employees Which Report to Each Employee", "titleSlug": "the-number-of-employees-which-report-to-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147840, "totalSubmissionRaw": 303588}, "1732": {"acRate": 83.38737114809874, "difficulty": "Easy", "likes": 2883, "dislikes": 343, "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": 427443, "totalSubmissionRaw": 512599}, "1733": {"acRate": 42.67702552719201, "difficulty": "Medium", "likes": 215, "dislikes": 397, "categoryTitle": "Algorithms", "frontendQuestionId": "1733", "paidOnly": false, "title": "Minimum Number of People to Teach", "titleSlug": "minimum-number-of-people-to-teach", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9613, "totalSubmissionRaw": 22525}, "1734": {"acRate": 64.8528618270867, "difficulty": "Medium", "likes": 762, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1734", "paidOnly": false, "title": "Decode XORed Permutation", "titleSlug": "decode-xored-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15625, "totalSubmissionRaw": 24093}, "1735": {"acRate": 51.79582523451365, "difficulty": "Hard", "likes": 290, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1735", "paidOnly": false, "title": "Count Ways to Make Array With Product", "titleSlug": "count-ways-to-make-array-with-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6129, "totalSubmissionRaw": 11833}, "1736": {"acRate": 42.771886333379236, "difficulty": "Easy", "likes": 367, "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": 37268, "totalSubmissionRaw": 87132}, "1737": {"acRate": 36.74036806566927, "difficulty": "Medium", "likes": 323, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "1737", "paidOnly": false, "title": "Change Minimum Characters to Satisfy One of Three Conditions", "titleSlug": "change-minimum-characters-to-satisfy-one-of-three-conditions", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13875, "totalSubmissionRaw": 37765}, "1738": {"acRate": 61.82805921499389, "difficulty": "Medium", "likes": 507, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1738", "paidOnly": false, "title": "Find Kth Largest XOR Coordinate Value", "titleSlug": "find-kth-largest-xor-coordinate-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22762, "totalSubmissionRaw": 36815}, "1739": {"acRate": 51.84979523842577, "difficulty": "Hard", "likes": 306, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1739", "paidOnly": false, "title": "Building Boxes", "titleSlug": "building-boxes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7470, "totalSubmissionRaw": 14407}, "1740": {"acRate": 73.55665584800171, "difficulty": "Medium", "likes": 460, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1740", "paidOnly": true, "title": "Find Distance in a Binary Tree", "titleSlug": "find-distance-in-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31049, "totalSubmissionRaw": 42211}, "1741": {"acRate": 86.83919053709222, "difficulty": "Easy", "likes": 713, "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": 141910, "totalSubmissionRaw": 163417}, "1742": {"acRate": 73.54222613462889, "difficulty": "Easy", "likes": 605, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "1742", "paidOnly": false, "title": "Maximum Number of Balls in a Box", "titleSlug": "maximum-number-of-balls-in-a-box", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65999, "totalSubmissionRaw": 89743}, "1743": {"acRate": 74.7562820840559, "difficulty": "Medium", "likes": 1949, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1743", "paidOnly": false, "title": "Restore the Array From Adjacent Pairs", "titleSlug": "restore-the-array-from-adjacent-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108200, "totalSubmissionRaw": 144737}, "1744": {"acRate": 34.287601849812816, "difficulty": "Medium", "likes": 131, "dislikes": 327, "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": 10899, "totalSubmissionRaw": 31787}, "1745": {"acRate": 44.352745769749816, "difficulty": "Hard", "likes": 914, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1745", "paidOnly": false, "title": "Palindrome Partitioning IV", "titleSlug": "palindrome-partitioning-iv", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25635, "totalSubmissionRaw": 57798}, "1746": {"acRate": 62.331172339276065, "difficulty": "Medium", "likes": 274, "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": 9230, "totalSubmissionRaw": 14808}, "1747": {"acRate": 63.47173900644499, "difficulty": "Medium", "likes": 185, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1747", "paidOnly": true, "title": "Leetflex Banned Accounts", "titleSlug": "leetflex-banned-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22257, "totalSubmissionRaw": 35066}, "1748": {"acRate": 78.0132635619265, "difficulty": "Easy", "likes": 1546, "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": 178452, "totalSubmissionRaw": 228746}, "1749": {"acRate": 60.28228485376405, "difficulty": "Medium", "likes": 1272, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1749", "paidOnly": false, "title": "Maximum Absolute Sum of Any Subarray", "titleSlug": "maximum-absolute-sum-of-any-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40831, "totalSubmissionRaw": 67733}, "1750": {"acRate": 55.91851249745987, "difficulty": "Medium", "likes": 1214, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1750", "paidOnly": false, "title": "Minimum Length of String After Deleting Similar Ends", "titleSlug": "minimum-length-of-string-after-deleting-similar-ends", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165105, "totalSubmissionRaw": 295260}, "1751": {"acRate": 61.5222930970119, "difficulty": "Hard", "likes": 2073, "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": 75809, "totalSubmissionRaw": 123222}, "1752": {"acRate": 51.29686832779685, "difficulty": "Easy", "likes": 3175, "dislikes": 174, "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": 277491, "totalSubmissionRaw": 540954}, "1753": {"acRate": 67.41413884202821, "difficulty": "Medium", "likes": 944, "dislikes": 56, "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": 42359, "totalSubmissionRaw": 62834}, "1754": {"acRate": 48.532015647519046, "difficulty": "Medium", "likes": 545, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1754", "paidOnly": false, "title": "Largest Merge Of Two Strings", "titleSlug": "largest-merge-of-two-strings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23572, "totalSubmissionRaw": 48570}, "1755": {"acRate": 39.64767196450876, "difficulty": "Hard", "likes": 894, "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": 18410, "totalSubmissionRaw": 46434}, "1756": {"acRate": 75.76214261109197, "difficulty": "Medium", "likes": 288, "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": 17595, "totalSubmissionRaw": 23224}, "1757": {"acRate": 89.2176934147765, "difficulty": "Easy", "likes": 2363, "dislikes": 106, "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": 1167894, "totalSubmissionRaw": 1309039}, "1758": {"acRate": 63.747888778018236, "difficulty": "Easy", "likes": 1424, "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": 147578, "totalSubmissionRaw": 231502}, "1759": {"acRate": 57.65229627734425, "difficulty": "Medium", "likes": 1481, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1759", "paidOnly": false, "title": "Count Number of Homogenous Substrings", "titleSlug": "count-number-of-homogenous-substrings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112667, "totalSubmissionRaw": 195425}, "1760": {"acRate": 60.310464351879524, "difficulty": "Medium", "likes": 1989, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1760", "paidOnly": false, "title": "Minimum Limit of Balls in a Bag", "titleSlug": "minimum-limit-of-balls-in-a-bag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40367, "totalSubmissionRaw": 66932}, "1761": {"acRate": 42.47436501322512, "difficulty": "Hard", "likes": 322, "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": 23445, "totalSubmissionRaw": 55198}, "1762": {"acRate": 79.8478872242956, "difficulty": "Medium", "likes": 1211, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1762", "paidOnly": true, "title": "Buildings With an Ocean View", "titleSlug": "buildings-with-an-ocean-view", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 225717, "totalSubmissionRaw": 282684}, "1763": {"acRate": 60.68602141436371, "difficulty": "Easy", "likes": 1337, "dislikes": 884, "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": 57358, "totalSubmissionRaw": 94516}, "1764": {"acRate": 53.651392209016535, "difficulty": "Medium", "likes": 330, "dislikes": 42, "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": 15935, "totalSubmissionRaw": 29701}, "1765": {"acRate": 62.810320008858376, "difficulty": "Medium", "likes": 826, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1765", "paidOnly": false, "title": "Map of Highest Peak", "titleSlug": "map-of-highest-peak", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28362, "totalSubmissionRaw": 45155}, "1766": {"acRate": 41.19530416221985, "difficulty": "Hard", "likes": 401, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1766", "paidOnly": false, "title": "Tree of Coprimes", "titleSlug": "tree-of-coprimes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10036, "totalSubmissionRaw": 24362}, "1767": {"acRate": 77.29780490667919, "difficulty": "Hard", "likes": 172, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1767", "paidOnly": true, "title": "Find the Subtasks That Did Not Execute", "titleSlug": "find-the-subtasks-that-did-not-execute", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13170, "totalSubmissionRaw": 17038}, "1768": {"acRate": 80.40341796209248, "difficulty": "Easy", "likes": 3878, "dislikes": 97, "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": 967100, "totalSubmissionRaw": 1202812}, "1769": {"acRate": 85.94247936501654, "difficulty": "Medium", "likes": 2247, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1769", "paidOnly": false, "title": "Minimum Number of Operations to Move All Balls to Each Box", "titleSlug": "minimum-number-of-operations-to-move-all-balls-to-each-box", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130257, "totalSubmissionRaw": 151563}, "1770": {"acRate": 40.60105817083532, "difficulty": "Hard", "likes": 2518, "dislikes": 511, "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": 113726, "totalSubmissionRaw": 280106}, "1771": {"acRate": 36.4427305755625, "difficulty": "Hard", "likes": 539, "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": 11435, "totalSubmissionRaw": 31378}, "1772": {"acRate": 65.80432236772064, "difficulty": "Medium", "likes": 89, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1772", "paidOnly": true, "title": "Sort Features by Popularity", "titleSlug": "sort-features-by-popularity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6181, "totalSubmissionRaw": 9393}, "1773": {"acRate": 85.02786305209274, "difficulty": "Easy", "likes": 1885, "dislikes": 226, "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": 232380, "totalSubmissionRaw": 273299}, "1774": {"acRate": 47.600220669363736, "difficulty": "Medium", "likes": 705, "dislikes": 87, "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": 31062, "totalSubmissionRaw": 65256}, "1775": {"acRate": 53.737511679724, "difficulty": "Medium", "likes": 919, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1775", "paidOnly": false, "title": "Equal Sum Arrays With Minimum Number of Operations", "titleSlug": "equal-sum-arrays-with-minimum-number-of-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29906, "totalSubmissionRaw": 55652}, "1776": {"acRate": 55.38956127080181, "difficulty": "Hard", "likes": 889, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1776", "paidOnly": false, "title": "Car Fleet II", "titleSlug": "car-fleet-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26361, "totalSubmissionRaw": 47592}, "1777": {"acRate": 82.2336823872136, "difficulty": "Easy", "likes": 134, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1777", "paidOnly": true, "title": "Product's Price for Each Store", "titleSlug": "products-price-for-each-store", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20889, "totalSubmissionRaw": 25402}, "1778": {"acRate": 40.090502338824486, "difficulty": "Medium", "likes": 166, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1778", "paidOnly": true, "title": "Shortest Path in a Hidden Grid", "titleSlug": "shortest-path-in-a-hidden-grid", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7885, "totalSubmissionRaw": 19668}, "1779": {"acRate": 68.63983038369798, "difficulty": "Easy", "likes": 844, "dislikes": 186, "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": 116547, "totalSubmissionRaw": 169795}, "1780": {"acRate": 67.92630341042728, "difficulty": "Medium", "likes": 973, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1780", "paidOnly": false, "title": "Check if Number is a Sum of Powers of Three", "titleSlug": "check-if-number-is-a-sum-of-powers-of-three", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43320, "totalSubmissionRaw": 63775}, "1781": {"acRate": 66.91171686942945, "difficulty": "Medium", "likes": 1110, "dislikes": 176, "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": 61710, "totalSubmissionRaw": 92226}, "1782": {"acRate": 40.286357600600425, "difficulty": "Hard", "likes": 314, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "1782", "paidOnly": false, "title": "Count Pairs Of Nodes", "titleSlug": "count-pairs-of-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6978, "totalSubmissionRaw": 17321}, "1783": {"acRate": 83.59354755117906, "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": 25807, "totalSubmissionRaw": 30872}, "1784": {"acRate": 39.16536838972815, "difficulty": "Easy", "likes": 336, "dislikes": 965, "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": 44748, "totalSubmissionRaw": 114254}, "1785": {"acRate": 43.59679493520625, "difficulty": "Medium", "likes": 264, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1785", "paidOnly": false, "title": "Minimum Elements to Add to Form a Given Sum", "titleSlug": "minimum-elements-to-add-to-form-a-given-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22036, "totalSubmissionRaw": 50545}, "1786": {"acRate": 39.22408383534137, "difficulty": "Medium", "likes": 1093, "dislikes": 210, "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": 25003, "totalSubmissionRaw": 63744}, "1787": {"acRate": 39.764532744665196, "difficulty": "Hard", "likes": 401, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1787", "paidOnly": false, "title": "Make the XOR of All Segments Equal to Zero", "titleSlug": "make-the-xor-of-all-segments-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5404, "totalSubmissionRaw": 13590}, "1788": {"acRate": 67.02973211657344, "difficulty": "Hard", "likes": 75, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1788", "paidOnly": true, "title": "Maximize the Beauty of the Garden", "titleSlug": "maximize-the-beauty-of-the-garden", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2277, "totalSubmissionRaw": 3397}, "1789": {"acRate": 64.54673601322122, "difficulty": "Easy", "likes": 503, "dislikes": 219, "categoryTitle": "Database", "frontendQuestionId": "1789", "paidOnly": false, "title": "Primary Department for Each Employee", "titleSlug": "primary-department-for-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132792, "totalSubmissionRaw": 205730}, "1790": {"acRate": 45.743257112360936, "difficulty": "Easy", "likes": 1091, "dislikes": 58, "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": 111426, "totalSubmissionRaw": 243590}, "1791": {"acRate": 86.68074384633432, "difficulty": "Easy", "likes": 1793, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1791", "paidOnly": false, "title": "Find Center of Star Graph", "titleSlug": "find-center-of-star-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 339896, "totalSubmissionRaw": 392124}, "1792": {"acRate": 54.0386145057488, "difficulty": "Medium", "likes": 726, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1792", "paidOnly": false, "title": "Maximum Average Pass Ratio", "titleSlug": "maximum-average-pass-ratio", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22419, "totalSubmissionRaw": 41487}, "1793": {"acRate": 64.31106863715486, "difficulty": "Hard", "likes": 1853, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1793", "paidOnly": false, "title": "Maximum Score of a Good Subarray", "titleSlug": "maximum-score-of-a-good-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75370, "totalSubmissionRaw": 117196}, "1794": {"acRate": 65.25008172605426, "difficulty": "Medium", "likes": 44, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1794", "paidOnly": true, "title": "Count Pairs of Equal Substrings With Minimum Difference", "titleSlug": "count-pairs-of-equal-substrings-with-minimum-difference", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1996, "totalSubmissionRaw": 3059}, "1795": {"acRate": 85.29312999347404, "difficulty": "Easy", "likes": 855, "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": 134619, "totalSubmissionRaw": 157831}, "1796": {"acRate": 50.5546215647678, "difficulty": "Easy", "likes": 527, "dislikes": 130, "categoryTitle": "Algorithms", "frontendQuestionId": "1796", "paidOnly": false, "title": "Second Largest Digit in a String", "titleSlug": "second-largest-digit-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59841, "totalSubmissionRaw": 118369}, "1797": {"acRate": 57.5957458635193, "difficulty": "Medium", "likes": 374, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1797", "paidOnly": false, "title": "Design Authentication Manager", "titleSlug": "design-authentication-manager", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31085, "totalSubmissionRaw": 53971}, "1798": {"acRate": 60.990201764292905, "difficulty": "Medium", "likes": 813, "dislikes": 57, "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": 19981, "totalSubmissionRaw": 32761}, "1799": {"acRate": 57.76313932150755, "difficulty": "Hard", "likes": 1630, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1799", "paidOnly": false, "title": "Maximize Score After N Operations", "titleSlug": "maximize-score-after-n-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61382, "totalSubmissionRaw": 106265}, "1800": {"acRate": 62.00756732695304, "difficulty": "Easy", "likes": 719, "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": 58506, "totalSubmissionRaw": 94353}, "1801": {"acRate": 49.84226397587567, "difficulty": "Medium", "likes": 291, "dislikes": 236, "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": 21487, "totalSubmissionRaw": 43110}, "1802": {"acRate": 39.218808642968206, "difficulty": "Medium", "likes": 2543, "dislikes": 446, "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": 73147, "totalSubmissionRaw": 186510}, "1803": {"acRate": 48.09663993503197, "difficulty": "Hard", "likes": 526, "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": 9476, "totalSubmissionRaw": 19702}, "1804": {"acRate": 61.50740242261104, "difficulty": "Medium", "likes": 319, "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": 18737, "totalSubmissionRaw": 30463}, "1805": {"acRate": 38.061332447814905, "difficulty": "Easy", "likes": 612, "dislikes": 100, "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": 49286, "totalSubmissionRaw": 129491}, "1806": {"acRate": 72.79275881576466, "difficulty": "Medium", "likes": 317, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "1806", "paidOnly": false, "title": "Minimum Number of Operations to Reinitialize a Permutation", "titleSlug": "minimum-number-of-operations-to-reinitialize-a-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19301, "totalSubmissionRaw": 26515}, "1807": {"acRate": 67.01929460136625, "difficulty": "Medium", "likes": 482, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1807", "paidOnly": false, "title": "Evaluate the Bracket Pairs of a String", "titleSlug": "evaluate-the-bracket-pairs-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31296, "totalSubmissionRaw": 46697}, "1808": {"acRate": 33.154387263976304, "difficulty": "Hard", "likes": 224, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "1808", "paidOnly": false, "title": "Maximize Number of Nice Divisors", "titleSlug": "maximize-number-of-nice-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7164, "totalSubmissionRaw": 21608}, "1809": {"acRate": 58.568306010928964, "difficulty": "Easy", "likes": 89, "dislikes": 61, "categoryTitle": "Database", "frontendQuestionId": "1809", "paidOnly": true, "title": "Ad-Free Sessions", "titleSlug": "ad-free-sessions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16077, "totalSubmissionRaw": 27450}, "1810": {"acRate": 56.702459300311745, "difficulty": "Medium", "likes": 86, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1810", "paidOnly": true, "title": "Minimum Path Cost in a Hidden Grid", "titleSlug": "minimum-path-cost-in-a-hidden-grid", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3274, "totalSubmissionRaw": 5774}, "1811": {"acRate": 60.974852530270105, "difficulty": "Medium", "likes": 197, "dislikes": 26, "categoryTitle": "Database", "frontendQuestionId": "1811", "paidOnly": true, "title": "Find Interview Candidates", "titleSlug": "find-interview-candidates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15712, "totalSubmissionRaw": 25768}, "1812": {"acRate": 78.60392445200128, "difficulty": "Easy", "likes": 811, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1812", "paidOnly": false, "title": "Determine Color of a Chessboard Square", "titleSlug": "determine-color-of-a-chessboard-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85525, "totalSubmissionRaw": 108805}, "1813": {"acRate": 33.55065195586761, "difficulty": "Medium", "likes": 403, "dislikes": 68, "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": 17394, "totalSubmissionRaw": 51844}, "1814": {"acRate": 48.74428517106904, "difficulty": "Medium", "likes": 1822, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1814", "paidOnly": false, "title": "Count Nice Pairs in an Array", "titleSlug": "count-nice-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110243, "totalSubmissionRaw": 226166}, "1815": {"acRate": 39.972486392726836, "difficulty": "Hard", "likes": 341, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1815", "paidOnly": false, "title": "Maximum Number of Groups Getting Fresh Donuts", "titleSlug": "maximum-number-of-groups-getting-fresh-donuts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6683, "totalSubmissionRaw": 16719}, "1816": {"acRate": 85.41442127600462, "difficulty": "Easy", "likes": 1138, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1816", "paidOnly": false, "title": "Truncate Sentence", "titleSlug": "truncate-sentence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 178312, "totalSubmissionRaw": 208761}, "1817": {"acRate": 80.50724539453172, "difficulty": "Medium", "likes": 826, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "1817", "paidOnly": false, "title": "Finding the Users Active Minutes", "titleSlug": "finding-the-users-active-minutes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59391, "totalSubmissionRaw": 73771}, "1818": {"acRate": 30.740190320956877, "difficulty": "Medium", "likes": 1021, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1818", "paidOnly": false, "title": "Minimum Absolute Sum Difference", "titleSlug": "minimum-absolute-sum-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25649, "totalSubmissionRaw": 83438}, "1819": {"acRate": 40.93992036056535, "difficulty": "Hard", "likes": 412, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1819", "paidOnly": false, "title": "Number of Different Subsequences GCDs", "titleSlug": "number-of-different-subsequences-gcds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9356, "totalSubmissionRaw": 22853}, "1820": {"acRate": 50.167407317221645, "difficulty": "Medium", "likes": 214, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1820", "paidOnly": true, "title": "Maximum Number of Accepted Invitations", "titleSlug": "maximum-number-of-accepted-invitations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8241, "totalSubmissionRaw": 16427}, "1821": {"acRate": 87.83164328378942, "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": 25292, "totalSubmissionRaw": 28796}, "1822": {"acRate": 65.3057568540487, "difficulty": "Easy", "likes": 2158, "dislikes": 217, "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": 346321, "totalSubmissionRaw": 530307}, "1823": {"acRate": 81.7249863313286, "difficulty": "Medium", "likes": 3761, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "1823", "paidOnly": false, "title": "Find the Winner of the Circular Game", "titleSlug": "find-the-winner-of-the-circular-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 286992, "totalSubmissionRaw": 351168}, "1824": {"acRate": 50.16896134438432, "difficulty": "Medium", "likes": 1189, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1824", "paidOnly": false, "title": "Minimum Sideway Jumps", "titleSlug": "minimum-sideway-jumps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43945, "totalSubmissionRaw": 87594}, "1825": {"acRate": 37.24212196780775, "difficulty": "Hard", "likes": 449, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1825", "paidOnly": false, "title": "Finding MK Average", "titleSlug": "finding-mk-average", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19713, "totalSubmissionRaw": 52932}, "1826": {"acRate": 49.96881496881497, "difficulty": "Easy", "likes": 67, "dislikes": 75, "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": 4807, "totalSubmissionRaw": 9620}, "1827": {"acRate": 80.03597551754602, "difficulty": "Easy", "likes": 1232, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1827", "paidOnly": false, "title": "Minimum Operations to Make the Array Increasing", "titleSlug": "minimum-operations-to-make-the-array-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 100558, "totalSubmissionRaw": 125641}, "1828": {"acRate": 86.35732026215302, "difficulty": "Medium", "likes": 1142, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1828", "paidOnly": false, "title": "Queries on Number of Points Inside a Circle", "titleSlug": "queries-on-number-of-points-inside-a-circle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78928, "totalSubmissionRaw": 91397}, "1829": {"acRate": 77.15230091216563, "difficulty": "Medium", "likes": 773, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1829", "paidOnly": false, "title": "Maximum XOR for Each Query", "titleSlug": "maximum-xor-for-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30111, "totalSubmissionRaw": 39028}, "1830": {"acRate": 50.14673514306677, "difficulty": "Hard", "likes": 179, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1830", "paidOnly": false, "title": "Minimum Number of Operations to Make String Sorted", "titleSlug": "minimum-number-of-operations-to-make-string-sorted", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4101, "totalSubmissionRaw": 8178}, "1831": {"acRate": 81.74626185643872, "difficulty": "Medium", "likes": 87, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "1831", "paidOnly": true, "title": "Maximum Transaction Each Day", "titleSlug": "maximum-transaction-each-day", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19736, "totalSubmissionRaw": 24143}, "1832": {"acRate": 83.32748964498424, "difficulty": "Easy", "likes": 2760, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1832", "paidOnly": false, "title": "Check if the Sentence Is Pangram", "titleSlug": "check-if-the-sentence-is-pangram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 356485, "totalSubmissionRaw": 427812}, "1833": {"acRate": 73.8418816779153, "difficulty": "Medium", "likes": 2173, "dislikes": 671, "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": 160612, "totalSubmissionRaw": 217508}, "1834": {"acRate": 45.641164353633926, "difficulty": "Medium", "likes": 3165, "dislikes": 267, "categoryTitle": "Algorithms", "frontendQuestionId": "1834", "paidOnly": false, "title": "Single-Threaded CPU", "titleSlug": "single-threaded-cpu", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109676, "totalSubmissionRaw": 240301}, "1835": {"acRate": 61.543351901186725, "difficulty": "Hard", "likes": 601, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1835", "paidOnly": false, "title": "Find XOR Sum of All Pairs Bitwise AND", "titleSlug": "find-xor-sum-of-all-pairs-bitwise-and", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20329, "totalSubmissionRaw": 33032}, "1836": {"acRate": 74.57884710062717, "difficulty": "Medium", "likes": 398, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1836", "paidOnly": true, "title": "Remove Duplicates From an Unsorted Linked List", "titleSlug": "remove-duplicates-from-an-unsorted-linked-list", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34841, "totalSubmissionRaw": 46717}, "1837": {"acRate": 77.53705347995356, "difficulty": "Easy", "likes": 508, "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": 56761, "totalSubmissionRaw": 73205}, "1838": {"acRate": 44.29918312169985, "difficulty": "Medium", "likes": 4628, "dislikes": 209, "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": 153359, "totalSubmissionRaw": 346191}, "1839": {"acRate": 49.52580367040276, "difficulty": "Medium", "likes": 755, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1839", "paidOnly": false, "title": "Longest Substring Of All Vowels in Order", "titleSlug": "longest-substring-of-all-vowels-in-order", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32168, "totalSubmissionRaw": 64952}, "1840": {"acRate": 36.314575872050234, "difficulty": "Hard", "likes": 375, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1840", "paidOnly": false, "title": "Maximum Building Height", "titleSlug": "maximum-building-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7402, "totalSubmissionRaw": 20383}, "1841": {"acRate": 53.46411334267476, "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": 13736, "totalSubmissionRaw": 25692}, "1842": {"acRate": 53.3105864994467, "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": 5781, "totalSubmissionRaw": 10844}, "1843": {"acRate": 44.90971052528497, "difficulty": "Medium", "likes": 92, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1843", "paidOnly": true, "title": "Suspicious Bank Accounts", "titleSlug": "suspicious-bank-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11465, "totalSubmissionRaw": 25529}, "1844": {"acRate": 81.47263268930823, "difficulty": "Easy", "likes": 833, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1844", "paidOnly": false, "title": "Replace All Digits with Characters", "titleSlug": "replace-all-digits-with-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90367, "totalSubmissionRaw": 110917}, "1845": {"acRate": 69.37491656654652, "difficulty": "Medium", "likes": 1414, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1845", "paidOnly": false, "title": "Seat Reservation Manager", "titleSlug": "seat-reservation-manager", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124724, "totalSubmissionRaw": 179783}, "1846": {"acRate": 65.86786226416275, "difficulty": "Medium", "likes": 1077, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1846", "paidOnly": false, "title": "Maximum Element After Decreasing and Rearranging", "titleSlug": "maximum-element-after-decreasing-and-rearranging", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105189, "totalSubmissionRaw": 159697}, "1847": {"acRate": 38.22165688728407, "difficulty": "Hard", "likes": 510, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1847", "paidOnly": false, "title": "Closest Room", "titleSlug": "closest-room", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9315, "totalSubmissionRaw": 24371}, "1848": {"acRate": 54.49457358872153, "difficulty": "Easy", "likes": 362, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1848", "paidOnly": false, "title": "Minimum Distance to the Target Element", "titleSlug": "minimum-distance-to-the-target-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46346, "totalSubmissionRaw": 85047}, "1849": {"acRate": 35.869464117248434, "difficulty": "Medium", "likes": 524, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1849", "paidOnly": false, "title": "Splitting a String Into Descending Consecutive Values", "titleSlug": "splitting-a-string-into-descending-consecutive-values", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26995, "totalSubmissionRaw": 75259}, "1850": {"acRate": 71.33136474515342, "difficulty": "Medium", "likes": 774, "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": 22224, "totalSubmissionRaw": 31156}, "1851": {"acRate": 50.1032034346103, "difficulty": "Hard", "likes": 954, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1851", "paidOnly": false, "title": "Minimum Interval to Include Each Query", "titleSlug": "minimum-interval-to-include-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36411, "totalSubmissionRaw": 72672}, "1852": {"acRate": 71.37281035795887, "difficulty": "Medium", "likes": 134, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1852", "paidOnly": true, "title": "Distinct Numbers in Each Subarray", "titleSlug": "distinct-numbers-in-each-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7497, "totalSubmissionRaw": 10504}, "1853": {"acRate": 85.741923002515, "difficulty": "Easy", "likes": 63, "dislikes": 42, "categoryTitle": "Database", "frontendQuestionId": "1853", "paidOnly": true, "title": "Convert Date Format", "titleSlug": "convert-date-format", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13296, "totalSubmissionRaw": 15507}, "1854": {"acRate": 61.055344090005725, "difficulty": "Easy", "likes": 1304, "dislikes": 230, "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": 72502, "totalSubmissionRaw": 118748}, "1855": {"acRate": 53.4846523765929, "difficulty": "Medium", "likes": 1193, "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": 50827, "totalSubmissionRaw": 95031}, "1856": {"acRate": 38.106167765352694, "difficulty": "Medium", "likes": 1429, "dislikes": 121, "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": 28556, "totalSubmissionRaw": 74938}, "1857": {"acRate": 49.92659395973154, "difficulty": "Hard", "likes": 2122, "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": 66654, "totalSubmissionRaw": 133504}, "1858": {"acRate": 68.5669592422004, "difficulty": "Medium", "likes": 179, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1858", "paidOnly": true, "title": "Longest Word With All Prefixes", "titleSlug": "longest-word-with-all-prefixes", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7890, "totalSubmissionRaw": 11507}, "1859": {"acRate": 83.25730341919208, "difficulty": "Easy", "likes": 2192, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1859", "paidOnly": false, "title": "Sorting the Sentence", "titleSlug": "sorting-the-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 173932, "totalSubmissionRaw": 208909}, "1860": {"acRate": 72.19510444332784, "difficulty": "Medium", "likes": 222, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1860", "paidOnly": false, "title": "Incremental Memory Leak", "titleSlug": "incremental-memory-leak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20115, "totalSubmissionRaw": 27862}, "1861": {"acRate": 67.72235681994155, "difficulty": "Medium", "likes": 981, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1861", "paidOnly": false, "title": "Rotating the Box", "titleSlug": "rotating-the-box", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54228, "totalSubmissionRaw": 80074}, "1862": {"acRate": 28.905100539480138, "difficulty": "Hard", "likes": 440, "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": 9429, "totalSubmissionRaw": 32623}, "1863": {"acRate": 87.79860505666957, "difficulty": "Easy", "likes": 2150, "dislikes": 247, "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": 181269, "totalSubmissionRaw": 206460}, "1864": {"acRate": 43.40588586324947, "difficulty": "Medium", "likes": 582, "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": 27640, "totalSubmissionRaw": 63677}, "1865": {"acRate": 50.945242475243646, "difficulty": "Medium", "likes": 612, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "1865", "paidOnly": false, "title": "Finding Pairs With a Certain Sum", "titleSlug": "finding-pairs-with-a-certain-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26032, "totalSubmissionRaw": 51098}, "1866": {"acRate": 57.675725613981065, "difficulty": "Hard", "likes": 709, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1866", "paidOnly": false, "title": "Number of Ways to Rearrange Sticks With K Sticks Visible", "titleSlug": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14983, "totalSubmissionRaw": 25978}, "1867": {"acRate": 71.03272381446418, "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": 16432, "totalSubmissionRaw": 23133}, "1868": {"acRate": 58.676520073512286, "difficulty": "Medium", "likes": 368, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1868", "paidOnly": true, "title": "Product of Two Run-Length Encoded Arrays", "titleSlug": "product-of-two-run-length-encoded-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45337, "totalSubmissionRaw": 77266}, "1869": {"acRate": 61.19167247040096, "difficulty": "Easy", "likes": 515, "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": 49203, "totalSubmissionRaw": 80408}, "1870": {"acRate": 46.851872988335195, "difficulty": "Medium", "likes": 2309, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "1870", "paidOnly": false, "title": "Minimum Speed to Arrive on Time", "titleSlug": "minimum-speed-to-arrive-on-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102622, "totalSubmissionRaw": 219035}, "1871": {"acRate": 24.9029340161182, "difficulty": "Medium", "likes": 1666, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1871", "paidOnly": false, "title": "Jump Game VII", "titleSlug": "jump-game-vii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47463, "totalSubmissionRaw": 190592}, "1872": {"acRate": 53.05166875374313, "difficulty": "Hard", "likes": 444, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "1872", "paidOnly": false, "title": "Stone Game VIII", "titleSlug": "stone-game-viii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9744, "totalSubmissionRaw": 18367}, "1873": {"acRate": 57.558969311350936, "difficulty": "Easy", "likes": 1077, "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": 245607, "totalSubmissionRaw": 426705}, "1874": {"acRate": 89.39577990731993, "difficulty": "Medium", "likes": 244, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1874", "paidOnly": true, "title": "Minimize Product Sum of Two Arrays", "titleSlug": "minimize-product-sum-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19870, "totalSubmissionRaw": 22227}, "1875": {"acRate": 67.6306697871392, "difficulty": "Medium", "likes": 73, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "1875", "paidOnly": true, "title": "Group Employees of the Same Salary", "titleSlug": "group-employees-of-the-same-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12137, "totalSubmissionRaw": 17946}, "1876": {"acRate": 73.82320422999146, "difficulty": "Easy", "likes": 1502, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1876", "paidOnly": false, "title": "Substrings of Size Three with Distinct Characters", "titleSlug": "substrings-of-size-three-with-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 128868, "totalSubmissionRaw": 174563}, "1877": {"acRate": 81.44588268945259, "difficulty": "Medium", "likes": 1945, "dislikes": 437, "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": 179387, "totalSubmissionRaw": 220253}, "1878": {"acRate": 47.99889509545147, "difficulty": "Medium", "likes": 207, "dislikes": 518, "categoryTitle": "Algorithms", "frontendQuestionId": "1878", "paidOnly": false, "title": "Get Biggest Three Rhombus Sums in a Grid", "titleSlug": "get-biggest-three-rhombus-sums-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15639, "totalSubmissionRaw": 32582}, "1879": {"acRate": 47.704214360041625, "difficulty": "Hard", "likes": 675, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1879", "paidOnly": false, "title": "Minimum XOR Sum of Two Arrays", "titleSlug": "minimum-xor-sum-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14670, "totalSubmissionRaw": 30752}, "1880": {"acRate": 74.23893189527703, "difficulty": "Easy", "likes": 573, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1880", "paidOnly": false, "title": "Check if Word Equals Summation of Two Words", "titleSlug": "check-if-word-equals-summation-of-two-words", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68282, "totalSubmissionRaw": 91976}, "1881": {"acRate": 38.02865803987554, "difficulty": "Medium", "likes": 380, "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": 28477, "totalSubmissionRaw": 74883}, "1882": {"acRate": 40.32795673861359, "difficulty": "Medium", "likes": 923, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1882", "paidOnly": false, "title": "Process Tasks Using Servers", "titleSlug": "process-tasks-using-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34603, "totalSubmissionRaw": 85804}, "1883": {"acRate": 37.88982960025721, "difficulty": "Hard", "likes": 335, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1883", "paidOnly": false, "title": "Minimum Skips to Arrive at Meeting On Time", "titleSlug": "minimum-skips-to-arrive-at-meeting-on-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7071, "totalSubmissionRaw": 18662}, "1884": {"acRate": 73.01266268026733, "difficulty": "Medium", "likes": 1452, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "1884", "paidOnly": false, "title": "Egg Drop With 2 Eggs and N Floors", "titleSlug": "egg-drop-with-2-eggs-and-n-floors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49818, "totalSubmissionRaw": 68232}, "1885": {"acRate": 60.8784127522469, "difficulty": "Medium", "likes": 237, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1885", "paidOnly": true, "title": "Count Pairs in Two Arrays", "titleSlug": "count-pairs-in-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10770, "totalSubmissionRaw": 17691}, "1886": {"acRate": 57.11754565189631, "difficulty": "Easy", "likes": 1432, "dislikes": 121, "categoryTitle": "Algorithms", "frontendQuestionId": "1886", "paidOnly": false, "title": "Determine Whether Matrix Can Be Obtained By Rotation", "titleSlug": "determine-whether-matrix-can-be-obtained-by-rotation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71566, "totalSubmissionRaw": 125296}, "1887": {"acRate": 72.91404837078134, "difficulty": "Medium", "likes": 1225, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1887", "paidOnly": false, "title": "Reduction Operations to Make the Array Elements Equal", "titleSlug": "reduction-operations-to-make-the-array-elements-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95147, "totalSubmissionRaw": 130491}, "1888": {"acRate": 40.009997857601945, "difficulty": "Medium", "likes": 1205, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1888", "paidOnly": false, "title": "Minimum Number of Flips to Make the Binary String Alternating", "titleSlug": "minimum-number-of-flips-to-make-the-binary-string-alternating", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28013, "totalSubmissionRaw": 70015}, "1889": {"acRate": 31.877526025719533, "difficulty": "Hard", "likes": 401, "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": 13014, "totalSubmissionRaw": 40825}, "1890": {"acRate": 77.29368333304978, "difficulty": "Easy", "likes": 408, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1890", "paidOnly": false, "title": "The Latest Login in 2020", "titleSlug": "the-latest-login-in-2020", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90868, "totalSubmissionRaw": 117562}, "1891": {"acRate": 49.6679751136487, "difficulty": "Medium", "likes": 571, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1891", "paidOnly": true, "title": "Cutting Ribbons", "titleSlug": "cutting-ribbons", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64025, "totalSubmissionRaw": 128906}, "1892": {"acRate": 43.611194703581106, "difficulty": "Hard", "likes": 85, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1892", "paidOnly": true, "title": "Page Recommendations II", "titleSlug": "page-recommendations-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7246, "totalSubmissionRaw": 16615}, "1893": {"acRate": 50.03107520198882, "difficulty": "Easy", "likes": 598, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1893", "paidOnly": false, "title": "Check if All the Integers in a Range Are Covered", "titleSlug": "check-if-all-the-integers-in-a-range-are-covered", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45885, "totalSubmissionRaw": 91713}, "1894": {"acRate": 45.738546649668415, "difficulty": "Medium", "likes": 591, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1894", "paidOnly": false, "title": "Find the Student that Will Replace the Chalk", "titleSlug": "find-the-student-that-will-replace-the-chalk", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39106, "totalSubmissionRaw": 85499}, "1895": {"acRate": 52.55538596734656, "difficulty": "Medium", "likes": 294, "dislikes": 260, "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": 11363, "totalSubmissionRaw": 21621}, "1896": {"acRate": 54.06498760276654, "difficulty": "Hard", "likes": 237, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1896", "paidOnly": false, "title": "Minimum Cost to Change the Final Value of Expression", "titleSlug": "minimum-cost-to-change-the-final-value-of-expression", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4143, "totalSubmissionRaw": 7663}, "1897": {"acRate": 67.21714233819121, "difficulty": "Easy", "likes": 1099, "dislikes": 77, "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": 140628, "totalSubmissionRaw": 209214}, "1898": {"acRate": 43.95543492162742, "difficulty": "Medium", "likes": 974, "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": 30931, "totalSubmissionRaw": 70369}, "1899": {"acRate": 66.25091709464417, "difficulty": "Medium", "likes": 802, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1899", "paidOnly": false, "title": "Merge Triplets to Form Target Triplet", "titleSlug": "merge-triplets-to-form-target-triplet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65016, "totalSubmissionRaw": 98136}, "1900": {"acRate": 50.95207432618894, "difficulty": "Hard", "likes": 229, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1900", "paidOnly": false, "title": "The Earliest and Latest Rounds Where Players Compete", "titleSlug": "the-earliest-and-latest-rounds-where-players-compete", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5539, "totalSubmissionRaw": 10871}, "1901": {"acRate": 51.93920678329822, "difficulty": "Medium", "likes": 2077, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1901", "paidOnly": false, "title": "Find a Peak Element II", "titleSlug": "find-a-peak-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79387, "totalSubmissionRaw": 152846}, "1902": {"acRate": 44.16915052160954, "difficulty": "Medium", "likes": 101, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1902", "paidOnly": true, "title": "Depth of BST Given Insertion Order", "titleSlug": "depth-of-bst-given-insertion-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2371, "totalSubmissionRaw": 5368}, "1903": {"acRate": 63.58272507466285, "difficulty": "Easy", "likes": 2052, "dislikes": 123, "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": 279534, "totalSubmissionRaw": 439639}, "1904": {"acRate": 43.915750482720576, "difficulty": "Medium", "likes": 212, "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": 22289, "totalSubmissionRaw": 50754}, "1905": {"acRate": 67.49026528839958, "difficulty": "Medium", "likes": 2082, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1905", "paidOnly": false, "title": "Count Sub Islands", "titleSlug": "count-sub-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96366, "totalSubmissionRaw": 142786}, "1906": {"acRate": 44.48893075836081, "difficulty": "Medium", "likes": 532, "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": 11334, "totalSubmissionRaw": 25476}, "1907": {"acRate": 59.95674954543987, "difficulty": "Medium", "likes": 442, "dislikes": 84, "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": 111455, "totalSubmissionRaw": 185893}, "1908": {"acRate": 63.1078814980436, "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": 4516, "totalSubmissionRaw": 7156}, "1909": {"acRate": 27.63787031621313, "difficulty": "Easy", "likes": 1243, "dislikes": 335, "categoryTitle": "Algorithms", "frontendQuestionId": "1909", "paidOnly": false, "title": "Remove One Element to Make the Array Strictly Increasing", "titleSlug": "remove-one-element-to-make-the-array-strictly-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 67571, "totalSubmissionRaw": 244487}, "1910": {"acRate": 77.6956865339729, "difficulty": "Medium", "likes": 1786, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1910", "paidOnly": false, "title": "Remove All Occurrences of a Substring", "titleSlug": "remove-all-occurrences-of-a-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 126825, "totalSubmissionRaw": 163233}, "1911": {"acRate": 59.034408214736075, "difficulty": "Medium", "likes": 1235, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1911", "paidOnly": false, "title": "Maximum Alternating Subsequence Sum", "titleSlug": "maximum-alternating-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39324, "totalSubmissionRaw": 66612}, "1912": {"acRate": 36.54243181571227, "difficulty": "Hard", "likes": 241, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1912", "paidOnly": false, "title": "Design Movie Rental System", "titleSlug": "design-movie-rental-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6726, "totalSubmissionRaw": 18406}, "1913": {"acRate": 82.85125944210328, "difficulty": "Easy", "likes": 1515, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1913", "paidOnly": false, "title": "Maximum Product Difference Between Two Pairs", "titleSlug": "maximum-product-difference-between-two-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251065, "totalSubmissionRaw": 303031}, "1914": {"acRate": 49.69153765568618, "difficulty": "Medium", "likes": 239, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1914", "paidOnly": false, "title": "Cyclically Rotating a Grid", "titleSlug": "cyclically-rotating-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12807, "totalSubmissionRaw": 25773}, "1915": {"acRate": 66.97781264913571, "difficulty": "Medium", "likes": 1722, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "1915", "paidOnly": false, "title": "Number of Wonderful Substrings", "titleSlug": "number-of-wonderful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82804, "totalSubmissionRaw": 123629}, "1916": {"acRate": 49.05318942674336, "difficulty": "Hard", "likes": 485, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1916", "paidOnly": false, "title": "Count Ways to Build Rooms in an Ant Colony", "titleSlug": "count-ways-to-build-rooms-in-an-ant-colony", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7590, "totalSubmissionRaw": 15473}, "1917": {"acRate": 26.961026147015293, "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": 6558, "totalSubmissionRaw": 24324}, "1918": {"acRate": 52.46868978805394, "difficulty": "Medium", "likes": 205, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1918", "paidOnly": true, "title": "Kth Smallest Subarray Sum", "titleSlug": "kth-smallest-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4357, "totalSubmissionRaw": 8304}, "1919": {"acRate": 41.59180340040092, "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": 5602, "totalSubmissionRaw": 13469}, "1920": {"acRate": 89.94718921661557, "difficulty": "Easy", "likes": 3360, "dislikes": 398, "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": 551322, "totalSubmissionRaw": 612939}, "1921": {"acRate": 50.89643750988547, "difficulty": "Medium", "likes": 1504, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "1921", "paidOnly": false, "title": "Eliminate Maximum Number of Monsters", "titleSlug": "eliminate-maximum-number-of-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109407, "totalSubmissionRaw": 214960}, "1922": {"acRate": 46.09342569530926, "difficulty": "Medium", "likes": 1423, "dislikes": 434, "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": 71065, "totalSubmissionRaw": 154176}, "1923": {"acRate": 28.32712369597615, "difficulty": "Hard", "likes": 477, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1923", "paidOnly": false, "title": "Longest Common Subpath", "titleSlug": "longest-common-subpath", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7603, "totalSubmissionRaw": 26840}, "1924": {"acRate": 50.700280112044815, "difficulty": "Hard", "likes": 13, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1924", "paidOnly": true, "title": "Erect the Fence II", "titleSlug": "erect-the-fence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 724, "totalSubmissionRaw": 1428}, "1925": {"acRate": 67.92537943277893, "difficulty": "Easy", "likes": 424, "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": 46679, "totalSubmissionRaw": 68721}, "1926": {"acRate": 46.76048459511578, "difficulty": "Medium", "likes": 2313, "dislikes": 110, "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": 158826, "totalSubmissionRaw": 339660}, "1927": {"acRate": 47.82539302529727, "difficulty": "Medium", "likes": 497, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1927", "paidOnly": false, "title": "Sum Game", "titleSlug": "sum-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11986, "totalSubmissionRaw": 25062}, "1928": {"acRate": 38.460358252464424, "difficulty": "Hard", "likes": 784, "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": 20054, "totalSubmissionRaw": 52142}, "1929": {"acRate": 90.02302521632562, "difficulty": "Easy", "likes": 3339, "dislikes": 392, "categoryTitle": "Algorithms", "frontendQuestionId": "1929", "paidOnly": false, "title": "Concatenation of Array", "titleSlug": "concatenation-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 824173, "totalSubmissionRaw": 915514}, "1930": {"acRate": 66.09263767758637, "difficulty": "Medium", "likes": 1725, "dislikes": 74, "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": 107230, "totalSubmissionRaw": 162243}, "1931": {"acRate": 57.73669264696997, "difficulty": "Hard", "likes": 479, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1931", "paidOnly": false, "title": "Painting a Grid With Three Different Colors", "titleSlug": "painting-a-grid-with-three-different-colors", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9556, "totalSubmissionRaw": 16551}, "1932": {"acRate": 36.288568436316766, "difficulty": "Hard", "likes": 574, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1932", "paidOnly": false, "title": "Merge BSTs to Create Single BST", "titleSlug": "merge-bsts-to-create-single-bst", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9009, "totalSubmissionRaw": 24826}, "1933": {"acRate": 50.66738573547256, "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": 3758, "totalSubmissionRaw": 7417}, "1934": {"acRate": 58.82015210820079, "difficulty": "Medium", "likes": 879, "dislikes": 80, "categoryTitle": "Database", "frontendQuestionId": "1934", "paidOnly": false, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 224363, "totalSubmissionRaw": 381439}, "1935": {"acRate": 73.45990063875088, "difficulty": "Easy", "likes": 592, "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": 62103, "totalSubmissionRaw": 84540}, "1936": {"acRate": 42.87344736608069, "difficulty": "Medium", "likes": 374, "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": 28925, "totalSubmissionRaw": 67466}, "1937": {"acRate": 35.62599988149553, "difficulty": "Medium", "likes": 2335, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "1937", "paidOnly": false, "title": "Maximum Number of Points with Cost", "titleSlug": "maximum-number-of-points-with-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60126, "totalSubmissionRaw": 168770}, "1938": {"acRate": 42.83533094129323, "difficulty": "Hard", "likes": 383, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1938", "paidOnly": false, "title": "Maximum Genetic Difference Query", "titleSlug": "maximum-genetic-difference-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5611, "totalSubmissionRaw": 13099}, "1939": {"acRate": 56.394399643793605, "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": 11399, "totalSubmissionRaw": 20213}, "1940": {"acRate": 81.24397299903569, "difficulty": "Medium", "likes": 185, "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": 13480, "totalSubmissionRaw": 16592}, "1941": {"acRate": 77.75373661111622, "difficulty": "Easy", "likes": 887, "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": 101338, "totalSubmissionRaw": 130332}, "1942": {"acRate": 42.302863489304166, "difficulty": "Medium", "likes": 578, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1942", "paidOnly": false, "title": "The Number of the Smallest Unoccupied Chair", "titleSlug": "the-number-of-the-smallest-unoccupied-chair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17521, "totalSubmissionRaw": 41418}, "1943": {"acRate": 50.02864235249188, "difficulty": "Medium", "likes": 477, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1943", "paidOnly": false, "title": "Describe the Painting", "titleSlug": "describe-the-painting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13100, "totalSubmissionRaw": 26185}, "1944": {"acRate": 69.83145732833064, "difficulty": "Hard", "likes": 1754, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1944", "paidOnly": false, "title": "Number of Visible People in a Queue", "titleSlug": "number-of-visible-people-in-a-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58627, "totalSubmissionRaw": 83955}, "1945": {"acRate": 62.84939627540411, "difficulty": "Easy", "likes": 607, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1945", "paidOnly": false, "title": "Sum of Digits of String After Convert", "titleSlug": "sum-of-digits-of-string-after-convert", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54706, "totalSubmissionRaw": 87043}, "1946": {"acRate": 36.00492790338533, "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": 20750, "totalSubmissionRaw": 57631}, "1947": {"acRate": 62.26758037973129, "difficulty": "Medium", "likes": 780, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1947", "paidOnly": false, "title": "Maximum Compatibility Score Sum", "titleSlug": "maximum-compatibility-score-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25351, "totalSubmissionRaw": 40713}, "1948": {"acRate": 55.54451139963968, "difficulty": "Hard", "likes": 319, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1948", "paidOnly": false, "title": "Delete Duplicate Folders in System", "titleSlug": "delete-duplicate-folders-in-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8941, "totalSubmissionRaw": 16097}, "1949": {"acRate": 54.469459064974124, "difficulty": "Medium", "likes": 146, "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": 12315, "totalSubmissionRaw": 22609}, "1950": {"acRate": 49.727317798710956, "difficulty": "Medium", "likes": 139, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1950", "paidOnly": true, "title": "Maximum of Minimum Values in All Subarrays", "titleSlug": "maximum-of-minimum-values-in-all-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3009, "totalSubmissionRaw": 6051}, "1951": {"acRate": 68.8033688150661, "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": 11764, "totalSubmissionRaw": 17098}, "1952": {"acRate": 61.00982354468331, "difficulty": "Easy", "likes": 529, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "1952", "paidOnly": false, "title": "Three Divisors", "titleSlug": "three-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72850, "totalSubmissionRaw": 119407}, "1953": {"acRate": 40.7538599732217, "difficulty": "Medium", "likes": 646, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1953", "paidOnly": false, "title": "Maximum Number of Weeks for Which You Can Work", "titleSlug": "maximum-number-of-weeks-for-which-you-can-work", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24046, "totalSubmissionRaw": 59003}, "1954": {"acRate": 54.51039888741387, "difficulty": "Medium", "likes": 382, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1954", "paidOnly": false, "title": "Minimum Garden Perimeter to Collect Enough Apples", "titleSlug": "minimum-garden-perimeter-to-collect-enough-apples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17246, "totalSubmissionRaw": 31638}, "1955": {"acRate": 51.289237668161434, "difficulty": "Hard", "likes": 519, "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": 11895, "totalSubmissionRaw": 23192}, "1956": {"acRate": 47.242557345046365, "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": 968, "totalSubmissionRaw": 2049}, "1957": {"acRate": 58.40512011647658, "difficulty": "Easy", "likes": 439, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1957", "paidOnly": false, "title": "Delete Characters to Make Fancy String", "titleSlug": "delete-characters-to-make-fancy-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38510, "totalSubmissionRaw": 65936}, "1958": {"acRate": 48.52645325239121, "difficulty": "Medium", "likes": 159, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "1958", "paidOnly": false, "title": "Check if Move is Legal", "titleSlug": "check-if-move-is-legal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13749, "totalSubmissionRaw": 28333}, "1959": {"acRate": 43.03125316071609, "difficulty": "Medium", "likes": 564, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1959", "paidOnly": false, "title": "Minimum Total Space Wasted With K Resizing Operations", "titleSlug": "minimum-total-space-wasted-with-k-resizing-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8509, "totalSubmissionRaw": 19774}, "1960": {"acRate": 30.737601745405723, "difficulty": "Hard", "likes": 244, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1960", "paidOnly": false, "title": "Maximum Product of the Length of Two Palindromic Substrings", "titleSlug": "maximum-product-of-the-length-of-two-palindromic-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3663, "totalSubmissionRaw": 11917}, "1961": {"acRate": 52.766969094173014, "difficulty": "Easy", "likes": 484, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "1961", "paidOnly": false, "title": "Check If String Is a Prefix of Array", "titleSlug": "check-if-string-is-a-prefix-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54379, "totalSubmissionRaw": 103055}, "1962": {"acRate": 62.53855869422652, "difficulty": "Medium", "likes": 1814, "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": 102992, "totalSubmissionRaw": 164685}, "1963": {"acRate": 71.9487104122272, "difficulty": "Medium", "likes": 1801, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1963", "paidOnly": false, "title": "Minimum Number of Swaps to Make the String Balanced", "titleSlug": "minimum-number-of-swaps-to-make-the-string-balanced", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78332, "totalSubmissionRaw": 108872}, "1964": {"acRate": 62.90841610709459, "difficulty": "Hard", "likes": 1791, "dislikes": 71, "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": 58647, "totalSubmissionRaw": 93226}, "1965": {"acRate": 72.33856391245783, "difficulty": "Easy", "likes": 696, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "1965", "paidOnly": false, "title": "Employees With Missing Information", "titleSlug": "employees-with-missing-information", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125668, "totalSubmissionRaw": 173722}, "1966": {"acRate": 64.06748746010031, "difficulty": "Medium", "likes": 72, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1966", "paidOnly": true, "title": "Binary Searchable Numbers in an Unsorted Array", "titleSlug": "binary-searchable-numbers-in-an-unsorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2810, "totalSubmissionRaw": 4386}, "1967": {"acRate": 81.03767210536226, "difficulty": "Easy", "likes": 693, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1967", "paidOnly": false, "title": "Number of Strings That Appear as Substrings in Word", "titleSlug": "number-of-strings-that-appear-as-substrings-in-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73160, "totalSubmissionRaw": 90279}, "1968": {"acRate": 50.27714118211374, "difficulty": "Medium", "likes": 620, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1968", "paidOnly": false, "title": "Array With Elements Not Equal to Average of Neighbors", "titleSlug": "array-with-elements-not-equal-to-average-of-neighbors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37734, "totalSubmissionRaw": 75052}, "1969": {"acRate": 35.62814374886371, "difficulty": "Medium", "likes": 242, "dislikes": 367, "categoryTitle": "Algorithms", "frontendQuestionId": "1969", "paidOnly": false, "title": "Minimum Non-Zero Product of the Array Elements", "titleSlug": "minimum-non-zero-product-of-the-array-elements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11758, "totalSubmissionRaw": 33002}, "1970": {"acRate": 61.96486125731153, "difficulty": "Hard", "likes": 1894, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1970", "paidOnly": false, "title": "Last Day Where You Can Still Cross", "titleSlug": "last-day-where-you-can-still-cross", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57100, "totalSubmissionRaw": 92149}, "1971": {"acRate": 54.076169573974845, "difficulty": "Easy", "likes": 3873, "dislikes": 223, "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": 455329, "totalSubmissionRaw": 842012}, "1972": {"acRate": 50.35401915868388, "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": 9672, "totalSubmissionRaw": 19208}, "1973": {"acRate": 76.9922143347836, "difficulty": "Medium", "likes": 175, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1973", "paidOnly": true, "title": "Count Nodes Equal to Sum of Descendants", "titleSlug": "count-nodes-equal-to-sum-of-descendants", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13449, "totalSubmissionRaw": 17468}, "1974": {"acRate": 75.46523098530321, "difficulty": "Easy", "likes": 692, "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": 45135, "totalSubmissionRaw": 59809}, "1975": {"acRate": 49.75104718248637, "difficulty": "Medium", "likes": 554, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1975", "paidOnly": false, "title": "Maximum Matrix Sum", "titleSlug": "maximum-matrix-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18885, "totalSubmissionRaw": 37959}, "1976": {"acRate": 27.581655446039456, "difficulty": "Medium", "likes": 2779, "dislikes": 130, "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": 70630, "totalSubmissionRaw": 256076}, "1977": {"acRate": 20.82456878418174, "difficulty": "Hard", "likes": 515, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1977", "paidOnly": false, "title": "Number of Ways to Separate Numbers", "titleSlug": "number-of-ways-to-separate-numbers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6435, "totalSubmissionRaw": 30901}, "1978": {"acRate": 48.363702596813646, "difficulty": "Easy", "likes": 359, "dislikes": 34, "categoryTitle": "Database", "frontendQuestionId": "1978", "paidOnly": false, "title": "Employees Whose Manager Left the Company", "titleSlug": "employees-whose-manager-left-the-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130108, "totalSubmissionRaw": 269021}, "1979": {"acRate": 77.98874402741532, "difficulty": "Easy", "likes": 1120, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1979", "paidOnly": false, "title": "Find Greatest Common Divisor of Array", "titleSlug": "find-greatest-common-divisor-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 143146, "totalSubmissionRaw": 183547}, "1980": {"acRate": 74.66356502655165, "difficulty": "Medium", "likes": 1988, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "1980", "paidOnly": false, "title": "Find Unique Binary String", "titleSlug": "find-unique-binary-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141866, "totalSubmissionRaw": 190007}, "1981": {"acRate": 35.015449234780085, "difficulty": "Medium", "likes": 943, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "1981", "paidOnly": false, "title": "Minimize the Difference Between Target and Chosen Elements", "titleSlug": "minimize-the-difference-between-target-and-chosen-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29011, "totalSubmissionRaw": 82852}, "1982": {"acRate": 48.79118988213026, "difficulty": "Hard", "likes": 583, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1982", "paidOnly": false, "title": "Find Array Given Subset Sums", "titleSlug": "find-array-given-subset-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5671, "totalSubmissionRaw": 11623}, "1983": {"acRate": 53.341312587273094, "difficulty": "Medium", "likes": 94, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "1983", "paidOnly": true, "title": "Widest Pair of Indices With Equal Range Sum", "titleSlug": "widest-pair-of-indices-with-equal-range-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2674, "totalSubmissionRaw": 5013}, "1984": {"acRate": 57.112567463377026, "difficulty": "Easy", "likes": 996, "dislikes": 280, "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": 80001, "totalSubmissionRaw": 140076}, "1985": {"acRate": 45.68633879050225, "difficulty": "Medium", "likes": 1243, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "1985", "paidOnly": false, "title": "Find the Kth Largest Integer in the Array", "titleSlug": "find-the-kth-largest-integer-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68286, "totalSubmissionRaw": 149467}, "1986": {"acRate": 33.243625359658694, "difficulty": "Medium", "likes": 1114, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1986", "paidOnly": false, "title": "Minimum Number of Work Sessions to Finish the Tasks", "titleSlug": "minimum-number-of-work-sessions-to-finish-the-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26805, "totalSubmissionRaw": 80632}, "1987": {"acRate": 52.315098111206304, "difficulty": "Hard", "likes": 698, "dislikes": 14, "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": 12824, "totalSubmissionRaw": 24513}, "1988": {"acRate": 67.07302709069494, "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": 11389, "totalSubmissionRaw": 16980}, "1989": {"acRate": 51.295947219604145, "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": 2177, "totalSubmissionRaw": 4244}, "1990": {"acRate": 49.36040609137056, "difficulty": "Medium", "likes": 24, "dislikes": 191, "categoryTitle": "Database", "frontendQuestionId": "1990", "paidOnly": true, "title": "Count the Number of Experiments", "titleSlug": "count-the-number-of-experiments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7293, "totalSubmissionRaw": 14775}, "1991": {"acRate": 67.55167785234899, "difficulty": "Easy", "likes": 1370, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1991", "paidOnly": false, "title": "Find the Middle Index in Array", "titleSlug": "find-the-middle-index-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 100652, "totalSubmissionRaw": 149000}, "1992": {"acRate": 75.79654985506563, "difficulty": "Medium", "likes": 1370, "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": 128651, "totalSubmissionRaw": 169732}, "1993": {"acRate": 45.97810035942158, "difficulty": "Medium", "likes": 461, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1993", "paidOnly": false, "title": "Operations on Tree", "titleSlug": "operations-on-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16502, "totalSubmissionRaw": 35891}, "1994": {"acRate": 34.828082102235584, "difficulty": "Hard", "likes": 471, "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": 7992, "totalSubmissionRaw": 22947}, "1995": {"acRate": 61.60602077224204, "difficulty": "Easy", "likes": 636, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "1995", "paidOnly": false, "title": "Count Special Quadruplets", "titleSlug": "count-special-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42648, "totalSubmissionRaw": 69227}, "1996": {"acRate": 43.988369744504666, "difficulty": "Medium", "likes": 3012, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1996", "paidOnly": false, "title": "The Number of Weak Characters in the Game", "titleSlug": "the-number-of-weak-characters-in-the-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104541, "totalSubmissionRaw": 237653}, "1997": {"acRate": 37.60120058449508, "difficulty": "Medium", "likes": 489, "dislikes": 95, "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": 9521, "totalSubmissionRaw": 25321}, "1998": {"acRate": 46.09211614221098, "difficulty": "Hard", "likes": 494, "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": 9477, "totalSubmissionRaw": 20561}, "1999": {"acRate": 49.1859468723222, "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": 1722, "totalSubmissionRaw": 3501}, "2000": {"acRate": 86.27262810731617, "difficulty": "Easy", "likes": 1322, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2000", "paidOnly": false, "title": "Reverse Prefix of Word", "titleSlug": "reverse-prefix-of-word", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 269696, "totalSubmissionRaw": 312609}, "2001": {"acRate": 50.02555615051356, "difficulty": "Medium", "likes": 528, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2001", "paidOnly": false, "title": "Number of Pairs of Interchangeable Rectangles", "titleSlug": "number-of-pairs-of-interchangeable-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41107, "totalSubmissionRaw": 82172}, "2002": {"acRate": 60.172236865932916, "difficulty": "Medium", "likes": 940, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "2002", "paidOnly": false, "title": "Maximum Product of the Length of Two Palindromic Subsequences", "titleSlug": "maximum-product-of-the-length-of-two-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29905, "totalSubmissionRaw": 49699}, "2003": {"acRate": 46.675771647090954, "difficulty": "Hard", "likes": 449, "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": 8544, "totalSubmissionRaw": 18305}, "2004": {"acRate": 43.391671695835846, "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": 8628, "totalSubmissionRaw": 19884}, "2005": {"acRate": 59.12806539509536, "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": 651, "totalSubmissionRaw": 1101}, "2006": {"acRate": 84.0682765506712, "difficulty": "Easy", "likes": 1629, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2006", "paidOnly": false, "title": "Count Number of Pairs With Absolute Difference K", "titleSlug": "count-number-of-pairs-with-absolute-difference-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 159131, "totalSubmissionRaw": 189288}, "2007": {"acRate": 40.49999404910677, "difficulty": "Medium", "likes": 2443, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "2007", "paidOnly": false, "title": "Find Original Array From Doubled Array", "titleSlug": "find-original-array-from-doubled-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136114, "totalSubmissionRaw": 336084}, "2008": {"acRate": 44.24908021110361, "difficulty": "Medium", "likes": 1274, "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": 32112, "totalSubmissionRaw": 72571}, "2009": {"acRate": 52.659652865996165, "difficulty": "Hard", "likes": 1874, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2009", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Continuous", "titleSlug": "minimum-number-of-operations-to-make-array-continuous", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75030, "totalSubmissionRaw": 142481}, "2010": {"acRate": 62.405686167304545, "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": 5707, "totalSubmissionRaw": 9145}, "2011": {"acRate": 89.30208043893424, "difficulty": "Easy", "likes": 1603, "dislikes": 184, "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": 404950, "totalSubmissionRaw": 453461}, "2012": {"acRate": 48.25848585019754, "difficulty": "Medium", "likes": 605, "dislikes": 63, "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": 23942, "totalSubmissionRaw": 49612}, "2013": {"acRate": 51.18473234355091, "difficulty": "Medium", "likes": 881, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "2013", "paidOnly": false, "title": "Detect Squares", "titleSlug": "detect-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71502, "totalSubmissionRaw": 139694}, "2014": {"acRate": 55.69969081865842, "difficulty": "Hard", "likes": 458, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2014", "paidOnly": false, "title": "Longest Subsequence Repeated k Times", "titleSlug": "longest-subsequence-repeated-k-times", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8287, "totalSubmissionRaw": 14878}, "2015": {"acRate": 59.2290377039955, "difficulty": "Medium", "likes": 54, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2015", "paidOnly": true, "title": "Average Height of Buildings in Each Segment", "titleSlug": "average-height-of-buildings-in-each-segment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2105, "totalSubmissionRaw": 3554}, "2016": {"acRate": 56.529625151148736, "difficulty": "Easy", "likes": 1008, "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": 86955, "totalSubmissionRaw": 153822}, "2017": {"acRate": 46.042440998223995, "difficulty": "Medium", "likes": 913, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2017", "paidOnly": false, "title": "Grid Game", "titleSlug": "grid-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25147, "totalSubmissionRaw": 54617}, "2018": {"acRate": 49.70102571178879, "difficulty": "Medium", "likes": 292, "dislikes": 294, "categoryTitle": "Algorithms", "frontendQuestionId": "2018", "paidOnly": false, "title": "Check if Word Can Be Placed In Crossword", "titleSlug": "check-if-word-can-be-placed-in-crossword", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21611, "totalSubmissionRaw": 43482}, "2019": {"acRate": 33.64078794901506, "difficulty": "Hard", "likes": 270, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2019", "paidOnly": false, "title": "The Score of Students Solving Math Expression", "titleSlug": "the-score-of-students-solving-math-expression", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7258, "totalSubmissionRaw": 21575}, "2020": {"acRate": 71.94643581766536, "difficulty": "Medium", "likes": 27, "dislikes": 213, "categoryTitle": "Database", "frontendQuestionId": "2020", "paidOnly": true, "title": "Number of Accounts That Did Not Stream", "titleSlug": "number-of-accounts-that-did-not-stream", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10638, "totalSubmissionRaw": 14786}, "2021": {"acRate": 61.6758522147377, "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": 6043, "totalSubmissionRaw": 9798}, "2022": {"acRate": 61.91974039097916, "difficulty": "Easy", "likes": 781, "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": 87008, "totalSubmissionRaw": 140518}, "2023": {"acRate": 74.97810962698804, "difficulty": "Medium", "likes": 702, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2023", "paidOnly": false, "title": "Number of Pairs of Strings With Concatenation Equal to Target", "titleSlug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47096, "totalSubmissionRaw": 62813}, "2024": {"acRate": 67.3545375395958, "difficulty": "Medium", "likes": 2871, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2024", "paidOnly": false, "title": "Maximize the Confusion of an Exam", "titleSlug": "maximize-the-confusion-of-an-exam", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109080, "totalSubmissionRaw": 161949}, "2025": {"acRate": 34.28400079962684, "difficulty": "Hard", "likes": 475, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2025", "paidOnly": false, "title": "Maximum Number of Ways to Partition an Array", "titleSlug": "maximum-number-of-ways-to-partition-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10290, "totalSubmissionRaw": 30014}, "2026": {"acRate": 84.29864561355748, "difficulty": "Easy", "likes": 52, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "2026", "paidOnly": true, "title": "Low-Quality Problems", "titleSlug": "low-quality-problems", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12386, "totalSubmissionRaw": 14693}, "2027": {"acRate": 55.206857367320886, "difficulty": "Easy", "likes": 478, "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": 39352, "totalSubmissionRaw": 71281}, "2028": {"acRate": 46.79908171568057, "difficulty": "Medium", "likes": 487, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2028", "paidOnly": false, "title": "Find Missing Observations", "titleSlug": "find-missing-observations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32209, "totalSubmissionRaw": 68824}, "2029": {"acRate": 28.442581726739313, "difficulty": "Medium", "likes": 236, "dislikes": 271, "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": 8483, "totalSubmissionRaw": 29825}, "2030": {"acRate": 39.27981057052227, "difficulty": "Hard", "likes": 483, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2030", "paidOnly": false, "title": "Smallest K-Length Subsequence With Occurrences of a Letter", "titleSlug": "smallest-k-length-subsequence-with-occurrences-of-a-letter", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8792, "totalSubmissionRaw": 22383}, "2031": {"acRate": 51.96650596295357, "difficulty": "Medium", "likes": 170, "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": 4096, "totalSubmissionRaw": 7882}, "2032": {"acRate": 75.4019663333543, "difficulty": "Easy", "likes": 754, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2032", "paidOnly": false, "title": "Two Out of Three", "titleSlug": "two-out-of-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71938, "totalSubmissionRaw": 95406}, "2033": {"acRate": 53.38374980068791, "difficulty": "Medium", "likes": 548, "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": 23436, "totalSubmissionRaw": 43901}, "2034": {"acRate": 48.66699291474287, "difficulty": "Medium", "likes": 1162, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2034", "paidOnly": false, "title": "Stock Price Fluctuation ", "titleSlug": "stock-price-fluctuation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68619, "totalSubmissionRaw": 140997}, "2035": {"acRate": 20.49427799183392, "difficulty": "Hard", "likes": 3055, "dislikes": 196, "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": 28510, "totalSubmissionRaw": 139112}, "2036": {"acRate": 40.16382951491105, "difficulty": "Medium", "likes": 98, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2036", "paidOnly": true, "title": "Maximum Alternating Subarray Sum", "titleSlug": "maximum-alternating-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3138, "totalSubmissionRaw": 7813}, "2037": {"acRate": 87.6766543280075, "difficulty": "Easy", "likes": 1325, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "2037", "paidOnly": false, "title": "Minimum Number of Moves to Seat Everyone", "titleSlug": "minimum-number-of-moves-to-seat-everyone", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232835, "totalSubmissionRaw": 265561}, "2038": {"acRate": 62.790748332512834, "difficulty": "Medium", "likes": 1570, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2038", "paidOnly": false, "title": "Remove Colored Pieces if Both Neighbors are the Same Color", "titleSlug": "remove-colored-pieces-if-both-neighbors-are-the-same-color", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144128, "totalSubmissionRaw": 229537}, "2039": {"acRate": 52.23229617418779, "difficulty": "Medium", "likes": 665, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2039", "paidOnly": false, "title": "The Time When the Network Becomes Idle", "titleSlug": "the-time-when-the-network-becomes-idle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15209, "totalSubmissionRaw": 29118}, "2040": {"acRate": 29.009145595930942, "difficulty": "Hard", "likes": 684, "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": 11863, "totalSubmissionRaw": 40894}, "2041": {"acRate": 78.16159681814834, "difficulty": "Medium", "likes": 53, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2041", "paidOnly": true, "title": "Accepted Candidates From the Interviews", "titleSlug": "accepted-candidates-from-the-interviews", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10612, "totalSubmissionRaw": 13577}, "2042": {"acRate": 69.94543713735307, "difficulty": "Easy", "likes": 614, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2042", "paidOnly": false, "title": "Check if Numbers Are Ascending in a Sentence", "titleSlug": "check-if-numbers-are-ascending-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60635, "totalSubmissionRaw": 86689}, "2043": {"acRate": 63.89683571738188, "difficulty": "Medium", "likes": 260, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "2043", "paidOnly": false, "title": "Simple Bank System", "titleSlug": "simple-bank-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29481, "totalSubmissionRaw": 46137}, "2044": {"acRate": 77.84618622885257, "difficulty": "Medium", "likes": 621, "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": 29587, "totalSubmissionRaw": 38007}, "2045": {"acRate": 63.21815089672233, "difficulty": "Hard", "likes": 1189, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2045", "paidOnly": false, "title": "Second Minimum Time to Reach Destination", "titleSlug": "second-minimum-time-to-reach-destination", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81779, "totalSubmissionRaw": 129360}, "2046": {"acRate": 67.14551949060413, "difficulty": "Medium", "likes": 166, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2046", "paidOnly": true, "title": "Sort Linked List Already Sorted Using Absolute Values", "titleSlug": "sort-linked-list-already-sorted-using-absolute-values", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8647, "totalSubmissionRaw": 12878}, "2047": {"acRate": 29.14826076147859, "difficulty": "Easy", "likes": 298, "dislikes": 803, "categoryTitle": "Algorithms", "frontendQuestionId": "2047", "paidOnly": false, "title": "Number of Valid Words in a Sentence", "titleSlug": "number-of-valid-words-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30485, "totalSubmissionRaw": 104586}, "2048": {"acRate": 48.657823819689916, "difficulty": "Medium", "likes": 197, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "2048", "paidOnly": false, "title": "Next Greater Numerically Balanced Number", "titleSlug": "next-greater-numerically-balanced-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13903, "totalSubmissionRaw": 28573}, "2049": {"acRate": 49.93102212666846, "difficulty": "Medium", "likes": 1071, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2049", "paidOnly": false, "title": "Count Nodes With the Highest Score", "titleSlug": "count-nodes-with-the-highest-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27869, "totalSubmissionRaw": 55815}, "2050": {"acRate": 67.1463566535188, "difficulty": "Hard", "likes": 1525, "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": 80861, "totalSubmissionRaw": 120425}, "2051": {"acRate": 70.03352531591163, "difficulty": "Medium", "likes": 57, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2051", "paidOnly": true, "title": "The Category of Each Member in the Store", "titleSlug": "the-category-of-each-member-in-the-store", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8147, "totalSubmissionRaw": 11633}, "2052": {"acRate": 49.49360341151386, "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": 1857, "totalSubmissionRaw": 3752}, "2053": {"acRate": 82.13552437634357, "difficulty": "Easy", "likes": 1220, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2053", "paidOnly": false, "title": "Kth Distinct String in an Array", "titleSlug": "kth-distinct-string-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 221217, "totalSubmissionRaw": 269333}, "2054": {"acRate": 46.65396976550411, "difficulty": "Medium", "likes": 831, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2054", "paidOnly": false, "title": "Two Best Non-Overlapping Events", "titleSlug": "two-best-non-overlapping-events", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19597, "totalSubmissionRaw": 42005}, "2055": {"acRate": 45.09534681540824, "difficulty": "Medium", "likes": 1215, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2055", "paidOnly": false, "title": "Plates Between Candles", "titleSlug": "plates-between-candles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55496, "totalSubmissionRaw": 123070}, "2056": {"acRate": 52.60869565217391, "difficulty": "Hard", "likes": 59, "dislikes": 290, "categoryTitle": "Algorithms", "frontendQuestionId": "2056", "paidOnly": false, "title": "Number of Valid Move Combinations On Chessboard", "titleSlug": "number-of-valid-move-combinations-on-chessboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4235, "totalSubmissionRaw": 8050}, "2057": {"acRate": 73.05800608946834, "difficulty": "Easy", "likes": 418, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "2057", "paidOnly": false, "title": "Smallest Index With Equal Value", "titleSlug": "smallest-index-with-equal-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65506, "totalSubmissionRaw": 89663}, "2058": {"acRate": 69.71734154329673, "difficulty": "Medium", "likes": 1243, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2058", "paidOnly": false, "title": "Find the Minimum and Maximum Number of Nodes Between Critical Points", "titleSlug": "find-the-minimum-and-maximum-number-of-nodes-between-critical-points", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173912, "totalSubmissionRaw": 249453}, "2059": {"acRate": 49.49457024029575, "difficulty": "Medium", "likes": 635, "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": 17137, "totalSubmissionRaw": 34624}, "2060": {"acRate": 43.81232587809514, "difficulty": "Hard", "likes": 310, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2060", "paidOnly": false, "title": "Check if an Original String Exists Given Two Encoded Strings", "titleSlug": "check-if-an-original-string-exists-given-two-encoded-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16827, "totalSubmissionRaw": 38407}, "2061": {"acRate": 62.53645351731987, "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": 8792, "totalSubmissionRaw": 14059}, "2062": {"acRate": 68.05137531988862, "difficulty": "Easy", "likes": 946, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "2062", "paidOnly": false, "title": "Count Vowel Substrings of a String", "titleSlug": "count-vowel-substrings-of-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42281, "totalSubmissionRaw": 62131}, "2063": {"acRate": 54.03894212617536, "difficulty": "Medium", "likes": 832, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2063", "paidOnly": false, "title": "Vowels of All Substrings", "titleSlug": "vowels-of-all-substrings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30057, "totalSubmissionRaw": 55621}, "2064": {"acRate": 53.319057815845824, "difficulty": "Medium", "likes": 1067, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2064", "paidOnly": false, "title": "Minimized Maximum of Products Distributed to Any Store", "titleSlug": "minimized-maximum-of-products-distributed-to-any-store", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32121, "totalSubmissionRaw": 60243}, "2065": {"acRate": 58.76164239800603, "difficulty": "Hard", "likes": 639, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2065", "paidOnly": false, "title": "Maximum Path Quality of a Graph", "titleSlug": "maximum-path-quality-of-a-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22397, "totalSubmissionRaw": 38115}, "2066": {"acRate": 82.05019859714359, "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": 9709, "totalSubmissionRaw": 11833}, "2067": {"acRate": 46.88209606986899, "difficulty": "Medium", "likes": 103, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2067", "paidOnly": true, "title": "Number of Equal Count Substrings", "titleSlug": "number-of-equal-count-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2684, "totalSubmissionRaw": 5725}, "2068": {"acRate": 63.847517530289856, "difficulty": "Easy", "likes": 526, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2068", "paidOnly": false, "title": "Check Whether Two Strings are Almost Equivalent", "titleSlug": "check-whether-two-strings-are-almost-equivalent", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56544, "totalSubmissionRaw": 88561}, "2069": {"acRate": 26.320467524387265, "difficulty": "Medium", "likes": 166, "dislikes": 307, "categoryTitle": "Algorithms", "frontendQuestionId": "2069", "paidOnly": false, "title": "Walking Robot Simulation II", "titleSlug": "walking-robot-simulation-ii", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11845, "totalSubmissionRaw": 45003}, "2070": {"acRate": 49.92281744897375, "difficulty": "Medium", "likes": 588, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2070", "paidOnly": false, "title": "Most Beautiful Item for Each Query", "titleSlug": "most-beautiful-item-for-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17464, "totalSubmissionRaw": 34982}, "2071": {"acRate": 33.66839563584332, "difficulty": "Hard", "likes": 534, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2071", "paidOnly": false, "title": "Maximum Number of Tasks You Can Assign", "titleSlug": "maximum-number-of-tasks-you-can-assign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9412, "totalSubmissionRaw": 27955}, "2072": {"acRate": 74.01995955906332, "difficulty": "Easy", "likes": 66, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2072", "paidOnly": true, "title": "The Winner University", "titleSlug": "the-winner-university", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11348, "totalSubmissionRaw": 15331}, "2073": {"acRate": 69.91180003725854, "difficulty": "Easy", "likes": 1649, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "2073", "paidOnly": false, "title": "Time Needed to Buy Tickets", "titleSlug": "time-needed-to-buy-tickets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217662, "totalSubmissionRaw": 311338}, "2074": {"acRate": 58.24846384453469, "difficulty": "Medium", "likes": 716, "dislikes": 338, "categoryTitle": "Algorithms", "frontendQuestionId": "2074", "paidOnly": false, "title": "Reverse Nodes in Even Length Groups", "titleSlug": "reverse-nodes-in-even-length-groups", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27396, "totalSubmissionRaw": 47033}, "2075": {"acRate": 49.0110117712037, "difficulty": "Medium", "likes": 247, "dislikes": 61, "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": 14198, "totalSubmissionRaw": 28969}, "2076": {"acRate": 55.32369578881207, "difficulty": "Hard", "likes": 614, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2076", "paidOnly": false, "title": "Process Restricted Friend Requests", "titleSlug": "process-restricted-friend-requests", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17604, "totalSubmissionRaw": 31820}, "2077": {"acRate": 55.37160120845921, "difficulty": "Medium", "likes": 129, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2077", "paidOnly": true, "title": "Paths in Maze That Lead to Same Room", "titleSlug": "paths-in-maze-that-lead-to-same-room", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4582, "totalSubmissionRaw": 8275}, "2078": {"acRate": 66.06472712727786, "difficulty": "Easy", "likes": 897, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2078", "paidOnly": false, "title": "Two Furthest Houses With Different Colors", "titleSlug": "two-furthest-houses-with-different-colors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56157, "totalSubmissionRaw": 85003}, "2079": {"acRate": 79.75665909402778, "difficulty": "Medium", "likes": 906, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2079", "paidOnly": false, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52310, "totalSubmissionRaw": 65587}, "2080": {"acRate": 40.29157528060895, "difficulty": "Medium", "likes": 657, "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": 21861, "totalSubmissionRaw": 54257}, "2081": {"acRate": 42.3723914677149, "difficulty": "Hard", "likes": 123, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "2081", "paidOnly": false, "title": "Sum of k-Mirror Numbers", "titleSlug": "sum-of-k-mirror-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7330, "totalSubmissionRaw": 17299}, "2082": {"acRate": 77.26471859313187, "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": 23242, "totalSubmissionRaw": 30081}, "2083": {"acRate": 74.29003724394786, "difficulty": "Medium", "likes": 133, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2083", "paidOnly": true, "title": "Substrings That Begin and End With the Same Letter", "titleSlug": "substrings-that-begin-and-end-with-the-same-letter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12766, "totalSubmissionRaw": 17184}, "2084": {"acRate": 87.05920414105468, "difficulty": "Medium", "likes": 84, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2084", "paidOnly": true, "title": "Drop Type 1 Orders for Customers With Type 0 Orders", "titleSlug": "drop-type-1-orders-for-customers-with-type-0-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10764, "totalSubmissionRaw": 12364}, "2085": {"acRate": 70.98647736939368, "difficulty": "Easy", "likes": 807, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2085", "paidOnly": false, "title": "Count Common Words With One Occurrence", "titleSlug": "count-common-words-with-one-occurrence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72600, "totalSubmissionRaw": 102273}, "2086": {"acRate": 46.79199724042773, "difficulty": "Medium", "likes": 537, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2086", "paidOnly": false, "title": "Minimum Number of Food Buckets to Feed the Hamsters", "titleSlug": "minimum-number-of-food-buckets-to-feed-the-hamsters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21704, "totalSubmissionRaw": 46384}, "2087": {"acRate": 51.03091364549785, "difficulty": "Medium", "likes": 673, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "2087", "paidOnly": false, "title": "Minimum Cost Homecoming of a Robot in a Grid", "titleSlug": "minimum-cost-homecoming-of-a-robot-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18538, "totalSubmissionRaw": 36327}, "2088": {"acRate": 64.93023862302778, "difficulty": "Hard", "likes": 368, "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": 9959, "totalSubmissionRaw": 15338}, "2089": {"acRate": 76.5118726861165, "difficulty": "Easy", "likes": 1793, "dislikes": 92, "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": 188271, "totalSubmissionRaw": 246068}, "2090": {"acRate": 46.042726715022916, "difficulty": "Medium", "likes": 1888, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2090", "paidOnly": false, "title": "K Radius Subarray Averages", "titleSlug": "k-radius-subarray-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127588, "totalSubmissionRaw": 277105}, "2091": {"acRate": 54.97387360741398, "difficulty": "Medium", "likes": 957, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2091", "paidOnly": false, "title": "Removing Minimum and Maximum From Array", "titleSlug": "removing-minimum-and-maximum-from-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44608, "totalSubmissionRaw": 81144}, "2092": {"acRate": 45.54694324657857, "difficulty": "Hard", "likes": 1578, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2092", "paidOnly": false, "title": "Find All People With Secret", "titleSlug": "find-all-people-with-secret", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98543, "totalSubmissionRaw": 216356}, "2093": {"acRate": 59.81206426189755, "difficulty": "Medium", "likes": 227, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2093", "paidOnly": true, "title": "Minimum Cost to Reach City With Discounts", "titleSlug": "minimum-cost-to-reach-city-with-discounts", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9866, "totalSubmissionRaw": 16495}, "2094": {"acRate": 60.855837450317594, "difficulty": "Easy", "likes": 695, "dislikes": 261, "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": 32766, "totalSubmissionRaw": 53842}, "2095": {"acRate": 59.40759648527379, "difficulty": "Medium", "likes": 4188, "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": 460344, "totalSubmissionRaw": 774897}, "2096": {"acRate": 56.373067965276306, "difficulty": "Medium", "likes": 3081, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2096", "paidOnly": false, "title": "Step-By-Step Directions From a Binary Tree Node to Another", "titleSlug": "step-by-step-directions-from-a-binary-tree-node-to-another", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 202349, "totalSubmissionRaw": 358947}, "2097": {"acRate": 44.04647033849242, "difficulty": "Hard", "likes": 506, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2097", "paidOnly": false, "title": "Valid Arrangement of Pairs", "titleSlug": "valid-arrangement-of-pairs", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Eulerian Circuit", "id": "VG9waWNUYWdOb2RlOjYxMDc0", "slug": "eulerian-circuit"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11412, "totalSubmissionRaw": 25909}, "2098": {"acRate": 36.601085481682496, "difficulty": "Medium", "likes": 84, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2098", "paidOnly": true, "title": "Subsequence of Size K With the Largest Even Sum", "titleSlug": "subsequence-of-size-k-with-the-largest-even-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3237, "totalSubmissionRaw": 8844}, "2099": {"acRate": 43.83657782605063, "difficulty": "Easy", "likes": 1253, "dislikes": 131, "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": 52468, "totalSubmissionRaw": 119690}, "2100": {"acRate": 49.51935331172851, "difficulty": "Medium", "likes": 887, "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": 27199, "totalSubmissionRaw": 54926}, "2101": {"acRate": 48.72243786882288, "difficulty": "Medium", "likes": 3066, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2101", "paidOnly": false, "title": "Detonate the Maximum Bombs", "titleSlug": "detonate-the-maximum-bombs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126901, "totalSubmissionRaw": 260454}, "2102": {"acRate": 64.57589379489981, "difficulty": "Hard", "likes": 378, "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": 15371, "totalSubmissionRaw": 23803}, "2103": {"acRate": 80.87636301922016, "difficulty": "Easy", "likes": 958, "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": 76247, "totalSubmissionRaw": 94276}, "2104": {"acRate": 61.019117868432936, "difficulty": "Medium", "likes": 2387, "dislikes": 116, "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": 105391, "totalSubmissionRaw": 172718}, "2105": {"acRate": 48.35595920211122, "difficulty": "Medium", "likes": 275, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2105", "paidOnly": false, "title": "Watering Plants II", "titleSlug": "watering-plants-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20339, "totalSubmissionRaw": 42061}, "2106": {"acRate": 36.31519090170593, "difficulty": "Hard", "likes": 552, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2106", "paidOnly": false, "title": "Maximum Fruits Harvested After at Most K Steps", "titleSlug": "maximum-fruits-harvested-after-at-most-k-steps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11176, "totalSubmissionRaw": 30775}, "2107": {"acRate": 55.452171074110346, "difficulty": "Medium", "likes": 77, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2107", "paidOnly": true, "title": "Number of Unique Flavors After Sharing K Candies", "titleSlug": "number-of-unique-flavors-after-sharing-k-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3397, "totalSubmissionRaw": 6126}, "2108": {"acRate": 83.86899941512574, "difficulty": "Easy", "likes": 1531, "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": 298265, "totalSubmissionRaw": 355632}, "2109": {"acRate": 59.15545208002866, "difficulty": "Medium", "likes": 559, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2109", "paidOnly": false, "title": "Adding Spaces to a String", "titleSlug": "adding-spaces-to-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46243, "totalSubmissionRaw": 78172}, "2110": {"acRate": 59.108700778118376, "difficulty": "Medium", "likes": 713, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2110", "paidOnly": false, "title": "Number of Smooth Descent Periods of a Stock", "titleSlug": "number-of-smooth-descent-periods-of-a-stock", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37602, "totalSubmissionRaw": 63615}, "2111": {"acRate": 38.75707898658718, "difficulty": "Hard", "likes": 697, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2111", "paidOnly": false, "title": "Minimum Operations to Make the Array K-Increasing", "titleSlug": "minimum-operations-to-make-the-array-k-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13003, "totalSubmissionRaw": 33550}, "2112": {"acRate": 70.17937219730942, "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": 8764, "totalSubmissionRaw": 12488}, "2113": {"acRate": 73.69811320754717, "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": 1953, "totalSubmissionRaw": 2650}, "2114": {"acRate": 86.55716626821379, "difficulty": "Easy", "likes": 1741, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2114", "paidOnly": false, "title": "Maximum Number of Words Found in Sentences", "titleSlug": "maximum-number-of-words-found-in-sentences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 301589, "totalSubmissionRaw": 348428}, "2115": {"acRate": 50.16927158278087, "difficulty": "Medium", "likes": 1874, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "2115", "paidOnly": false, "title": "Find All Possible Recipes from Given Supplies", "titleSlug": "find-all-possible-recipes-from-given-supplies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95880, "totalSubmissionRaw": 191113}, "2116": {"acRate": 31.980704085419138, "difficulty": "Medium", "likes": 1153, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2116", "paidOnly": false, "title": "Check if a Parentheses String Can Be Valid", "titleSlug": "check-if-a-parentheses-string-can-be-valid", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26717, "totalSubmissionRaw": 83541}, "2117": {"acRate": 26.085672082717874, "difficulty": "Hard", "likes": 89, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "2117", "paidOnly": false, "title": "Abbreviating the Product of a Range", "titleSlug": "abbreviating-the-product-of-a-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3532, "totalSubmissionRaw": 13540}, "2118": {"acRate": 55.553231541518514, "difficulty": "Hard", "likes": 23, "dislikes": 37, "categoryTitle": "Database", "frontendQuestionId": "2118", "paidOnly": true, "title": "Build the Equation", "titleSlug": "build-the-equation", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2656, "totalSubmissionRaw": 4781}, "2119": {"acRate": 80.13905446444888, "difficulty": "Easy", "likes": 679, "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": 92095, "totalSubmissionRaw": 114919}, "2120": {"acRate": 82.71211060099084, "difficulty": "Medium", "likes": 538, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2120", "paidOnly": false, "title": "Execution of All Suffix Instructions Staying in a Grid", "titleSlug": "execution-of-all-suffix-instructions-staying-in-a-grid", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31888, "totalSubmissionRaw": 38553}, "2121": {"acRate": 44.466748688726284, "difficulty": "Medium", "likes": 904, "dislikes": 38, "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": 20601, "totalSubmissionRaw": 46329}, "2122": {"acRate": 39.445244956772335, "difficulty": "Hard", "likes": 372, "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": 10950, "totalSubmissionRaw": 27760}, "2123": {"acRate": 40.71269487750557, "difficulty": "Hard", "likes": 52, "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": 914, "totalSubmissionRaw": 2245}, "2124": {"acRate": 72.08517531130833, "difficulty": "Easy", "likes": 737, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2124", "paidOnly": false, "title": "Check if All A's Appears Before All B's", "titleSlug": "check-if-all-as-appears-before-all-bs", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85444, "totalSubmissionRaw": 118532}, "2125": {"acRate": 85.60398008328511, "difficulty": "Medium", "likes": 1851, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "2125", "paidOnly": false, "title": "Number of Laser Beams in a Bank", "titleSlug": "number-of-laser-beams-in-a-bank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210091, "totalSubmissionRaw": 245422}, "2126": {"acRate": 51.66976190740967, "difficulty": "Medium", "likes": 555, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "2126", "paidOnly": false, "title": "Destroying Asteroids", "titleSlug": "destroying-asteroids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46463, "totalSubmissionRaw": 89923}, "2127": {"acRate": 37.31674811195024, "difficulty": "Hard", "likes": 1031, "dislikes": 36, "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": 13440, "totalSubmissionRaw": 36016}, "2128": {"acRate": 76.20371425316166, "difficulty": "Medium", "likes": 475, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "2128", "paidOnly": true, "title": "Remove All Ones With Row and Column Flips", "titleSlug": "remove-all-ones-with-row-and-column-flips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33442, "totalSubmissionRaw": 43885}, "2129": {"acRate": 64.63783890757966, "difficulty": "Easy", "likes": 732, "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": 65321, "totalSubmissionRaw": 101058}, "2130": {"acRate": 80.95192722518216, "difficulty": "Medium", "likes": 3523, "dislikes": 100, "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": 305855, "totalSubmissionRaw": 377823}, "2131": {"acRate": 48.05906148867314, "difficulty": "Medium", "likes": 2430, "dislikes": 60, "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": 118801, "totalSubmissionRaw": 247197}, "2132": {"acRate": 32.363877822045154, "difficulty": "Hard", "likes": 386, "dislikes": 43, "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": 7311, "totalSubmissionRaw": 22590}, "2133": {"acRate": 51.82300599261516, "difficulty": "Easy", "likes": 968, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2133", "paidOnly": false, "title": "Check if Every Row and Column Contains All Numbers", "titleSlug": "check-if-every-row-and-column-contains-all-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77052, "totalSubmissionRaw": 148683}, "2134": {"acRate": 65.54325669070425, "difficulty": "Medium", "likes": 1924, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2134", "paidOnly": false, "title": "Minimum Swaps to Group All 1's Together II", "titleSlug": "minimum-swaps-to-group-all-1s-together-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149506, "totalSubmissionRaw": 228101}, "2135": {"acRate": 43.095325726904676, "difficulty": "Medium", "likes": 693, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "2135", "paidOnly": false, "title": "Count Words Obtained After Adding a Letter", "titleSlug": "count-words-obtained-after-adding-a-letter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35127, "totalSubmissionRaw": 81510}, "2136": {"acRate": 71.77959012965287, "difficulty": "Hard", "likes": 1584, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2136", "paidOnly": false, "title": "Earliest Possible Day of Full Bloom", "titleSlug": "earliest-possible-day-of-full-bloom", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54920, "totalSubmissionRaw": 76512}, "2137": {"acRate": 67.60000000000001, "difficulty": "Medium", "likes": 100, "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": 2535, "totalSubmissionRaw": 3750}, "2138": {"acRate": 66.84473476618183, "difficulty": "Easy", "likes": 464, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2138", "paidOnly": false, "title": "Divide a String Into Groups of Size k", "titleSlug": "divide-a-string-into-groups-of-size-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48300, "totalSubmissionRaw": 72257}, "2139": {"acRate": 50.92820728259512, "difficulty": "Medium", "likes": 989, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2139", "paidOnly": false, "title": "Minimum Moves to Reach Target Score", "titleSlug": "minimum-moves-to-reach-target-score", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44854, "totalSubmissionRaw": 88073}, "2140": {"acRate": 55.04350032242037, "difficulty": "Medium", "likes": 2334, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2140", "paidOnly": false, "title": "Solving Questions With Brainpower", "titleSlug": "solving-questions-with-brainpower", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104139, "totalSubmissionRaw": 189194}, "2141": {"acRate": 49.9659218748717, "difficulty": "Hard", "likes": 2002, "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": 60848, "totalSubmissionRaw": 121779}, "2142": {"acRate": 48.43450479233227, "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": 9096, "totalSubmissionRaw": 18780}, "2143": {"acRate": 51.807802093244526, "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": 1089, "totalSubmissionRaw": 2102}, "2144": {"acRate": 61.37266836131896, "difficulty": "Easy", "likes": 591, "dislikes": 19, "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": 51425, "totalSubmissionRaw": 83792}, "2145": {"acRate": 38.47001122241157, "difficulty": "Medium", "likes": 519, "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": 18510, "totalSubmissionRaw": 48117}, "2146": {"acRate": 43.31840998507665, "difficulty": "Medium", "likes": 501, "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": 15965, "totalSubmissionRaw": 36855}, "2147": {"acRate": 49.359062715368715, "difficulty": "Hard", "likes": 1054, "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": 68039, "totalSubmissionRaw": 137845}, "2148": {"acRate": 59.38268888399912, "difficulty": "Easy", "likes": 645, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2148", "paidOnly": false, "title": "Count Elements With Strictly Smaller and Greater Elements ", "titleSlug": "count-elements-with-strictly-smaller-and-greater-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59372, "totalSubmissionRaw": 99982}, "2149": {"acRate": 84.0211613253851, "difficulty": "Medium", "likes": 3260, "dislikes": 184, "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": 395779, "totalSubmissionRaw": 471047}, "2150": {"acRate": 60.783545543584715, "difficulty": "Medium", "likes": 643, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "2150", "paidOnly": false, "title": "Find All Lonely Numbers in the Array", "titleSlug": "find-all-lonely-numbers-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49648, "totalSubmissionRaw": 81680}, "2151": {"acRate": 50.144294805387005, "difficulty": "Hard", "likes": 504, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2151", "paidOnly": false, "title": "Maximum Good People Based on Statements", "titleSlug": "maximum-good-people-based-on-statements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13553, "totalSubmissionRaw": 27028}, "2152": {"acRate": 43.468035065212746, "difficulty": "Medium", "likes": 71, "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": 2033, "totalSubmissionRaw": 4677}, "2153": {"acRate": 40.09552872495688, "difficulty": "Hard", "likes": 77, "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": 3022, "totalSubmissionRaw": 7537}, "2154": {"acRate": 71.35230129246102, "difficulty": "Easy", "likes": 710, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2154", "paidOnly": false, "title": "Keep Multiplying Found Values by Two", "titleSlug": "keep-multiplying-found-values-by-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96224, "totalSubmissionRaw": 134858}, "2155": {"acRate": 64.31888052581364, "difficulty": "Medium", "likes": 503, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2155", "paidOnly": false, "title": "All Divisions With the Highest Score of a Binary Array", "titleSlug": "all-divisions-with-the-highest-score-of-a-binary-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30336, "totalSubmissionRaw": 47165}, "2156": {"acRate": 23.640816038899263, "difficulty": "Hard", "likes": 424, "dislikes": 383, "categoryTitle": "Algorithms", "frontendQuestionId": "2156", "paidOnly": false, "title": "Find Substring With Given Hash Value", "titleSlug": "find-substring-with-given-hash-value", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13419, "totalSubmissionRaw": 56762}, "2157": {"acRate": 26.10983856893543, "difficulty": "Hard", "likes": 472, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2157", "paidOnly": false, "title": "Groups of Strings", "titleSlug": "groups-of-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9575, "totalSubmissionRaw": 36672}, "2158": {"acRate": 55.293794114950956, "difficulty": "Hard", "likes": 421, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2158", "paidOnly": true, "title": "Amount of New Area Painted Each Day", "titleSlug": "amount-of-new-area-painted-each-day", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30160, "totalSubmissionRaw": 54545}, "2159": {"acRate": 60.347058375827686, "difficulty": "Medium", "likes": 72, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2159", "paidOnly": true, "title": "Order Two Columns Independently", "titleSlug": "order-two-columns-independently", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7929, "totalSubmissionRaw": 13139}, "2160": {"acRate": 86.23769842037083, "difficulty": "Easy", "likes": 1397, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "2160", "paidOnly": false, "title": "Minimum Sum of Four Digit Number After Splitting Digits", "titleSlug": "minimum-sum-of-four-digit-number-after-splitting-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 133809, "totalSubmissionRaw": 155163}, "2161": {"acRate": 85.09139802157698, "difficulty": "Medium", "likes": 1100, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2161", "paidOnly": false, "title": "Partition Array According to Given Pivot", "titleSlug": "partition-array-according-to-given-pivot", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79740, "totalSubmissionRaw": 93711}, "2162": {"acRate": 41.154409309255314, "difficulty": "Medium", "likes": 207, "dislikes": 622, "categoryTitle": "Algorithms", "frontendQuestionId": "2162", "paidOnly": false, "title": "Minimum Cost to Set Cooking Time", "titleSlug": "minimum-cost-to-set-cooking-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16021, "totalSubmissionRaw": 38929}, "2163": {"acRate": 48.17474288890948, "difficulty": "Hard", "likes": 668, "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": 10399, "totalSubmissionRaw": 21586}, "2164": {"acRate": 62.629615887832216, "difficulty": "Easy", "likes": 731, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2164", "paidOnly": false, "title": "Sort Even and Odd Indices Independently", "titleSlug": "sort-even-and-odd-indices-independently", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64144, "totalSubmissionRaw": 102418}, "2165": {"acRate": 52.22175810563614, "difficulty": "Medium", "likes": 633, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2165", "paidOnly": false, "title": "Smallest Value of the Rearranged Number", "titleSlug": "smallest-value-of-the-rearranged-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36256, "totalSubmissionRaw": 69427}, "2166": {"acRate": 32.53716620869443, "difficulty": "Medium", "likes": 587, "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": 23090, "totalSubmissionRaw": 70965}, "2167": {"acRate": 41.510357201109116, "difficulty": "Hard", "likes": 669, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2167", "paidOnly": false, "title": "Minimum Time to Remove All Cars Containing Illegal Goods", "titleSlug": "minimum-time-to-remove-all-cars-containing-illegal-goods", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12725, "totalSubmissionRaw": 30655}, "2168": {"acRate": 60.0805549339897, "difficulty": "Medium", "likes": 73, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2168", "paidOnly": true, "title": "Unique Substrings With Equal Digit Frequency", "titleSlug": "unique-substrings-with-equal-digit-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2685, "totalSubmissionRaw": 4469}, "2169": {"acRate": 74.50544088225247, "difficulty": "Easy", "likes": 603, "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": 76342, "totalSubmissionRaw": 102465}, "2170": {"acRate": 33.350554268085666, "difficulty": "Medium", "likes": 579, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "2170", "paidOnly": false, "title": "Minimum Operations to Make the Array Alternating", "titleSlug": "minimum-operations-to-make-the-array-alternating", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22594, "totalSubmissionRaw": 67747}, "2171": {"acRate": 42.89455417429166, "difficulty": "Medium", "likes": 867, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2171", "paidOnly": false, "title": "Removing Minimum Number of Magic Beans", "titleSlug": "removing-minimum-number-of-magic-beans", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27190, "totalSubmissionRaw": 63388}, "2172": {"acRate": 49.217843709354234, "difficulty": "Hard", "likes": 512, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2172", "paidOnly": false, "title": "Maximum AND Sum of Array", "titleSlug": "maximum-and-sum-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14001, "totalSubmissionRaw": 28447}, "2173": {"acRate": 52.738954012623985, "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": 4679, "totalSubmissionRaw": 8872}, "2174": {"acRate": 67.26078799249531, "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": 5019, "totalSubmissionRaw": 7462}, "2175": {"acRate": 60.40048657247122, "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": 6455, "totalSubmissionRaw": 10687}, "2176": {"acRate": 79.60326651225941, "difficulty": "Easy", "likes": 639, "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": 79737, "totalSubmissionRaw": 100168}, "2177": {"acRate": 64.54873743136756, "difficulty": "Medium", "likes": 671, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "2177", "paidOnly": false, "title": "Find Three Consecutive Integers That Sum to a Given Number", "titleSlug": "find-three-consecutive-integers-that-sum-to-a-given-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48083, "totalSubmissionRaw": 74491}, "2178": {"acRate": 59.26916221033868, "difficulty": "Medium", "likes": 782, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "2178", "paidOnly": false, "title": "Maximum Split of Positive Even Integers", "titleSlug": "maximum-split-of-positive-even-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46550, "totalSubmissionRaw": 78540}, "2179": {"acRate": 41.39710259972217, "difficulty": "Hard", "likes": 618, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2179", "paidOnly": false, "title": "Count Good Triplets in an Array", "titleSlug": "count-good-triplets-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8344, "totalSubmissionRaw": 20156}, "2180": {"acRate": 67.22242384134236, "difficulty": "Easy", "likes": 618, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2180", "paidOnly": false, "title": "Count Integers With Even Digit Sum", "titleSlug": "count-integers-with-even-digit-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62978, "totalSubmissionRaw": 93686}, "2181": {"acRate": 89.85402745333896, "difficulty": "Medium", "likes": 2289, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2181", "paidOnly": false, "title": "Merge Nodes in Between Zeros", "titleSlug": "merge-nodes-in-between-zeros", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 270412, "totalSubmissionRaw": 300946}, "2182": {"acRate": 54.339006649542696, "difficulty": "Medium", "likes": 658, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2182", "paidOnly": false, "title": "Construct String With Repeat Limit", "titleSlug": "construct-string-with-repeat-limit", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22636, "totalSubmissionRaw": 41657}, "2183": {"acRate": 29.566212024055044, "difficulty": "Hard", "likes": 841, "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": 17060, "totalSubmissionRaw": 57701}, "2184": {"acRate": 49.012588747688085, "difficulty": "Medium", "likes": 177, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2184", "paidOnly": true, "title": "Number of Ways to Build Sturdy Brick Wall", "titleSlug": "number-of-ways-to-build-sturdy-brick-wall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8215, "totalSubmissionRaw": 16761}, "2185": {"acRate": 78.23022524262659, "difficulty": "Easy", "likes": 693, "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": 99228, "totalSubmissionRaw": 126841}, "2186": {"acRate": 72.71653019106584, "difficulty": "Medium", "likes": 572, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2186", "paidOnly": false, "title": "Minimum Number of Steps to Make Two Strings Anagram II", "titleSlug": "minimum-number-of-steps-to-make-two-strings-anagram-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43690, "totalSubmissionRaw": 60083}, "2187": {"acRate": 38.78694481070507, "difficulty": "Medium", "likes": 2797, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "2187", "paidOnly": false, "title": "Minimum Time to Complete Trips", "titleSlug": "minimum-time-to-complete-trips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116784, "totalSubmissionRaw": 301091}, "2188": {"acRate": 41.79561180847735, "difficulty": "Hard", "likes": 564, "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": 12020, "totalSubmissionRaw": 28759}, "2189": {"acRate": 63.208616780045354, "difficulty": "Medium", "likes": 66, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2189", "paidOnly": true, "title": "Number of Ways to Build House of Cards", "titleSlug": "number-of-ways-to-build-house-of-cards", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2230, "totalSubmissionRaw": 3528}, "2190": {"acRate": 59.036844087371335, "difficulty": "Easy", "likes": 369, "dislikes": 234, "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": 37623, "totalSubmissionRaw": 63728}, "2191": {"acRate": 60.283549315455886, "difficulty": "Medium", "likes": 918, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2191", "paidOnly": false, "title": "Sort the Jumbled Numbers", "titleSlug": "sort-the-jumbled-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144953, "totalSubmissionRaw": 240452}, "2192": {"acRate": 62.19263166851017, "difficulty": "Medium", "likes": 1602, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2192", "paidOnly": false, "title": "All Ancestors of a Node in a Directed Acyclic Graph", "titleSlug": "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131570, "totalSubmissionRaw": 211553}, "2193": {"acRate": 51.15431609183083, "difficulty": "Hard", "likes": 973, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2193", "paidOnly": false, "title": "Minimum Number of Moves to Make Palindrome", "titleSlug": "minimum-number-of-moves-to-make-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23864, "totalSubmissionRaw": 46651}, "2194": {"acRate": 84.16191945794804, "difficulty": "Easy", "likes": 605, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "2194", "paidOnly": false, "title": "Cells in a Range on an Excel Sheet", "titleSlug": "cells-in-a-range-on-an-excel-sheet", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72540, "totalSubmissionRaw": 86191}, "2195": {"acRate": 25.471917786953956, "difficulty": "Medium", "likes": 749, "dislikes": 308, "categoryTitle": "Algorithms", "frontendQuestionId": "2195", "paidOnly": false, "title": "Append K Integers With Minimal Sum", "titleSlug": "append-k-integers-with-minimal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32817, "totalSubmissionRaw": 128836}, "2196": {"acRate": 81.824240486782, "difficulty": "Medium", "likes": 1562, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2196", "paidOnly": false, "title": "Create Binary Tree From Descriptions", "titleSlug": "create-binary-tree-from-descriptions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151014, "totalSubmissionRaw": 184559}, "2197": {"acRate": 39.17904401836349, "difficulty": "Hard", "likes": 424, "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": 14508, "totalSubmissionRaw": 37030}, "2198": {"acRate": 54.71789883268483, "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": 1125, "totalSubmissionRaw": 2056}, "2199": {"acRate": 49.06149855028231, "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": 3215, "totalSubmissionRaw": 6553}, "2200": {"acRate": 66.05695687550855, "difficulty": "Easy", "likes": 414, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2200", "paidOnly": false, "title": "Find All K-Distant Indices in an Array", "titleSlug": "find-all-k-distant-indices-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40592, "totalSubmissionRaw": 61450}, "2201": {"acRate": 56.54365282760977, "difficulty": "Medium", "likes": 213, "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": 19857, "totalSubmissionRaw": 35118}, "2202": {"acRate": 23.02128831700311, "difficulty": "Medium", "likes": 615, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "2202", "paidOnly": false, "title": "Maximize the Topmost Element After K Moves", "titleSlug": "maximize-the-topmost-element-after-k-moves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29252, "totalSubmissionRaw": 127065}, "2203": {"acRate": 37.02644311231476, "difficulty": "Hard", "likes": 673, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2203", "paidOnly": false, "title": "Minimum Weighted Subgraph With the Required Paths", "titleSlug": "minimum-weighted-subgraph-with-the-required-paths", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12168, "totalSubmissionRaw": 32863}, "2204": {"acRate": 68.64202490960226, "difficulty": "Hard", "likes": 112, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2204", "paidOnly": true, "title": "Distance to a Cycle in Undirected Graph", "titleSlug": "distance-to-a-cycle-in-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3417, "totalSubmissionRaw": 4978}, "2205": {"acRate": 50.019855452307205, "difficulty": "Easy", "likes": 27, "dislikes": 76, "categoryTitle": "Database", "frontendQuestionId": "2205", "paidOnly": true, "title": "The Number of Users That Are Eligible for Discount", "titleSlug": "the-number-of-users-that-are-eligible-for-discount", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6298, "totalSubmissionRaw": 12591}, "2206": {"acRate": 73.72198018410512, "difficulty": "Easy", "likes": 716, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2206", "paidOnly": false, "title": "Divide Array Into Equal Pairs", "titleSlug": "divide-array-into-equal-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83931, "totalSubmissionRaw": 113848}, "2207": {"acRate": 34.77293201208203, "difficulty": "Medium", "likes": 500, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2207", "paidOnly": false, "title": "Maximize Number of Subsequences in a String", "titleSlug": "maximize-number-of-subsequences-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19686, "totalSubmissionRaw": 56613}, "2208": {"acRate": 46.828956749049425, "difficulty": "Medium", "likes": 592, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2208", "paidOnly": false, "title": "Minimum Operations to Halve Array Sum", "titleSlug": "minimum-operations-to-halve-array-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31529, "totalSubmissionRaw": 67328}, "2209": {"acRate": 36.78303870184478, "difficulty": "Hard", "likes": 500, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2209", "paidOnly": false, "title": "Minimum White Tiles After Covering With Carpets", "titleSlug": "minimum-white-tiles-after-covering-with-carpets", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12422, "totalSubmissionRaw": 33771}, "2210": {"acRate": 61.02986783720598, "difficulty": "Easy", "likes": 688, "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": 51165, "totalSubmissionRaw": 83836}, "2211": {"acRate": 43.8871757663704, "difficulty": "Medium", "likes": 666, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "2211", "paidOnly": false, "title": "Count Collisions on a Road", "titleSlug": "count-collisions-on-a-road", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29034, "totalSubmissionRaw": 66156}, "2212": {"acRate": 50.18392348782906, "difficulty": "Medium", "likes": 494, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2212", "paidOnly": false, "title": "Maximum Points in an Archery Competition", "titleSlug": "maximum-points-in-an-archery-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15689, "totalSubmissionRaw": 31263}, "2213": {"acRate": 32.243833968317624, "difficulty": "Hard", "likes": 296, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2213", "paidOnly": false, "title": "Longest Substring of One Repeating Character", "titleSlug": "longest-substring-of-one-repeating-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4824, "totalSubmissionRaw": 14961}, "2214": {"acRate": 57.680983401420626, "difficulty": "Medium", "likes": 313, "dislikes": 233, "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": 31345, "totalSubmissionRaw": 54342}, "2215": {"acRate": 79.22131911601784, "difficulty": "Easy", "likes": 2332, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2215", "paidOnly": false, "title": "Find the Difference of Two Arrays", "titleSlug": "find-the-difference-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 369690, "totalSubmissionRaw": 466656}, "2216": {"acRate": 48.52089985274607, "difficulty": "Medium", "likes": 792, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2216", "paidOnly": false, "title": "Minimum Deletions to Make Array Beautiful", "titleSlug": "minimum-deletions-to-make-array-beautiful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33280, "totalSubmissionRaw": 68589}, "2217": {"acRate": 37.12081589958159, "difficulty": "Medium", "likes": 618, "dislikes": 288, "categoryTitle": "Algorithms", "frontendQuestionId": "2217", "paidOnly": false, "title": "Find Palindrome With Fixed Length", "titleSlug": "find-palindrome-with-fixed-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22712, "totalSubmissionRaw": 61184}, "2218": {"acRate": 60.53973174687083, "difficulty": "Hard", "likes": 2307, "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": 67569, "totalSubmissionRaw": 111611}, "2219": {"acRate": 62.00727272727272, "difficulty": "Medium", "likes": 66, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2219", "paidOnly": true, "title": "Maximum Sum Score of Array", "titleSlug": "maximum-sum-score-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4263, "totalSubmissionRaw": 6875}, "2220": {"acRate": 85.22339678213842, "difficulty": "Easy", "likes": 927, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2220", "paidOnly": false, "title": "Minimum Bit Flips to Convert Number", "titleSlug": "minimum-bit-flips-to-convert-number", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 100694, "totalSubmissionRaw": 118153}, "2221": {"acRate": 78.8048480385983, "difficulty": "Medium", "likes": 1092, "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": 81340, "totalSubmissionRaw": 103217}, "2222": {"acRate": 50.68636796949476, "difficulty": "Medium", "likes": 975, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2222", "paidOnly": false, "title": "Number of Ways to Select Buildings", "titleSlug": "number-of-ways-to-select-buildings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37219, "totalSubmissionRaw": 73430}, "2223": {"acRate": 40.37607979764235, "difficulty": "Hard", "likes": 264, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2223", "paidOnly": false, "title": "Sum of Scores of Built Strings", "titleSlug": "sum-of-scores-of-built-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8460, "totalSubmissionRaw": 20953}, "2224": {"acRate": 65.23386961749799, "difficulty": "Easy", "likes": 453, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2224", "paidOnly": false, "title": "Minimum Number of Operations to Convert Time", "titleSlug": "minimum-number-of-operations-to-convert-time", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42858, "totalSubmissionRaw": 65699}, "2225": {"acRate": 73.21688162164048, "difficulty": "Medium", "likes": 2146, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "2225", "paidOnly": false, "title": "Find Players With Zero or One Losses", "titleSlug": "find-players-with-zero-or-one-losses", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251828, "totalSubmissionRaw": 343941}, "2226": {"acRate": 38.24554608830364, "difficulty": "Medium", "likes": 1115, "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": 43450, "totalSubmissionRaw": 113608}, "2227": {"acRate": 40.534176116998204, "difficulty": "Hard", "likes": 332, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "2227", "paidOnly": false, "title": "Encrypt and Decrypt Strings", "titleSlug": "encrypt-and-decrypt-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13082, "totalSubmissionRaw": 32274}, "2228": {"acRate": 44.847831941826016, "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": 8326, "totalSubmissionRaw": 18565}, "2229": {"acRate": 61.179007907979866, "difficulty": "Easy", "likes": 81, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2229", "paidOnly": true, "title": "Check if an Array Is Consecutive", "titleSlug": "check-if-an-array-is-consecutive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5957, "totalSubmissionRaw": 9737}, "2230": {"acRate": 49.94489346069067, "difficulty": "Easy", "likes": 20, "dislikes": 44, "categoryTitle": "Database", "frontendQuestionId": "2230", "paidOnly": true, "title": "The Users That Are Eligible for Discount", "titleSlug": "the-users-that-are-eligible-for-discount", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5438, "totalSubmissionRaw": 10888}, "2231": {"acRate": 61.93263192684808, "difficulty": "Easy", "likes": 615, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "2231", "paidOnly": false, "title": "Largest Number After Digit Swaps by Parity", "titleSlug": "largest-number-after-digit-swaps-by-parity", "topicTags": [{"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44974, "totalSubmissionRaw": 72617}, "2232": {"acRate": 67.47881694644285, "difficulty": "Medium", "likes": 205, "dislikes": 333, "categoryTitle": "Algorithms", "frontendQuestionId": "2232", "paidOnly": false, "title": "Minimize Result by Adding Parentheses to Expression", "titleSlug": "minimize-result-by-adding-parentheses-to-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21104, "totalSubmissionRaw": 31275}, "2233": {"acRate": 41.68551541431839, "difficulty": "Medium", "likes": 736, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2233", "paidOnly": false, "title": "Maximum Product After K Increments", "titleSlug": "maximum-product-after-k-increments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33358, "totalSubmissionRaw": 80023}, "2234": {"acRate": 29.547549392858574, "difficulty": "Hard", "likes": 432, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2234", "paidOnly": false, "title": "Maximum Total Beauty of the Gardens", "titleSlug": "maximum-total-beauty-of-the-gardens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7373, "totalSubmissionRaw": 24953}, "2235": {"acRate": 87.88708912897795, "difficulty": "Easy", "likes": 1629, "dislikes": 3114, "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": 537702, "totalSubmissionRaw": 611810}, "2236": {"acRate": 84.55355026340835, "difficulty": "Easy", "likes": 1266, "dislikes": 1530, "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": 238978, "totalSubmissionRaw": 282635}, "2237": {"acRate": 63.52450883111729, "difficulty": "Medium", "likes": 77, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2237", "paidOnly": true, "title": "Count Positions on Street With Required Brightness", "titleSlug": "count-positions-on-street-with-required-brightness", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3201, "totalSubmissionRaw": 5039}, "2238": {"acRate": 71.37529965373346, "difficulty": "Medium", "likes": 67, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2238", "paidOnly": true, "title": "Number of Times a Driver Was a Passenger", "titleSlug": "number-of-times-a-driver-was-a-passenger", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8039, "totalSubmissionRaw": 11263}, "2239": {"acRate": 45.44138582827884, "difficulty": "Easy", "likes": 576, "dislikes": 38, "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": 75964, "totalSubmissionRaw": 167168}, "2240": {"acRate": 57.16029043870889, "difficulty": "Medium", "likes": 446, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2240", "paidOnly": false, "title": "Number of Ways to Buy Pens and Pencils", "titleSlug": "number-of-ways-to-buy-pens-and-pencils", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28104, "totalSubmissionRaw": 49167}, "2241": {"acRate": 42.00836345058563, "difficulty": "Medium", "likes": 262, "dislikes": 345, "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": 22201, "totalSubmissionRaw": 52849}, "2242": {"acRate": 38.672207007271695, "difficulty": "Hard", "likes": 520, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2242", "paidOnly": false, "title": "Maximum Score of a Node Sequence", "titleSlug": "maximum-score-of-a-node-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12285, "totalSubmissionRaw": 31767}, "2243": {"acRate": 66.1640936459239, "difficulty": "Easy", "likes": 545, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2243", "paidOnly": false, "title": "Calculate Digit Sum of a String", "titleSlug": "calculate-digit-sum-of-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40329, "totalSubmissionRaw": 60953}, "2244": {"acRate": 62.89495839936608, "difficulty": "Medium", "likes": 2771, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2244", "paidOnly": false, "title": "Minimum Rounds to Complete All Tasks", "titleSlug": "minimum-rounds-to-complete-all-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152397, "totalSubmissionRaw": 242304}, "2245": {"acRate": 36.30448346554952, "difficulty": "Medium", "likes": 186, "dislikes": 400, "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": 8146, "totalSubmissionRaw": 22438}, "2246": {"acRate": 54.42600024764916, "difficulty": "Hard", "likes": 2370, "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": 74722, "totalSubmissionRaw": 137291}, "2247": {"acRate": 49.94493392070485, "difficulty": "Hard", "likes": 59, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2247", "paidOnly": true, "title": "Maximum Cost of Trip With K Highways", "titleSlug": "maximum-cost-of-trip-with-k-highways", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1814, "totalSubmissionRaw": 3632}, "2248": {"acRate": 68.20977766386878, "difficulty": "Easy", "likes": 714, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2248", "paidOnly": false, "title": "Intersection of Multiple Arrays", "titleSlug": "intersection-of-multiple-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85161, "totalSubmissionRaw": 124853}, "2249": {"acRate": 53.17750648687737, "difficulty": "Medium", "likes": 234, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "2249", "paidOnly": false, "title": "Count Lattice Points Inside a Circle", "titleSlug": "count-lattice-points-inside-a-circle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25003, "totalSubmissionRaw": 47018}, "2250": {"acRate": 35.21202584064933, "difficulty": "Medium", "likes": 504, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "2250", "paidOnly": false, "title": "Count Number of Rectangles Containing Each Point", "titleSlug": "count-number-of-rectangles-containing-each-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17006, "totalSubmissionRaw": 48296}, "2251": {"acRate": 56.69037339840518, "difficulty": "Hard", "likes": 1651, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2251", "paidOnly": false, "title": "Number of Flowers in Full Bloom", "titleSlug": "number-of-flowers-in-full-bloom", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81543, "totalSubmissionRaw": 143837}, "2252": {"acRate": 55.720338983050844, "difficulty": "Hard", "likes": 30, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2252", "paidOnly": true, "title": "Dynamic Pivoting of a Table", "titleSlug": "dynamic-pivoting-of-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1578, "totalSubmissionRaw": 2832}, "2253": {"acRate": 66.71338472319552, "difficulty": "Hard", "likes": 16, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "2253", "paidOnly": true, "title": "Dynamic Unpivoting of a Table", "titleSlug": "dynamic-unpivoting-of-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 952, "totalSubmissionRaw": 1427}, "2254": {"acRate": 64.26592797783933, "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": 3480, "totalSubmissionRaw": 5415}, "2255": {"acRate": 72.64290594397632, "difficulty": "Easy", "likes": 539, "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": 63795, "totalSubmissionRaw": 87820}, "2256": {"acRate": 43.21100365183194, "difficulty": "Medium", "likes": 1507, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "2256", "paidOnly": false, "title": "Minimum Average Difference", "titleSlug": "minimum-average-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86142, "totalSubmissionRaw": 199352}, "2257": {"acRate": 52.57661677667256, "difficulty": "Medium", "likes": 419, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2257", "paidOnly": false, "title": "Count Unguarded Cells in the Grid", "titleSlug": "count-unguarded-cells-in-the-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16967, "totalSubmissionRaw": 32271}, "2258": {"acRate": 35.09083667779786, "difficulty": "Hard", "likes": 730, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2258", "paidOnly": false, "title": "Escape the Spreading Fire", "titleSlug": "escape-the-spreading-fire", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11454, "totalSubmissionRaw": 32641}, "2259": {"acRate": 45.69404276932965, "difficulty": "Easy", "likes": 825, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2259", "paidOnly": false, "title": "Remove Digit From Number to Maximize Result", "titleSlug": "remove-digit-from-number-to-maximize-result", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88162, "totalSubmissionRaw": 192940}, "2260": {"acRate": 51.48557446694093, "difficulty": "Medium", "likes": 954, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2260", "paidOnly": false, "title": "Minimum Consecutive Cards to Pick Up", "titleSlug": "minimum-consecutive-cards-to-pick-up", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76591, "totalSubmissionRaw": 148763}, "2261": {"acRate": 51.95148941260916, "difficulty": "Medium", "likes": 666, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2261", "paidOnly": false, "title": "K Divisible Elements Subarrays", "titleSlug": "k-divisible-elements-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34741, "totalSubmissionRaw": 66872}, "2262": {"acRate": 55.69816367135262, "difficulty": "Hard", "likes": 1109, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2262", "paidOnly": false, "title": "Total Appeal of A String", "titleSlug": "total-appeal-of-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34153, "totalSubmissionRaw": 61318}, "2263": {"acRate": 66.00331674958541, "difficulty": "Hard", "likes": 83, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2263", "paidOnly": true, "title": "Make Array Non-decreasing or Non-increasing", "titleSlug": "make-array-non-decreasing-or-non-increasing", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3582, "totalSubmissionRaw": 5427}, "2264": {"acRate": 68.99444581069355, "difficulty": "Easy", "likes": 996, "dislikes": 47, "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": 148692, "totalSubmissionRaw": 215513}, "2265": {"acRate": 86.33205736159516, "difficulty": "Medium", "likes": 2188, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2265", "paidOnly": false, "title": "Count Nodes Equal to Average of Subtree", "titleSlug": "count-nodes-equal-to-average-of-subtree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151107, "totalSubmissionRaw": 175030}, "2266": {"acRate": 47.85693036453924, "difficulty": "Medium", "likes": 872, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2266", "paidOnly": false, "title": "Count Number of Texts", "titleSlug": "count-number-of-texts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20912, "totalSubmissionRaw": 43696}, "2267": {"acRate": 38.88398764887517, "difficulty": "Hard", "likes": 515, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2267", "paidOnly": false, "title": " Check if There Is a Valid Parentheses String Path", "titleSlug": "check-if-there-is-a-valid-parentheses-string-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15867, "totalSubmissionRaw": 40806}, "2268": {"acRate": 71.30534515304294, "difficulty": "Medium", "likes": 244, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2268", "paidOnly": true, "title": "Minimum Number of Keypresses", "titleSlug": "minimum-number-of-keypresses", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29842, "totalSubmissionRaw": 41851}, "2269": {"acRate": 60.13142408787759, "difficulty": "Easy", "likes": 654, "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": 61309, "totalSubmissionRaw": 101959}, "2270": {"acRate": 47.99269868643546, "difficulty": "Medium", "likes": 567, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2270", "paidOnly": false, "title": "Number of Ways to Split Array", "titleSlug": "number-of-ways-to-split-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42855, "totalSubmissionRaw": 89297}, "2271": {"acRate": 33.80244666868871, "difficulty": "Medium", "likes": 774, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2271", "paidOnly": false, "title": "Maximum White Tiles Covered by a Carpet", "titleSlug": "maximum-white-tiles-covered-by-a-carpet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16717, "totalSubmissionRaw": 49455}, "2272": {"acRate": 46.24416618471843, "difficulty": "Hard", "likes": 1850, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "2272", "paidOnly": false, "title": "Substring With Largest Variance", "titleSlug": "substring-with-largest-variance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68766, "totalSubmissionRaw": 148702}, "2273": {"acRate": 58.37836833992609, "difficulty": "Easy", "likes": 671, "dislikes": 184, "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": 62870, "totalSubmissionRaw": 107694}, "2274": {"acRate": 51.79287287477619, "difficulty": "Medium", "likes": 406, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2274", "paidOnly": false, "title": "Maximum Consecutive Floors Without Special Floors", "titleSlug": "maximum-consecutive-floors-without-special-floors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32687, "totalSubmissionRaw": 63111}, "2275": {"acRate": 72.97311366179954, "difficulty": "Medium", "likes": 563, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2275", "paidOnly": false, "title": "Largest Combination With Bitwise AND Greater Than Zero", "titleSlug": "largest-combination-with-bitwise-and-greater-than-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28037, "totalSubmissionRaw": 38421}, "2276": {"acRate": 35.279555149299206, "difficulty": "Hard", "likes": 575, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2276", "paidOnly": false, "title": "Count Integers in Intervals", "titleSlug": "count-integers-in-intervals", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18526, "totalSubmissionRaw": 52512}, "2277": {"acRate": 62.586575997985136, "difficulty": "Hard", "likes": 134, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2277", "paidOnly": true, "title": "Closest Node to Path in Tree", "titleSlug": "closest-node-to-path-in-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4970, "totalSubmissionRaw": 7941}, "2278": {"acRate": 74.12063479707706, "difficulty": "Easy", "likes": 518, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2278", "paidOnly": false, "title": "Percentage of Letter in String", "titleSlug": "percentage-of-letter-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76176, "totalSubmissionRaw": 102773}, "2279": {"acRate": 67.51208408273382, "difficulty": "Medium", "likes": 1668, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "2279", "paidOnly": false, "title": "Maximum Bags With Full Capacity of Rocks", "titleSlug": "maximum-bags-with-full-capacity-of-rocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96094, "totalSubmissionRaw": 142336}, "2280": {"acRate": 25.33741807593448, "difficulty": "Medium", "likes": 341, "dislikes": 523, "categoryTitle": "Algorithms", "frontendQuestionId": "2280", "paidOnly": false, "title": "Minimum Lines to Represent a Line Chart", "titleSlug": "minimum-lines-to-represent-a-line-chart", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26714, "totalSubmissionRaw": 105433}, "2281": {"acRate": 27.88167195413814, "difficulty": "Hard", "likes": 1181, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2281", "paidOnly": false, "title": "Sum of Total Strength of Wizards", "titleSlug": "sum-of-total-strength-of-wizards", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20038, "totalSubmissionRaw": 71868}, "2282": {"acRate": 48.33201996322563, "difficulty": "Medium", "likes": 63, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2282", "paidOnly": true, "title": "Number of People That Can Be Seen in a Grid", "titleSlug": "number-of-people-that-can-be-seen-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1840, "totalSubmissionRaw": 3807}, "2283": {"acRate": 72.35401125666915, "difficulty": "Easy", "likes": 598, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2283", "paidOnly": false, "title": "Check if Number Has Equal Digit Count and Digit Value", "titleSlug": "check-if-number-has-equal-digit-count-and-digit-value", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59263, "totalSubmissionRaw": 81907}, "2284": {"acRate": 57.023102310231025, "difficulty": "Medium", "likes": 432, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2284", "paidOnly": false, "title": "Sender With Largest Word Count", "titleSlug": "sender-with-largest-word-count", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34556, "totalSubmissionRaw": 60600}, "2285": {"acRate": 69.37323750587498, "difficulty": "Medium", "likes": 1262, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "2285", "paidOnly": false, "title": "Maximum Total Importance of Roads", "titleSlug": "maximum-total-importance-of-roads", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141699, "totalSubmissionRaw": 204256}, "2286": {"acRate": 17.858048162230673, "difficulty": "Hard", "likes": 330, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2286", "paidOnly": false, "title": "Booking Concert Tickets in Groups", "titleSlug": "booking-concert-tickets-in-groups", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7045, "totalSubmissionRaw": 39450}, "2287": {"acRate": 59.269519263552674, "difficulty": "Easy", "likes": 471, "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": 41721, "totalSubmissionRaw": 70392}, "2288": {"acRate": 31.111674162285425, "difficulty": "Medium", "likes": 199, "dislikes": 1101, "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": 24558, "totalSubmissionRaw": 78935}, "2289": {"acRate": 22.02300777235675, "difficulty": "Medium", "likes": 1329, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2289", "paidOnly": false, "title": "Steps to Make Array Non-decreasing", "titleSlug": "steps-to-make-array-non-decreasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22073, "totalSubmissionRaw": 100227}, "2290": {"acRate": 54.58528448258536, "difficulty": "Hard", "likes": 950, "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": 27160, "totalSubmissionRaw": 49757}, "2291": {"acRate": 45.34212695795548, "difficulty": "Medium", "likes": 158, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2291", "paidOnly": true, "title": "Maximum Profit From Trading Stocks", "titleSlug": "maximum-profit-from-trading-stocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9350, "totalSubmissionRaw": 20621}, "2292": {"acRate": 39.35756180452776, "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": 7180, "totalSubmissionRaw": 18243}, "2293": {"acRate": 63.16200173975336, "difficulty": "Easy", "likes": 534, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2293", "paidOnly": false, "title": "Min Max Game", "titleSlug": "min-max-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49375, "totalSubmissionRaw": 78172}, "2294": {"acRate": 73.98157416990448, "difficulty": "Medium", "likes": 766, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2294", "paidOnly": false, "title": "Partition Array Such That Maximum Difference Is K", "titleSlug": "partition-array-such-that-maximum-difference-is-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43604, "totalSubmissionRaw": 58939}, "2295": {"acRate": 57.94353744753516, "difficulty": "Medium", "likes": 632, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2295", "paidOnly": false, "title": "Replace Elements in an Array", "titleSlug": "replace-elements-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36308, "totalSubmissionRaw": 62661}, "2296": {"acRate": 45.22531228748344, "difficulty": "Hard", "likes": 571, "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": 25271, "totalSubmissionRaw": 55878}, "2297": {"acRate": 45.48504079782412, "difficulty": "Medium", "likes": 145, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2297", "paidOnly": true, "title": "Jump Game VIII", "titleSlug": "jump-game-viii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5017, "totalSubmissionRaw": 11030}, "2298": {"acRate": 81.49284253578732, "difficulty": "Medium", "likes": 47, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2298", "paidOnly": true, "title": "Tasks Count in the Weekend", "titleSlug": "tasks-count-in-the-weekend", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6376, "totalSubmissionRaw": 7824}, "2299": {"acRate": 54.84336303520821, "difficulty": "Easy", "likes": 347, "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": 42961, "totalSubmissionRaw": 78334}, "2300": {"acRate": 43.45171385675922, "difficulty": "Medium", "likes": 2569, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2300", "paidOnly": false, "title": "Successful Pairs of Spells and Potions", "titleSlug": "successful-pairs-of-spells-and-potions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164387, "totalSubmissionRaw": 378323}, "2301": {"acRate": 41.033563896133344, "difficulty": "Hard", "likes": 379, "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": 14475, "totalSubmissionRaw": 35276}, "2302": {"acRate": 54.87486456242562, "difficulty": "Hard", "likes": 1038, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2302", "paidOnly": false, "title": "Count Subarrays With Score Less Than K", "titleSlug": "count-subarrays-with-score-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30894, "totalSubmissionRaw": 56299}, "2303": {"acRate": 65.7861550619609, "difficulty": "Easy", "likes": 262, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "2303", "paidOnly": false, "title": "Calculate Amount Paid in Taxes", "titleSlug": "calculate-amount-paid-in-taxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39125, "totalSubmissionRaw": 59473}, "2304": {"acRate": 66.81214340458145, "difficulty": "Medium", "likes": 886, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2304", "paidOnly": false, "title": "Minimum Path Cost in a Grid", "titleSlug": "minimum-path-cost-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31383, "totalSubmissionRaw": 46972}, "2305": {"acRate": 69.2124375851112, "difficulty": "Medium", "likes": 2562, "dislikes": 116, "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": 97584, "totalSubmissionRaw": 140992}, "2306": {"acRate": 46.40106646353075, "difficulty": "Hard", "likes": 1944, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2306", "paidOnly": false, "title": "Naming a Company", "titleSlug": "naming-a-company", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60913, "totalSubmissionRaw": 131275}, "2307": {"acRate": 43.59403138667353, "difficulty": "Hard", "likes": 59, "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": 3389, "totalSubmissionRaw": 7774}, "2308": {"acRate": 69.12883152800184, "difficulty": "Medium", "likes": 78, "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": 5999, "totalSubmissionRaw": 8678}, "2309": {"acRate": 70.04029660321109, "difficulty": "Easy", "likes": 481, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2309", "paidOnly": false, "title": "Greatest English Letter in Upper and Lower Case", "titleSlug": "greatest-english-letter-in-upper-and-lower-case", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55446, "totalSubmissionRaw": 79163}, "2310": {"acRate": 26.779314901199225, "difficulty": "Medium", "likes": 405, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "2310", "paidOnly": false, "title": "Sum of Numbers With Units Digit K", "titleSlug": "sum-of-numbers-with-units-digit-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26752, "totalSubmissionRaw": 99898}, "2311": {"acRate": 37.97340003041928, "difficulty": "Medium", "likes": 684, "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": 22470, "totalSubmissionRaw": 59173}, "2312": {"acRate": 50.0432230765731, "difficulty": "Hard", "likes": 543, "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": 10999, "totalSubmissionRaw": 21979}, "2313": {"acRate": 58.734220402592975, "difficulty": "Hard", "likes": 99, "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": 3443, "totalSubmissionRaw": 5862}, "2314": {"acRate": 71.86837841206531, "difficulty": "Medium", "likes": 52, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2314", "paidOnly": true, "title": "The First Day of the Maximum Recorded Degree in Each City", "titleSlug": "the-first-day-of-the-maximum-recorded-degree-in-each-city", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5766, "totalSubmissionRaw": 8023}, "2315": {"acRate": 82.39309018552896, "difficulty": "Easy", "likes": 626, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2315", "paidOnly": false, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74120, "totalSubmissionRaw": 89959}, "2316": {"acRate": 49.20881957686853, "difficulty": "Medium", "likes": 2040, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2316", "paidOnly": false, "title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "titleSlug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92642, "totalSubmissionRaw": 188263}, "2317": {"acRate": 79.62327178249977, "difficulty": "Medium", "likes": 611, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "2317", "paidOnly": false, "title": "Maximum XOR After Operations ", "titleSlug": "maximum-xor-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25743, "totalSubmissionRaw": 32331}, "2318": {"acRate": 57.242166424569405, "difficulty": "Hard", "likes": 437, "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": 11034, "totalSubmissionRaw": 19276}, "2319": {"acRate": 65.17383975455063, "difficulty": "Easy", "likes": 489, "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": 53743, "totalSubmissionRaw": 82461}, "2320": {"acRate": 41.95959412937126, "difficulty": "Medium", "likes": 579, "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": 27789, "totalSubmissionRaw": 66228}, "2321": {"acRate": 56.87325187693214, "difficulty": "Hard", "likes": 785, "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": 19317, "totalSubmissionRaw": 33965}, "2322": {"acRate": 52.42343354874966, "difficulty": "Hard", "likes": 453, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2322", "paidOnly": false, "title": "Minimum Score After Removals on a Tree", "titleSlug": "minimum-score-after-removals-on-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7463, "totalSubmissionRaw": 14236}, "2323": {"acRate": 65.86143665789683, "difficulty": "Medium", "likes": 61, "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": 8261, "totalSubmissionRaw": 12543}, "2324": {"acRate": 74.2947016612602, "difficulty": "Medium", "likes": 48, "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": 7558, "totalSubmissionRaw": 10173}, "2325": {"acRate": 84.56331620847877, "difficulty": "Easy", "likes": 992, "dislikes": 99, "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": 107814, "totalSubmissionRaw": 127495}, "2326": {"acRate": 75.36775612054373, "difficulty": "Medium", "likes": 748, "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": 43191, "totalSubmissionRaw": 57307}, "2327": {"acRate": 45.967892826404224, "difficulty": "Medium", "likes": 847, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2327", "paidOnly": false, "title": "Number of People Aware of a Secret", "titleSlug": "number-of-people-aware-of-a-secret", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24568, "totalSubmissionRaw": 53446}, "2328": {"acRate": 58.22277127191497, "difficulty": "Hard", "likes": 1976, "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": 68810, "totalSubmissionRaw": 118184}, "2329": {"acRate": 69.7478203806131, "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": 7440, "totalSubmissionRaw": 10667}, "2330": {"acRate": 76.04179248701534, "difficulty": "Medium", "likes": 102, "dislikes": 32, "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": 12586, "totalSubmissionRaw": 16553}, "2331": {"acRate": 82.83182139029044, "difficulty": "Easy", "likes": 1428, "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": 190104, "totalSubmissionRaw": 229506}, "2332": {"acRate": 27.36544971386356, "difficulty": "Medium", "likes": 461, "dislikes": 743, "categoryTitle": "Algorithms", "frontendQuestionId": "2332", "paidOnly": false, "title": "The Latest Time to Catch a Bus", "titleSlug": "the-latest-time-to-catch-a-bus", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24818, "totalSubmissionRaw": 90691}, "2333": {"acRate": 25.489747828227767, "difficulty": "Medium", "likes": 627, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2333", "paidOnly": false, "title": "Minimum Sum of Squared Difference", "titleSlug": "minimum-sum-of-squared-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14495, "totalSubmissionRaw": 56866}, "2334": {"acRate": 42.974295031651636, "difficulty": "Hard", "likes": 545, "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": 8961, "totalSubmissionRaw": 20852}, "2335": {"acRate": 57.87309674743765, "difficulty": "Easy", "likes": 690, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2335", "paidOnly": false, "title": "Minimum Amount of Time to Fill Cups", "titleSlug": "minimum-amount-of-time-to-fill-cups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48842, "totalSubmissionRaw": 84395}, "2336": {"acRate": 71.63126073580932, "difficulty": "Medium", "likes": 1667, "dislikes": 194, "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": 147622, "totalSubmissionRaw": 206086}, "2337": {"acRate": 47.63759371000183, "difficulty": "Medium", "likes": 656, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2337", "paidOnly": false, "title": "Move Pieces to Obtain a String", "titleSlug": "move-pieces-to-obtain-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26053, "totalSubmissionRaw": 54690}, "2338": {"acRate": 26.808166048672376, "difficulty": "Hard", "likes": 482, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2338", "paidOnly": false, "title": "Count the Number of Ideal Arrays", "titleSlug": "count-the-number-of-ideal-arrays", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6290, "totalSubmissionRaw": 23463}, "2339": {"acRate": 87.71076523994812, "difficulty": "Easy", "likes": 42, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2339", "paidOnly": true, "title": "All the Matches of the League", "titleSlug": "all-the-matches-of-the-league", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8115, "totalSubmissionRaw": 9252}, "2340": {"acRate": 72.43782707358866, "difficulty": "Medium", "likes": 175, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2340", "paidOnly": true, "title": "Minimum Adjacent Swaps to Make a Valid Array", "titleSlug": "minimum-adjacent-swaps-to-make-a-valid-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31283, "totalSubmissionRaw": 43186}, "2341": {"acRate": 75.32395743640443, "difficulty": "Easy", "likes": 675, "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": 70858, "totalSubmissionRaw": 94071}, "2342": {"acRate": 55.08843857467711, "difficulty": "Medium", "likes": 699, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2342", "paidOnly": false, "title": "Max Sum of a Pair With Equal Sum of Digits", "titleSlug": "max-sum-of-a-pair-with-equal-sum-of-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49178, "totalSubmissionRaw": 89271}, "2343": {"acRate": 44.17238001958864, "difficulty": "Medium", "likes": 311, "dislikes": 428, "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": 30217, "totalSubmissionRaw": 68407}, "2344": {"acRate": 56.237643337287466, "difficulty": "Hard", "likes": 546, "dislikes": 127, "categoryTitle": "Algorithms", "frontendQuestionId": "2344", "paidOnly": false, "title": "Minimum Deletions to Make Array Divisible", "titleSlug": "minimum-deletions-to-make-array-divisible", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28445, "totalSubmissionRaw": 50580}, "2345": {"acRate": 37.77777777777778, "difficulty": "Medium", "likes": 156, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2345", "paidOnly": true, "title": "Finding the Number of Visible Mountains", "titleSlug": "finding-the-number-of-visible-mountains", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8704, "totalSubmissionRaw": 23040}, "2346": {"acRate": 33.59594437213126, "difficulty": "Medium", "likes": 26, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "2346", "paidOnly": true, "title": "Compute the Rank as a Percentage", "titleSlug": "compute-the-rank-as-a-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4904, "totalSubmissionRaw": 14597}, "2347": {"acRate": 60.65403731182021, "difficulty": "Easy", "likes": 371, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2347", "paidOnly": false, "title": "Best Poker Hand", "titleSlug": "best-poker-hand", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42103, "totalSubmissionRaw": 69415}, "2348": {"acRate": 66.74434802645705, "difficulty": "Medium", "likes": 2258, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2348", "paidOnly": false, "title": "Number of Zero-Filled Subarrays", "titleSlug": "number-of-zero-filled-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127449, "totalSubmissionRaw": 190951}, "2349": {"acRate": 44.84011627906977, "difficulty": "Medium", "likes": 397, "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": 23446, "totalSubmissionRaw": 52288}, "2350": {"acRate": 68.54787856949824, "difficulty": "Hard", "likes": 639, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2350", "paidOnly": false, "title": "Shortest Impossible Sequence of Rolls", "titleSlug": "shortest-impossible-sequence-of-rolls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15219, "totalSubmissionRaw": 22203}, "2351": {"acRate": 73.63066876856132, "difficulty": "Easy", "likes": 1028, "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": 124709, "totalSubmissionRaw": 169371}, "2352": {"acRate": 70.41903526892746, "difficulty": "Medium", "likes": 2206, "dislikes": 155, "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": 233505, "totalSubmissionRaw": 331594}, "2353": {"acRate": 45.22969144167064, "difficulty": "Medium", "likes": 1488, "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": 84447, "totalSubmissionRaw": 186707}, "2354": {"acRate": 47.47073186001377, "difficulty": "Hard", "likes": 590, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2354", "paidOnly": false, "title": "Number of Excellent Pairs", "titleSlug": "number-of-excellent-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15165, "totalSubmissionRaw": 31946}, "2355": {"acRate": 40.3344120819849, "difficulty": "Hard", "likes": 283, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2355", "paidOnly": true, "title": "Maximum Number of Books You Can Take", "titleSlug": "maximum-number-of-books-you-can-take", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11216, "totalSubmissionRaw": 27809}, "2356": {"acRate": 88.50011203226529, "difficulty": "Easy", "likes": 449, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "2356", "paidOnly": false, "title": "Number of Unique Subjects Taught by Each Teacher", "titleSlug": "number-of-unique-subjects-taught-by-each-teacher", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 197487, "totalSubmissionRaw": 223149}, "2357": {"acRate": 72.4510120075118, "difficulty": "Easy", "likes": 1172, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2357", "paidOnly": false, "title": "Make Array Zero by Subtracting Equal Amounts", "titleSlug": "make-array-zero-by-subtracting-equal-amounts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 114581, "totalSubmissionRaw": 158150}, "2358": {"acRate": 68.06671882779715, "difficulty": "Medium", "likes": 669, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "2358", "paidOnly": false, "title": "Maximum Number of Groups Entering a Competition", "titleSlug": "maximum-number-of-groups-entering-a-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38278, "totalSubmissionRaw": 56236}, "2359": {"acRate": 45.485647239228165, "difficulty": "Medium", "likes": 1683, "dislikes": 403, "categoryTitle": "Algorithms", "frontendQuestionId": "2359", "paidOnly": false, "title": "Find Closest Node to Given Two Nodes", "titleSlug": "find-closest-node-to-given-two-nodes", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78309, "totalSubmissionRaw": 172162}, "2360": {"acRate": 49.81401035299014, "difficulty": "Hard", "likes": 2326, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2360", "paidOnly": false, "title": "Longest Cycle in a Graph", "titleSlug": "longest-cycle-in-a-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76600, "totalSubmissionRaw": 153772}, "2361": {"acRate": 78.65629725642688, "difficulty": "Hard", "likes": 183, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2361", "paidOnly": true, "title": "Minimum Costs Using the Train Line", "titleSlug": "minimum-costs-using-the-train-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10923, "totalSubmissionRaw": 13887}, "2362": {"acRate": 74.36676798378926, "difficulty": "Hard", "likes": 32, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2362", "paidOnly": true, "title": "Generate the Invoice", "titleSlug": "generate-the-invoice", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3670, "totalSubmissionRaw": 4935}, "2363": {"acRate": 75.63773546168454, "difficulty": "Easy", "likes": 557, "dislikes": 25, "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": 58946, "totalSubmissionRaw": 77932}, "2364": {"acRate": 41.778559861265194, "difficulty": "Medium", "likes": 983, "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": 32764, "totalSubmissionRaw": 78423}, "2365": {"acRate": 52.53533069530808, "difficulty": "Medium", "likes": 552, "dislikes": 58, "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": 37174, "totalSubmissionRaw": 70760}, "2366": {"acRate": 53.55270236632701, "difficulty": "Hard", "likes": 1998, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2366", "paidOnly": false, "title": "Minimum Replacements to Sort the Array", "titleSlug": "minimum-replacements-to-sort-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66694, "totalSubmissionRaw": 124539}, "2367": {"acRate": 84.34409664810487, "difficulty": "Easy", "likes": 1261, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2367", "paidOnly": false, "title": "Number of Arithmetic Triplets", "titleSlug": "number-of-arithmetic-triplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 133138, "totalSubmissionRaw": 157850}, "2368": {"acRate": 58.93416927899686, "difficulty": "Medium", "likes": 702, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2368", "paidOnly": false, "title": "Reachable Nodes With Restrictions", "titleSlug": "reachable-nodes-with-restrictions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56776, "totalSubmissionRaw": 96338}, "2369": {"acRate": 51.84547445853978, "difficulty": "Medium", "likes": 1991, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "2369", "paidOnly": false, "title": "Check if There is a Valid Partition For The Array", "titleSlug": "check-if-there-is-a-valid-partition-for-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88522, "totalSubmissionRaw": 170742}, "2370": {"acRate": 47.33473890009569, "difficulty": "Medium", "likes": 1451, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2370", "paidOnly": false, "title": "Longest Ideal Subsequence", "titleSlug": "longest-ideal-subsequence", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114276, "totalSubmissionRaw": 241421}, "2371": {"acRate": 66.33064516129032, "difficulty": "Hard", "likes": 99, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2371", "paidOnly": true, "title": "Minimize Maximum Value in a Grid", "titleSlug": "minimize-maximum-value-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2961, "totalSubmissionRaw": 4464}, "2372": {"acRate": 83.23760580411125, "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": 5507, "totalSubmissionRaw": 6616}, "2373": {"acRate": 88.02773038697971, "difficulty": "Easy", "likes": 1202, "dislikes": 157, "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": 162530, "totalSubmissionRaw": 184635}, "2374": {"acRate": 47.74298885900883, "difficulty": "Medium", "likes": 440, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2374", "paidOnly": false, "title": "Node With Highest Edge Score", "titleSlug": "node-with-highest-edge-score", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34797, "totalSubmissionRaw": 72884}, "2375": {"acRate": 76.2026214819579, "difficulty": "Medium", "likes": 937, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2375", "paidOnly": false, "title": "Construct Smallest Number From DI String", "titleSlug": "construct-smallest-number-from-di-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34359, "totalSubmissionRaw": 45089}, "2376": {"acRate": 38.77225448280263, "difficulty": "Hard", "likes": 570, "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": 12152, "totalSubmissionRaw": 31342}, "2377": {"acRate": 78.8682131022177, "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": 6188, "totalSubmissionRaw": 7846}, "2378": {"acRate": 58.33003561535417, "difficulty": "Medium", "likes": 53, "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": 1474, "totalSubmissionRaw": 2527}, "2379": {"acRate": 59.09901305316778, "difficulty": "Easy", "likes": 732, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2379", "paidOnly": false, "title": "Minimum Recolors to Get K Consecutive Black Blocks", "titleSlug": "minimum-recolors-to-get-k-consecutive-black-blocks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55689, "totalSubmissionRaw": 94230}, "2380": {"acRate": 50.57490936814426, "difficulty": "Medium", "likes": 500, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "2380", "paidOnly": false, "title": "Time Needed to Rearrange a Binary String", "titleSlug": "time-needed-to-rearrange-a-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32505, "totalSubmissionRaw": 64271}, "2381": {"acRate": 37.66445433924221, "difficulty": "Medium", "likes": 758, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2381", "paidOnly": false, "title": "Shifting Letters II", "titleSlug": "shifting-letters-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22416, "totalSubmissionRaw": 59515}, "2382": {"acRate": 49.15555077452668, "difficulty": "Hard", "likes": 460, "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": 9139, "totalSubmissionRaw": 18592}, "2383": {"acRate": 41.24763943094549, "difficulty": "Easy", "likes": 344, "dislikes": 277, "categoryTitle": "Algorithms", "frontendQuestionId": "2383", "paidOnly": false, "title": "Minimum Hours of Training to Win a Competition", "titleSlug": "minimum-hours-of-training-to-win-a-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32763, "totalSubmissionRaw": 79430}, "2384": {"acRate": 35.422987370352075, "difficulty": "Medium", "likes": 605, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "2384", "paidOnly": false, "title": "Largest Palindromic Number", "titleSlug": "largest-palindromic-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40164, "totalSubmissionRaw": 113384}, "2385": {"acRate": 62.72463432140485, "difficulty": "Medium", "likes": 2714, "dislikes": 66, "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": 140697, "totalSubmissionRaw": 224309}, "2386": {"acRate": 39.007061844639416, "difficulty": "Hard", "likes": 565, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2386", "paidOnly": false, "title": "Find the K-Sum of an Array", "titleSlug": "find-the-k-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9114, "totalSubmissionRaw": 23365}, "2387": {"acRate": 69.64174777386623, "difficulty": "Medium", "likes": 76, "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": 3363, "totalSubmissionRaw": 4829}, "2388": {"acRate": 50.7201646090535, "difficulty": "Medium", "likes": 84, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2388", "paidOnly": true, "title": "Change Null Values in a Table to the Previous Value", "titleSlug": "change-null-values-in-a-table-to-the-previous-value", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4437, "totalSubmissionRaw": 8748}, "2389": {"acRate": 71.87141216991964, "difficulty": "Easy", "likes": 1891, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "2389", "paidOnly": false, "title": "Longest Subsequence With Limited Sum", "titleSlug": "longest-subsequence-with-limited-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115184, "totalSubmissionRaw": 160264}, "2390": {"acRate": 75.89727453487671, "difficulty": "Medium", "likes": 2904, "dislikes": 207, "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": 340096, "totalSubmissionRaw": 448102}, "2391": {"acRate": 85.21801705417471, "difficulty": "Medium", "likes": 1525, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "2391", "paidOnly": false, "title": "Minimum Amount of Time to Collect Garbage", "titleSlug": "minimum-amount-of-time-to-collect-garbage", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133817, "totalSubmissionRaw": 157029}, "2392": {"acRate": 79.58462954037594, "difficulty": "Hard", "likes": 1341, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2392", "paidOnly": false, "title": "Build a Matrix With Conditions", "titleSlug": "build-a-matrix-with-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90818, "totalSubmissionRaw": 114115}, "2393": {"acRate": 74.81698389458272, "difficulty": "Medium", "likes": 132, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2393", "paidOnly": true, "title": "Count Strictly Increasing Subarrays", "titleSlug": "count-strictly-increasing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6643, "totalSubmissionRaw": 8879}, "2394": {"acRate": 40.48308304686086, "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": 4475, "totalSubmissionRaw": 11054}, "2395": {"acRate": 65.26915179077591, "difficulty": "Easy", "likes": 536, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2395", "paidOnly": false, "title": "Find Subarrays With Equal Sum", "titleSlug": "find-subarrays-with-equal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51810, "totalSubmissionRaw": 79379}, "2396": {"acRate": 87.70755247823143, "difficulty": "Medium", "likes": 615, "dislikes": 1566, "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": 91964, "totalSubmissionRaw": 104853}, "2397": {"acRate": 55.63758147574633, "difficulty": "Medium", "likes": 266, "dislikes": 409, "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": 15450, "totalSubmissionRaw": 27769}, "2398": {"acRate": 34.65167604912999, "difficulty": "Hard", "likes": 800, "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": 21667, "totalSubmissionRaw": 62528}, "2399": {"acRate": 70.66655359565807, "difficulty": "Easy", "likes": 485, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2399", "paidOnly": false, "title": "Check Distances Between Same Letters", "titleSlug": "check-distances-between-same-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49998, "totalSubmissionRaw": 70752}, "2400": {"acRate": 35.24483670086466, "difficulty": "Medium", "likes": 792, "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": 31468, "totalSubmissionRaw": 89284}, "2401": {"acRate": 51.46203295109252, "difficulty": "Medium", "likes": 1302, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2401", "paidOnly": false, "title": "Longest Nice Subarray", "titleSlug": "longest-nice-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33701, "totalSubmissionRaw": 65489}, "2402": {"acRate": 44.22969010713768, "difficulty": "Hard", "likes": 1712, "dislikes": 109, "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": 119019, "totalSubmissionRaw": 269093}, "2403": {"acRate": 55.839867932315315, "difficulty": "Hard", "likes": 47, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2403", "paidOnly": true, "title": "Minimum Time to Kill All Monsters", "titleSlug": "minimum-time-to-kill-all-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1353, "totalSubmissionRaw": 2423}, "2404": {"acRate": 50.701806868493485, "difficulty": "Easy", "likes": 970, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2404", "paidOnly": false, "title": "Most Frequent Even Element", "titleSlug": "most-frequent-even-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 84744, "totalSubmissionRaw": 167141}, "2405": {"acRate": 77.97113509098057, "difficulty": "Medium", "likes": 2626, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2405", "paidOnly": false, "title": "Optimal Partition of String", "titleSlug": "optimal-partition-of-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 204268, "totalSubmissionRaw": 261979}, "2406": {"acRate": 47.29931053598032, "difficulty": "Medium", "likes": 782, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2406", "paidOnly": false, "title": "Divide Intervals Into Minimum Number of Groups", "titleSlug": "divide-intervals-into-minimum-number-of-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27304, "totalSubmissionRaw": 57726}, "2407": {"acRate": 24.176091821046384, "difficulty": "Hard", "likes": 879, "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": 15882, "totalSubmissionRaw": 65693}, "2408": {"acRate": 78.4366576819407, "difficulty": "Medium", "likes": 51, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2408", "paidOnly": true, "title": "Design SQL", "titleSlug": "design-sql", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6984, "totalSubmissionRaw": 8904}, "2409": {"acRate": 45.23131741513197, "difficulty": "Easy", "likes": 253, "dislikes": 583, "categoryTitle": "Algorithms", "frontendQuestionId": "2409", "paidOnly": false, "title": "Count Days Spent Together", "titleSlug": "count-days-spent-together", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23357, "totalSubmissionRaw": 51639}, "2410": {"acRate": 63.36814755303328, "difficulty": "Medium", "likes": 500, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2410", "paidOnly": false, "title": "Maximum Matching of Players With Trainers", "titleSlug": "maximum-matching-of-players-with-trainers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37071, "totalSubmissionRaw": 58501}, "2411": {"acRate": 44.322048172477686, "difficulty": "Medium", "likes": 563, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2411", "paidOnly": false, "title": "Smallest Subarrays With Maximum Bitwise OR", "titleSlug": "smallest-subarrays-with-maximum-bitwise-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13157, "totalSubmissionRaw": 29685}, "2412": {"acRate": 40.467753366406804, "difficulty": "Hard", "likes": 399, "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": 10849, "totalSubmissionRaw": 26809}, "2413": {"acRate": 87.87105197772593, "difficulty": "Easy", "likes": 896, "dislikes": 105, "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": 180365, "totalSubmissionRaw": 205261}, "2414": {"acRate": 58.50996065696622, "difficulty": "Medium", "likes": 505, "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": 46843, "totalSubmissionRaw": 80061}, "2415": {"acRate": 78.02102712759054, "difficulty": "Medium", "likes": 1121, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2415", "paidOnly": false, "title": "Reverse Odd Levels of Binary Tree", "titleSlug": "reverse-odd-levels-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54099, "totalSubmissionRaw": 69339}, "2416": {"acRate": 46.28292342578057, "difficulty": "Hard", "likes": 668, "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": 26534, "totalSubmissionRaw": 57330}, "2417": {"acRate": 45.12694512694513, "difficulty": "Medium", "likes": 28, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2417", "paidOnly": true, "title": "Closest Fair Integer", "titleSlug": "closest-fair-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1102, "totalSubmissionRaw": 2442}, "2418": {"acRate": 85.02526202940204, "difficulty": "Easy", "likes": 1710, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2418", "paidOnly": false, "title": "Sort the People", "titleSlug": "sort-the-people", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 298202, "totalSubmissionRaw": 350720}, "2419": {"acRate": 49.622276113543975, "difficulty": "Medium", "likes": 461, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2419", "paidOnly": false, "title": "Longest Subarray With Maximum Bitwise AND", "titleSlug": "longest-subarray-with-maximum-bitwise-and", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28442, "totalSubmissionRaw": 57317}, "2420": {"acRate": 38.8613223353525, "difficulty": "Medium", "likes": 623, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2420", "paidOnly": false, "title": "Find All Good Indices", "titleSlug": "find-all-good-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24121, "totalSubmissionRaw": 62071}, "2421": {"acRate": 56.33678994585306, "difficulty": "Hard", "likes": 2236, "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": 56392, "totalSubmissionRaw": 100098}, "2422": {"acRate": 69.21354603974251, "difficulty": "Medium", "likes": 134, "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": 12365, "totalSubmissionRaw": 17865}, "2423": {"acRate": 17.376584718561155, "difficulty": "Easy", "likes": 670, "dislikes": 1215, "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": 48452, "totalSubmissionRaw": 278835}, "2424": {"acRate": 55.50820095570192, "difficulty": "Medium", "likes": 359, "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": 21490, "totalSubmissionRaw": 38715}, "2425": {"acRate": 58.1232055035961, "difficulty": "Medium", "likes": 404, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2425", "paidOnly": false, "title": "Bitwise XOR of All Pairings", "titleSlug": "bitwise-xor-of-all-pairings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20446, "totalSubmissionRaw": 35177}, "2426": {"acRate": 44.21624096543154, "difficulty": "Hard", "likes": 530, "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": 13520, "totalSubmissionRaw": 30577}, "2427": {"acRate": 79.08174828710402, "difficulty": "Easy", "likes": 573, "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": 90721, "totalSubmissionRaw": 114718}, "2428": {"acRate": 74.9269532880507, "difficulty": "Medium", "likes": 451, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2428", "paidOnly": false, "title": "Maximum Sum of an Hourglass", "titleSlug": "maximum-sum-of-an-hourglass", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39491, "totalSubmissionRaw": 52706}, "2429": {"acRate": 44.27761028245001, "difficulty": "Medium", "likes": 480, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2429", "paidOnly": false, "title": "Minimize XOR", "titleSlug": "minimize-xor", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22323, "totalSubmissionRaw": 50416}, "2430": {"acRate": 33.55420351257482, "difficulty": "Hard", "likes": 482, "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": 13622, "totalSubmissionRaw": 40597}, "2431": {"acRate": 64.12707337644082, "difficulty": "Medium", "likes": 46, "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": 2281, "totalSubmissionRaw": 3557}, "2432": {"acRate": 50.21908989066777, "difficulty": "Easy", "likes": 274, "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": 35414, "totalSubmissionRaw": 70519}, "2433": {"acRate": 88.0769701312547, "difficulty": "Medium", "likes": 1387, "dislikes": 82, "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": 151185, "totalSubmissionRaw": 171651}, "2434": {"acRate": 40.02898976955234, "difficulty": "Medium", "likes": 649, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "2434", "paidOnly": false, "title": "Using a Robot to Print the Lexicographically Smallest String", "titleSlug": "using-a-robot-to-print-the-lexicographically-smallest-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19055, "totalSubmissionRaw": 47603}, "2435": {"acRate": 42.97124600638978, "difficulty": "Hard", "likes": 897, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2435", "paidOnly": false, "title": "Paths in Matrix Whose Sum Is Divisible by K", "titleSlug": "paths-in-matrix-whose-sum-is-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23403, "totalSubmissionRaw": 54462}, "2436": {"acRate": 71.14382091383011, "difficulty": "Medium", "likes": 40, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2436", "paidOnly": true, "title": "Minimum Split Into Subarrays With GCD Greater Than One", "titleSlug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2320, "totalSubmissionRaw": 3261}, "2437": {"acRate": 46.79967236133864, "difficulty": "Easy", "likes": 286, "dislikes": 236, "categoryTitle": "Algorithms", "frontendQuestionId": "2437", "paidOnly": false, "title": "Number of Valid Clock Times", "titleSlug": "number-of-valid-clock-times", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31996, "totalSubmissionRaw": 68368}, "2438": {"acRate": 40.49042183136544, "difficulty": "Medium", "likes": 293, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2438", "paidOnly": false, "title": "Range Product Queries of Powers", "titleSlug": "range-product-queries-of-powers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16529, "totalSubmissionRaw": 40822}, "2439": {"acRate": 46.48097529891167, "difficulty": "Medium", "likes": 2417, "dislikes": 618, "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": 83154, "totalSubmissionRaw": 178899}, "2440": {"acRate": 53.026559604694256, "difficulty": "Hard", "likes": 388, "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": 6868, "totalSubmissionRaw": 12952}, "2441": {"acRate": 75.080992618817, "difficulty": "Easy", "likes": 995, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2441", "paidOnly": false, "title": "Largest Positive Integer That Exists With Its Negative", "titleSlug": "largest-positive-integer-that-exists-with-its-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 224800, "totalSubmissionRaw": 299410}, "2442": {"acRate": 79.70858727115063, "difficulty": "Medium", "likes": 629, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2442", "paidOnly": false, "title": "Count Number of Distinct Integers After Reverse Operations", "titleSlug": "count-number-of-distinct-integers-after-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65263, "totalSubmissionRaw": 81877}, "2443": {"acRate": 47.44047232855382, "difficulty": "Medium", "likes": 253, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "2443", "paidOnly": false, "title": "Sum of Number and Its Reverse", "titleSlug": "sum-of-number-and-its-reverse", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36560, "totalSubmissionRaw": 77065}, "2444": {"acRate": 67.90819002660072, "difficulty": "Hard", "likes": 3148, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2444", "paidOnly": false, "title": "Count Subarrays With Fixed Bounds", "titleSlug": "count-subarrays-with-fixed-bounds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145003, "totalSubmissionRaw": 213528}, "2445": {"acRate": 68.71675531914893, "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": 2067, "totalSubmissionRaw": 3008}, "2446": {"acRate": 51.039366566298646, "difficulty": "Easy", "likes": 456, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2446", "paidOnly": false, "title": "Determine if Two Events Have Conflict", "titleSlug": "determine-if-two-events-have-conflict", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45767, "totalSubmissionRaw": 89670}, "2447": {"acRate": 50.2272424743758, "difficulty": "Medium", "likes": 443, "dislikes": 67, "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": 26413, "totalSubmissionRaw": 52587}, "2448": {"acRate": 45.93831570270642, "difficulty": "Hard", "likes": 2383, "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": 66877, "totalSubmissionRaw": 145580}, "2449": {"acRate": 61.98561151079137, "difficulty": "Hard", "likes": 425, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2449", "paidOnly": false, "title": "Minimum Number of Operations to Make Arrays Similar", "titleSlug": "minimum-number-of-operations-to-make-arrays-similar", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12924, "totalSubmissionRaw": 20850}, "2450": {"acRate": 63.46769033909149, "difficulty": "Medium", "likes": 37, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2450", "paidOnly": true, "title": "Number of Distinct Binary Strings After Applying Operations", "titleSlug": "number-of-distinct-binary-strings-after-applying-operations", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 992, "totalSubmissionRaw": 1563}, "2451": {"acRate": 59.22606120434354, "difficulty": "Easy", "likes": 394, "dislikes": 110, "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": 29998, "totalSubmissionRaw": 50650}, "2452": {"acRate": 60.8045850929633, "difficulty": "Medium", "likes": 297, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2452", "paidOnly": false, "title": "Words Within Two Edits of Dictionary", "titleSlug": "words-within-two-edits-of-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22173, "totalSubmissionRaw": 36466}, "2453": {"acRate": 39.43226034665723, "difficulty": "Medium", "likes": 564, "dislikes": 23, "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": 17836, "totalSubmissionRaw": 45232}, "2454": {"acRate": 38.86078252957234, "difficulty": "Hard", "likes": 660, "dislikes": 10, "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": 10677, "totalSubmissionRaw": 27475}, "2455": {"acRate": 60.55157357060471, "difficulty": "Easy", "likes": 333, "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": 58798, "totalSubmissionRaw": 97104}, "2456": {"acRate": 43.85727015613498, "difficulty": "Medium", "likes": 270, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "2456", "paidOnly": false, "title": "Most Popular Video Creator", "titleSlug": "most-popular-video-creator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22640, "totalSubmissionRaw": 51621}, "2457": {"acRate": 37.62526457751888, "difficulty": "Medium", "likes": 523, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2457", "paidOnly": false, "title": "Minimum Addition to Make Integer Beautiful", "titleSlug": "minimum-addition-to-make-integer-beautiful", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20087, "totalSubmissionRaw": 53387}, "2458": {"acRate": 40.98964540543887, "difficulty": "Hard", "likes": 841, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2458", "paidOnly": false, "title": "Height of Binary Tree After Subtree Removal Queries", "titleSlug": "height-of-binary-tree-after-subtree-removal-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26483, "totalSubmissionRaw": 64609}, "2459": {"acRate": 46.09414121181772, "difficulty": "Hard", "likes": 54, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2459", "paidOnly": true, "title": "Sort Array by Moving Items to Empty Space", "titleSlug": "sort-array-by-moving-items-to-empty-space", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1841, "totalSubmissionRaw": 3994}, "2460": {"acRate": 67.71307389864091, "difficulty": "Easy", "likes": 549, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2460", "paidOnly": false, "title": "Apply Operations to an Array", "titleSlug": "apply-operations-to-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65616, "totalSubmissionRaw": 96903}, "2461": {"acRate": 34.1606573872212, "difficulty": "Medium", "likes": 1307, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2461", "paidOnly": false, "title": "Maximum Sum of Distinct Subarrays With Length K", "titleSlug": "maximum-sum-of-distinct-subarrays-with-length-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61110, "totalSubmissionRaw": 178890}, "2462": {"acRate": 42.86819242250671, "difficulty": "Medium", "likes": 1888, "dislikes": 586, "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": 102533, "totalSubmissionRaw": 239182}, "2463": {"acRate": 40.89096064202989, "difficulty": "Hard", "likes": 465, "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": 8509, "totalSubmissionRaw": 20809}, "2464": {"acRate": 54.384328358208954, "difficulty": "Medium", "likes": 29, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2464", "paidOnly": true, "title": "Minimum Subarrays in a Valid Split", "titleSlug": "minimum-subarrays-in-a-valid-split", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1166, "totalSubmissionRaw": 2144}, "2465": {"acRate": 58.0756102606537, "difficulty": "Easy", "likes": 370, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2465", "paidOnly": false, "title": "Number of Distinct Averages", "titleSlug": "number-of-distinct-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44918, "totalSubmissionRaw": 77344}, "2466": {"acRate": 54.45169749605233, "difficulty": "Medium", "likes": 1703, "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": 77243, "totalSubmissionRaw": 141856}, "2467": {"acRate": 49.41853858100686, "difficulty": "Medium", "likes": 699, "dislikes": 68, "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": 13046, "totalSubmissionRaw": 26399}, "2468": {"acRate": 44.66838249851514, "difficulty": "Hard", "likes": 158, "dislikes": 167, "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": 11281, "totalSubmissionRaw": 25251}, "2469": {"acRate": 89.62938699110903, "difficulty": "Easy", "likes": 613, "dislikes": 336, "categoryTitle": "Algorithms", "frontendQuestionId": "2469", "paidOnly": false, "title": "Convert the Temperature", "titleSlug": "convert-the-temperature", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 191538, "totalSubmissionRaw": 213700}, "2470": {"acRate": 38.953528281164196, "difficulty": "Medium", "likes": 355, "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": 22699, "totalSubmissionRaw": 58272}, "2471": {"acRate": 62.02488973789926, "difficulty": "Medium", "likes": 640, "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": 22079, "totalSubmissionRaw": 35597}, "2472": {"acRate": 40.42191307879773, "difficulty": "Hard", "likes": 459, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2472", "paidOnly": false, "title": "Maximum Number of Non-overlapping Palindrome Substrings", "titleSlug": "maximum-number-of-non-overlapping-palindrome-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15923, "totalSubmissionRaw": 39392}, "2473": {"acRate": 67.75358354305723, "difficulty": "Medium", "likes": 110, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2473", "paidOnly": true, "title": "Minimum Cost to Buy Apples", "titleSlug": "minimum-cost-to-buy-apples", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6192, "totalSubmissionRaw": 9139}, "2474": {"acRate": 44.63596249310535, "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": 3237, "totalSubmissionRaw": 7252}, "2475": {"acRate": 71.5403576687015, "difficulty": "Easy", "likes": 402, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2475", "paidOnly": false, "title": "Number of Unequal Triplets in Array", "titleSlug": "number-of-unequal-triplets-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43244, "totalSubmissionRaw": 60447}, "2476": {"acRate": 41.55905760818005, "difficulty": "Medium", "likes": 441, "dislikes": 116, "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": 23655, "totalSubmissionRaw": 56919}, "2477": {"acRate": 64.46553556378028, "difficulty": "Medium", "likes": 2188, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2477", "paidOnly": false, "title": "Minimum Fuel Cost to Report to the Capital", "titleSlug": "minimum-fuel-cost-to-report-to-the-capital", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70368, "totalSubmissionRaw": 109156}, "2478": {"acRate": 31.061472695526522, "difficulty": "Hard", "likes": 346, "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": 10318, "totalSubmissionRaw": 33218}, "2479": {"acRate": 49.47916666666667, "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": 665, "totalSubmissionRaw": 1344}, "2480": {"acRate": 76.34640957446808, "difficulty": "Easy", "likes": 27, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2480", "paidOnly": true, "title": "Form a Chemical Bond", "titleSlug": "form-a-chemical-bond", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4593, "totalSubmissionRaw": 6016}, "2481": {"acRate": 53.440822166494875, "difficulty": "Easy", "likes": 221, "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": 34736, "totalSubmissionRaw": 64999}, "2482": {"acRate": 84.44552083817157, "difficulty": "Medium", "likes": 1172, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2482", "paidOnly": false, "title": "Difference Between Ones and Zeros in Row and Column", "titleSlug": "difference-between-ones-and-zeros-in-row-and-column", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127267, "totalSubmissionRaw": 150709}, "2483": {"acRate": 67.35110883380302, "difficulty": "Medium", "likes": 1926, "dislikes": 101, "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": 107784, "totalSubmissionRaw": 160033}, "2484": {"acRate": 38.27787832382013, "difficulty": "Hard", "likes": 495, "dislikes": 27, "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": 10998, "totalSubmissionRaw": 28732}, "2485": {"acRate": 83.91016548463357, "difficulty": "Easy", "likes": 1278, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2485", "paidOnly": false, "title": "Find the Pivot Integer", "titleSlug": "find-the-pivot-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230709, "totalSubmissionRaw": 274948}, "2486": {"acRate": 73.01735745967194, "difficulty": "Medium", "likes": 1096, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2486", "paidOnly": false, "title": "Append Characters to String to Make Subsequence", "titleSlug": "append-characters-to-string-to-make-subsequence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188165, "totalSubmissionRaw": 257699}, "2487": {"acRate": 74.3432490045139, "difficulty": "Medium", "likes": 2076, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2487", "paidOnly": false, "title": "Remove Nodes From Linked List", "titleSlug": "remove-nodes-from-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192862, "totalSubmissionRaw": 259421}, "2488": {"acRate": 44.399599971426525, "difficulty": "Hard", "likes": 570, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2488", "paidOnly": false, "title": "Count Subarrays With Median K", "titleSlug": "count-subarrays-with-median-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12431, "totalSubmissionRaw": 27998}, "2489": {"acRate": 58.13817330210773, "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": 993, "totalSubmissionRaw": 1708}, "2490": {"acRate": 62.749466258238186, "difficulty": "Easy", "likes": 364, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2490", "paidOnly": false, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40560, "totalSubmissionRaw": 64638}, "2491": {"acRate": 60.06207966890843, "difficulty": "Medium", "likes": 483, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2491", "paidOnly": false, "title": "Divide Players Into Teams of Equal Skill", "titleSlug": "divide-players-into-teams-of-equal-skill", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37152, "totalSubmissionRaw": 61856}, "2492": {"acRate": 57.42490294028012, "difficulty": "Medium", "likes": 1772, "dislikes": 303, "categoryTitle": "Algorithms", "frontendQuestionId": "2492", "paidOnly": false, "title": "Minimum Score of a Path Between Two Cities", "titleSlug": "minimum-score-of-a-path-between-two-cities", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86676, "totalSubmissionRaw": 150938}, "2493": {"acRate": 38.81259342301943, "difficulty": "Hard", "likes": 411, "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": 8309, "totalSubmissionRaw": 21408}, "2494": {"acRate": 31.53938151375363, "difficulty": "Hard", "likes": 47, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2494", "paidOnly": true, "title": "Merge Overlapping Events in the Same Hall", "titleSlug": "merge-overlapping-events-in-the-same-hall", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1846, "totalSubmissionRaw": 5853}, "2495": {"acRate": 64.07122905027933, "difficulty": "Medium", "likes": 45, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2495", "paidOnly": true, "title": "Number of Subarrays Having Even Product", "titleSlug": "number-of-subarrays-having-even-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1835, "totalSubmissionRaw": 2864}, "2496": {"acRate": 72.37115034439078, "difficulty": "Easy", "likes": 395, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2496", "paidOnly": false, "title": "Maximum Value of a String in an Array", "titleSlug": "maximum-value-of-a-string-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45706, "totalSubmissionRaw": 63155}, "2497": {"acRate": 39.50487277183174, "difficulty": "Medium", "likes": 396, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2497", "paidOnly": false, "title": "Maximum Star Sum of a Graph", "titleSlug": "maximum-star-sum-of-a-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20633, "totalSubmissionRaw": 52229}, "2498": {"acRate": 61.69864559819413, "difficulty": "Medium", "likes": 701, "dislikes": 104, "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": 21866, "totalSubmissionRaw": 35440}, "2499": {"acRate": 43.05385268320286, "difficulty": "Hard", "likes": 227, "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": 4565, "totalSubmissionRaw": 10603}, "2500": {"acRate": 78.29334883838511, "difficulty": "Easy", "likes": 636, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2500", "paidOnly": false, "title": "Delete Greatest Value in Each Row", "titleSlug": "delete-greatest-value-in-each-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61941, "totalSubmissionRaw": 79114}, "2501": {"acRate": 39.8550942488651, "difficulty": "Medium", "likes": 458, "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": 26514, "totalSubmissionRaw": 66526}, "2502": {"acRate": 53.2767433369843, "difficulty": "Medium", "likes": 287, "dislikes": 84, "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": 17511, "totalSubmissionRaw": 32868}, "2503": {"acRate": 37.608222968966196, "difficulty": "Hard", "likes": 470, "dislikes": 19, "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": 9513, "totalSubmissionRaw": 25295}, "2504": {"acRate": 75.81981360027615, "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": 4393, "totalSubmissionRaw": 5794}, "2505": {"acRate": 66.900790166813, "difficulty": "Medium", "likes": 53, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2505", "paidOnly": true, "title": "Bitwise OR of All Subsequence Sums", "titleSlug": "bitwise-or-of-all-subsequence-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3810, "totalSubmissionRaw": 5695}, "2506": {"acRate": 70.43171162394202, "difficulty": "Easy", "likes": 498, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2506", "paidOnly": false, "title": "Count Pairs Of Similar Strings", "titleSlug": "count-pairs-of-similar-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46268, "totalSubmissionRaw": 65692}, "2507": {"acRate": 48.64421930870083, "difficulty": "Medium", "likes": 388, "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": 22855, "totalSubmissionRaw": 46984}, "2508": {"acRate": 32.37040447858857, "difficulty": "Hard", "likes": 328, "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": 13357, "totalSubmissionRaw": 41263}, "2509": {"acRate": 56.41949152542372, "difficulty": "Hard", "likes": 349, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2509", "paidOnly": false, "title": "Cycle Length Queries in a Tree", "titleSlug": "cycle-length-queries-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13315, "totalSubmissionRaw": 23600}, "2510": {"acRate": 50.36398252883861, "difficulty": "Medium", "likes": 93, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2510", "paidOnly": true, "title": "Check if There is a Path With Equal Number of 0's And 1's", "titleSlug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4497, "totalSubmissionRaw": 8930}, "2511": {"acRate": 38.48775258787578, "difficulty": "Easy", "likes": 275, "dislikes": 275, "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": 24056, "totalSubmissionRaw": 62503}, "2512": {"acRate": 45.20272026336308, "difficulty": "Medium", "likes": 328, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2512", "paidOnly": false, "title": "Reward Top K Students", "titleSlug": "reward-top-k-students", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20871, "totalSubmissionRaw": 46172}, "2513": {"acRate": 30.532938564026647, "difficulty": "Medium", "likes": 477, "dislikes": 94, "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": 13200, "totalSubmissionRaw": 43232}, "2514": {"acRate": 33.52328551778345, "difficulty": "Hard", "likes": 412, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2514", "paidOnly": false, "title": "Count Anagrams", "titleSlug": "count-anagrams", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11942, "totalSubmissionRaw": 35623}, "2515": {"acRate": 49.448170681710096, "difficulty": "Easy", "likes": 345, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2515", "paidOnly": false, "title": "Shortest Distance to Target String in a Circular Array", "titleSlug": "shortest-distance-to-target-string-in-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30153, "totalSubmissionRaw": 60979}, "2516": {"acRate": 34.414492934072086, "difficulty": "Medium", "likes": 706, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2516", "paidOnly": false, "title": "Take K of Each Character From Left and Right", "titleSlug": "take-k-of-each-character-from-left-and-right", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16584, "totalSubmissionRaw": 48189}, "2517": {"acRate": 63.9104746936756, "difficulty": "Medium", "likes": 899, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "2517", "paidOnly": false, "title": "Maximum Tastiness of Candy Basket", "titleSlug": "maximum-tastiness-of-candy-basket", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21959, "totalSubmissionRaw": 34359}, "2518": {"acRate": 31.479126933672386, "difficulty": "Hard", "likes": 434, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2518", "paidOnly": false, "title": "Number of Great Partitions", "titleSlug": "number-of-great-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8913, "totalSubmissionRaw": 28314}, "2519": {"acRate": 53.58723249909322, "difficulty": "Hard", "likes": 102, "dislikes": 19, "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": 7387, "totalSubmissionRaw": 13785}, "2520": {"acRate": 84.71206116338337, "difficulty": "Easy", "likes": 503, "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": 87422, "totalSubmissionRaw": 103199}, "2521": {"acRate": 51.41477893569483, "difficulty": "Medium", "likes": 464, "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": 31526, "totalSubmissionRaw": 61317}, "2522": {"acRate": 46.30439442658092, "difficulty": "Medium", "likes": 370, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2522", "paidOnly": false, "title": "Partition String Into Substrings With Values at Most K", "titleSlug": "partition-string-into-substrings-with-values-at-most-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21601, "totalSubmissionRaw": 46650}, "2523": {"acRate": 37.56224049887848, "difficulty": "Medium", "likes": 363, "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": 23612, "totalSubmissionRaw": 62861}, "2524": {"acRate": 39.804171988080036, "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": 935, "totalSubmissionRaw": 2349}, "2525": {"acRate": 35.77063364153024, "difficulty": "Easy", "likes": 196, "dislikes": 57, "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": 33735, "totalSubmissionRaw": 94310}, "2526": {"acRate": 49.40687018609097, "difficulty": "Medium", "likes": 309, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2526", "paidOnly": false, "title": "Find Consecutive Integers from a Data Stream", "titleSlug": "find-consecutive-integers-from-a-data-stream", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26363, "totalSubmissionRaw": 53360}, "2527": {"acRate": 68.74165839635879, "difficulty": "Medium", "likes": 359, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2527", "paidOnly": false, "title": "Find Xor-Beauty of Array", "titleSlug": "find-xor-beauty-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20087, "totalSubmissionRaw": 29221}, "2528": {"acRate": 32.588035443735365, "difficulty": "Hard", "likes": 457, "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": 7098, "totalSubmissionRaw": 21781}, "2529": {"acRate": 70.99673832087731, "difficulty": "Easy", "likes": 902, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2529", "paidOnly": false, "title": "Maximum Count of Positive Integer and Negative Integer", "titleSlug": "maximum-count-of-positive-integer-and-negative-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 110576, "totalSubmissionRaw": 155748}, "2530": {"acRate": 46.05616802124406, "difficulty": "Medium", "likes": 389, "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": 28617, "totalSubmissionRaw": 62135}, "2531": {"acRate": 26.408680329119893, "difficulty": "Medium", "likes": 563, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2531", "paidOnly": false, "title": "Make Number of Distinct Characters Equal", "titleSlug": "make-number-of-distinct-characters-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19033, "totalSubmissionRaw": 72071}, "2532": {"acRate": 43.866210728788204, "difficulty": "Hard", "likes": 111, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "2532", "paidOnly": false, "title": "Time to Cross a Bridge", "titleSlug": "time-to-cross-a-bridge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4105, "totalSubmissionRaw": 9358}, "2533": {"acRate": 51.91369606003753, "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": 5534, "totalSubmissionRaw": 10660}, "2534": {"acRate": 49.484259879437374, "difficulty": "Hard", "likes": 82, "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": 7388, "totalSubmissionRaw": 14930}, "2535": {"acRate": 84.45600217625038, "difficulty": "Easy", "likes": 695, "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": 130395, "totalSubmissionRaw": 154394}, "2536": {"acRate": 49.79852487216344, "difficulty": "Medium", "likes": 460, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2536", "paidOnly": false, "title": "Increment Submatrices by One", "titleSlug": "increment-submatrices-by-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21133, "totalSubmissionRaw": 42437}, "2537": {"acRate": 51.082545622433365, "difficulty": "Medium", "likes": 848, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2537", "paidOnly": false, "title": "Count the Number of Good Subarrays", "titleSlug": "count-the-number-of-good-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21022, "totalSubmissionRaw": 41153}, "2538": {"acRate": 32.07050992316226, "difficulty": "Hard", "likes": 431, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2538", "paidOnly": false, "title": "Difference Between Maximum and Minimum Price Sum", "titleSlug": "difference-between-maximum-and-minimum-price-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7805, "totalSubmissionRaw": 24337}, "2539": {"acRate": 52.758298270219726, "difficulty": "Medium", "likes": 28, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2539", "paidOnly": true, "title": "Count the Number of Good Subsequences", "titleSlug": "count-the-number-of-good-subsequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2257, "totalSubmissionRaw": 4278}, "2540": {"acRate": 58.75325399776868, "difficulty": "Easy", "likes": 1115, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2540", "paidOnly": false, "title": "Minimum Common Value", "titleSlug": "minimum-common-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 240141, "totalSubmissionRaw": 408728}, "2541": {"acRate": 31.575616068414536, "difficulty": "Medium", "likes": 413, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2541", "paidOnly": false, "title": "Minimum Operations to Make Array Equal II", "titleSlug": "minimum-operations-to-make-array-equal-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22449, "totalSubmissionRaw": 71096}, "2542": {"acRate": 53.777920212431106, "difficulty": "Medium", "likes": 2740, "dislikes": 163, "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": 93971, "totalSubmissionRaw": 174739}, "2543": {"acRate": 42.55874673629243, "difficulty": "Hard", "likes": 244, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2543", "paidOnly": false, "title": "Check if Point Is Reachable", "titleSlug": "check-if-point-is-reachable", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7987, "totalSubmissionRaw": 18767}, "2544": {"acRate": 68.24830694834961, "difficulty": "Easy", "likes": 392, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2544", "paidOnly": false, "title": "Alternating Digit Sum", "titleSlug": "alternating-digit-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62381, "totalSubmissionRaw": 91403}, "2545": {"acRate": 85.5278406995733, "difficulty": "Medium", "likes": 660, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2545", "paidOnly": false, "title": "Sort the Students by Their Kth Score", "titleSlug": "sort-the-students-by-their-kth-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64943, "totalSubmissionRaw": 75932}, "2546": {"acRate": 41.1652670764436, "difficulty": "Medium", "likes": 250, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2546", "paidOnly": false, "title": "Apply Bitwise Operations to Make Strings Equal", "titleSlug": "apply-bitwise-operations-to-make-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19020, "totalSubmissionRaw": 46204}, "2547": {"acRate": 40.673583717307, "difficulty": "Hard", "likes": 430, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2547", "paidOnly": false, "title": "Minimum Cost to Split an Array", "titleSlug": "minimum-cost-to-split-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12270, "totalSubmissionRaw": 30167}, "2548": {"acRate": 65.78947368421053, "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": 1350, "totalSubmissionRaw": 2052}, "2549": {"acRate": 60.388673910870594, "difficulty": "Easy", "likes": 263, "dislikes": 266, "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": 42292, "totalSubmissionRaw": 70033}, "2550": {"acRate": 27.68159014069146, "difficulty": "Medium", "likes": 239, "dislikes": 514, "categoryTitle": "Algorithms", "frontendQuestionId": "2550", "paidOnly": false, "title": "Count Collisions of Monkeys on a Polygon", "titleSlug": "count-collisions-of-monkeys-on-a-polygon", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20304, "totalSubmissionRaw": 73349}, "2551": {"acRate": 66.56756541252321, "difficulty": "Hard", "likes": 2037, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2551", "paidOnly": false, "title": "Put Marbles in Bags", "titleSlug": "put-marbles-in-bags", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58439, "totalSubmissionRaw": 87789}, "2552": {"acRate": 33.419866594555614, "difficulty": "Hard", "likes": 374, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2552", "paidOnly": false, "title": "Count Increasing Quadruplets", "titleSlug": "count-increasing-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9269, "totalSubmissionRaw": 27735}, "2553": {"acRate": 79.46312195016858, "difficulty": "Easy", "likes": 485, "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": 73768, "totalSubmissionRaw": 92833}, "2554": {"acRate": 54.11529719677664, "difficulty": "Medium", "likes": 332, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2554", "paidOnly": false, "title": "Maximum Number of Integers to Choose From a Range I", "titleSlug": "maximum-number-of-integers-to-choose-from-a-range-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31428, "totalSubmissionRaw": 58076}, "2555": {"acRate": 33.29916720051249, "difficulty": "Medium", "likes": 544, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2555", "paidOnly": false, "title": "Maximize Win From Two Segments", "titleSlug": "maximize-win-from-two-segments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10396, "totalSubmissionRaw": 31220}, "2556": {"acRate": 27.278734481377654, "difficulty": "Medium", "likes": 572, "dislikes": 27, "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": 13623, "totalSubmissionRaw": 49940}, "2557": {"acRate": 40.39836567926455, "difficulty": "Medium", "likes": 33, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2557", "paidOnly": true, "title": "Maximum Number of Integers to Choose From a Range II", "titleSlug": "maximum-number-of-integers-to-choose-from-a-range-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1582, "totalSubmissionRaw": 3916}, "2558": {"acRate": 66.97697003329634, "difficulty": "Easy", "likes": 379, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2558", "paidOnly": false, "title": "Take Gifts From the Richest Pile", "titleSlug": "take-gifts-from-the-richest-pile", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48277, "totalSubmissionRaw": 72080}, "2559": {"acRate": 52.25594446905922, "difficulty": "Medium", "likes": 443, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2559", "paidOnly": false, "title": "Count Vowel Strings in Ranges", "titleSlug": "count-vowel-strings-in-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28306, "totalSubmissionRaw": 54168}, "2560": {"acRate": 43.67964778503995, "difficulty": "Medium", "likes": 907, "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": 19247, "totalSubmissionRaw": 44064}, "2561": {"acRate": 34.09713315076091, "difficulty": "Hard", "likes": 378, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2561", "paidOnly": false, "title": "Rearranging Fruits", "titleSlug": "rearranging-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9836, "totalSubmissionRaw": 28847}, "2562": {"acRate": 69.89636430200794, "difficulty": "Easy", "likes": 355, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2562", "paidOnly": false, "title": "Find the Array Concatenation Value", "titleSlug": "find-the-array-concatenation-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49639, "totalSubmissionRaw": 71018}, "2563": {"acRate": 32.98057705119663, "difficulty": "Medium", "likes": 798, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2563", "paidOnly": false, "title": "Count the Number of Fair Pairs", "titleSlug": "count-the-number-of-fair-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25742, "totalSubmissionRaw": 78052}, "2564": {"acRate": 33.58591901305469, "difficulty": "Medium", "likes": 368, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2564", "paidOnly": false, "title": "Substring XOR Queries", "titleSlug": "substring-xor-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12632, "totalSubmissionRaw": 37611}, "2565": {"acRate": 31.62936514848036, "difficulty": "Hard", "likes": 375, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2565", "paidOnly": false, "title": "Subsequence With the Minimum Score", "titleSlug": "subsequence-with-the-minimum-score", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7264, "totalSubmissionRaw": 22966}, "2566": {"acRate": 59.91084485117223, "difficulty": "Easy", "likes": 227, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2566", "paidOnly": false, "title": "Maximum Difference by Remapping a Digit", "titleSlug": "maximum-difference-by-remapping-a-digit", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25401, "totalSubmissionRaw": 42398}, "2567": {"acRate": 47.959840031322535, "difficulty": "Medium", "likes": 239, "dislikes": 222, "categoryTitle": "Algorithms", "frontendQuestionId": "2567", "paidOnly": false, "title": "Minimum Score by Changing Two Elements", "titleSlug": "minimum-score-by-changing-two-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17149, "totalSubmissionRaw": 35757}, "2568": {"acRate": 57.6216932190294, "difficulty": "Medium", "likes": 350, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2568", "paidOnly": false, "title": "Minimum Impossible OR", "titleSlug": "minimum-impossible-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15661, "totalSubmissionRaw": 27179}, "2569": {"acRate": 28.30584707646177, "difficulty": "Hard", "likes": 175, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2569", "paidOnly": false, "title": "Handling Sum Queries After Update", "titleSlug": "handling-sum-queries-after-update", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5664, "totalSubmissionRaw": 20010}, "2570": {"acRate": 73.6953371409087, "difficulty": "Easy", "likes": 333, "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": 43226, "totalSubmissionRaw": 58655}, "2571": {"acRate": 55.364108001666224, "difficulty": "Medium", "likes": 532, "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": 29240, "totalSubmissionRaw": 52814}, "2572": {"acRate": 23.155702975570783, "difficulty": "Medium", "likes": 457, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "2572", "paidOnly": false, "title": "Count the Number of Square-Free Subsets", "titleSlug": "count-the-number-of-square-free-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9564, "totalSubmissionRaw": 41303}, "2573": {"acRate": 31.377583771986135, "difficulty": "Hard", "likes": 186, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2573", "paidOnly": false, "title": "Find the String with LCP", "titleSlug": "find-the-string-with-lcp", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4888, "totalSubmissionRaw": 15578}, "2574": {"acRate": 86.83133063611163, "difficulty": "Easy", "likes": 1047, "dislikes": 98, "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": 143150, "totalSubmissionRaw": 164860}, "2575": {"acRate": 32.917376342590984, "difficulty": "Medium", "likes": 525, "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": 28410, "totalSubmissionRaw": 86307}, "2576": {"acRate": 38.687774175090595, "difficulty": "Medium", "likes": 555, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2576", "paidOnly": false, "title": "Find the Maximum Number of Marked Indices", "titleSlug": "find-the-maximum-number-of-marked-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20284, "totalSubmissionRaw": 52430}, "2577": {"acRate": 35.62354787121692, "difficulty": "Hard", "likes": 541, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2577", "paidOnly": false, "title": "Minimum Time to Visit a Cell In a Grid", "titleSlug": "minimum-time-to-visit-a-cell-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11806, "totalSubmissionRaw": 33141}, "2578": {"acRate": 70.83569432775163, "difficulty": "Easy", "likes": 369, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2578", "paidOnly": false, "title": "Split With Minimum Sum", "titleSlug": "split-with-minimum-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36253, "totalSubmissionRaw": 51179}, "2579": {"acRate": 57.76364947237334, "difficulty": "Medium", "likes": 290, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2579", "paidOnly": false, "title": "Count Total Number of Colored Cells", "titleSlug": "count-total-number-of-colored-cells", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26439, "totalSubmissionRaw": 45771}, "2580": {"acRate": 36.25083836351442, "difficulty": "Medium", "likes": 313, "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": 16215, "totalSubmissionRaw": 44730}, "2581": {"acRate": 45.78196940442596, "difficulty": "Hard", "likes": 297, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2581", "paidOnly": false, "title": "Count Number of Possible Root Nodes", "titleSlug": "count-number-of-possible-root-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6165, "totalSubmissionRaw": 13466}, "2582": {"acRate": 56.98145650298324, "difficulty": "Easy", "likes": 1004, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2582", "paidOnly": false, "title": "Pass the Pillow", "titleSlug": "pass-the-pillow", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187567, "totalSubmissionRaw": 329172}, "2583": {"acRate": 47.68122413023278, "difficulty": "Medium", "likes": 551, "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": 39512, "totalSubmissionRaw": 82867}, "2584": {"acRate": 23.107218434046555, "difficulty": "Hard", "likes": 303, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "2584", "paidOnly": false, "title": "Split the Array to Make Coprime Products", "titleSlug": "split-the-array-to-make-coprime-products", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11793, "totalSubmissionRaw": 51036}, "2585": {"acRate": 57.476651500119736, "difficulty": "Hard", "likes": 470, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2585", "paidOnly": false, "title": "Number of Ways to Earn Points", "titleSlug": "number-of-ways-to-earn-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16801, "totalSubmissionRaw": 29231}, "2586": {"acRate": 74.15785620852284, "difficulty": "Easy", "likes": 338, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2586", "paidOnly": false, "title": "Count the Number of Vowel Strings in Range", "titleSlug": "count-the-number-of-vowel-strings-in-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61795, "totalSubmissionRaw": 83329}, "2587": {"acRate": 41.089101941405865, "difficulty": "Medium", "likes": 288, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2587", "paidOnly": false, "title": "Rearrange Array to Maximize Prefix Score", "titleSlug": "rearrange-array-to-maximize-prefix-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29186, "totalSubmissionRaw": 71031}, "2588": {"acRate": 50.60842258733808, "difficulty": "Medium", "likes": 498, "dislikes": 21, "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": 18050, "totalSubmissionRaw": 35666}, "2589": {"acRate": 39.35181410517733, "difficulty": "Hard", "likes": 424, "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": 9653, "totalSubmissionRaw": 24530}, "2590": {"acRate": 58.849557522123895, "difficulty": "Medium", "likes": 38, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2590", "paidOnly": true, "title": "Design a Todo List", "titleSlug": "design-a-todo-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1995, "totalSubmissionRaw": 3390}, "2591": {"acRate": 19.166280399246006, "difficulty": "Easy", "likes": 296, "dislikes": 832, "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": 31012, "totalSubmissionRaw": 161805}, "2592": {"acRate": 58.00902827274888, "difficulty": "Medium", "likes": 435, "dislikes": 15, "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": 24416, "totalSubmissionRaw": 42090}, "2593": {"acRate": 52.640716886026325, "difficulty": "Medium", "likes": 362, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2593", "paidOnly": false, "title": "Find Score of an Array After Marking All Elements", "titleSlug": "find-score-of-an-array-after-marking-all-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18798, "totalSubmissionRaw": 35710}, "2594": {"acRate": 44.77298596180599, "difficulty": "Medium", "likes": 577, "dislikes": 28, "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": 17701, "totalSubmissionRaw": 39535}, "2595": {"acRate": 73.39433836002304, "difficulty": "Easy", "likes": 319, "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": 47161, "totalSubmissionRaw": 64257}, "2596": {"acRate": 57.03417556860736, "difficulty": "Medium", "likes": 387, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2596", "paidOnly": false, "title": "Check Knight Tour Configuration", "titleSlug": "check-knight-tour-configuration", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28938, "totalSubmissionRaw": 50738}, "2597": {"acRate": 51.162418257039896, "difficulty": "Medium", "likes": 1189, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "2597", "paidOnly": false, "title": "The Number of Beautiful Subsets", "titleSlug": "the-number-of-beautiful-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115007, "totalSubmissionRaw": 224789}, "2598": {"acRate": 39.298298983446145, "difficulty": "Medium", "likes": 346, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2598", "paidOnly": false, "title": "Smallest Missing Non-negative Integer After Operations", "titleSlug": "smallest-missing-non-negative-integer-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15502, "totalSubmissionRaw": 39447}, "2599": {"acRate": 51.10807113543092, "difficulty": "Medium", "likes": 45, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2599", "paidOnly": true, "title": "Make the Prefix Sum Non-negative", "titleSlug": "make-the-prefix-sum-non-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1868, "totalSubmissionRaw": 3655}, "2600": {"acRate": 61.823314513450676, "difficulty": "Easy", "likes": 278, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2600", "paidOnly": false, "title": "K Items With the Maximum Sum", "titleSlug": "k-items-with-the-maximum-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40953, "totalSubmissionRaw": 66242}, "2601": {"acRate": 37.829324813823206, "difficulty": "Medium", "likes": 378, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2601", "paidOnly": false, "title": "Prime Subtraction Operation", "titleSlug": "prime-subtraction-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16814, "totalSubmissionRaw": 44447}, "2602": {"acRate": 35.60032629522129, "difficulty": "Medium", "likes": 707, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2602", "paidOnly": false, "title": "Minimum Operations to Make All Array Elements Equal", "titleSlug": "minimum-operations-to-make-all-array-elements-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18766, "totalSubmissionRaw": 52713}, "2603": {"acRate": 37.34061027040437, "difficulty": "Hard", "likes": 431, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2603", "paidOnly": false, "title": "Collect Coins in a Tree", "titleSlug": "collect-coins-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7526, "totalSubmissionRaw": 20155}, "2604": {"acRate": 41.0688140556369, "difficulty": "Hard", "likes": 40, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2604", "paidOnly": true, "title": "Minimum Time to Eat All Grains", "titleSlug": "minimum-time-to-eat-all-grains", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1122, "totalSubmissionRaw": 2732}, "2605": {"acRate": 54.069867492686285, "difficulty": "Easy", "likes": 295, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2605", "paidOnly": false, "title": "Form Smallest Number From Two Digit Arrays", "titleSlug": "form-smallest-number-from-two-digit-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37704, "totalSubmissionRaw": 69732}, "2606": {"acRate": 56.8735632183908, "difficulty": "Medium", "likes": 357, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2606", "paidOnly": false, "title": "Find the Substring With Maximum Cost", "titleSlug": "find-the-substring-with-maximum-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24740, "totalSubmissionRaw": 43500}, "2607": {"acRate": 36.94377736968498, "difficulty": "Medium", "likes": 459, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2607", "paidOnly": false, "title": "Make K-Subarray Sums Equal", "titleSlug": "make-k-subarray-sums-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10461, "totalSubmissionRaw": 28316}, "2608": {"acRate": 36.48872441782012, "difficulty": "Hard", "likes": 505, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2608", "paidOnly": false, "title": "Shortest Cycle in a Graph", "titleSlug": "shortest-cycle-in-a-graph", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17847, "totalSubmissionRaw": 48911}, "2609": {"acRate": 46.45244482651292, "difficulty": "Easy", "likes": 363, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2609", "paidOnly": false, "title": "Find the Longest Balanced Substring of a Binary String", "titleSlug": "find-the-longest-balanced-substring-of-a-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31341, "totalSubmissionRaw": 67469}, "2610": {"acRate": 87.18051904309904, "difficulty": "Medium", "likes": 1601, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2610", "paidOnly": false, "title": "Convert an Array Into a 2D Array With Conditions", "titleSlug": "convert-an-array-into-a-2d-array-with-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199305, "totalSubmissionRaw": 228612}, "2611": {"acRate": 45.94997745169459, "difficulty": "Medium", "likes": 614, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2611", "paidOnly": false, "title": "Mice and Cheese", "titleSlug": "mice-and-cheese", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26492, "totalSubmissionRaw": 57654}, "2612": {"acRate": 16.57043687214231, "difficulty": "Hard", "likes": 240, "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": 4965, "totalSubmissionRaw": 29963}, "2613": {"acRate": 43.152866242038215, "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": 542, "totalSubmissionRaw": 1256}, "2614": {"acRate": 34.06867989118807, "difficulty": "Easy", "likes": 344, "dislikes": 39, "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": 44585, "totalSubmissionRaw": 130868}, "2615": {"acRate": 31.09263073754112, "difficulty": "Medium", "likes": 729, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "2615", "paidOnly": false, "title": "Sum of Distances", "titleSlug": "sum-of-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20227, "totalSubmissionRaw": 65054}, "2616": {"acRate": 43.918792734720924, "difficulty": "Medium", "likes": 2308, "dislikes": 246, "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": 72903, "totalSubmissionRaw": 165995}, "2617": {"acRate": 24.91846426732277, "difficulty": "Hard", "likes": 377, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2617", "paidOnly": false, "title": "Minimum Number of Visited Cells in a Grid", "titleSlug": "minimum-number-of-visited-cells-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8710, "totalSubmissionRaw": 34954}, "2618": {"acRate": 27.617324222005283, "difficulty": "Medium", "likes": 265, "dislikes": 99, "categoryTitle": "JavaScript", "frontendQuestionId": "2618", "paidOnly": false, "title": "Check if Object Instance of Class", "titleSlug": "check-if-object-instance-of-class", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23198, "totalSubmissionRaw": 83998}, "2619": {"acRate": 73.49872117265244, "difficulty": "Easy", "likes": 498, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2619", "paidOnly": false, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136787, "totalSubmissionRaw": 186108}, "2620": {"acRate": 81.11094553928812, "difficulty": "Easy", "likes": 1259, "dislikes": 103, "categoryTitle": "JavaScript", "frontendQuestionId": "2620", "paidOnly": false, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 391903, "totalSubmissionRaw": 483170}, "2621": {"acRate": 86.90251028935876, "difficulty": "Easy", "likes": 583, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2621", "paidOnly": false, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138301, "totalSubmissionRaw": 159145}, "2622": {"acRate": 74.32452754524036, "difficulty": "Medium", "likes": 424, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2622", "paidOnly": false, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44481, "totalSubmissionRaw": 59847}, "2623": {"acRate": 62.56816717069059, "difficulty": "Medium", "likes": 589, "dislikes": 83, "categoryTitle": "JavaScript", "frontendQuestionId": "2623", "paidOnly": false, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100965, "totalSubmissionRaw": 161368}, "2624": {"acRate": 65.40567446490792, "difficulty": "Medium", "likes": 99, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2624", "paidOnly": false, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10512, "totalSubmissionRaw": 16072}, "2625": {"acRate": 63.54074318943367, "difficulty": "Medium", "likes": 332, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2625", "paidOnly": false, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42287, "totalSubmissionRaw": 66551}, "2626": {"acRate": 84.69889476417045, "difficulty": "Easy", "likes": 579, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2626", "paidOnly": false, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159855, "totalSubmissionRaw": 188734}, "2627": {"acRate": 90.84527084716821, "difficulty": "Medium", "likes": 392, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2627", "paidOnly": false, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47880, "totalSubmissionRaw": 52705}, "2628": {"acRate": 38.7236393774749, "difficulty": "Medium", "likes": 213, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2628", "paidOnly": true, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12615, "totalSubmissionRaw": 32577}, "2629": {"acRate": 86.20705110965974, "difficulty": "Easy", "likes": 654, "dislikes": 48, "categoryTitle": "JavaScript", "frontendQuestionId": "2629", "paidOnly": false, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134633, "totalSubmissionRaw": 156174}, "2630": {"acRate": 30.871698995092313, "difficulty": "Hard", "likes": 116, "dislikes": 41, "categoryTitle": "JavaScript", "frontendQuestionId": "2630", "paidOnly": false, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5284, "totalSubmissionRaw": 17116}, "2631": {"acRate": 80.7959426981814, "difficulty": "Medium", "likes": 301, "dislikes": 17, "categoryTitle": "JavaScript", "frontendQuestionId": "2631", "paidOnly": false, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42695, "totalSubmissionRaw": 52843}, "2632": {"acRate": 89.42855592337331, "difficulty": "Medium", "likes": 342, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2632", "paidOnly": true, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16479, "totalSubmissionRaw": 18427}, "2633": {"acRate": 77.55614266842801, "difficulty": "Medium", "likes": 203, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2633", "paidOnly": true, "title": "Convert Object to JSON String", "titleSlug": "convert-object-to-json-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11742, "totalSubmissionRaw": 15140}, "2634": {"acRate": 84.71988351591752, "difficulty": "Easy", "likes": 627, "dislikes": 76, "categoryTitle": "JavaScript", "frontendQuestionId": "2634", "paidOnly": false, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 171061, "totalSubmissionRaw": 201914}, "2635": {"acRate": 85.74367938528209, "difficulty": "Easy", "likes": 722, "dislikes": 70, "categoryTitle": "JavaScript", "frontendQuestionId": "2635", "paidOnly": false, "title": "Apply Transform Over Each Element in Array", "titleSlug": "apply-transform-over-each-element-in-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188360, "totalSubmissionRaw": 219678}, "2636": {"acRate": 79.97169143665958, "difficulty": "Medium", "likes": 285, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2636", "paidOnly": true, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12430, "totalSubmissionRaw": 15543}, "2637": {"acRate": 81.65321971413894, "difficulty": "Medium", "likes": 475, "dislikes": 69, "categoryTitle": "JavaScript", "frontendQuestionId": "2637", "paidOnly": false, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54043, "totalSubmissionRaw": 66186}, "2638": {"acRate": 47.03875545851528, "difficulty": "Medium", "likes": 81, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2638", "paidOnly": true, "title": "Count the Number of K-Free Subsets", "titleSlug": "count-the-number-of-k-free-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3447, "totalSubmissionRaw": 7328}, "2639": {"acRate": 67.71248178727538, "difficulty": "Easy", "likes": 167, "dislikes": 43, "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": 27884, "totalSubmissionRaw": 41180}, "2640": {"acRate": 70.69975232054814, "difficulty": "Medium", "likes": 288, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2640", "paidOnly": false, "title": "Find the Score of All Prefixes of an Array", "titleSlug": "find-the-score-of-all-prefixes-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30543, "totalSubmissionRaw": 43201}, "2641": {"acRate": 67.67069564099268, "difficulty": "Medium", "likes": 579, "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": 21051, "totalSubmissionRaw": 31108}, "2642": {"acRate": 70.60987718839822, "difficulty": "Hard", "likes": 805, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2642", "paidOnly": false, "title": "Design Graph With Shortest Path Calculator", "titleSlug": "design-graph-with-shortest-path-calculator", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67556, "totalSubmissionRaw": 95675}, "2643": {"acRate": 75.36314103700552, "difficulty": "Easy", "likes": 447, "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": 63763, "totalSubmissionRaw": 84608}, "2644": {"acRate": 49.327060876067044, "difficulty": "Easy", "likes": 231, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2644", "paidOnly": false, "title": "Find the Maximum Divisibility Score", "titleSlug": "find-the-maximum-divisibility-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31666, "totalSubmissionRaw": 64196}, "2645": {"acRate": 50.565704795515884, "difficulty": "Medium", "likes": 539, "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": 29229, "totalSubmissionRaw": 57804}, "2646": {"acRate": 45.688909132316105, "difficulty": "Hard", "likes": 472, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2646", "paidOnly": false, "title": "Minimize the Total Price of the Trips", "titleSlug": "minimize-the-total-price-of-the-trips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10031, "totalSubmissionRaw": 21955}, "2647": {"acRate": 66.38297872340425, "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": 312, "totalSubmissionRaw": 470}, "2648": {"acRate": 83.11073443025396, "difficulty": "Easy", "likes": 244, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2648", "paidOnly": false, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28438, "totalSubmissionRaw": 34217}, "2649": {"acRate": 79.05310300703775, "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": 12356, "totalSubmissionRaw": 15630}, "2650": {"acRate": 51.95668225449176, "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": 2111, "totalSubmissionRaw": 4063}, "2651": {"acRate": 78.50176385142146, "difficulty": "Easy", "likes": 227, "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": 56745, "totalSubmissionRaw": 72285}, "2652": {"acRate": 85.6159892623248, "difficulty": "Easy", "likes": 487, "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": 110990, "totalSubmissionRaw": 129637}, "2653": {"acRate": 33.35149689082634, "difficulty": "Medium", "likes": 617, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2653", "paidOnly": false, "title": "Sliding Subarray Beauty", "titleSlug": "sliding-subarray-beauty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20810, "totalSubmissionRaw": 62396}, "2654": {"acRate": 35.31169585788993, "difficulty": "Medium", "likes": 380, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2654", "paidOnly": false, "title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "titleSlug": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12762, "totalSubmissionRaw": 36141}, "2655": {"acRate": 52.13365539452496, "difficulty": "Medium", "likes": 26, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2655", "paidOnly": true, "title": "Find Maximal Uncovered Ranges", "titleSlug": "find-maximal-uncovered-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1295, "totalSubmissionRaw": 2484}, "2656": {"acRate": 82.27790584271655, "difficulty": "Easy", "likes": 368, "dislikes": 48, "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": 74240, "totalSubmissionRaw": 90231}, "2657": {"acRate": 81.42250530785563, "difficulty": "Medium", "likes": 476, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2657", "paidOnly": false, "title": "Find the Prefix Common Array of Two Arrays", "titleSlug": "find-the-prefix-common-array-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42952, "totalSubmissionRaw": 52752}, "2658": {"acRate": 59.97579180956224, "difficulty": "Medium", "likes": 432, "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": 26757, "totalSubmissionRaw": 44613}, "2659": {"acRate": 25.51946083346937, "difficulty": "Hard", "likes": 537, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2659", "paidOnly": false, "title": "Make Array Empty", "titleSlug": "make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10943, "totalSubmissionRaw": 42881}, "2660": {"acRate": 34.13074232718984, "difficulty": "Easy", "likes": 272, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "2660", "paidOnly": false, "title": "Determine the Winner of a Bowling Game", "titleSlug": "determine-the-winner-of-a-bowling-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34741, "totalSubmissionRaw": 101788}, "2661": {"acRate": 50.549543635247026, "difficulty": "Medium", "likes": 428, "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": 23870, "totalSubmissionRaw": 47221}, "2662": {"acRate": 39.1191557101586, "difficulty": "Medium", "likes": 607, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2662", "paidOnly": false, "title": "Minimum Cost of a Path With Special Roads", "titleSlug": "minimum-cost-of-a-path-with-special-roads", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13270, "totalSubmissionRaw": 33922}, "2663": {"acRate": 37.56476683937824, "difficulty": "Hard", "likes": 191, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2663", "paidOnly": false, "title": "Lexicographically Smallest Beautiful String", "titleSlug": "lexicographically-smallest-beautiful-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5220, "totalSubmissionRaw": 13896}, "2664": {"acRate": 66.5129151291513, "difficulty": "Medium", "likes": 35, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2664", "paidOnly": true, "title": "The Knight\u2019s Tour", "titleSlug": "the-knights-tour", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1442, "totalSubmissionRaw": 2168}, "2665": {"acRate": 80.12801895888757, "difficulty": "Easy", "likes": 717, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2665", "paidOnly": false, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 206926, "totalSubmissionRaw": 258244}, "2666": {"acRate": 86.18477469460399, "difficulty": "Easy", "likes": 469, "dislikes": 54, "categoryTitle": "JavaScript", "frontendQuestionId": "2666", "paidOnly": false, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 106533, "totalSubmissionRaw": 123610}, "2667": {"acRate": 81.2960628970624, "difficulty": "Easy", "likes": 1260, "dislikes": 173, "categoryTitle": "JavaScript", "frontendQuestionId": "2667", "paidOnly": false, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 444422, "totalSubmissionRaw": 546671}, "2668": {"acRate": 71.91364082433759, "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": 3664, "totalSubmissionRaw": 5095}, "2669": {"acRate": 72.25358228397742, "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": 3328, "totalSubmissionRaw": 4606}, "2670": {"acRate": 77.74930429037619, "difficulty": "Easy", "likes": 329, "dislikes": 31, "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": 38835, "totalSubmissionRaw": 49949}, "2671": {"acRate": 29.893753806591324, "difficulty": "Medium", "likes": 321, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2671", "paidOnly": false, "title": "Frequency Tracker", "titleSlug": "frequency-tracker", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22087, "totalSubmissionRaw": 73885}, "2672": {"acRate": 54.78806907378336, "difficulty": "Medium", "likes": 345, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2672", "paidOnly": false, "title": "Number of Adjacent Elements With the Same Color", "titleSlug": "number-of-adjacent-elements-with-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15705, "totalSubmissionRaw": 28665}, "2673": {"acRate": 59.11859548548907, "difficulty": "Medium", "likes": 593, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2673", "paidOnly": false, "title": "Make Costs of Paths Equal in a Binary Tree", "titleSlug": "make-costs-of-paths-equal-in-a-binary-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16500, "totalSubmissionRaw": 27910}, "2674": {"acRate": 74.18367346938776, "difficulty": "Medium", "likes": 39, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2674", "paidOnly": true, "title": "Split a Circular Linked List", "titleSlug": "split-a-circular-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1454, "totalSubmissionRaw": 1960}, "2675": {"acRate": 69.13667372382969, "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": 5878, "totalSubmissionRaw": 8502}, "2676": {"acRate": 82.83044058744994, "difficulty": "Medium", "likes": 162, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2676", "paidOnly": true, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9306, "totalSubmissionRaw": 11235}, "2677": {"acRate": 83.3703270242275, "difficulty": "Easy", "likes": 333, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2677", "paidOnly": false, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61974, "totalSubmissionRaw": 74336}, "2678": {"acRate": 81.88749495239855, "difficulty": "Easy", "likes": 688, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2678", "paidOnly": false, "title": "Number of Senior Citizens", "titleSlug": "number-of-senior-citizens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239287, "totalSubmissionRaw": 292213}, "2679": {"acRate": 60.05588037460547, "difficulty": "Medium", "likes": 346, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2679", "paidOnly": false, "title": "Sum in a Matrix", "titleSlug": "sum-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34821, "totalSubmissionRaw": 57981}, "2680": {"acRate": 40.89700407729126, "difficulty": "Medium", "likes": 388, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2680", "paidOnly": false, "title": "Maximum OR", "titleSlug": "maximum-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13842, "totalSubmissionRaw": 33846}, "2681": {"acRate": 30.801301606670734, "difficulty": "Hard", "likes": 313, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2681", "paidOnly": false, "title": "Power of Heroes", "titleSlug": "power-of-heroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9087, "totalSubmissionRaw": 29502}, "2682": {"acRate": 49.08193976954996, "difficulty": "Easy", "likes": 247, "dislikes": 37, "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": 27560, "totalSubmissionRaw": 56151}, "2683": {"acRate": 61.946284340851285, "difficulty": "Medium", "likes": 270, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2683", "paidOnly": false, "title": "Neighboring Bitwise XOR", "titleSlug": "neighboring-bitwise-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22165, "totalSubmissionRaw": 35781}, "2684": {"acRate": 45.93734008074146, "difficulty": "Medium", "likes": 431, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2684", "paidOnly": false, "title": "Maximum Number of Moves in a Grid", "titleSlug": "maximum-number-of-moves-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24237, "totalSubmissionRaw": 52761}, "2685": {"acRate": 65.86360097100719, "difficulty": "Medium", "likes": 658, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2685", "paidOnly": false, "title": "Count the Number of Complete Components", "titleSlug": "count-the-number-of-complete-components", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28760, "totalSubmissionRaw": 43666}, "2686": {"acRate": 67.26215205650186, "difficulty": "Medium", "likes": 14, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2686", "paidOnly": true, "title": "Immediate Food Delivery III", "titleSlug": "immediate-food-delivery-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3238, "totalSubmissionRaw": 4814}, "2687": {"acRate": 80.23255813953489, "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": 3519, "totalSubmissionRaw": 4386}, "2688": {"acRate": 42.20207594271449, "difficulty": "Medium", "likes": 20, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2688", "paidOnly": true, "title": "Find Active Users", "titleSlug": "find-active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3212, "totalSubmissionRaw": 7611}, "2689": {"acRate": 74.10907127429806, "difficulty": "Easy", "likes": 34, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2689", "paidOnly": true, "title": "Extract Kth Character From The Rope Tree", "titleSlug": "extract-kth-character-from-the-rope-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2745, "totalSubmissionRaw": 3704}, "2690": {"acRate": 92.93313069908815, "difficulty": "Easy", "likes": 27, "dislikes": 6, "categoryTitle": "JavaScript", "frontendQuestionId": "2690", "paidOnly": true, "title": "Infinite Method Object", "titleSlug": "infinite-method-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1223, "totalSubmissionRaw": 1316}, "2691": {"acRate": 37.8, "difficulty": "Hard", "likes": 11, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2691", "paidOnly": true, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 189, "totalSubmissionRaw": 500}, "2692": {"acRate": 62.824675324675326, "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": 387, "totalSubmissionRaw": 616}, "2693": {"acRate": 79.97953883686158, "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": 10163, "totalSubmissionRaw": 12707}, "2694": {"acRate": 74.36158733964753, "difficulty": "Medium", "likes": 237, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2694", "paidOnly": false, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24810, "totalSubmissionRaw": 33364}, "2695": {"acRate": 88.07294011706438, "difficulty": "Easy", "likes": 225, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2695", "paidOnly": false, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39122, "totalSubmissionRaw": 44420}, "2696": {"acRate": 69.81096787121768, "difficulty": "Easy", "likes": 408, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2696", "paidOnly": false, "title": "Minimum String Length After Removing Substrings", "titleSlug": "minimum-string-length-after-removing-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52257, "totalSubmissionRaw": 74855}, "2697": {"acRate": 81.92494333480383, "difficulty": "Easy", "likes": 348, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2697", "paidOnly": false, "title": "Lexicographically Smallest Palindrome", "titleSlug": "lexicographically-smallest-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53855, "totalSubmissionRaw": 65737}, "2698": {"acRate": 62.6746006890072, "difficulty": "Medium", "likes": 476, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2698", "paidOnly": false, "title": "Find the Punishment Number of an Integer", "titleSlug": "find-the-punishment-number-of-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20012, "totalSubmissionRaw": 31930}, "2699": {"acRate": 24.542571358868017, "difficulty": "Hard", "likes": 273, "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": 5030, "totalSubmissionRaw": 20495}, "2700": {"acRate": 76.41133263378805, "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": 7282, "totalSubmissionRaw": 9530}, "2701": {"acRate": 32.444710101613865, "difficulty": "Hard", "likes": 44, "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": 2714, "totalSubmissionRaw": 8365}, "2702": {"acRate": 46.38771824202288, "difficulty": "Hard", "likes": 38, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2702", "paidOnly": true, "title": "Minimum Operations to Make Numbers Non-positive", "titleSlug": "minimum-operations-to-make-numbers-non-positive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1541, "totalSubmissionRaw": 3322}, "2703": {"acRate": 94.28574923846689, "difficulty": "Easy", "likes": 308, "dislikes": 153, "categoryTitle": "JavaScript", "frontendQuestionId": "2703", "paidOnly": false, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154144, "totalSubmissionRaw": 163486}, "2704": {"acRate": 62.35865413175473, "difficulty": "Easy", "likes": 637, "dislikes": 151, "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": 180550, "totalSubmissionRaw": 289536}, "2705": {"acRate": 65.03273555365784, "difficulty": "Medium", "likes": 172, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2705", "paidOnly": false, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22846, "totalSubmissionRaw": 35130}, "2706": {"acRate": 69.16176715082449, "difficulty": "Easy", "likes": 982, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2706", "paidOnly": false, "title": "Buy Two Chocolates", "titleSlug": "buy-two-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 183038, "totalSubmissionRaw": 264652}, "2707": {"acRate": 52.52741277752605, "difficulty": "Medium", "likes": 2079, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2707", "paidOnly": false, "title": "Extra Characters in a String", "titleSlug": "extra-characters-in-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86946, "totalSubmissionRaw": 165525}, "2708": {"acRate": 24.229419978883556, "difficulty": "Medium", "likes": 355, "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": 28456, "totalSubmissionRaw": 117444}, "2709": {"acRate": 42.46490292169238, "difficulty": "Hard", "likes": 811, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2709", "paidOnly": false, "title": "Greatest Common Divisor Traversal", "titleSlug": "greatest-common-divisor-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70448, "totalSubmissionRaw": 165897}, "2710": {"acRate": 78.7956675592961, "difficulty": "Easy", "likes": 314, "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": 65911, "totalSubmissionRaw": 83648}, "2711": {"acRate": 71.14973746152454, "difficulty": "Medium", "likes": 124, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "2711", "paidOnly": false, "title": "Difference of Number of Distinct Values on Diagonals", "titleSlug": "difference-of-number-of-distinct-values-on-diagonals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19648, "totalSubmissionRaw": 27615}, "2712": {"acRate": 54.48808265821299, "difficulty": "Medium", "likes": 528, "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": 18563, "totalSubmissionRaw": 34068}, "2713": {"acRate": 30.64649960882862, "difficulty": "Hard", "likes": 575, "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": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12927, "totalSubmissionRaw": 42180}, "2714": {"acRate": 61.48007590132827, "difficulty": "Hard", "likes": 30, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2714", "paidOnly": true, "title": "Find Shortest Path with K Hops", "titleSlug": "find-shortest-path-with-k-hops", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 972, "totalSubmissionRaw": 1581}, "2715": {"acRate": 88.7124872038936, "difficulty": "Easy", "likes": 226, "dislikes": 285, "categoryTitle": "JavaScript", "frontendQuestionId": "2715", "paidOnly": false, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49396, "totalSubmissionRaw": 55681}, "2716": {"acRate": 76.2954930532023, "difficulty": "Easy", "likes": 324, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "2716", "paidOnly": false, "title": "Minimize String Length", "titleSlug": "minimize-string-length", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56287, "totalSubmissionRaw": 73775}, "2717": {"acRate": 63.92265644121726, "difficulty": "Easy", "likes": 207, "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": 31339, "totalSubmissionRaw": 49026}, "2718": {"acRate": 30.910213260042035, "difficulty": "Medium", "likes": 688, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2718", "paidOnly": false, "title": "Sum of Matrix After Queries", "titleSlug": "sum-of-matrix-after-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21031, "totalSubmissionRaw": 68039}, "2719": {"acRate": 34.63641505876438, "difficulty": "Hard", "likes": 524, "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": 11022, "totalSubmissionRaw": 31822}, "2720": {"acRate": 51.006521122767225, "difficulty": "Hard", "likes": 13, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2720", "paidOnly": true, "title": "Popularity Percentage", "titleSlug": "popularity-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1799, "totalSubmissionRaw": 3527}, "2721": {"acRate": 75.0447253424055, "difficulty": "Medium", "likes": 186, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2721", "paidOnly": false, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25588, "totalSubmissionRaw": 34097}, "2722": {"acRate": 54.57378752255454, "difficulty": "Medium", "likes": 164, "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": 29942, "totalSubmissionRaw": 54866}, "2723": {"acRate": 91.35472632433967, "difficulty": "Easy", "likes": 266, "dislikes": 26, "categoryTitle": "JavaScript", "frontendQuestionId": "2723", "paidOnly": false, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 93349, "totalSubmissionRaw": 102183}, "2724": {"acRate": 82.47104247104247, "difficulty": "Easy", "likes": 168, "dislikes": 37, "categoryTitle": "JavaScript", "frontendQuestionId": "2724", "paidOnly": false, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39516, "totalSubmissionRaw": 47915}, "2725": {"acRate": 80.58348077851053, "difficulty": "Easy", "likes": 158, "dislikes": 83, "categoryTitle": "JavaScript", "frontendQuestionId": "2725", "paidOnly": false, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40079, "totalSubmissionRaw": 49736}, "2726": {"acRate": 75.34772049895132, "difficulty": "Easy", "likes": 109, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2726", "paidOnly": false, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27303, "totalSubmissionRaw": 36236}, "2727": {"acRate": 80.15917107014121, "difficulty": "Easy", "likes": 173, "dislikes": 10, "categoryTitle": "JavaScript", "frontendQuestionId": "2727", "paidOnly": false, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62044, "totalSubmissionRaw": 77401}, "2728": {"acRate": 85.12464241928892, "difficulty": "Easy", "likes": 50, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2728", "paidOnly": true, "title": "Count Houses in a Circular Street", "titleSlug": "count-houses-in-a-circular-street", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2083, "totalSubmissionRaw": 2447}, "2729": {"acRate": 52.165084816559535, "difficulty": "Easy", "likes": 230, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2729", "paidOnly": false, "title": "Check if The Number is Fascinating", "titleSlug": "check-if-the-number-is-fascinating", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44959, "totalSubmissionRaw": 86186}, "2730": {"acRate": 36.934791464293546, "difficulty": "Medium", "likes": 286, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "2730", "paidOnly": false, "title": "Find the Longest Semi-Repetitive Substring", "titleSlug": "find-the-longest-semi-repetitive-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23574, "totalSubmissionRaw": 63826}, "2731": {"acRate": 27.94300132362674, "difficulty": "Medium", "likes": 484, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "2731", "paidOnly": false, "title": "Movement of Robots", "titleSlug": "movement-of-robots", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13511, "totalSubmissionRaw": 48352}, "2732": {"acRate": 45.72306869820903, "difficulty": "Hard", "likes": 208, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2732", "paidOnly": false, "title": "Find a Good Subset of the Matrix", "titleSlug": "find-a-good-subset-of-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6842, "totalSubmissionRaw": 14964}, "2733": {"acRate": 76.55746553049508, "difficulty": "Easy", "likes": 344, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2733", "paidOnly": false, "title": "Neither Minimum nor Maximum", "titleSlug": "neither-minimum-nor-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93616, "totalSubmissionRaw": 122282}, "2734": {"acRate": 30.99418564566911, "difficulty": "Medium", "likes": 240, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "2734", "paidOnly": false, "title": "Lexicographically Smallest String After Substring Operation", "titleSlug": "lexicographically-smallest-string-after-substring-operation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26973, "totalSubmissionRaw": 87026}, "2735": {"acRate": 33.24261384360708, "difficulty": "Medium", "likes": 287, "dislikes": 537, "categoryTitle": "Algorithms", "frontendQuestionId": "2735", "paidOnly": false, "title": "Collecting Chocolates", "titleSlug": "collecting-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11846, "totalSubmissionRaw": 35639}, "2736": {"acRate": 29.08919991644036, "difficulty": "Hard", "likes": 329, "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": 5570, "totalSubmissionRaw": 19148}, "2737": {"acRate": 57.311320754716974, "difficulty": "Medium", "likes": 34, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2737", "paidOnly": true, "title": "Find the Closest Marked Node", "titleSlug": "find-the-closest-marked-node", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1701, "totalSubmissionRaw": 2968}, "2738": {"acRate": 55.629063533705946, "difficulty": "Medium", "likes": 20, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "2738", "paidOnly": true, "title": "Count Occurrences in Text", "titleSlug": "count-occurrences-in-text", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4877, "totalSubmissionRaw": 8767}, "2739": {"acRate": 39.28671316053014, "difficulty": "Easy", "likes": 282, "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": 43545, "totalSubmissionRaw": 110839}, "2740": {"acRate": 65.38002309694846, "difficulty": "Medium", "likes": 283, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2740", "paidOnly": false, "title": "Find the Value of the Partition", "titleSlug": "find-the-value-of-the-partition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33402, "totalSubmissionRaw": 51089}, "2741": {"acRate": 28.459072536487266, "difficulty": "Medium", "likes": 556, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2741", "paidOnly": false, "title": "Special Permutations", "titleSlug": "special-permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14293, "totalSubmissionRaw": 50223}, "2742": {"acRate": 50.86945564516129, "difficulty": "Hard", "likes": 1366, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2742", "paidOnly": false, "title": "Painting the Walls", "titleSlug": "painting-the-walls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64592, "totalSubmissionRaw": 126976}, "2743": {"acRate": 76.68182348140375, "difficulty": "Medium", "likes": 83, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2743", "paidOnly": true, "title": "Count Substrings Without Repeating Character", "titleSlug": "count-substrings-without-repeating-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6577, "totalSubmissionRaw": 8577}, "2744": {"acRate": 81.48143749554643, "difficulty": "Easy", "likes": 350, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2744", "paidOnly": false, "title": "Find Maximum Number of String Pairs", "titleSlug": "find-maximum-number-of-string-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68609, "totalSubmissionRaw": 84202}, "2745": {"acRate": 53.94227908360607, "difficulty": "Medium", "likes": 307, "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": 19943, "totalSubmissionRaw": 36971}, "2746": {"acRate": 26.860517653133677, "difficulty": "Medium", "likes": 358, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2746", "paidOnly": false, "title": "Decremental String Concatenation", "titleSlug": "decremental-string-concatenation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8323, "totalSubmissionRaw": 30986}, "2747": {"acRate": 32.35474631751227, "difficulty": "Medium", "likes": 338, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2747", "paidOnly": false, "title": "Count Zero Request Servers", "titleSlug": "count-zero-request-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6326, "totalSubmissionRaw": 19552}, "2748": {"acRate": 50.24317246539469, "difficulty": "Easy", "likes": 206, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2748", "paidOnly": false, "title": "Number of Beautiful Pairs", "titleSlug": "number-of-beautiful-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34918, "totalSubmissionRaw": 69498}, "2749": {"acRate": 29.840603764131153, "difficulty": "Medium", "likes": 283, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "2749", "paidOnly": false, "title": "Minimum Operations to Make the Integer Zero", "titleSlug": "minimum-operations-to-make-the-integer-zero", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9529, "totalSubmissionRaw": 31933}, "2750": {"acRate": 34.11240781390648, "difficulty": "Medium", "likes": 435, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2750", "paidOnly": false, "title": "Ways to Split Array Into Good Subarrays", "titleSlug": "ways-to-split-array-into-good-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21601, "totalSubmissionRaw": 63323}, "2751": {"acRate": 57.13095381583982, "difficulty": "Hard", "likes": 1115, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "2751", "paidOnly": false, "title": "Robot Collisions", "titleSlug": "robot-collisions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109019, "totalSubmissionRaw": 190823}, "2752": {"acRate": 37.790552361909526, "difficulty": "Hard", "likes": 12, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "2752", "paidOnly": true, "title": "Customers with Maximum Number of Transactions on Consecutive Days", "titleSlug": "customers-with-maximum-number-of-transactions-on-consecutive-days", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1512, "totalSubmissionRaw": 4001}, "2753": {"acRate": 67.41245136186771, "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": 693, "totalSubmissionRaw": 1028}, "2754": {"acRate": 86.58008658008657, "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": 600, "totalSubmissionRaw": 693}, "2755": {"acRate": 64.85788113695091, "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": 502, "totalSubmissionRaw": 774}, "2756": {"acRate": 62.913907284768214, "difficulty": "Hard", "likes": 14, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2756", "paidOnly": true, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 285, "totalSubmissionRaw": 453}, "2757": {"acRate": 71.1645101663586, "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": 385, "totalSubmissionRaw": 541}, "2758": {"acRate": 83.57531760435572, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2758", "paidOnly": true, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 921, "totalSubmissionRaw": 1102}, "2759": {"acRate": 60.9254498714653, "difficulty": "Hard", "likes": 16, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2759", "paidOnly": true, "title": "Convert JSON String to Object", "titleSlug": "convert-json-string-to-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 474, "totalSubmissionRaw": 778}, "2760": {"acRate": 29.674920938988848, "difficulty": "Easy", "likes": 290, "dislikes": 268, "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": 35939, "totalSubmissionRaw": 121109}, "2761": {"acRate": 34.295709008894974, "difficulty": "Medium", "likes": 360, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2761", "paidOnly": false, "title": "Prime Pairs With Target Sum", "titleSlug": "prime-pairs-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29804, "totalSubmissionRaw": 86903}, "2762": {"acRate": 41.21525559928296, "difficulty": "Medium", "likes": 697, "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": 20003, "totalSubmissionRaw": 48533}, "2763": {"acRate": 46.5599806025338, "difficulty": "Hard", "likes": 304, "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": 7681, "totalSubmissionRaw": 16497}, "2764": {"acRate": 66.62613981762918, "difficulty": "Medium", "likes": 31, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2764", "paidOnly": true, "title": "Is Array a Preorder of Some \u200cBinary Tree", "titleSlug": "is-array-a-preorder-of-some-binary-tree", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1096, "totalSubmissionRaw": 1645}, "2765": {"acRate": 34.10114281803873, "difficulty": "Easy", "likes": 212, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "2765", "paidOnly": false, "title": "Longest Alternating Subarray", "titleSlug": "longest-alternating-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24916, "totalSubmissionRaw": 73065}, "2766": {"acRate": 51.82641991065731, "difficulty": "Medium", "likes": 195, "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": 20303, "totalSubmissionRaw": 39175}, "2767": {"acRate": 53.44154576800469, "difficulty": "Medium", "likes": 351, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2767", "paidOnly": false, "title": "Partition String Into Minimum Beautiful Substrings", "titleSlug": "partition-string-into-minimum-beautiful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16429, "totalSubmissionRaw": 30742}, "2768": {"acRate": 36.33255845754137, "difficulty": "Medium", "likes": 226, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2768", "paidOnly": false, "title": "Number of Black Blocks", "titleSlug": "number-of-black-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7971, "totalSubmissionRaw": 21939}, "2769": {"acRate": 90.58700672417305, "difficulty": "Easy", "likes": 344, "dislikes": 502, "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": 106697, "totalSubmissionRaw": 117784}, "2770": {"acRate": 31.2268340543704, "difficulty": "Medium", "likes": 421, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2770", "paidOnly": false, "title": "Maximum Number of Jumps to Reach the Last Index", "titleSlug": "maximum-number-of-jumps-to-reach-the-last-index", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27212, "totalSubmissionRaw": 87143}, "2771": {"acRate": 29.515455404904085, "difficulty": "Medium", "likes": 587, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2771", "paidOnly": false, "title": "Longest Non-decreasing Subarray From Two Arrays", "titleSlug": "longest-non-decreasing-subarray-from-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24664, "totalSubmissionRaw": 83561}, "2772": {"acRate": 33.27964823478283, "difficulty": "Medium", "likes": 384, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2772", "paidOnly": false, "title": "Apply Operations to Make All Array Elements Equal to Zero", "titleSlug": "apply-operations-to-make-all-array-elements-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13018, "totalSubmissionRaw": 39117}, "2773": {"acRate": 74.70472440944881, "difficulty": "Medium", "likes": 10, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2773", "paidOnly": true, "title": "Height of Special Binary Tree", "titleSlug": "height-of-special-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 759, "totalSubmissionRaw": 1016}, "2774": {"acRate": 81.47023086269745, "difficulty": "Easy", "likes": 21, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2774", "paidOnly": true, "title": "Array Upper Bound", "titleSlug": "array-upper-bound", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1341, "totalSubmissionRaw": 1646}, "2775": {"acRate": 68.40796019900498, "difficulty": "Medium", "likes": 15, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2775", "paidOnly": true, "title": "Undefined to Null", "titleSlug": "undefined-to-null", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 550, "totalSubmissionRaw": 804}, "2776": {"acRate": 91.70918367346938, "difficulty": "Medium", "likes": 17, "dislikes": 8, "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": 719, "totalSubmissionRaw": 784}, "2777": {"acRate": 80.55555555555556, "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": 377, "totalSubmissionRaw": 468}, "2778": {"acRate": 81.49714404884662, "difficulty": "Easy", "likes": 274, "dislikes": 104, "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": 70341, "totalSubmissionRaw": 86311}, "2779": {"acRate": 38.37177829238219, "difficulty": "Medium", "likes": 609, "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": 25518, "totalSubmissionRaw": 66502}, "2780": {"acRate": 62.21133844168839, "difficulty": "Medium", "likes": 333, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2780", "paidOnly": false, "title": "Minimum Index of a Valid Split", "titleSlug": "minimum-index-of-a-valid-split", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23626, "totalSubmissionRaw": 37977}, "2781": {"acRate": 37.84088566612909, "difficulty": "Hard", "likes": 552, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2781", "paidOnly": false, "title": "Length of the Longest Valid Substring", "titleSlug": "length-of-the-longest-valid-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31207, "totalSubmissionRaw": 82469}, "2782": {"acRate": 83.39113680154142, "difficulty": "Medium", "likes": 32, "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": 2164, "totalSubmissionRaw": 2595}, "2783": {"acRate": 37.466627113616134, "difficulty": "Medium", "likes": 17, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2783", "paidOnly": true, "title": "Flight Occupancy and Waitlist Analysis", "titleSlug": "flight-occupancy-and-waitlist-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2526, "totalSubmissionRaw": 6742}, "2784": {"acRate": 49.31136325215541, "difficulty": "Easy", "likes": 269, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2784", "paidOnly": false, "title": "Check if Array is Good", "titleSlug": "check-if-array-is-good", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49588, "totalSubmissionRaw": 100561}, "2785": {"acRate": 81.34051356942923, "difficulty": "Medium", "likes": 988, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2785", "paidOnly": false, "title": "Sort Vowels in a String", "titleSlug": "sort-vowels-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133675, "totalSubmissionRaw": 164340}, "2786": {"acRate": 36.11561417728981, "difficulty": "Medium", "likes": 475, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2786", "paidOnly": false, "title": "Visit Array Positions to Maximize Score", "titleSlug": "visit-array-positions-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19605, "totalSubmissionRaw": 54284}, "2787": {"acRate": 33.85615500972412, "difficulty": "Medium", "likes": 400, "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": 18801, "totalSubmissionRaw": 55532}, "2788": {"acRate": 74.31835676376454, "difficulty": "Easy", "likes": 309, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2788", "paidOnly": false, "title": "Split Strings by Separator", "titleSlug": "split-strings-by-separator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55032, "totalSubmissionRaw": 74049}, "2789": {"acRate": 47.20004979072336, "difficulty": "Medium", "likes": 464, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2789", "paidOnly": false, "title": "Largest Element in an Array after Merge Operations", "titleSlug": "largest-element-in-an-array-after-merge-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30335, "totalSubmissionRaw": 64269}, "2790": {"acRate": 20.07113710258145, "difficulty": "Hard", "likes": 400, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2790", "paidOnly": false, "title": "Maximum Number of Groups With Increasing Length", "titleSlug": "maximum-number-of-groups-with-increasing-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9198, "totalSubmissionRaw": 45827}, "2791": {"acRate": 48.05981308411215, "difficulty": "Hard", "likes": 379, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2791", "paidOnly": false, "title": "Count Paths That Can Form a Palindrome in a Tree", "titleSlug": "count-paths-that-can-form-a-palindrome-in-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6428, "totalSubmissionRaw": 13375}, "2792": {"acRate": 58.449158741770304, "difficulty": "Hard", "likes": 19, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2792", "paidOnly": true, "title": "Count Nodes That Are Great Enough", "titleSlug": "count-nodes-that-are-great-enough", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 799, "totalSubmissionRaw": 1367}, "2793": {"acRate": 74.69056764831413, "difficulty": "Hard", "likes": 10, "dislikes": 20, "categoryTitle": "Database", "frontendQuestionId": "2793", "paidOnly": true, "title": "Status of Flight Tickets", "titleSlug": "status-of-flight-tickets", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1750, "totalSubmissionRaw": 2343}, "2794": {"acRate": 63.729903536977496, "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": 991, "totalSubmissionRaw": 1555}, "2795": {"acRate": 87.78979907264298, "difficulty": "Medium", "likes": 13, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2795", "paidOnly": true, "title": "Parallel Execution of Promises for Individual Results Retrieval", "titleSlug": "parallel-execution-of-promises-for-individual-results-retrieval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 568, "totalSubmissionRaw": 647}, "2796": {"acRate": 92.8048780487805, "difficulty": "Easy", "likes": 25, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2796", "paidOnly": true, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2283, "totalSubmissionRaw": 2460}, "2797": {"acRate": 90.38817005545286, "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": 978, "totalSubmissionRaw": 1082}, "2798": {"acRate": 87.73984282125625, "difficulty": "Easy", "likes": 495, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2798", "paidOnly": false, "title": "Number of Employees Who Met the Target", "titleSlug": "number-of-employees-who-met-the-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 163111, "totalSubmissionRaw": 185903}, "2799": {"acRate": 65.11069962160857, "difficulty": "Medium", "likes": 557, "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": 40436, "totalSubmissionRaw": 62104}, "2800": {"acRate": 30.51851562194502, "difficulty": "Medium", "likes": 321, "dislikes": 262, "categoryTitle": "Algorithms", "frontendQuestionId": "2800", "paidOnly": false, "title": "Shortest String That Contains Three Strings", "titleSlug": "shortest-string-that-contains-three-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15609, "totalSubmissionRaw": 51146}, "2801": {"acRate": 27.943120511629573, "difficulty": "Hard", "likes": 330, "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": 7821, "totalSubmissionRaw": 27989}, "2802": {"acRate": 77.33854619171736, "difficulty": "Medium", "likes": 58, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2802", "paidOnly": true, "title": "Find The K-th Lucky Number", "titleSlug": "find-the-k-th-lucky-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5341, "totalSubmissionRaw": 6906}, "2803": {"acRate": 86.06060606060606, "difficulty": "Easy", "likes": 18, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2803", "paidOnly": true, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 852, "totalSubmissionRaw": 990}, "2804": {"acRate": 88.95833333333333, "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": 854, "totalSubmissionRaw": 960}, "2805": {"acRate": 81.48893360160966, "difficulty": "Medium", "likes": 16, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2805", "paidOnly": true, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 405, "totalSubmissionRaw": 497}, "2806": {"acRate": 52.72176801539536, "difficulty": "Easy", "likes": 251, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2806", "paidOnly": false, "title": "Account Balance After Rounded Purchase", "titleSlug": "account-balance-after-rounded-purchase", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43012, "totalSubmissionRaw": 81583}, "2807": {"acRate": 88.77501109076225, "difficulty": "Medium", "likes": 537, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2807", "paidOnly": false, "title": "Insert Greatest Common Divisors in Linked List", "titleSlug": "insert-greatest-common-divisors-in-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78043, "totalSubmissionRaw": 87911}, "2808": {"acRate": 26.83814565845843, "difficulty": "Medium", "likes": 513, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2808", "paidOnly": false, "title": "Minimum Seconds to Equalize a Circular Array", "titleSlug": "minimum-seconds-to-equalize-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15411, "totalSubmissionRaw": 57422}, "2809": {"acRate": 26.21216180016073, "difficulty": "Hard", "likes": 230, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2809", "paidOnly": false, "title": "Minimum Time to Make Array Sum At Most x", "titleSlug": "minimum-time-to-make-array-sum-at-most-x", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3914, "totalSubmissionRaw": 14932}, "2810": {"acRate": 83.84013810603382, "difficulty": "Easy", "likes": 425, "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": 80619, "totalSubmissionRaw": 96158}, "2811": {"acRate": 33.74351508428946, "difficulty": "Medium", "likes": 497, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2811", "paidOnly": false, "title": "Check if it is Possible to Split Array", "titleSlug": "check-if-it-is-possible-to-split-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29204, "totalSubmissionRaw": 86547}, "2812": {"acRate": 49.028373083699286, "difficulty": "Medium", "likes": 1567, "dislikes": 292, "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": 93225, "totalSubmissionRaw": 190145}, "2813": {"acRate": 32.986748216106015, "difficulty": "Hard", "likes": 304, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2813", "paidOnly": false, "title": "Maximum Elegance of a K-Length Subsequence", "titleSlug": "maximum-elegance-of-a-k-length-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6472, "totalSubmissionRaw": 19620}, "2814": {"acRate": 64.13199426111909, "difficulty": "Hard", "likes": 20, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2814", "paidOnly": true, "title": "Minimum Time Takes to Reach Destination Without Drowning", "titleSlug": "minimum-time-takes-to-reach-destination-without-drowning", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 894, "totalSubmissionRaw": 1394}, "2815": {"acRate": 58.13278218750793, "difficulty": "Easy", "likes": 374, "dislikes": 121, "categoryTitle": "Algorithms", "frontendQuestionId": "2815", "paidOnly": false, "title": "Max Pair Sum in an Array", "titleSlug": "max-pair-sum-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45847, "totalSubmissionRaw": 78866}, "2816": {"acRate": 61.54574457895241, "difficulty": "Medium", "likes": 1133, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2816", "paidOnly": false, "title": "Double a Number Represented as a Linked List", "titleSlug": "double-a-number-represented-as-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167061, "totalSubmissionRaw": 271442}, "2817": {"acRate": 33.91889951840879, "difficulty": "Medium", "likes": 670, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2817", "paidOnly": false, "title": "Minimum Absolute Difference Between Elements With Constraint", "titleSlug": "minimum-absolute-difference-between-elements-with-constraint", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25989, "totalSubmissionRaw": 76621}, "2818": {"acRate": 32.58966796689183, "difficulty": "Hard", "likes": 325, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2818", "paidOnly": false, "title": "Apply Operations to Maximize Score", "titleSlug": "apply-operations-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6851, "totalSubmissionRaw": 21022}, "2819": {"acRate": 51.97183098591549, "difficulty": "Hard", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2819", "paidOnly": true, "title": "Minimum Relative Loss After Buying Chocolates", "titleSlug": "minimum-relative-loss-after-buying-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 369, "totalSubmissionRaw": 710}, "2820": {"acRate": 65.97070738547835, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2820", "paidOnly": true, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2117, "totalSubmissionRaw": 3209}, "2821": {"acRate": 65.7488986784141, "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": 597, "totalSubmissionRaw": 908}, "2822": {"acRate": 58.001502629601795, "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": 772, "totalSubmissionRaw": 1331}, "2823": {"acRate": 52.47813411078717, "difficulty": "Medium", "likes": 14, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2823", "paidOnly": true, "title": "Deep Object Filter", "titleSlug": "deep-object-filter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 360, "totalSubmissionRaw": 686}, "2824": {"acRate": 87.34320480544146, "difficulty": "Easy", "likes": 590, "dislikes": 65, "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": 158203, "totalSubmissionRaw": 181128}, "2825": {"acRate": 49.4034592304977, "difficulty": "Medium", "likes": 319, "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": 34990, "totalSubmissionRaw": 70825}, "2826": {"acRate": 42.186870293774525, "difficulty": "Medium", "likes": 492, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "2826", "paidOnly": false, "title": "Sorting Three Groups", "titleSlug": "sorting-three-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19889, "totalSubmissionRaw": 47145}, "2827": {"acRate": 18.06910330238571, "difficulty": "Hard", "likes": 349, "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": 9225, "totalSubmissionRaw": 51054}, "2828": {"acRate": 83.07970375595133, "difficulty": "Easy", "likes": 316, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2828", "paidOnly": false, "title": "Check if a String Is an Acronym of Words", "titleSlug": "check-if-a-string-is-an-acronym-of-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 94229, "totalSubmissionRaw": 113420}, "2829": {"acRate": 61.382300074014026, "difficulty": "Medium", "likes": 327, "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": 34832, "totalSubmissionRaw": 56746}, "2830": {"acRate": 36.43045671711603, "difficulty": "Medium", "likes": 662, "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": 21808, "totalSubmissionRaw": 59862}, "2831": {"acRate": 35.85557355742696, "difficulty": "Medium", "likes": 667, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2831", "paidOnly": false, "title": "Find the Longest Equal Subarray", "titleSlug": "find-the-longest-equal-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20139, "totalSubmissionRaw": 56164}, "2832": {"acRate": 74.26303854875283, "difficulty": "Medium", "likes": 37, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2832", "paidOnly": true, "title": "Maximal Range That Each Element Is Maximum in It", "titleSlug": "maximal-range-that-each-element-is-maximum-in-it", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1310, "totalSubmissionRaw": 1764}, "2833": {"acRate": 64.84987387778351, "difficulty": "Easy", "likes": 238, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2833", "paidOnly": false, "title": "Furthest Point From Origin", "titleSlug": "furthest-point-from-origin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47819, "totalSubmissionRaw": 73738}, "2834": {"acRate": 38.218510260383205, "difficulty": "Medium", "likes": 294, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2834", "paidOnly": false, "title": "Find the Minimum Possible Sum of a Beautiful Array", "titleSlug": "find-the-minimum-possible-sum-of-a-beautiful-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30339, "totalSubmissionRaw": 79383}, "2835": {"acRate": 32.425414514078604, "difficulty": "Hard", "likes": 520, "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": 11988, "totalSubmissionRaw": 36971}, "2836": {"acRate": 31.1152146672822, "difficulty": "Hard", "likes": 289, "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": 4718, "totalSubmissionRaw": 15163}, "2837": {"acRate": 75.0762406431938, "difficulty": "Easy", "likes": 14, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2837", "paidOnly": true, "title": "Total Traveled Distance", "titleSlug": "total-traveled-distance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2708, "totalSubmissionRaw": 3607}, "2838": {"acRate": 68.80783886771911, "difficulty": "Medium", "likes": 30, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2838", "paidOnly": true, "title": "Maximum Coins Heroes Can Collect", "titleSlug": "maximum-coins-heroes-can-collect", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1264, "totalSubmissionRaw": 1837}, "2839": {"acRate": 47.15276738034636, "difficulty": "Easy", "likes": 181, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2839", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations I", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37792, "totalSubmissionRaw": 80148}, "2840": {"acRate": 55.84125326370757, "difficulty": "Medium", "likes": 253, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2840", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations II", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26734, "totalSubmissionRaw": 47875}, "2841": {"acRate": 38.096256357776724, "difficulty": "Medium", "likes": 271, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2841", "paidOnly": false, "title": "Maximum Sum of Almost Unique Subarray", "titleSlug": "maximum-sum-of-almost-unique-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24942, "totalSubmissionRaw": 65471}, "2842": {"acRate": 29.421286928369085, "difficulty": "Hard", "likes": 333, "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": 12359, "totalSubmissionRaw": 42007}, "2843": {"acRate": 74.42697785064455, "difficulty": "Easy", "likes": 252, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2843", "paidOnly": false, "title": "  Count Symmetric Integers", "titleSlug": "count-symmetric-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46304, "totalSubmissionRaw": 62214}, "2844": {"acRate": 38.221406474340945, "difficulty": "Medium", "likes": 345, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2844", "paidOnly": false, "title": "Minimum Operations to Make a Special Number", "titleSlug": "minimum-operations-to-make-a-special-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25822, "totalSubmissionRaw": 67559}, "2845": {"acRate": 35.45532257253482, "difficulty": "Medium", "likes": 495, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2845", "paidOnly": false, "title": "Count of Interesting Subarrays", "titleSlug": "count-of-interesting-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14102, "totalSubmissionRaw": 39774}, "2846": {"acRate": 44.571645185746775, "difficulty": "Hard", "likes": 297, "dislikes": 7, "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": 5879, "totalSubmissionRaw": 13190}, "2847": {"acRate": 43.158905424867974, "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": 899, "totalSubmissionRaw": 2083}, "2848": {"acRate": 75.29536643898837, "difficulty": "Easy", "likes": 272, "dislikes": 24, "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": 48945, "totalSubmissionRaw": 65004}, "2849": {"acRate": 35.672004373468106, "difficulty": "Medium", "likes": 817, "dislikes": 755, "categoryTitle": "Algorithms", "frontendQuestionId": "2849", "paidOnly": false, "title": "Determine if a Cell Is Reachable at a Given Time", "titleSlug": "determine-if-a-cell-is-reachable-at-a-given-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98530, "totalSubmissionRaw": 276211}, "2850": {"acRate": 44.41987173043286, "difficulty": "Medium", "likes": 501, "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": 22094, "totalSubmissionRaw": 49739}, "2851": {"acRate": 29.419652834686733, "difficulty": "Hard", "likes": 163, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2851", "paidOnly": false, "title": "String Transformation", "titleSlug": "string-transformation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3949, "totalSubmissionRaw": 13423}, "2852": {"acRate": 64.00911161731207, "difficulty": "Medium", "likes": 28, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2852", "paidOnly": true, "title": "Sum of Remoteness of All Cells", "titleSlug": "sum-of-remoteness-of-all-cells", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1124, "totalSubmissionRaw": 1756}, "2853": {"acRate": 73.647118046816, "difficulty": "Easy", "likes": 15, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2853", "paidOnly": true, "title": "Highest Salaries Difference", "titleSlug": "highest-salaries-difference", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2926, "totalSubmissionRaw": 3973}, "2854": {"acRate": 67.0365926814637, "difficulty": "Medium", "likes": 16, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2854", "paidOnly": true, "title": "Rolling Average Steps", "titleSlug": "rolling-average-steps", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2234, "totalSubmissionRaw": 3333}, "2855": {"acRate": 57.96702827368241, "difficulty": "Easy", "likes": 214, "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": 33931, "totalSubmissionRaw": 58535}, "2856": {"acRate": 22.541345418162557, "difficulty": "Medium", "likes": 367, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2856", "paidOnly": false, "title": "Minimum Array Length After Pair Removals", "titleSlug": "minimum-array-length-after-pair-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22980, "totalSubmissionRaw": 101946}, "2857": {"acRate": 32.16592893886829, "difficulty": "Medium", "likes": 265, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2857", "paidOnly": false, "title": "Count Pairs of Points With Distance k", "titleSlug": "count-pairs-of-points-with-distance-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10755, "totalSubmissionRaw": 33436}, "2858": {"acRate": 58.67909757312647, "difficulty": "Hard", "likes": 294, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2858", "paidOnly": false, "title": "Minimum Edge Reversals So Every Node Is Reachable", "titleSlug": "minimum-edge-reversals-so-every-node-is-reachable", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8245, "totalSubmissionRaw": 14051}, "2859": {"acRate": 86.66951688755879, "difficulty": "Easy", "likes": 264, "dislikes": 41, "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": 70952, "totalSubmissionRaw": 81865}, "2860": {"acRate": 52.18595688305432, "difficulty": "Medium", "likes": 163, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "2860", "paidOnly": false, "title": "Happy Students", "titleSlug": "happy-students", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21665, "totalSubmissionRaw": 41515}, "2861": {"acRate": 38.47456238564679, "difficulty": "Medium", "likes": 270, "dislikes": 45, "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": 14089, "totalSubmissionRaw": 36619}, "2862": {"acRate": 44.11062590975255, "difficulty": "Hard", "likes": 206, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2862", "paidOnly": false, "title": "Maximum Element-Sum of a Complete Subset of Indices", "titleSlug": "maximum-element-sum-of-a-complete-subset-of-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7576, "totalSubmissionRaw": 17175}, "2863": {"acRate": 70.89099581885637, "difficulty": "Medium", "likes": 120, "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": 12038, "totalSubmissionRaw": 16981}, "2864": {"acRate": 83.1513190234311, "difficulty": "Easy", "likes": 762, "dislikes": 28, "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": 202989, "totalSubmissionRaw": 244120}, "2865": {"acRate": 43.583995408812925, "difficulty": "Medium", "likes": 282, "dislikes": 48, "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": 24302, "totalSubmissionRaw": 55759}, "2866": {"acRate": 34.822997072132026, "difficulty": "Medium", "likes": 402, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2866", "paidOnly": false, "title": "Beautiful Towers II", "titleSlug": "beautiful-towers-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13083, "totalSubmissionRaw": 37570}, "2867": {"acRate": 35.56684991183487, "difficulty": "Hard", "likes": 248, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2867", "paidOnly": false, "title": "Count Valid Paths in a Tree", "titleSlug": "count-valid-paths-in-a-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6858, "totalSubmissionRaw": 19282}, "2868": {"acRate": 59.76253298153035, "difficulty": "Hard", "likes": 10, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2868", "paidOnly": true, "title": "The Wording Game", "titleSlug": "the-wording-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 453, "totalSubmissionRaw": 758}, "2869": {"acRate": 60.361459883302956, "difficulty": "Easy", "likes": 168, "dislikes": 18, "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": 36104, "totalSubmissionRaw": 59813}, "2870": {"acRate": 61.99602099269372, "difficulty": "Medium", "likes": 1387, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2870", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Empty", "titleSlug": "minimum-number-of-operations-to-make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180737, "totalSubmissionRaw": 291530}, "2871": {"acRate": 43.97495235502314, "difficulty": "Medium", "likes": 221, "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": 16152, "totalSubmissionRaw": 36730}, "2872": {"acRate": 57.79981474418351, "difficulty": "Hard", "likes": 185, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2872", "paidOnly": false, "title": "Maximum Number of K-Divisible Components", "titleSlug": "maximum-number-of-k-divisible-components", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10608, "totalSubmissionRaw": 18353}, "2873": {"acRate": 45.74838990847901, "difficulty": "Easy", "likes": 163, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2873", "paidOnly": false, "title": "Maximum Value of an Ordered Triplet I", "titleSlug": "maximum-value-of-an-ordered-triplet-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37790, "totalSubmissionRaw": 82604}, "2874": {"acRate": 41.40712737856092, "difficulty": "Medium", "likes": 273, "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": 26178, "totalSubmissionRaw": 63221}, "2875": {"acRate": 30.829751122249892, "difficulty": "Medium", "likes": 369, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2875", "paidOnly": false, "title": "Minimum Size Subarray in Infinite Array", "titleSlug": "minimum-size-subarray-in-infinite-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19436, "totalSubmissionRaw": 63043}, "2876": {"acRate": 32.88018211548944, "difficulty": "Hard", "likes": 317, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2876", "paidOnly": false, "title": "Count Visited Nodes in a Directed Graph", "titleSlug": "count-visited-nodes-in-a-directed-graph", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10255, "totalSubmissionRaw": 31189}, "2877": {"acRate": 81.1269114059618, "difficulty": "Easy", "likes": 173, "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": 109080, "totalSubmissionRaw": 134456}, "2878": {"acRate": 84.88801304430463, "difficulty": "Easy", "likes": 90, "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": 84858, "totalSubmissionRaw": 99965}, "2879": {"acRate": 92.88254001355509, "difficulty": "Easy", "likes": 75, "dislikes": 19, "categoryTitle": "pandas", "frontendQuestionId": "2879", "paidOnly": false, "title": "Display the First Three Rows", "titleSlug": "display-the-first-three-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89078, "totalSubmissionRaw": 95904}, "2880": {"acRate": 79.15887218553495, "difficulty": "Easy", "likes": 75, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2880", "paidOnly": false, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70244, "totalSubmissionRaw": 88738}, "2881": {"acRate": 90.09690477164001, "difficulty": "Easy", "likes": 67, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2881", "paidOnly": false, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66104, "totalSubmissionRaw": 73370}, "2882": {"acRate": 85.31663187195547, "difficulty": "Easy", "likes": 79, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2882", "paidOnly": false, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58848, "totalSubmissionRaw": 68976}, "2883": {"acRate": 63.93589953080138, "difficulty": "Easy", "likes": 61, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2883", "paidOnly": false, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54779, "totalSubmissionRaw": 85678}, "2884": {"acRate": 91.89613158696315, "difficulty": "Easy", "likes": 61, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2884", "paidOnly": false, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60339, "totalSubmissionRaw": 65660}, "2885": {"acRate": 85.22036349295034, "difficulty": "Easy", "likes": 50, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2885", "paidOnly": false, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51860, "totalSubmissionRaw": 60854}, "2886": {"acRate": 87.08149627996693, "difficulty": "Easy", "likes": 56, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2886", "paidOnly": false, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50562, "totalSubmissionRaw": 58063}, "2887": {"acRate": 71.84503373978927, "difficulty": "Easy", "likes": 55, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2887", "paidOnly": false, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 48550, "totalSubmissionRaw": 67576}, "2888": {"acRate": 90.49495110827166, "difficulty": "Easy", "likes": 55, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2888", "paidOnly": false, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50992, "totalSubmissionRaw": 56348}, "2889": {"acRate": 81.85232019006015, "difficulty": "Easy", "likes": 80, "dislikes": 12, "categoryTitle": "pandas", "frontendQuestionId": "2889", "paidOnly": false, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42721, "totalSubmissionRaw": 52193}, "2890": {"acRate": 85.68876791562114, "difficulty": "Easy", "likes": 69, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2890", "paidOnly": false, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40296, "totalSubmissionRaw": 47026}, "2891": {"acRate": 75.93216066831103, "difficulty": "Easy", "likes": 63, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2891", "paidOnly": false, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42173, "totalSubmissionRaw": 55541}, "2892": {"acRate": 40.32016008004002, "difficulty": "Medium", "likes": 22, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2892", "paidOnly": true, "title": "Minimizing Array After Replacing Pairs With Their Product", "titleSlug": "minimizing-array-after-replacing-pairs-with-their-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 806, "totalSubmissionRaw": 1999}, "2893": {"acRate": 68.02248677248677, "difficulty": "Medium", "likes": 18, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2893", "paidOnly": true, "title": "Calculate Orders Within Each Interval", "titleSlug": "calculate-orders-within-each-interval", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2057, "totalSubmissionRaw": 3024}, "2894": {"acRate": 89.04249976941287, "difficulty": "Easy", "likes": 214, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2894", "paidOnly": false, "title": "Divisible and Non-divisible Sums Difference", "titleSlug": "divisible-and-non-divisible-sums-difference", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86885, "totalSubmissionRaw": 97577}, "2895": {"acRate": 69.1977255748319, "difficulty": "Medium", "likes": 253, "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": 33345, "totalSubmissionRaw": 48188}, "2896": {"acRate": 26.900910551687197, "difficulty": "Medium", "likes": 350, "dislikes": 67, "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": 12556, "totalSubmissionRaw": 46675}, "2897": {"acRate": 47.11405689036178, "difficulty": "Hard", "likes": 179, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2897", "paidOnly": false, "title": "Apply Operations on Array to Maximize Sum of Squares", "titleSlug": "apply-operations-on-array-to-maximize-sum-of-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6824, "totalSubmissionRaw": 14484}, "2898": {"acRate": 67.36363636363636, "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": 741, "totalSubmissionRaw": 1100}, "2899": {"acRate": 66.0812620925733, "difficulty": "Easy", "likes": 152, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "2899", "paidOnly": false, "title": "Last Visited Integers", "titleSlug": "last-visited-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26640, "totalSubmissionRaw": 40314}, "2900": {"acRate": 62.669087205827, "difficulty": "Easy", "likes": 177, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2900", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence I", "titleSlug": "longest-unequal-adjacent-groups-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28307, "totalSubmissionRaw": 45169}, "2901": {"acRate": 27.32125155682078, "difficulty": "Medium", "likes": 192, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2901", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence II", "titleSlug": "longest-unequal-adjacent-groups-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10749, "totalSubmissionRaw": 39343}, "2902": {"acRate": 21.032707450030287, "difficulty": "Hard", "likes": 146, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2902", "paidOnly": false, "title": "Count of Sub-Multisets With Bounded Sum", "titleSlug": "count-of-sub-multisets-with-bounded-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4167, "totalSubmissionRaw": 19812}, "2903": {"acRate": 61.888738296645954, "difficulty": "Easy", "likes": 135, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2903", "paidOnly": false, "title": "Find Indices With Index and Value Difference I", "titleSlug": "find-indices-with-index-and-value-difference-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39727, "totalSubmissionRaw": 64191}, "2904": {"acRate": 39.15827714663958, "difficulty": "Medium", "likes": 178, "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": 25438, "totalSubmissionRaw": 64962}, "2905": {"acRate": 32.1738042915081, "difficulty": "Medium", "likes": 258, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2905", "paidOnly": false, "title": "Find Indices With Index and Value Difference II", "titleSlug": "find-indices-with-index-and-value-difference-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18008, "totalSubmissionRaw": 55971}, "2906": {"acRate": 30.906572264121902, "difficulty": "Medium", "likes": 220, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2906", "paidOnly": false, "title": "Construct Product Matrix", "titleSlug": "construct-product-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12048, "totalSubmissionRaw": 38982}, "2907": {"acRate": 56.44581407293272, "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": 1099, "totalSubmissionRaw": 1947}, "2908": {"acRate": 65.06506506506507, "difficulty": "Easy", "likes": 154, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2908", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets I", "titleSlug": "minimum-sum-of-mountain-triplets-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34450, "totalSubmissionRaw": 52947}, "2909": {"acRate": 54.175736052239664, "difficulty": "Medium", "likes": 189, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2909", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets II", "titleSlug": "minimum-sum-of-mountain-triplets-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23645, "totalSubmissionRaw": 43645}, "2910": {"acRate": 25.038274182324287, "difficulty": "Medium", "likes": 368, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "2910", "paidOnly": false, "title": "Minimum Number of Groups to Create a Valid Assignment", "titleSlug": "minimum-number-of-groups-to-create-a-valid-assignment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12593, "totalSubmissionRaw": 50295}, "2911": {"acRate": 36.421785344746496, "difficulty": "Hard", "likes": 121, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2911", "paidOnly": false, "title": "Minimum Changes to Make K Semi-palindromes", "titleSlug": "minimum-changes-to-make-k-semi-palindromes", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3872, "totalSubmissionRaw": 10631}, "2912": {"acRate": 63.05828917486752, "difficulty": "Hard", "likes": 15, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2912", "paidOnly": true, "title": "Number of Ways to Reach Destination in the Grid", "titleSlug": "number-of-ways-to-reach-destination-in-the-grid", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 833, "totalSubmissionRaw": 1321}, "2913": {"acRate": 82.7964680347277, "difficulty": "Easy", "likes": 145, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2913", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares I", "titleSlug": "subarrays-distinct-element-sum-of-squares-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33569, "totalSubmissionRaw": 40544}, "2914": {"acRate": 60.00693503136526, "difficulty": "Medium", "likes": 142, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2914", "paidOnly": false, "title": "Minimum Number of Changes to Make Binary String Beautiful", "titleSlug": "minimum-number-of-changes-to-make-binary-string-beautiful", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19036, "totalSubmissionRaw": 31723}, "2915": {"acRate": 35.74745304594913, "difficulty": "Medium", "likes": 217, "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": 20632, "totalSubmissionRaw": 57716}, "2916": {"acRate": 21.23954010476903, "difficulty": "Hard", "likes": 141, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2916", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares II", "titleSlug": "subarrays-distinct-element-sum-of-squares-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3122, "totalSubmissionRaw": 14699}, "2917": {"acRate": 74.69249339004483, "difficulty": "Easy", "likes": 219, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "2917", "paidOnly": false, "title": "Find the K-or of an Array", "titleSlug": "find-the-k-or-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25990, "totalSubmissionRaw": 34796}, "2918": {"acRate": 35.243398362425296, "difficulty": "Medium", "likes": 176, "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": 26773, "totalSubmissionRaw": 75966}, "2919": {"acRate": 34.34444472229863, "difficulty": "Medium", "likes": 312, "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": 13734, "totalSubmissionRaw": 39989}, "2920": {"acRate": 37.528908133641686, "difficulty": "Hard", "likes": 196, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2920", "paidOnly": false, "title": "Maximum Points After Collecting Coins From All Nodes", "titleSlug": "maximum-points-after-collecting-coins-from-all-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7627, "totalSubmissionRaw": 20323}, "2921": {"acRate": 49.21402660217654, "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": 407, "totalSubmissionRaw": 827}, "2922": {"acRate": 40.53186611646034, "difficulty": "Medium", "likes": 12, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2922", "paidOnly": true, "title": "Market Analysis III", "titleSlug": "market-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1768, "totalSubmissionRaw": 4362}, "2923": {"acRate": 73.47172569080962, "difficulty": "Easy", "likes": 138, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2923", "paidOnly": false, "title": "Find Champion I", "titleSlug": "find-champion-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37198, "totalSubmissionRaw": 50629}, "2924": {"acRate": 58.53816879337362, "difficulty": "Medium", "likes": 147, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2924", "paidOnly": false, "title": "Find Champion II", "titleSlug": "find-champion-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26149, "totalSubmissionRaw": 44670}, "2925": {"acRate": 49.542735867258344, "difficulty": "Medium", "likes": 318, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2925", "paidOnly": false, "title": "Maximum Score After Applying Operations on a Tree", "titleSlug": "maximum-score-after-applying-operations-on-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12839, "totalSubmissionRaw": 25915}, "2926": {"acRate": 24.04119167690808, "difficulty": "Hard", "likes": 191, "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": 5673, "totalSubmissionRaw": 23597}, "2927": {"acRate": 44.29301533219762, "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": 520, "totalSubmissionRaw": 1174}, "2928": {"acRate": 75.87711487088157, "difficulty": "Easy", "likes": 102, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2928", "paidOnly": false, "title": "Distribute Candies Among Children I", "titleSlug": "distribute-candies-among-children-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25563, "totalSubmissionRaw": 33690}, "2929": {"acRate": 35.272109822430714, "difficulty": "Medium", "likes": 90, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "2929", "paidOnly": false, "title": "Distribute Candies Among Children II", "titleSlug": "distribute-candies-among-children-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12256, "totalSubmissionRaw": 34747}, "2930": {"acRate": 56.4009442527692, "difficulty": "Medium", "likes": 165, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2930", "paidOnly": false, "title": "Number of Strings Which Can Be Rearranged to Contain Substring", "titleSlug": "number-of-strings-which-can-be-rearranged-to-contain-substring", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6212, "totalSubmissionRaw": 11014}, "2931": {"acRate": 65.49950421417947, "difficulty": "Hard", "likes": 92, "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": 10569, "totalSubmissionRaw": 16136}, "2932": {"acRate": 76.26705358402354, "difficulty": "Easy", "likes": 139, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2932", "paidOnly": false, "title": "Maximum Strong Pair XOR I", "titleSlug": "maximum-strong-pair-xor-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37846, "totalSubmissionRaw": 49623}, "2933": {"acRate": 44.32198833795128, "difficulty": "Medium", "likes": 190, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2933", "paidOnly": false, "title": "High-Access Employees", "titleSlug": "high-access-employees", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21435, "totalSubmissionRaw": 48362}, "2934": {"acRate": 44.961868621744095, "difficulty": "Medium", "likes": 180, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2934", "paidOnly": false, "title": "Minimum Operations to Maximize Last Elements in Arrays", "titleSlug": "minimum-operations-to-maximize-last-elements-in-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12204, "totalSubmissionRaw": 27143}, "2935": {"acRate": 30.395211950338823, "difficulty": "Hard", "likes": 171, "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": 6145, "totalSubmissionRaw": 20217}, "2936": {"acRate": 66.5530303030303, "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": 1757, "totalSubmissionRaw": 2640}, "2937": {"acRate": 43.24790236460717, "difficulty": "Easy", "likes": 294, "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": 28349, "totalSubmissionRaw": 65550}, "2938": {"acRate": 53.416314736608136, "difficulty": "Medium", "likes": 186, "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": 24032, "totalSubmissionRaw": 44990}, "2939": {"acRate": 26.181182639091173, "difficulty": "Medium", "likes": 201, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2939", "paidOnly": false, "title": "Maximum Xor Product", "titleSlug": "maximum-xor-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8988, "totalSubmissionRaw": 34330}, "2940": {"acRate": 35.41482214467997, "difficulty": "Hard", "likes": 229, "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": 6800, "totalSubmissionRaw": 19201}, "2941": {"acRate": 47.63729246487867, "difficulty": "Hard", "likes": 13, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2941", "paidOnly": true, "title": "Maximum GCD-Sum of a Subarray", "titleSlug": "maximum-gcd-sum-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 373, "totalSubmissionRaw": 783}, "2942": {"acRate": 88.65106403989532, "difficulty": "Easy", "likes": 332, "dislikes": 26, "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": 143636, "totalSubmissionRaw": 162024}, "2943": {"acRate": 36.78182920215651, "difficulty": "Medium", "likes": 224, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "2943", "paidOnly": false, "title": "Maximize Area of Square Hole in Grid", "titleSlug": "maximize-area-of-square-hole-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11530, "totalSubmissionRaw": 31347}, "2944": {"acRate": 45.90603631219052, "difficulty": "Medium", "likes": 250, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2944", "paidOnly": false, "title": "Minimum Number of Coins for Fruits", "titleSlug": "minimum-number-of-coins-for-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15575, "totalSubmissionRaw": 33928}, "2945": {"acRate": 15.988970285620216, "difficulty": "Hard", "likes": 159, "dislikes": 20, "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": 3885, "totalSubmissionRaw": 24298}, "2946": {"acRate": 58.21487011658826, "difficulty": "Easy", "likes": 172, "dislikes": 62, "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": 22769, "totalSubmissionRaw": 39112}, "2947": {"acRate": 61.978028647730035, "difficulty": "Medium", "likes": 135, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2947", "paidOnly": false, "title": "Count Beautiful Substrings I", "titleSlug": "count-beautiful-substrings-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20423, "totalSubmissionRaw": 32952}, "2948": {"acRate": 39.61108627626285, "difficulty": "Medium", "likes": 255, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2948", "paidOnly": false, "title": "Make Lexicographically Smallest Array by Swapping Elements", "titleSlug": "make-lexicographically-smallest-array-by-swapping-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8861, "totalSubmissionRaw": 22370}, "2949": {"acRate": 25.223685533326627, "difficulty": "Hard", "likes": 175, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2949", "paidOnly": false, "title": "Count Beautiful Substrings II", "titleSlug": "count-beautiful-substrings-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5018, "totalSubmissionRaw": 19894}, "2950": {"acRate": 76.29310344827587, "difficulty": "Medium", "likes": 22, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2950", "paidOnly": true, "title": "Number of Divisible Substrings", "titleSlug": "number-of-divisible-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1239, "totalSubmissionRaw": 1624}, "2951": {"acRate": 75.69615874463435, "difficulty": "Easy", "likes": 151, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2951", "paidOnly": false, "title": "Find the Peaks", "titleSlug": "find-the-peaks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48142, "totalSubmissionRaw": 63599}, "2952": {"acRate": 56.65141811527905, "difficulty": "Medium", "likes": 343, "dislikes": 53, "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": 18576, "totalSubmissionRaw": 32790}, "2953": {"acRate": 27.73610775062505, "difficulty": "Hard", "likes": 195, "dislikes": 34, "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": 6878, "totalSubmissionRaw": 24798}, "2954": {"acRate": 36.65121668597914, "difficulty": "Hard", "likes": 114, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2954", "paidOnly": false, "title": "Count the Number of Infection Sequences", "titleSlug": "count-the-number-of-infection-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3163, "totalSubmissionRaw": 8630}, "2955": {"acRate": 70.81199707388441, "difficulty": "Medium", "likes": 28, "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": 968, "totalSubmissionRaw": 1367}, "2956": {"acRate": 83.59251431210896, "difficulty": "Easy", "likes": 213, "dislikes": 85, "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": 59721, "totalSubmissionRaw": 71443}, "2957": {"acRate": 52.575900297079926, "difficulty": "Medium", "likes": 161, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2957", "paidOnly": false, "title": "Remove Adjacent Almost-Equal Characters", "titleSlug": "remove-adjacent-almost-equal-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21768, "totalSubmissionRaw": 41403}, "2958": {"acRate": 55.8188354357341, "difficulty": "Medium", "likes": 1025, "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": 147041, "totalSubmissionRaw": 263427}, "2959": {"acRate": 51.27937336814622, "difficulty": "Hard", "likes": 157, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2959", "paidOnly": false, "title": "Number of Possible Sets of Closing Branches", "titleSlug": "number-of-possible-sets-of-closing-branches", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6874, "totalSubmissionRaw": 13405}, "2960": {"acRate": 80.76253413003047, "difficulty": "Easy", "likes": 137, "dislikes": 11, "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": 40819, "totalSubmissionRaw": 50542}, "2961": {"acRate": 47.96872499485608, "difficulty": "Medium", "likes": 110, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2961", "paidOnly": false, "title": "Double Modular Exponentiation", "titleSlug": "double-modular-exponentiation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20982, "totalSubmissionRaw": 43741}, "2962": {"acRate": 58.96658452084357, "difficulty": "Medium", "likes": 1208, "dislikes": 57, "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": 130884, "totalSubmissionRaw": 221963}, "2963": {"acRate": 49.81430339967622, "difficulty": "Hard", "likes": 239, "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": 10462, "totalSubmissionRaw": 21002}, "2964": {"acRate": 66.9215291750503, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2964", "paidOnly": true, "title": "Number of Divisible Triplet Sums", "titleSlug": "number-of-divisible-triplet-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1663, "totalSubmissionRaw": 2485}, "2965": {"acRate": 75.85298259960929, "difficulty": "Easy", "likes": 194, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2965", "paidOnly": false, "title": "Find Missing and Repeated Values", "titleSlug": "find-missing-and-repeated-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50088, "totalSubmissionRaw": 66033}, "2966": {"acRate": 71.62571013970428, "difficulty": "Medium", "likes": 826, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "2966", "paidOnly": false, "title": "Divide Array Into Arrays With Max Difference", "titleSlug": "divide-array-into-arrays-with-max-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151040, "totalSubmissionRaw": 210874}, "2967": {"acRate": 22.15029260966389, "difficulty": "Medium", "likes": 222, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2967", "paidOnly": false, "title": "Minimum Cost to Make Array Equalindromic", "titleSlug": "minimum-cost-to-make-array-equalindromic", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12831, "totalSubmissionRaw": 57927}, "2968": {"acRate": 38.48837209302325, "difficulty": "Hard", "likes": 237, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2968", "paidOnly": false, "title": "Apply Operations to Maximize Frequency Score", "titleSlug": "apply-operations-to-maximize-frequency-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6289, "totalSubmissionRaw": 16340}, "2969": {"acRate": 54.197761194029844, "difficulty": "Hard", "likes": 18, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2969", "paidOnly": true, "title": "Minimum Number of Coins for Fruits II", "titleSlug": "minimum-number-of-coins-for-fruits-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 581, "totalSubmissionRaw": 1072}, "2970": {"acRate": 51.908744839418794, "difficulty": "Easy", "likes": 145, "dislikes": 91, "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": 19363, "totalSubmissionRaw": 37302}, "2971": {"acRate": 66.07259783673611, "difficulty": "Medium", "likes": 781, "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": 134206, "totalSubmissionRaw": 203119}, "2972": {"acRate": 39.86797928640528, "difficulty": "Hard", "likes": 191, "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": 7006, "totalSubmissionRaw": 17573}, "2973": {"acRate": 37.072148033362204, "difficulty": "Hard", "likes": 172, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2973", "paidOnly": false, "title": "Find Number of Coins to Place in Tree Nodes", "titleSlug": "find-number-of-coins-to-place-in-tree-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8134, "totalSubmissionRaw": 21941}, "2974": {"acRate": 85.8969595640597, "difficulty": "Easy", "likes": 224, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2974", "paidOnly": false, "title": "Minimum Number Game", "titleSlug": "minimum-number-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83229, "totalSubmissionRaw": 96894}, "2975": {"acRate": 22.8550099535501, "difficulty": "Medium", "likes": 135, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "2975", "paidOnly": false, "title": "Maximum Square Area by Removing Fences From a Field", "titleSlug": "maximum-square-area-by-removing-fences-from-a-field", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13777, "totalSubmissionRaw": 60280}, "2976": {"acRate": 58.68627184775487, "difficulty": "Medium", "likes": 854, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2976", "paidOnly": false, "title": "Minimum Cost to Convert String I", "titleSlug": "minimum-cost-to-convert-string-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99421, "totalSubmissionRaw": 169411}, "2977": {"acRate": 25.24541884816754, "difficulty": "Hard", "likes": 95, "dislikes": 72, "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": 4629, "totalSubmissionRaw": 18336}, "2978": {"acRate": 42.37007613373056, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2978", "paidOnly": true, "title": "Symmetric Coordinates", "titleSlug": "symmetric-coordinates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1280, "totalSubmissionRaw": 3021}, "2979": {"acRate": 77.22526106414719, "difficulty": "Medium", "likes": 15, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2979", "paidOnly": true, "title": "Most Expensive Item That Can Not Be Bought", "titleSlug": "most-expensive-item-that-can-not-be-bought", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1553, "totalSubmissionRaw": 2011}, "2980": {"acRate": 70.69604831020236, "difficulty": "Easy", "likes": 105, "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": 33365, "totalSubmissionRaw": 47195}, "2981": {"acRate": 42.951254376333615, "difficulty": "Medium", "likes": 162, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2981", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice I", "titleSlug": "find-longest-special-substring-that-occurs-thrice-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20733, "totalSubmissionRaw": 48271}, "2982": {"acRate": 34.041409516225364, "difficulty": "Medium", "likes": 248, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2982", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice II", "titleSlug": "find-longest-special-substring-that-occurs-thrice-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17099, "totalSubmissionRaw": 50230}, "2983": {"acRate": 25.88608122758736, "difficulty": "Hard", "likes": 85, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2983", "paidOnly": false, "title": "Palindrome Rearrangement Queries", "titleSlug": "palindrome-rearrangement-queries", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3104, "totalSubmissionRaw": 11991}, "2984": {"acRate": 61.327231121281464, "difficulty": "Medium", "likes": 8, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2984", "paidOnly": true, "title": "Find Peak Calling Hours for Each City", "titleSlug": "find-peak-calling-hours-for-each-city", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1608, "totalSubmissionRaw": 2622}, "2985": {"acRate": 87.17731696995344, "difficulty": "Easy", "likes": 7, "dislikes": 3, "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": 2060, "totalSubmissionRaw": 2363}, "2986": {"acRate": 52.10006176652254, "difficulty": "Medium", "likes": 7, "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": 1687, "totalSubmissionRaw": 3238}, "2987": {"acRate": 78.79688080207946, "difficulty": "Easy", "likes": 7, "dislikes": 5, "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": 2122, "totalSubmissionRaw": 2693}, "2988": {"acRate": 79.50617283950618, "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": 1931, "totalSubmissionRaw": 2429}, "2989": {"acRate": 89.0188679245283, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2989", "paidOnly": true, "title": "Class Performance", "titleSlug": "class-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2359, "totalSubmissionRaw": 2650}, "2990": {"acRate": 61.51947339550192, "difficulty": "Easy", "likes": 13, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2990", "paidOnly": true, "title": "Loan Types", "titleSlug": "loan-types", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2243, "totalSubmissionRaw": 3646}, "2991": {"acRate": 53.799126637554586, "difficulty": "Hard", "likes": 8, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2991", "paidOnly": true, "title": "Top Three Wineries ", "titleSlug": "top-three-wineries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1232, "totalSubmissionRaw": 2290}, "2992": {"acRate": 73.32528666264334, "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": 1215, "totalSubmissionRaw": 1657}, "2993": {"acRate": 80.63583815028902, "difficulty": "Medium", "likes": 9, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2993", "paidOnly": true, "title": "Friday Purchases I", "titleSlug": "friday-purchases-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1674, "totalSubmissionRaw": 2076}, "2994": {"acRate": 73.35984095427436, "difficulty": "Hard", "likes": 10, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2994", "paidOnly": true, "title": "Friday Purchases II ", "titleSlug": "friday-purchases-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1107, "totalSubmissionRaw": 1509}, "2995": {"acRate": 42.80483339436104, "difficulty": "Hard", "likes": 5, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2995", "paidOnly": true, "title": "Viewers Turned Streamers", "titleSlug": "viewers-turned-streamers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1169, "totalSubmissionRaw": 2731}, "2996": {"acRate": 32.58871887576129, "difficulty": "Easy", "likes": 106, "dislikes": 230, "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": 30286, "totalSubmissionRaw": 92934}, "2997": {"acRate": 86.4150404342616, "difficulty": "Medium", "likes": 565, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2997", "paidOnly": false, "title": "Minimum Number of Operations to Make Array XOR Equal to K", "titleSlug": "minimum-number-of-operations-to-make-array-xor-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108889, "totalSubmissionRaw": 126007}, "2998": {"acRate": 46.4262183069377, "difficulty": "Medium", "likes": 240, "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": 19023, "totalSubmissionRaw": 40976}, "2999": {"acRate": 26.250071596311358, "difficulty": "Hard", "likes": 105, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2999", "paidOnly": false, "title": "Count the Number of Powerful Integers", "titleSlug": "count-the-number-of-powerful-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4583, "totalSubmissionRaw": 17459}, "3000": {"acRate": 36.12002166305616, "difficulty": "Easy", "likes": 102, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3000", "paidOnly": false, "title": "Maximum Area of Longest Diagonal Rectangle", "titleSlug": "maximum-area-of-longest-diagonal-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34681, "totalSubmissionRaw": 96016}, "3001": {"acRate": 20.956396049144786, "difficulty": "Medium", "likes": 150, "dislikes": 194, "categoryTitle": "Algorithms", "frontendQuestionId": "3001", "paidOnly": false, "title": "Minimum Moves to Capture The Queen", "titleSlug": "minimum-moves-to-capture-the-queen", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17398, "totalSubmissionRaw": 83020}, "3002": {"acRate": 45.69300423543158, "difficulty": "Medium", "likes": 279, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3002", "paidOnly": false, "title": "Maximum Size of a Set After Removals", "titleSlug": "maximum-size-of-a-set-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15643, "totalSubmissionRaw": 34235}, "3003": {"acRate": 28.158347676419965, "difficulty": "Hard", "likes": 130, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3003", "paidOnly": false, "title": "Maximize the Number of Partitions After Operations", "titleSlug": "maximize-the-number-of-partitions-after-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3272, "totalSubmissionRaw": 11620}, "3004": {"acRate": 64.79459178367135, "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": 1246, "totalSubmissionRaw": 1923}, "3005": {"acRate": 78.7684331147972, "difficulty": "Easy", "likes": 633, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "3005", "paidOnly": false, "title": "Count Elements With Maximum Frequency", "titleSlug": "count-elements-with-maximum-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209654, "totalSubmissionRaw": 266165}, "3006": {"acRate": 36.411605705083964, "difficulty": "Medium", "likes": 150, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3006", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array I", "titleSlug": "find-beautiful-indices-in-the-given-array-i", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25325, "totalSubmissionRaw": 69552}, "3007": {"acRate": 36.444370668547954, "difficulty": "Medium", "likes": 285, "dislikes": 111, "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": 8782, "totalSubmissionRaw": 24097}, "3008": {"acRate": 24.56020993293809, "difficulty": "Hard", "likes": 158, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3008", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array II", "titleSlug": "find-beautiful-indices-in-the-given-array-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10108, "totalSubmissionRaw": 41156}, "3009": {"acRate": 45.945251253052305, "difficulty": "Hard", "likes": 28, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3009", "paidOnly": true, "title": "Maximum Number of Intersections on the Chart", "titleSlug": "maximum-number-of-intersections-on-the-chart", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3575, "totalSubmissionRaw": 7781}, "3010": {"acRate": 66.3278092158448, "difficulty": "Easy", "likes": 89, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3010", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost I", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32819, "totalSubmissionRaw": 49480}, "3011": {"acRate": 51.469624743013355, "difficulty": "Medium", "likes": 114, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3011", "paidOnly": false, "title": "Find if Array Can Be Sorted", "titleSlug": "find-if-array-can-be-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22782, "totalSubmissionRaw": 44263}, "3012": {"acRate": 35.28608599325038, "difficulty": "Medium", "likes": 161, "dislikes": 41, "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": 13697, "totalSubmissionRaw": 38816}, "3013": {"acRate": 31.96846388606307, "difficulty": "Hard", "likes": 113, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3013", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost II", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5028, "totalSubmissionRaw": 15728}, "3014": {"acRate": 66.30965111616094, "difficulty": "Easy", "likes": 154, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "3014", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word I", "titleSlug": "minimum-number-of-pushes-to-type-word-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39683, "totalSubmissionRaw": 59844}, "3015": {"acRate": 56.2375885473784, "difficulty": "Medium", "likes": 146, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "3015", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance I", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-i", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18974, "totalSubmissionRaw": 33739}, "3016": {"acRate": 80.70301639917955, "difficulty": "Medium", "likes": 712, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "3016", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word II", "titleSlug": "minimum-number-of-pushes-to-type-word-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 166006, "totalSubmissionRaw": 205703}, "3017": {"acRate": 21.69171824344238, "difficulty": "Hard", "likes": 79, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "3017", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance II", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2944, "totalSubmissionRaw": 13572}, "3018": {"acRate": 43.78265412748171, "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": 419, "totalSubmissionRaw": 957}, "3019": {"acRate": 80.9125807862384, "difficulty": "Easy", "likes": 110, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3019", "paidOnly": false, "title": "Number of Changing Keys", "titleSlug": "number-of-changing-keys", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49953, "totalSubmissionRaw": 61737}, "3020": {"acRate": 24.70992053128381, "difficulty": "Medium", "likes": 170, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "3020", "paidOnly": false, "title": "Find the Maximum Number of Elements in Subset", "titleSlug": "find-the-maximum-number-of-elements-in-subset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19869, "totalSubmissionRaw": 80408}, "3021": {"acRate": 47.77886497064579, "difficulty": "Medium", "likes": 90, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "3021", "paidOnly": false, "title": "Alice and Bob Playing Flower Game", "titleSlug": "alice-and-bob-playing-flower-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19532, "totalSubmissionRaw": 40880}, "3022": {"acRate": 33.84408902807292, "difficulty": "Hard", "likes": 88, "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": 3026, "totalSubmissionRaw": 8941}, "3023": {"acRate": 59.138187221396734, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3023", "paidOnly": true, "title": "Find Pattern in Infinite Stream I", "titleSlug": "find-pattern-in-infinite-stream-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 796, "totalSubmissionRaw": 1346}, "3024": {"acRate": 38.25822784810127, "difficulty": "Easy", "likes": 90, "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": 45336, "totalSubmissionRaw": 118500}, "3025": {"acRate": 41.13311561853971, "difficulty": "Medium", "likes": 82, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "3025", "paidOnly": false, "title": "Find the Number of Ways to Place People I", "titleSlug": "find-the-number-of-ways-to-place-people-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13729, "totalSubmissionRaw": 33377}, "3026": {"acRate": 18.24683392322068, "difficulty": "Medium", "likes": 310, "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": 17477, "totalSubmissionRaw": 95781}, "3027": {"acRate": 47.80058651026393, "difficulty": "Hard", "likes": 91, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3027", "paidOnly": false, "title": "Find the Number of Ways to Place People II", "titleSlug": "find-the-number-of-ways-to-place-people-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8802, "totalSubmissionRaw": 18414}, "3028": {"acRate": 74.90110664467257, "difficulty": "Easy", "likes": 101, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3028", "paidOnly": false, "title": "Ant on the Boundary", "titleSlug": "ant-on-the-boundary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46769, "totalSubmissionRaw": 62441}, "3029": {"acRate": 40.826353760676675, "difficulty": "Medium", "likes": 139, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3029", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State I", "titleSlug": "minimum-time-to-revert-word-to-initial-state-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19693, "totalSubmissionRaw": 48236}, "3030": {"acRate": 44.152526911147596, "difficulty": "Medium", "likes": 76, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "3030", "paidOnly": false, "title": "Find the Grid of Region Average", "titleSlug": "find-the-grid-of-region-average", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9680, "totalSubmissionRaw": 21924}, "3031": {"acRate": 35.61197273535513, "difficulty": "Hard", "likes": 128, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3031", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State II", "titleSlug": "minimum-time-to-revert-word-to-initial-state-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10815, "totalSubmissionRaw": 30369}, "3032": {"acRate": 86.95064232589587, "difficulty": "Easy", "likes": 22, "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": 3858, "totalSubmissionRaw": 4437}, "3033": {"acRate": 68.49499144881504, "difficulty": "Easy", "likes": 108, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3033", "paidOnly": false, "title": "Modify the Matrix", "titleSlug": "modify-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39249, "totalSubmissionRaw": 57302}, "3034": {"acRate": 66.68751465874443, "difficulty": "Medium", "likes": 90, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3034", "paidOnly": false, "title": "Number of Subarrays That Match a Pattern I", "titleSlug": "number-of-subarrays-that-match-a-pattern-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25590, "totalSubmissionRaw": 38373}, "3035": {"acRate": 42.5734356937487, "difficulty": "Medium", "likes": 208, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3035", "paidOnly": false, "title": "Maximum Palindromes After Operations", "titleSlug": "maximum-palindromes-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14363, "totalSubmissionRaw": 33737}, "3036": {"acRate": 32.47017922436013, "difficulty": "Hard", "likes": 140, "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": 10834, "totalSubmissionRaw": 33366}, "3037": {"acRate": 72.40384615384615, "difficulty": "Hard", "likes": 4, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3037", "paidOnly": true, "title": "Find Pattern in Infinite Stream II", "titleSlug": "find-pattern-in-infinite-stream-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 753, "totalSubmissionRaw": 1040}, "3038": {"acRate": 52.07109858272649, "difficulty": "Easy", "likes": 73, "dislikes": 20, "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": 33250, "totalSubmissionRaw": 63855}, "3039": {"acRate": 56.74638192728556, "difficulty": "Medium", "likes": 127, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3039", "paidOnly": false, "title": "Apply Operations to Make String Empty", "titleSlug": "apply-operations-to-make-string-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25722, "totalSubmissionRaw": 45328}, "3040": {"acRate": 33.298725171480605, "difficulty": "Medium", "likes": 150, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3040", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score II", "titleSlug": "maximum-number-of-operations-with-the-same-score-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19564, "totalSubmissionRaw": 58753}, "3041": {"acRate": 32.1423975981128, "difficulty": "Hard", "likes": 148, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3041", "paidOnly": false, "title": "Maximize Consecutive Elements in an Array After Modification", "titleSlug": "maximize-consecutive-elements-in-an-array-after-modification", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7494, "totalSubmissionRaw": 23315}, "3042": {"acRate": 65.22853704898593, "difficulty": "Easy", "likes": 100, "dislikes": 3, "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": 37404, "totalSubmissionRaw": 57343}, "3043": {"acRate": 34.86886398659465, "difficulty": "Medium", "likes": 160, "dislikes": 13, "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": 23304, "totalSubmissionRaw": 66837}, "3044": {"acRate": 48.24378203911145, "difficulty": "Medium", "likes": 86, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "3044", "paidOnly": false, "title": "Most Frequent Prime", "titleSlug": "most-frequent-prime", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15246, "totalSubmissionRaw": 31602}, "3045": {"acRate": 24.829102297708314, "difficulty": "Hard", "likes": 152, "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": 8245, "totalSubmissionRaw": 33207}, "3046": {"acRate": 58.557771689060644, "difficulty": "Easy", "likes": 102, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3046", "paidOnly": false, "title": "Split the Array", "titleSlug": "split-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48942, "totalSubmissionRaw": 83579}, "3047": {"acRate": 45.29087167976057, "difficulty": "Medium", "likes": 101, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3047", "paidOnly": false, "title": "Find the Largest Area of Square Inside Two Rectangles", "titleSlug": "find-the-largest-area-of-square-inside-two-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19370, "totalSubmissionRaw": 42768}, "3048": {"acRate": 35.92122038070954, "difficulty": "Medium", "likes": 172, "dislikes": 78, "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": 8171, "totalSubmissionRaw": 22747}, "3049": {"acRate": 22.708272577038983, "difficulty": "Hard", "likes": 73, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3049", "paidOnly": false, "title": "Earliest Second to Mark Indices II", "titleSlug": "earliest-second-to-mark-indices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2336, "totalSubmissionRaw": 10287}, "3050": {"acRate": 68.45238095238095, "difficulty": "Medium", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3050", "paidOnly": true, "title": "Pizza Toppings Cost Analysis", "titleSlug": "pizza-toppings-cost-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1265, "totalSubmissionRaw": 1848}, "3051": {"acRate": 74.17448731317344, "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": 2134, "totalSubmissionRaw": 2877}, "3052": {"acRate": 73.47740667976424, "difficulty": "Hard", "likes": 4, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "3052", "paidOnly": true, "title": "Maximize Items", "titleSlug": "maximize-items", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 748, "totalSubmissionRaw": 1018}, "3053": {"acRate": 50.50823694356817, "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": 1441, "totalSubmissionRaw": 2853}, "3054": {"acRate": 79.3296089385475, "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": 1278, "totalSubmissionRaw": 1611}, "3055": {"acRate": 60.37832310838446, "difficulty": "Medium", "likes": 5, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3055", "paidOnly": true, "title": "Top Percentile Fraud", "titleSlug": "top-percentile-fraud", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1181, "totalSubmissionRaw": 1956}, "3056": {"acRate": 59.22518159806296, "difficulty": "Medium", "likes": 2, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3056", "paidOnly": true, "title": "Snaps Analysis", "titleSlug": "snaps-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1223, "totalSubmissionRaw": 2065}, "3057": {"acRate": 68.55482933914307, "difficulty": "Hard", "likes": 5, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3057", "paidOnly": true, "title": "Employees Project Allocation", "titleSlug": "employees-project-allocation", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 944, "totalSubmissionRaw": 1377}, "3058": {"acRate": 52.235872235872236, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3058", "paidOnly": true, "title": "Friends With No Mutual Friends", "titleSlug": "friends-with-no-mutual-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1063, "totalSubmissionRaw": 2035}, "3059": {"acRate": 67.47933884297521, "difficulty": "Easy", "likes": 6, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "3059", "paidOnly": true, "title": "Find All Unique Email Domains", "titleSlug": "find-all-unique-email-domains", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1633, "totalSubmissionRaw": 2420}, "3060": {"acRate": 40.45412418906395, "difficulty": "Hard", "likes": 3, "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": 873, "totalSubmissionRaw": 2158}, "3061": {"acRate": 77.6332899869961, "difficulty": "Hard", "likes": 8, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3061", "paidOnly": true, "title": "Calculate Trapping Rain Water", "titleSlug": "calculate-trapping-rain-water", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 597, "totalSubmissionRaw": 769}, "3062": {"acRate": 80.56002270362312, "difficulty": "Easy", "likes": 26, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3062", "paidOnly": true, "title": "Winner of the Linked List Game", "titleSlug": "winner-of-the-linked-list-game", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8516, "totalSubmissionRaw": 10571}, "3063": {"acRate": 86.10388445321611, "difficulty": "Easy", "likes": 37, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3063", "paidOnly": true, "title": "Linked List Frequency", "titleSlug": "linked-list-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9593, "totalSubmissionRaw": 11142}, "3064": {"acRate": 91.20135363790186, "difficulty": "Medium", "likes": 9, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3064", "paidOnly": true, "title": "Guess the Number Using Bitwise Questions I", "titleSlug": "guess-the-number-using-bitwise-questions-i", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1078, "totalSubmissionRaw": 1182}, "3065": {"acRate": 86.15709961036515, "difficulty": "Easy", "likes": 82, "dislikes": 5, "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": 59482, "totalSubmissionRaw": 69039}, "3066": {"acRate": 27.680936554392577, "difficulty": "Medium", "likes": 84, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3066", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value II", "titleSlug": "minimum-operations-to-exceed-threshold-value-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27901, "totalSubmissionRaw": 100795}, "3067": {"acRate": 57.8119724084704, "difficulty": "Medium", "likes": 186, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3067", "paidOnly": false, "title": "Count Pairs of Connectable Servers in a Weighted Tree Network", "titleSlug": "count-pairs-of-connectable-servers-in-a-weighted-tree-network", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11985, "totalSubmissionRaw": 20731}, "3068": {"acRate": 66.94813829787233, "difficulty": "Hard", "likes": 623, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "3068", "paidOnly": false, "title": "Find the Maximum Sum of Node Values", "titleSlug": "find-the-maximum-sum-of-node-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70483, "totalSubmissionRaw": 105280}, "3069": {"acRate": 72.65072587532025, "difficulty": "Easy", "likes": 74, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3069", "paidOnly": false, "title": "Distribute Elements Into Two Arrays I", "titleSlug": "distribute-elements-into-two-arrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42537, "totalSubmissionRaw": 58550}, "3070": {"acRate": 59.462711433000905, "difficulty": "Medium", "likes": 135, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3070", "paidOnly": false, "title": "Count Submatrices with Top-Left Element and Sum Less Than k", "titleSlug": "count-submatrices-with-top-left-element-and-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25698, "totalSubmissionRaw": 43217}, "3071": {"acRate": 62.813237937475776, "difficulty": "Medium", "likes": 90, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3071", "paidOnly": false, "title": "Minimum Operations to Write the Letter Y on a Grid", "titleSlug": "minimum-operations-to-write-the-letter-y-on-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17822, "totalSubmissionRaw": 28373}, "3072": {"acRate": 27.623249568386726, "difficulty": "Hard", "likes": 129, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3072", "paidOnly": false, "title": "Distribute Elements Into Two Arrays II", "titleSlug": "distribute-elements-into-two-arrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10080, "totalSubmissionRaw": 36491}, "3073": {"acRate": 41.39290407358738, "difficulty": "Medium", "likes": 12, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3073", "paidOnly": true, "title": "Maximum Increasing Triplet Value", "titleSlug": "maximum-increasing-triplet-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 630, "totalSubmissionRaw": 1522}, "3074": {"acRate": 66.96394797334652, "difficulty": "Easy", "likes": 86, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3074", "paidOnly": false, "title": "Apple Redistribution into Boxes", "titleSlug": "apple-redistribution-into-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46027, "totalSubmissionRaw": 68734}, "3075": {"acRate": 55.04072300412791, "difficulty": "Medium", "likes": 640, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "3075", "paidOnly": false, "title": "Maximize Happiness of Selected Children", "titleSlug": "maximize-happiness-of-selected-children", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173206, "totalSubmissionRaw": 314687}, "3076": {"acRate": 45.67986082773136, "difficulty": "Medium", "likes": 126, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3076", "paidOnly": false, "title": "Shortest Uncommon Substring in an Array", "titleSlug": "shortest-uncommon-substring-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21269, "totalSubmissionRaw": 46561}, "3077": {"acRate": 27.854788458933488, "difficulty": "Hard", "likes": 128, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "3077", "paidOnly": false, "title": "Maximum Strength of K Disjoint Subarrays", "titleSlug": "maximum-strength-of-k-disjoint-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6169, "totalSubmissionRaw": 22147}, "3078": {"acRate": 67.46817538896747, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3078", "paidOnly": true, "title": "Match Alphanumerical Pattern in Matrix I", "titleSlug": "match-alphanumerical-pattern-in-matrix-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 477, "totalSubmissionRaw": 707}, "3079": {"acRate": 74.38884218833095, "difficulty": "Easy", "likes": 92, "dislikes": 12, "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": 43362, "totalSubmissionRaw": 58291}, "3080": {"acRate": 49.26557395052576, "difficulty": "Medium", "likes": 111, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3080", "paidOnly": false, "title": "Mark Elements on Array by Performing Queries", "titleSlug": "mark-elements-on-array-by-performing-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17944, "totalSubmissionRaw": 36423}, "3081": {"acRate": 27.269527772602114, "difficulty": "Medium", "likes": 160, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3081", "paidOnly": false, "title": "Replace Question Marks in String to Minimize Its Value", "titleSlug": "replace-question-marks-in-string-to-minimize-its-value", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13172, "totalSubmissionRaw": 48303}, "3082": {"acRate": 38.901753225272905, "difficulty": "Hard", "likes": 132, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3082", "paidOnly": false, "title": "Find the Sum of the Power of All Subsequences", "titleSlug": "find-the-sum-of-the-power-of-all-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7056, "totalSubmissionRaw": 18138}, "3083": {"acRate": 66.12036007493946, "difficulty": "Easy", "likes": 86, "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": 43410, "totalSubmissionRaw": 65653}, "3084": {"acRate": 48.800769241186906, "difficulty": "Medium", "likes": 106, "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": 36034, "totalSubmissionRaw": 73839}, "3085": {"acRate": 43.93582306018855, "difficulty": "Medium", "likes": 191, "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": 19388, "totalSubmissionRaw": 44128}, "3086": {"acRate": 22.711729622266404, "difficulty": "Hard", "likes": 50, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "3086", "paidOnly": false, "title": "Minimum Moves to Pick K Ones", "titleSlug": "minimum-moves-to-pick-k-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2856, "totalSubmissionRaw": 12575}, "3087": {"acRate": 64.00541271989174, "difficulty": "Medium", "likes": 5, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "3087", "paidOnly": true, "title": "Find Trending Hashtags", "titleSlug": "find-trending-hashtags", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 946, "totalSubmissionRaw": 1478}, "3088": {"acRate": 54.109589041095894, "difficulty": "Hard", "likes": 8, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3088", "paidOnly": true, "title": "Make String Anti-palindrome", "titleSlug": "make-string-anti-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 395, "totalSubmissionRaw": 730}, "3089": {"acRate": 40.4883011190234, "difficulty": "Medium", "likes": 7, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "3089", "paidOnly": true, "title": "Find Bursty Behavior", "titleSlug": "find-bursty-behavior", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 796, "totalSubmissionRaw": 1966}, "3090": {"acRate": 63.60805650698963, "difficulty": "Easy", "likes": 165, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3090", "paidOnly": false, "title": "Maximum Length Substring With Two Occurrences", "titleSlug": "maximum-length-substring-with-two-occurrences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38813, "totalSubmissionRaw": 61019}, "3091": {"acRate": 44.53704611563225, "difficulty": "Medium", "likes": 156, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3091", "paidOnly": false, "title": "Apply Operations to Make Sum of Array Greater Than or Equal to k", "titleSlug": "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27254, "totalSubmissionRaw": 61194}, "3092": {"acRate": 42.570245750022025, "difficulty": "Medium", "likes": 221, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3092", "paidOnly": false, "title": "Most Frequent IDs", "titleSlug": "most-frequent-ids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19332, "totalSubmissionRaw": 45412}, "3093": {"acRate": 40.84932000360263, "difficulty": "Hard", "likes": 124, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3093", "paidOnly": false, "title": "Longest Common Suffix Queries", "titleSlug": "longest-common-suffix-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9071, "totalSubmissionRaw": 22206}, "3094": {"acRate": 80.7936507936508, "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": 509, "totalSubmissionRaw": 630}, "3095": {"acRate": 40.952810339645325, "difficulty": "Easy", "likes": 83, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3095", "paidOnly": false, "title": "Shortest Subarray With OR at Least K I", "titleSlug": "shortest-subarray-with-or-at-least-k-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27250, "totalSubmissionRaw": 66540}, "3096": {"acRate": 40.56053011957725, "difficulty": "Medium", "likes": 78, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3096", "paidOnly": false, "title": "Minimum Levels to Gain More Points", "titleSlug": "minimum-levels-to-gain-more-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21607, "totalSubmissionRaw": 53271}, "3097": {"acRate": 30.16901795529498, "difficulty": "Medium", "likes": 185, "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": 13173, "totalSubmissionRaw": 43664}, "3098": {"acRate": 24.350140933291577, "difficulty": "Hard", "likes": 121, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3098", "paidOnly": false, "title": "Find the Sum of Subsequence Powers", "titleSlug": "find-the-sum-of-subsequence-powers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4665, "totalSubmissionRaw": 19158}, "3099": {"acRate": 83.00283694071226, "difficulty": "Easy", "likes": 119, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3099", "paidOnly": false, "title": "Harshad Number", "titleSlug": "harshad-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57638, "totalSubmissionRaw": 69441}, "3100": {"acRate": 63.70852575159035, "difficulty": "Medium", "likes": 136, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3100", "paidOnly": false, "title": "Water Bottles II", "titleSlug": "water-bottles-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34351, "totalSubmissionRaw": 53919}, "3101": {"acRate": 57.09497018495435, "difficulty": "Medium", "likes": 203, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3101", "paidOnly": false, "title": "Count Alternating Subarrays", "titleSlug": "count-alternating-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33895, "totalSubmissionRaw": 59366}, "3102": {"acRate": 32.37497548538929, "difficulty": "Hard", "likes": 158, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3102", "paidOnly": false, "title": "Minimize Manhattan Distances", "titleSlug": "minimize-manhattan-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8254, "totalSubmissionRaw": 25495}, "3103": {"acRate": 65.71798188874514, "difficulty": "Hard", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3103", "paidOnly": true, "title": "Find Trending Hashtags II ", "titleSlug": "find-trending-hashtags-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 508, "totalSubmissionRaw": 773}, "3104": {"acRate": 57.29665071770334, "difficulty": "Hard", "likes": 8, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3104", "paidOnly": true, "title": "Find Longest Self-Contained Substring", "titleSlug": "find-longest-self-contained-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 479, "totalSubmissionRaw": 836}, "3105": {"acRate": 56.94972660342428, "difficulty": "Easy", "likes": 108, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3105", "paidOnly": false, "title": "Longest Strictly Increasing or Strictly Decreasing Subarray", "titleSlug": "longest-strictly-increasing-or-strictly-decreasing-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39682, "totalSubmissionRaw": 69679}, "3106": {"acRate": 63.43967917443612, "difficulty": "Medium", "likes": 143, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3106", "paidOnly": false, "title": "Lexicographically Smallest String After Operations With Constraint", "titleSlug": "lexicographically-smallest-string-after-operations-with-constraint", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24836, "totalSubmissionRaw": 39149}, "3107": {"acRate": 48.47143115905569, "difficulty": "Medium", "likes": 129, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "3107", "paidOnly": false, "title": "Minimum Operations to Make Median of Array Equal to K", "titleSlug": "minimum-operations-to-make-median-of-array-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24084, "totalSubmissionRaw": 49687}, "3108": {"acRate": 45.67672871817073, "difficulty": "Hard", "likes": 174, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3108", "paidOnly": false, "title": "Minimum Cost Walk in Weighted Graph", "titleSlug": "minimum-cost-walk-in-weighted-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11606, "totalSubmissionRaw": 25409}, "3109": {"acRate": 41.340782122905026, "difficulty": "Medium", "likes": 10, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3109", "paidOnly": true, "title": "Find the Index of Permutation", "titleSlug": "find-the-index-of-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 370, "totalSubmissionRaw": 895}, "3110": {"acRate": 93.33144227545837, "difficulty": "Easy", "likes": 562, "dislikes": 35, "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": 253345, "totalSubmissionRaw": 271447}, "3111": {"acRate": 63.7234905266262, "difficulty": "Medium", "likes": 87, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3111", "paidOnly": false, "title": "Minimum Rectangles to Cover Points", "titleSlug": "minimum-rectangles-to-cover-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25931, "totalSubmissionRaw": 40693}, "3112": {"acRate": 34.58974164709448, "difficulty": "Medium", "likes": 150, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3112", "paidOnly": false, "title": "Minimum Time to Visit Disappearing Nodes", "titleSlug": "minimum-time-to-visit-disappearing-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18262, "totalSubmissionRaw": 52796}, "3113": {"acRate": 29.72551951895816, "difficulty": "Hard", "likes": 199, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3113", "paidOnly": false, "title": "Find the Number of Subarrays Where Boundary Elements Are Maximum", "titleSlug": "find-the-number-of-subarrays-where-boundary-elements-are-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9541, "totalSubmissionRaw": 32097}, "3114": {"acRate": 35.5338135684335, "difficulty": "Easy", "likes": 90, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3114", "paidOnly": false, "title": "Latest Time You Can Obtain After Replacing Characters", "titleSlug": "latest-time-you-can-obtain-after-replacing-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33050, "totalSubmissionRaw": 93010}, "3115": {"acRate": 58.28287030616804, "difficulty": "Medium", "likes": 101, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3115", "paidOnly": false, "title": "Maximum Prime Difference", "titleSlug": "maximum-prime-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37825, "totalSubmissionRaw": 64899}, "3116": {"acRate": 16.38060084076694, "difficulty": "Hard", "likes": 209, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3116", "paidOnly": false, "title": "Kth Smallest Amount With Single Denomination Combination", "titleSlug": "kth-smallest-amount-with-single-denomination-combination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7988, "totalSubmissionRaw": 48765}, "3117": {"acRate": 27.538757360894124, "difficulty": "Hard", "likes": 107, "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": 4583, "totalSubmissionRaw": 16642}, "3118": {"acRate": 62.098138747884946, "difficulty": "Medium", "likes": 3, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3118", "paidOnly": true, "title": "Friday Purchase III ", "titleSlug": "friday-purchase-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 734, "totalSubmissionRaw": 1182}, "3119": {"acRate": 61.44393241167435, "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": 800, "totalSubmissionRaw": 1302}, "3120": {"acRate": 65.44584797070036, "difficulty": "Easy", "likes": 120, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3120", "paidOnly": false, "title": "Count the Number of Special Characters I", "titleSlug": "count-the-number-of-special-characters-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43780, "totalSubmissionRaw": 66895}, "3121": {"acRate": 41.36575144901902, "difficulty": "Medium", "likes": 139, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3121", "paidOnly": false, "title": "Count the Number of Special Characters II", "titleSlug": "count-the-number-of-special-characters-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30403, "totalSubmissionRaw": 73498}, "3122": {"acRate": 41.117643668222954, "difficulty": "Medium", "likes": 209, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3122", "paidOnly": false, "title": "Minimum Number of Operations to Satisfy Conditions", "titleSlug": "minimum-number-of-operations-to-satisfy-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14267, "totalSubmissionRaw": 34698}, "3123": {"acRate": 48.787293410603134, "difficulty": "Hard", "likes": 218, "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": 11365, "totalSubmissionRaw": 23295}, "3124": {"acRate": 71.57894736842105, "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": 884, "totalSubmissionRaw": 1235}, "3125": {"acRate": 68.77192982456141, "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": 588, "totalSubmissionRaw": 855}, "3126": {"acRate": 55.81829495955196, "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": 897, "totalSubmissionRaw": 1607}, "3127": {"acRate": 51.012022213633315, "difficulty": "Easy", "likes": 66, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3127", "paidOnly": false, "title": "Make a Square with the Same Color", "titleSlug": "make-a-square-with-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25077, "totalSubmissionRaw": 49159}, "3128": {"acRate": 47.41138782680583, "difficulty": "Medium", "likes": 100, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3128", "paidOnly": false, "title": "Right Triangles", "titleSlug": "right-triangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18352, "totalSubmissionRaw": 38708}, "3129": {"acRate": 26.93499554764025, "difficulty": "Medium", "likes": 111, "dislikes": 33, "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": 7562, "totalSubmissionRaw": 28075}, "3130": {"acRate": 28.08621187337631, "difficulty": "Hard", "likes": 58, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3130", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays II", "titleSlug": "find-all-possible-stable-binary-arrays-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2919, "totalSubmissionRaw": 10393}, "3131": {"acRate": 82.0570054945055, "difficulty": "Easy", "likes": 112, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3131", "paidOnly": false, "title": "Find the Integer Added to Array I", "titleSlug": "find-the-integer-added-to-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52568, "totalSubmissionRaw": 64063}, "3132": {"acRate": 31.03714137445326, "difficulty": "Medium", "likes": 147, "dislikes": 35, "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": 20933, "totalSubmissionRaw": 67445}, "3133": {"acRate": 37.84228431208522, "difficulty": "Medium", "likes": 194, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3133", "paidOnly": false, "title": "Minimum Array End", "titleSlug": "minimum-array-end", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13571, "totalSubmissionRaw": 35862}, "3134": {"acRate": 28.19647355163728, "difficulty": "Hard", "likes": 135, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3134", "paidOnly": false, "title": "Find the Median of the Uniqueness Array", "titleSlug": "find-the-median-of-the-uniqueness-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5597, "totalSubmissionRaw": 19850}, "3135": {"acRate": 56.49999999999999, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3135", "paidOnly": true, "title": "Equalize Strings by Adding or Removing Characters at Ends", "titleSlug": "equalize-strings-by-adding-or-removing-characters-at-ends", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 565, "totalSubmissionRaw": 1000}, "3136": {"acRate": 37.49976427103174, "difficulty": "Easy", "likes": 97, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "3136", "paidOnly": false, "title": "Valid Word", "titleSlug": "valid-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39770, "totalSubmissionRaw": 106054}, "3137": {"acRate": 62.508585618428704, "difficulty": "Medium", "likes": 111, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3137", "paidOnly": false, "title": "Minimum Number of Operations to Make Word K-Periodic", "titleSlug": "minimum-number-of-operations-to-make-word-k-periodic", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23662, "totalSubmissionRaw": 37854}, "3138": {"acRate": 42.00094817171084, "difficulty": "Medium", "likes": 165, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "3138", "paidOnly": false, "title": "Minimum Length of Anagram Concatenation", "titleSlug": "minimum-length-of-anagram-concatenation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27464, "totalSubmissionRaw": 65389}, "3139": {"acRate": 16.4743000918567, "difficulty": "Hard", "likes": 116, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3139", "paidOnly": false, "title": "Minimum Cost to Equalize Array", "titleSlug": "minimum-cost-to-equalize-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4125, "totalSubmissionRaw": 25039}, "3140": {"acRate": 63.65145228215767, "difficulty": "Medium", "likes": 3, "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": 767, "totalSubmissionRaw": 1205}, "3141": {"acRate": 72.23198594024605, "difficulty": "Hard", "likes": 11, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3141", "paidOnly": true, "title": "Maximum Hamming Distances", "titleSlug": "maximum-hamming-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 411, "totalSubmissionRaw": 569}, "3142": {"acRate": 42.97536593090343, "difficulty": "Easy", "likes": 61, "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": 31210, "totalSubmissionRaw": 72623}, "3143": {"acRate": 38.765694730270305, "difficulty": "Medium", "likes": 142, "dislikes": 19, "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": 16765, "totalSubmissionRaw": 43247}, "3144": {"acRate": 40.651917952531456, "difficulty": "Medium", "likes": 128, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "3144", "paidOnly": false, "title": "Minimum Substring Partition of Equal Character Frequency", "titleSlug": "minimum-substring-partition-of-equal-character-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13120, "totalSubmissionRaw": 32274}, "3145": {"acRate": 24.45026178010471, "difficulty": "Hard", "likes": 53, "dislikes": 13, "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": 1868, "totalSubmissionRaw": 7640}, "3146": {"acRate": 89.00272843699538, "difficulty": "Easy", "likes": 110, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3146", "paidOnly": false, "title": "Permutation Difference between Two Strings", "titleSlug": "permutation-difference-between-two-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63936, "totalSubmissionRaw": 71836}, "3147": {"acRate": 40.429635260498046, "difficulty": "Medium", "likes": 146, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3147", "paidOnly": false, "title": "Taking Maximum Energy From the Mystic Dungeon", "titleSlug": "taking-maximum-energy-from-the-mystic-dungeon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28720, "totalSubmissionRaw": 71037}, "3148": {"acRate": 47.767621481954826, "difficulty": "Medium", "likes": 218, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3148", "paidOnly": false, "title": "Maximum Difference Score in a Grid", "titleSlug": "maximum-difference-score-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17193, "totalSubmissionRaw": 35993}, "3149": {"acRate": 22.64720684448918, "difficulty": "Hard", "likes": 101, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3149", "paidOnly": false, "title": "Find the Minimum Cost Array Permutation", "titleSlug": "find-the-minimum-cost-array-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4050, "totalSubmissionRaw": 17883}, "3150": {"acRate": 87.29198184568835, "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": 1154, "totalSubmissionRaw": 1322}, "3151": {"acRate": 75.62602049916988, "difficulty": "Easy", "likes": 83, "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": 55117, "totalSubmissionRaw": 72880}, "3152": {"acRate": 29.867732401142984, "difficulty": "Medium", "likes": 175, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3152", "paidOnly": false, "title": "Special Array II", "titleSlug": "special-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30417, "totalSubmissionRaw": 101839}, "3153": {"acRate": 43.72847440016932, "difficulty": "Medium", "likes": 165, "dislikes": 16, "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": 22727, "totalSubmissionRaw": 51973}, "3154": {"acRate": 36.263327128109665, "difficulty": "Hard", "likes": 124, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3154", "paidOnly": false, "title": "Find Number of Ways to Reach the K-th Stair", "titleSlug": "find-number-of-ways-to-reach-the-k-th-stair", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10714, "totalSubmissionRaw": 29545}, "3155": {"acRate": 52.25424981522543, "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": 707, "totalSubmissionRaw": 1353}, "3156": {"acRate": 57.00416088765603, "difficulty": "Hard", "likes": 6, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3156", "paidOnly": true, "title": "Employee Task Duration and Concurrent Tasks", "titleSlug": "employee-task-duration-and-concurrent-tasks", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 411, "totalSubmissionRaw": 721}, "3157": {"acRate": 68.92880904856953, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3157", "paidOnly": true, "title": "Find the Level of Tree with Minimum Sum", "titleSlug": "find-the-level-of-tree-with-minimum-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1036, "totalSubmissionRaw": 1503}, "3158": {"acRate": 82.06096777849129, "difficulty": "Easy", "likes": 87, "dislikes": 7, "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": 43448, "totalSubmissionRaw": 52946}, "3159": {"acRate": 73.62546865179984, "difficulty": "Medium", "likes": 107, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3159", "paidOnly": false, "title": "Find Occurrences of an Element in an Array", "titleSlug": "find-occurrences-of-an-element-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33973, "totalSubmissionRaw": 46143}, "3160": {"acRate": 41.052835232869, "difficulty": "Medium", "likes": 106, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3160", "paidOnly": false, "title": "Find the Number of Distinct Colors Among the Balls", "titleSlug": "find-the-number-of-distinct-colors-among-the-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23341, "totalSubmissionRaw": 56856}, "3161": {"acRate": 13.47216827512026, "difficulty": "Hard", "likes": 94, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3161", "paidOnly": false, "title": "Block Placement Queries", "titleSlug": "block-placement-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4509, "totalSubmissionRaw": 33469}, "3162": {"acRate": 86.64440004083835, "difficulty": "Easy", "likes": 93, "dislikes": 7, "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": 59406, "totalSubmissionRaw": 68563}, "3163": {"acRate": 55.78695065591182, "difficulty": "Medium", "likes": 104, "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": 38869, "totalSubmissionRaw": 69674}, "3164": {"acRate": 25.587393153395933, "difficulty": "Medium", "likes": 199, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "3164", "paidOnly": false, "title": "Find the Number of Good Pairs II", "titleSlug": "find-the-number-of-good-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24307, "totalSubmissionRaw": 94995}, "3165": {"acRate": 17.12616395837137, "difficulty": "Hard", "likes": 101, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3165", "paidOnly": false, "title": "Maximum Sum of Subsequence With Non-adjacent Elements", "titleSlug": "maximum-sum-of-subsequence-with-non-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5628, "totalSubmissionRaw": 32862}, "3166": {"acRate": 61.82432432432432, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3166", "paidOnly": true, "title": "Calculate Parking Fees and Duration", "titleSlug": "calculate-parking-fees-and-duration", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 732, "totalSubmissionRaw": 1184}, "3167": {"acRate": 79.45443993035404, "difficulty": "Medium", "likes": 9, "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": 1369, "totalSubmissionRaw": 1723}, "3168": {"acRate": 80.30678747416945, "difficulty": "Easy", "likes": 105, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3168", "paidOnly": false, "title": "Minimum Number of Chairs in a Waiting Room", "titleSlug": "minimum-number-of-chairs-in-a-waiting-room", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50520, "totalSubmissionRaw": 62909}, "3169": {"acRate": 33.57768052516412, "difficulty": "Medium", "likes": 189, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3169", "paidOnly": false, "title": "Count Days Without Meetings", "titleSlug": "count-days-without-meetings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36828, "totalSubmissionRaw": 109680}, "3170": {"acRate": 35.82112829819512, "difficulty": "Medium", "likes": 188, "dislikes": 24, "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": 25261, "totalSubmissionRaw": 70527}, "3171": {"acRate": 31.113878437814634, "difficulty": "Hard", "likes": 161, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3171", "paidOnly": false, "title": "Find Subarray With Bitwise OR Closest to K", "titleSlug": "find-subarray-with-bitwise-or-closest-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11743, "totalSubmissionRaw": 37742}, "3172": {"acRate": 73.32255456750202, "difficulty": "Easy", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3172", "paidOnly": true, "title": "Second Day Verification", "titleSlug": "second-day-verification", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 907, "totalSubmissionRaw": 1237}, "3173": {"acRate": 95.57618787547788, "difficulty": "Easy", "likes": 8, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3173", "paidOnly": true, "title": "Bitwise OR of Adjacent Elements", "titleSlug": "bitwise-or-of-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1750, "totalSubmissionRaw": 1831}, "3174": {"acRate": 72.32095115276948, "difficulty": "Easy", "likes": 68, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3174", "paidOnly": false, "title": "Clear Digits", "titleSlug": "clear-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45986, "totalSubmissionRaw": 63586}, "3175": {"acRate": 39.360480292351866, "difficulty": "Medium", "likes": 112, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3175", "paidOnly": false, "title": "Find The First Player to win K Games in a Row", "titleSlug": "find-the-first-player-to-win-k-games-in-a-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30158, "totalSubmissionRaw": 76620}, "3176": {"acRate": 30.19372906290434, "difficulty": "Medium", "likes": 123, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "3176", "paidOnly": false, "title": "Find the Maximum Length of a Good Subsequence I", "titleSlug": "find-the-maximum-length-of-a-good-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17035, "totalSubmissionRaw": 56419}, "3177": {"acRate": 23.823305407463824, "difficulty": "Hard", "likes": 96, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3177", "paidOnly": false, "title": "Find the Maximum Length of a Good Subsequence II", "titleSlug": "find-the-maximum-length-of-a-good-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6256, "totalSubmissionRaw": 26260}, "3178": {"acRate": 61.86888767979464, "difficulty": "Easy", "likes": 127, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3178", "paidOnly": false, "title": "Find the Child Who Has the Ball After K Seconds", "titleSlug": "find-the-child-who-has-the-ball-after-k-seconds", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44347, "totalSubmissionRaw": 71679}, "3179": {"acRate": 54.60337829771995, "difficulty": "Medium", "likes": 93, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3179", "paidOnly": false, "title": "Find the N-th Value After K Seconds", "titleSlug": "find-the-n-th-value-after-k-seconds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36593, "totalSubmissionRaw": 67016}, "3180": {"acRate": 29.239307402521774, "difficulty": "Medium", "likes": 159, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3180", "paidOnly": false, "title": "Maximum Total Reward Using Operations I", "titleSlug": "maximum-total-reward-using-operations-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24604, "totalSubmissionRaw": 84147}, "3181": {"acRate": 20.571279679510145, "difficulty": "Hard", "likes": 108, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "3181", "paidOnly": false, "title": "Maximum Total Reward Using Operations II", "titleSlug": "maximum-total-reward-using-operations-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6316, "totalSubmissionRaw": 30703}, "3182": {"acRate": 55.41890853189854, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3182", "paidOnly": true, "title": "Find Top Scoring Students", "titleSlug": "find-top-scoring-students", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 721, "totalSubmissionRaw": 1301}, "3183": {"acRate": 58.71404399323181, "difficulty": "Medium", "likes": 11, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3183", "paidOnly": true, "title": "The Number of Ways to Make the Sum", "titleSlug": "the-number-of-ways-to-make-the-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 694, "totalSubmissionRaw": 1182}, "3184": {"acRate": 79.12619917431465, "difficulty": "Easy", "likes": 95, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3184", "paidOnly": false, "title": "Count Pairs That Form a Complete Day I", "titleSlug": "count-pairs-that-form-a-complete-day-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53282, "totalSubmissionRaw": 67338}, "3185": {"acRate": 42.81861908797728, "difficulty": "Medium", "likes": 142, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3185", "paidOnly": false, "title": "Count Pairs That Form a Complete Day II", "titleSlug": "count-pairs-that-form-a-complete-day-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38902, "totalSubmissionRaw": 90853}, "3186": {"acRate": 25.917660459818208, "difficulty": "Medium", "likes": 216, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3186", "paidOnly": false, "title": "Maximum Total Damage With Spell Casting", "titleSlug": "maximum-total-damage-with-spell-casting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22298, "totalSubmissionRaw": 86033}, "3187": {"acRate": 26.699922057677316, "difficulty": "Hard", "likes": 107, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3187", "paidOnly": false, "title": "Peaks in Array", "titleSlug": "peaks-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8564, "totalSubmissionRaw": 32075}, "3188": {"acRate": 50.661375661375665, "difficulty": "Hard", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3188", "paidOnly": true, "title": "Find Top Scoring Students II", "titleSlug": "find-top-scoring-students-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 383, "totalSubmissionRaw": 756}, "3189": {"acRate": 74.1042345276873, "difficulty": "Medium", "likes": 16, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3189", "paidOnly": true, "title": "Minimum Moves to Get a Peaceful Board", "titleSlug": "minimum-moves-to-get-a-peaceful-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 455, "totalSubmissionRaw": 614}, "3190": {"acRate": 89.70499090725399, "difficulty": "Easy", "likes": 103, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3190", "paidOnly": false, "title": "Find Minimum Operations to Make All Elements Divisible by Three", "titleSlug": "find-minimum-operations-to-make-all-elements-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71028, "totalSubmissionRaw": 79180}, "3191": {"acRate": 70.73789638193826, "difficulty": "Medium", "likes": 135, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3191", "paidOnly": false, "title": "Minimum Operations to Make Binary Array Elements Equal to One I", "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42093, "totalSubmissionRaw": 59506}, "3192": {"acRate": 64.95001630945757, "difficulty": "Medium", "likes": 113, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3192", "paidOnly": false, "title": "Minimum Operations to Make Binary Array Elements Equal to One II", "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33849, "totalSubmissionRaw": 52116}, "3193": {"acRate": 33.25509442014297, "difficulty": "Hard", "likes": 86, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3193", "paidOnly": false, "title": "Count the Number of Inversions", "titleSlug": "count-the-number-of-inversions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6234, "totalSubmissionRaw": 18746}, "3194": {"acRate": 85.03140978816654, "difficulty": "Easy", "likes": 93, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3194", "paidOnly": false, "title": "Minimum Average of Smallest and Largest Elements", "titleSlug": "minimum-average-of-smallest-and-largest-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58204, "totalSubmissionRaw": 68450}, "3195": {"acRate": 74.01065231086422, "difficulty": "Medium", "likes": 97, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3195", "paidOnly": false, "title": "Find the Minimum Area to Cover All Ones I", "titleSlug": "find-the-minimum-area-to-cover-all-ones-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38769, "totalSubmissionRaw": 52383}, "3196": {"acRate": 28.293104868605322, "difficulty": "Medium", "likes": 155, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3196", "paidOnly": false, "title": "Maximize Total Cost of Alternating Subarrays", "titleSlug": "maximize-total-cost-of-alternating-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20607, "totalSubmissionRaw": 72834}, "3197": {"acRate": 36.633235344976654, "difficulty": "Hard", "likes": 64, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3197", "paidOnly": false, "title": "Find the Minimum Area to Cover All Ones II", "titleSlug": "find-the-minimum-area-to-cover-all-ones-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4237, "totalSubmissionRaw": 11566}, "3198": {"acRate": 81.1881188118812, "difficulty": "Easy", "likes": 4, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3198", "paidOnly": true, "title": "Find Cities in Each State", "titleSlug": "find-cities-in-each-state", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 738, "totalSubmissionRaw": 909}, "3199": {"acRate": 85.06787330316742, "difficulty": "Easy", "likes": 7, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3199", "paidOnly": true, "title": "Count Triplets with Even XOR Set Bits I", "titleSlug": "count-triplets-with-even-xor-set-bits-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 564, "totalSubmissionRaw": 663}, "3200": {"acRate": 42.22859402807989, "difficulty": "Easy", "likes": 117, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3200", "paidOnly": false, "title": "Maximum Height of a Triangle", "titleSlug": "maximum-height-of-a-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34168, "totalSubmissionRaw": 80912}, "3201": {"acRate": 37.30920125053638, "difficulty": "Medium", "likes": 120, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3201", "paidOnly": false, "title": "Find the Maximum Length of Valid Subsequence I", "titleSlug": "find-the-maximum-length-of-valid-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24345, "totalSubmissionRaw": 65252}, "3202": {"acRate": 38.80369605819325, "difficulty": "Medium", "likes": 170, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3202", "paidOnly": false, "title": "Find the Maximum Length of Valid Subsequence II", "titleSlug": "find-the-maximum-length-of-valid-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15790, "totalSubmissionRaw": 40692}, "3203": {"acRate": 35.45780581601348, "difficulty": "Hard", "likes": 123, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3203", "paidOnly": false, "title": "Find Minimum Diameter After Merging Two Trees", "titleSlug": "find-minimum-diameter-after-merging-two-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8206, "totalSubmissionRaw": 23143}, "3204": {"acRate": 95.64164648910412, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3204", "paidOnly": true, "title": "Bitwise User Permissions Analysis", "titleSlug": "bitwise-user-permissions-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 395, "totalSubmissionRaw": 413}, "3205": {"acRate": 80.28455284552845, "difficulty": "Medium", "likes": 15, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3205", "paidOnly": true, "title": "Maximum Array Hopping Score I", "titleSlug": "maximum-array-hopping-score-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 790, "totalSubmissionRaw": 984}, "3206": {"acRate": 66.646162363326, "difficulty": "Easy", "likes": 75, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3206", "paidOnly": false, "title": "Alternating Groups I", "titleSlug": "alternating-groups-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43337, "totalSubmissionRaw": 65026}, "3207": {"acRate": 31.582198656405243, "difficulty": "Medium", "likes": 89, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "3207", "paidOnly": false, "title": "Maximum Points After Enemy Battles", "titleSlug": "maximum-points-after-enemy-battles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24540, "totalSubmissionRaw": 77702}, "3208": {"acRate": 39.95335616937541, "difficulty": "Medium", "likes": 132, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3208", "paidOnly": false, "title": "Alternating Groups II", "titleSlug": "alternating-groups-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21927, "totalSubmissionRaw": 54883}, "3209": {"acRate": 33.9543837896042, "difficulty": "Hard", "likes": 133, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3209", "paidOnly": false, "title": "Number of Subarrays With AND Value of K", "titleSlug": "number-of-subarrays-with-and-value-of-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10406, "totalSubmissionRaw": 30647}, "3210": {"acRate": 69.35279723230107, "difficulty": "Easy", "likes": 70, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3210", "paidOnly": false, "title": "Find the Encrypted String", "titleSlug": "find-the-encrypted-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49314, "totalSubmissionRaw": 71106}, "3211": {"acRate": 86.22864072318377, "difficulty": "Medium", "likes": 121, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3211", "paidOnly": false, "title": "Generate Binary Strings Without Adjacent Zeros", "titleSlug": "generate-binary-strings-without-adjacent-zeros", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39108, "totalSubmissionRaw": 45354}, "3212": {"acRate": 51.58126876876877, "difficulty": "Medium", "likes": 126, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3212", "paidOnly": false, "title": "Count Submatrices With Equal Frequency of X and Y", "titleSlug": "count-submatrices-with-equal-frequency-of-x-and-y", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21986, "totalSubmissionRaw": 42624}, "3213": {"acRate": 20.547385620915033, "difficulty": "Hard", "likes": 134, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "3213", "paidOnly": false, "title": "Construct String with Minimum Cost", "titleSlug": "construct-string-with-minimum-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11066, "totalSubmissionRaw": 53856}, "3214": {"acRate": 57.94251134644478, "difficulty": "Hard", "likes": 1, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3214", "paidOnly": true, "title": "Year on Year Growth Rate", "titleSlug": "year-on-year-growth-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 383, "totalSubmissionRaw": 661}, "3215": {"acRate": 74.27937915742794, "difficulty": "Medium", "likes": 12, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3215", "paidOnly": true, "title": "Count Triplets with Even XOR Set Bits II", "titleSlug": "count-triplets-with-even-xor-set-bits-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 335, "totalSubmissionRaw": 451}, "3216": {"acRate": 53.204843156437, "difficulty": "Easy", "likes": 70, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3216", "paidOnly": false, "title": "Lexicographically Smallest String After a Swap", "titleSlug": "lexicographically-smallest-string-after-a-swap", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41877, "totalSubmissionRaw": 78709}, "3217": {"acRate": 61.38766036197107, "difficulty": "Medium", "likes": 107, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3217", "paidOnly": false, "title": "Delete Nodes From Linked List Present in Array", "titleSlug": "delete-nodes-from-linked-list-present-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39142, "totalSubmissionRaw": 63761}, "3218": {"acRate": 57.682150436217874, "difficulty": "Medium", "likes": 145, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3218", "paidOnly": false, "title": "Minimum Cost for Cutting Cake I", "titleSlug": "minimum-cost-for-cutting-cake-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24463, "totalSubmissionRaw": 42410}, "3219": {"acRate": 55.868141921834344, "difficulty": "Hard", "likes": 92, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3219", "paidOnly": false, "title": "Minimum Cost for Cutting Cake II", "titleSlug": "minimum-cost-for-cutting-cake-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19541, "totalSubmissionRaw": 34977}, "3220": {"acRate": 71.76165803108809, "difficulty": "Medium", "likes": 16, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3220", "paidOnly": false, "title": "Odd and Even Transactions", "titleSlug": "odd-and-even-transactions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2493, "totalSubmissionRaw": 3474}, "3221": {"acRate": 68.51851851851852, "difficulty": "Medium", "likes": 12, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3221", "paidOnly": true, "title": "Maximum Array Hopping Score II", "titleSlug": "maximum-array-hopping-score-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 333, "totalSubmissionRaw": 486}, "3222": {"acRate": 50.59937000524995, "difficulty": "Easy", "likes": 75, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3222", "paidOnly": false, "title": "Find the Winning Player in Coin Game", "titleSlug": "find-the-winning-player-in-coin-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34697, "totalSubmissionRaw": 68572}, "3223": {"acRate": 54.302034271971145, "difficulty": "Medium", "likes": 82, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3223", "paidOnly": false, "title": "Minimum Length of String After Operations", "titleSlug": "minimum-length-of-string-after-operations", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27094, "totalSubmissionRaw": 49895}, "3224": {"acRate": 22.43298170908739, "difficulty": "Medium", "likes": 183, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3224", "paidOnly": false, "title": "Minimum Array Changes to Make Differences Equal", "titleSlug": "minimum-array-changes-to-make-differences-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11590, "totalSubmissionRaw": 51665}, "3225": {"acRate": 24.97396375755051, "difficulty": "Hard", "likes": 49, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3225", "paidOnly": false, "title": "Maximum Score From Grid Operations", "titleSlug": "maximum-score-from-grid-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1199, "totalSubmissionRaw": 4801}, "3226": {"acRate": 64.144578313253, "difficulty": "Easy", "likes": 72, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3226", "paidOnly": false, "title": "Number of Bit Changes to Make Two Integers Equal", "titleSlug": "number-of-bit-changes-to-make-two-integers-equal", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38595, "totalSubmissionRaw": 60171}, "3227": {"acRate": 61.918809838379815, "difficulty": "Medium", "likes": 113, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3227", "paidOnly": false, "title": "Vowels Game in a String", "titleSlug": "vowels-game-in-a-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34210, "totalSubmissionRaw": 55251}, "3228": {"acRate": 53.38907705334462, "difficulty": "Medium", "likes": 138, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3228", "paidOnly": false, "title": "Maximum Number of Operations to Move Ones to the End", "titleSlug": "maximum-number-of-operations-to-move-ones-to-the-end", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25221, "totalSubmissionRaw": 47240}, "3229": {"acRate": 37.340138619029666, "difficulty": "Hard", "likes": 171, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3229", "paidOnly": false, "title": "Minimum Operations to Make Array Equal to Target", "titleSlug": "minimum-operations-to-make-array-equal-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12876, "totalSubmissionRaw": 34483}, "3230": {"acRate": 46.13555291319857, "difficulty": "Medium", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3230", "paidOnly": true, "title": "Customer Purchasing Behavior Analysis", "titleSlug": "customer-purchasing-behavior-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 388, "totalSubmissionRaw": 841}, "3231": {"acRate": 57.702349869451695, "difficulty": "Hard", "likes": 5, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3231", "paidOnly": true, "title": "Minimum Number of Increasing Subsequence to Be Removed", "titleSlug": "minimum-number-of-increasing-subsequence-to-be-removed", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 221, "totalSubmissionRaw": 383}, "3232": {"acRate": 83.10847099031655, "difficulty": "Easy", "likes": 74, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3232", "paidOnly": false, "title": "Find if Digit Game Can Be Won", "titleSlug": "find-if-digit-game-can-be-won", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51064, "totalSubmissionRaw": 61443}, "3233": {"acRate": 26.388609685962262, "difficulty": "Medium", "likes": 148, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3233", "paidOnly": false, "title": "Find the Count of Numbers Which Are Not Special", "titleSlug": "find-the-count-of-numbers-which-are-not-special", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30190, "totalSubmissionRaw": 114410}, "3234": {"acRate": 14.089498252560059, "difficulty": "Medium", "likes": 188, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3234", "paidOnly": false, "title": "Count the Number of Substrings With Dominant Ones", "titleSlug": "count-the-number-of-substrings-with-dominant-ones", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5764, "totalSubmissionRaw": 40916}, "3235": {"acRate": 29.824381752086428, "difficulty": "Hard", "likes": 87, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3235", "paidOnly": false, "title": "Check if the Rectangle Corner Is Reachable", "titleSlug": "check-if-the-rectangle-corner-is-reachable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5825, "totalSubmissionRaw": 19530}, "3236": {"acRate": 81.12449799196787, "difficulty": "Hard", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3236", "paidOnly": true, "title": "CEO Subordinate Hierarchy", "titleSlug": "ceo-subordinate-hierarchy", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 202, "totalSubmissionRaw": 249}, "3237": {"acRate": 82.62806236080178, "difficulty": "Medium", "likes": 11, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3237", "paidOnly": true, "title": "Alt and Tab Simulation", "titleSlug": "alt-and-tab-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 371, "totalSubmissionRaw": 449}, "3238": {"acRate": 60.62412215939784, "difficulty": "Easy", "likes": 47, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3238", "paidOnly": false, "title": "Find the Number of Winning Players", "titleSlug": "find-the-number-of-winning-players", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33664, "totalSubmissionRaw": 55531}, "3239": {"acRate": 77.85946825827456, "difficulty": "Medium", "likes": 43, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3239", "paidOnly": false, "title": "Minimum Number of Flips to Make Binary Grid Palindromic I", "titleSlug": "minimum-number-of-flips-to-make-binary-grid-palindromic-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28699, "totalSubmissionRaw": 36860}, "3240": {"acRate": 21.328829427879885, "difficulty": "Medium", "likes": 89, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "3240", "paidOnly": false, "title": "Minimum Number of Flips to Make Binary Grid Palindromic II", "titleSlug": "minimum-number-of-flips-to-make-binary-grid-palindromic-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8018, "totalSubmissionRaw": 37593}, "3241": {"acRate": 18.382691422433638, "difficulty": "Hard", "likes": 45, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3241", "paidOnly": false, "title": "Time Taken to Mark All Nodes", "titleSlug": "time-taken-to-mark-all-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2396, "totalSubmissionRaw": 13033}, "3242": {"acRate": 84.27432500518657, "difficulty": "Easy", "likes": 51, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3242", "paidOnly": false, "title": "Design Neighbor Sum Service", "titleSlug": "design-neighbor-sum-service", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28433, "totalSubmissionRaw": 33739}, "3243": {"acRate": 46.91162565692547, "difficulty": "Medium", "likes": 63, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3243", "paidOnly": false, "title": "Shortest Distance After Road Addition Queries I", "titleSlug": "shortest-distance-after-road-addition-queries-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21333, "totalSubmissionRaw": 45476}, "3244": {"acRate": 20.282922857724405, "difficulty": "Hard", "likes": 106, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3244", "paidOnly": false, "title": "Shortest Distance After Road Addition Queries II", "titleSlug": "shortest-distance-after-road-addition-queries-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7972, "totalSubmissionRaw": 39303}, "3245": {"acRate": 11.112676056338028, "difficulty": "Hard", "likes": 33, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3245", "paidOnly": false, "title": "Alternating Groups III", "titleSlug": "alternating-groups-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 789, "totalSubmissionRaw": 7099}, "3246": {"acRate": 95.91836734693877, "difficulty": "Easy", "likes": 4, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3246", "paidOnly": true, "title": "Premier League Table Ranking", "titleSlug": "premier-league-table-ranking", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 235, "totalSubmissionRaw": 245}, "3247": {"acRate": 72.95081967213115, "difficulty": "Medium", "likes": 0, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3247", "paidOnly": true, "title": "Number of Subsequences with Odd Sum", "titleSlug": "number-of-subsequences-with-odd-sum", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 89, "totalSubmissionRaw": 121}}
\ No newline at end of file
+{"1": {"acRate": 53.349837030384194, "difficulty": "Easy", "likes": 57471, "dislikes": 2017, "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": 14068437, "totalSubmissionRaw": 26370175}, "2": {"acRate": 43.686628908258065, "difficulty": "Medium", "likes": 31357, "dislikes": 6271, "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": 4829523, "totalSubmissionRaw": 11054950}, "3": {"acRate": 35.205775859231906, "difficulty": "Medium", "likes": 39877, "dislikes": 1908, "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": 6119020, "totalSubmissionRaw": 17380738}, "4": {"acRate": 40.99640363553279, "difficulty": "Hard", "likes": 28469, "dislikes": 3180, "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": 2763204, "totalSubmissionRaw": 6740124}, "5": {"acRate": 34.227275727160475, "difficulty": "Medium", "likes": 29429, "dislikes": 1796, "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": 3220574, "totalSubmissionRaw": 9409387}, "6": {"acRate": 48.87418109162168, "difficulty": "Medium", "likes": 7721, "dislikes": 14734, "categoryTitle": "Algorithms", "frontendQuestionId": "6", "paidOnly": false, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1424591, "totalSubmissionRaw": 2914822}, "7": {"acRate": 28.961036428598007, "difficulty": "Medium", "likes": 13141, "dislikes": 13564, "categoryTitle": "Algorithms", "frontendQuestionId": "7", "paidOnly": false, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3401099, "totalSubmissionRaw": 11743711}, "8": {"acRate": 17.69911465961515, "difficulty": "Medium", "likes": 4620, "dislikes": 13829, "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": 1628858, "totalSubmissionRaw": 9203081}, "9": {"acRate": 57.157281640319525, "difficulty": "Easy", "likes": 12783, "dislikes": 2745, "categoryTitle": "Algorithms", "frontendQuestionId": "9", "paidOnly": false, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 5005166, "totalSubmissionRaw": 8756843}, "10": {"acRate": 28.294058428270674, "difficulty": "Hard", "likes": 12180, "dislikes": 2178, "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": 998294, "totalSubmissionRaw": 3528288}, "11": {"acRate": 55.861651695754034, "difficulty": "Medium", "likes": 29272, "dislikes": 1796, "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": 3187093, "totalSubmissionRaw": 5705332}, "12": {"acRate": 65.79976829213247, "difficulty": "Medium", "likes": 7204, "dislikes": 5563, "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": 1399433, "totalSubmissionRaw": 2126807}, "13": {"acRate": 62.19234193354456, "difficulty": "Easy", "likes": 14371, "dislikes": 950, "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": 3891754, "totalSubmissionRaw": 6257618}, "14": {"acRate": 43.459619111006575, "difficulty": "Easy", "likes": 17702, "dislikes": 4566, "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": 3580854, "totalSubmissionRaw": 8239523}, "15": {"acRate": 35.065227926702796, "difficulty": "Medium", "likes": 31040, "dislikes": 2889, "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": 3775478, "totalSubmissionRaw": 10767014}, "16": {"acRate": 45.970907828351635, "difficulty": "Medium", "likes": 10479, "dislikes": 571, "categoryTitle": "Algorithms", "frontendQuestionId": "16", "paidOnly": false, "title": "3Sum Closest", "titleSlug": "3sum-closest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1273717, "totalSubmissionRaw": 2770694}, "17": {"acRate": 61.30621320727515, "difficulty": "Medium", "likes": 18670, "dislikes": 1007, "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": 2138953, "totalSubmissionRaw": 3488968}, "18": {"acRate": 36.54874756015895, "difficulty": "Medium", "likes": 11359, "dislikes": 1401, "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": 1023881, "totalSubmissionRaw": 2801407}, "19": {"acRate": 46.269551446248975, "difficulty": "Medium", "likes": 18938, "dislikes": 814, "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": 2887456, "totalSubmissionRaw": 6240517}, "20": {"acRate": 40.84277545902388, "difficulty": "Easy", "likes": 24180, "dislikes": 1782, "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": 4911884, "totalSubmissionRaw": 12026320}, "21": {"acRate": 64.95381468506459, "difficulty": "Easy", "likes": 21895, "dislikes": 2137, "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": 4404398, "totalSubmissionRaw": 6780817}, "22": {"acRate": 75.20700682103647, "difficulty": "Medium", "likes": 21182, "dislikes": 953, "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": 1935783, "totalSubmissionRaw": 2573942}, "23": {"acRate": 53.70131374300936, "difficulty": "Hard", "likes": 19515, "dislikes": 721, "categoryTitle": "Algorithms", "frontendQuestionId": "23", "paidOnly": false, "title": "Merge k Sorted Lists", "titleSlug": "merge-k-sorted-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2093402, "totalSubmissionRaw": 3898241}, "24": {"acRate": 64.97856145708016, "difficulty": "Medium", "likes": 11984, "dislikes": 449, "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": 1421048, "totalSubmissionRaw": 2186949}, "25": {"acRate": 59.8798768059875, "difficulty": "Hard", "likes": 13764, "dislikes": 706, "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": 994477, "totalSubmissionRaw": 1660787}, "26": {"acRate": 57.02951282212126, "difficulty": "Easy", "likes": 14816, "dislikes": 18779, "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": 4754761, "totalSubmissionRaw": 8337378}, "27": {"acRate": 57.745652671034705, "difficulty": "Easy", "likes": 2674, "dislikes": 3759, "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": 3194394, "totalSubmissionRaw": 5531836}, "28": {"acRate": 43.08569726906458, "difficulty": "Easy", "likes": 5922, "dislikes": 425, "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": 2650603, "totalSubmissionRaw": 6151933}, "29": {"acRate": 17.67225919175385, "difficulty": "Medium", "likes": 5185, "dislikes": 14839, "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": 784885, "totalSubmissionRaw": 4441341}, "30": {"acRate": 32.601255930018915, "difficulty": "Hard", "likes": 1885, "dislikes": 271, "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": 475547, "totalSubmissionRaw": 1458678}, "31": {"acRate": 40.72892665225196, "difficulty": "Medium", "likes": 18479, "dislikes": 4704, "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": 1446280, "totalSubmissionRaw": 3550991}, "32": {"acRate": 34.57024208994753, "difficulty": "Hard", "likes": 12376, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "32", "paidOnly": false, "title": "Longest Valid Parentheses", "titleSlug": "longest-valid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 771958, "totalSubmissionRaw": 2233010}, "33": {"acRate": 41.26678396540394, "difficulty": "Medium", "likes": 26387, "dislikes": 1591, "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": 2920003, "totalSubmissionRaw": 7075920}, "34": {"acRate": 44.90318756831376, "difficulty": "Medium", "likes": 20570, "dislikes": 524, "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": 2168292, "totalSubmissionRaw": 4828814}, "35": {"acRate": 46.75266325539911, "difficulty": "Easy", "likes": 16251, "dislikes": 751, "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": 3078032, "totalSubmissionRaw": 6583650}, "36": {"acRate": 60.29227758349642, "difficulty": "Medium", "likes": 10755, "dislikes": 1134, "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": 1616137, "totalSubmissionRaw": 2680510}, "37": {"acRate": 62.29325121949767, "difficulty": "Hard", "likes": 9565, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "37", "paidOnly": false, "title": "Sudoku Solver", "titleSlug": "sudoku-solver", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 627531, "totalSubmissionRaw": 1007382}, "38": {"acRate": 55.983685115326765, "difficulty": "Medium", "likes": 4028, "dislikes": 8350, "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": 968490, "totalSubmissionRaw": 1729952}, "39": {"acRate": 72.31266454567086, "difficulty": "Medium", "likes": 18861, "dislikes": 425, "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": 2063571, "totalSubmissionRaw": 2853682}, "40": {"acRate": 55.009999292179, "difficulty": "Medium", "likes": 10541, "dislikes": 302, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 1041410, "totalSubmissionRaw": 1893128}, "41": {"acRate": 39.797139947980725, "difficulty": "Hard", "likes": 16857, "dislikes": 1865, "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": 1263243, "totalSubmissionRaw": 3174202}, "42": {"acRate": 62.733449880525185, "difficulty": "Hard", "likes": 32166, "dislikes": 522, "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": 2249939, "totalSubmissionRaw": 3586502}, "43": {"acRate": 40.78078773959602, "difficulty": "Medium", "likes": 7081, "dislikes": 3358, "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": 830650, "totalSubmissionRaw": 2036866}, "44": {"acRate": 28.39545173342961, "difficulty": "Hard", "likes": 8277, "dislikes": 354, "categoryTitle": "Algorithms", "frontendQuestionId": "44", "paidOnly": false, "title": "Wildcard Matching", "titleSlug": "wildcard-matching", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 604034, "totalSubmissionRaw": 2127217}, "45": {"acRate": 40.62157079806442, "difficulty": "Medium", "likes": 14636, "dislikes": 585, "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": 1344492, "totalSubmissionRaw": 3309801}, "46": {"acRate": 78.96281743853464, "difficulty": "Medium", "likes": 19116, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "46", "paidOnly": false, "title": "Permutations", "titleSlug": "permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2186499, "totalSubmissionRaw": 2769027}, "47": {"acRate": 59.77301520008529, "difficulty": "Medium", "likes": 8525, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "47", "paidOnly": false, "title": "Permutations II", "titleSlug": "permutations-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 964382, "totalSubmissionRaw": 1613409}, "48": {"acRate": 75.40342831113526, "difficulty": "Medium", "likes": 17662, "dislikes": 820, "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": 1840742, "totalSubmissionRaw": 2441189}, "49": {"acRate": 69.12480583287976, "difficulty": "Medium", "likes": 19317, "dislikes": 629, "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": 3058065, "totalSubmissionRaw": 4423981}, "50": {"acRate": 35.29356001576504, "difficulty": "Medium", "likes": 9815, "dislikes": 9561, "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": 1772138, "totalSubmissionRaw": 5021165}, "51": {"acRate": 69.44941498499605, "difficulty": "Hard", "likes": 12432, "dislikes": 290, "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": 777397, "totalSubmissionRaw": 1119371}, "52": {"acRate": 74.6437581461915, "difficulty": "Hard", "likes": 3865, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "52", "paidOnly": false, "title": "N-Queens II", "titleSlug": "n-queens-ii", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 408900, "totalSubmissionRaw": 547802}, "53": {"acRate": 51.024308779670804, "difficulty": "Medium", "likes": 34148, "dislikes": 1447, "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": 4113059, "totalSubmissionRaw": 8060984}, "54": {"acRate": 50.672440281428834, "difficulty": "Medium", "likes": 14898, "dislikes": 1321, "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": 1525124, "totalSubmissionRaw": 3009776}, "55": {"acRate": 38.684976455373466, "difficulty": "Medium", "likes": 19465, "dislikes": 1251, "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": 2054708, "totalSubmissionRaw": 5311384}, "56": {"acRate": 47.77619904514039, "difficulty": "Medium", "likes": 22271, "dislikes": 784, "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": 2541348, "totalSubmissionRaw": 5319286}, "57": {"acRate": 41.96859916246443, "difficulty": "Medium", "likes": 10421, "dislikes": 819, "categoryTitle": "Algorithms", "frontendQuestionId": "57", "paidOnly": false, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1181975, "totalSubmissionRaw": 2816341}, "58": {"acRate": 53.0407505612425, "difficulty": "Easy", "likes": 5262, "dislikes": 289, "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": 2155201, "totalSubmissionRaw": 4063298}, "59": {"acRate": 71.73102349594656, "difficulty": "Medium", "likes": 6403, "dislikes": 264, "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": 598395, "totalSubmissionRaw": 834223}, "60": {"acRate": 47.77338609493173, "difficulty": "Hard", "likes": 6692, "dislikes": 480, "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": 414941, "totalSubmissionRaw": 868561}, "61": {"acRate": 38.3767578638171, "difficulty": "Medium", "likes": 9733, "dislikes": 1451, "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": 1032654, "totalSubmissionRaw": 2690833}, "62": {"acRate": 64.63835629219399, "difficulty": "Medium", "likes": 16693, "dislikes": 447, "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": 1939799, "totalSubmissionRaw": 3001006}, "63": {"acRate": 42.00062106159284, "difficulty": "Medium", "likes": 8779, "dislikes": 509, "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": 994114, "totalSubmissionRaw": 2366905}, "64": {"acRate": 64.61664950130657, "difficulty": "Medium", "likes": 12488, "dislikes": 170, "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": 1247254, "totalSubmissionRaw": 1930239}, "65": {"acRate": 20.194740249841587, "difficulty": "Hard", "likes": 1264, "dislikes": 2008, "categoryTitle": "Algorithms", "frontendQuestionId": "65", "paidOnly": false, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 380208, "totalSubmissionRaw": 1882712}, "66": {"acRate": 45.86586333949697, "difficulty": "Easy", "likes": 9412, "dislikes": 5409, "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": 2387929, "totalSubmissionRaw": 5206322}, "67": {"acRate": 54.09593317760872, "difficulty": "Easy", "likes": 9451, "dislikes": 980, "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": 1544220, "totalSubmissionRaw": 2854589}, "68": {"acRate": 44.54059433578698, "difficulty": "Hard", "likes": 3721, "dislikes": 4743, "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": 440383, "totalSubmissionRaw": 988723}, "69": {"acRate": 39.171026830838116, "difficulty": "Easy", "likes": 8218, "dislikes": 4515, "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": 2091136, "totalSubmissionRaw": 5338474}, "70": {"acRate": 53.042731152605405, "difficulty": "Easy", "likes": 22014, "dislikes": 848, "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": 3465899, "totalSubmissionRaw": 6534166}, "71": {"acRate": 43.61450075615044, "difficulty": "Medium", "likes": 5623, "dislikes": 1288, "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": 815291, "totalSubmissionRaw": 1869323}, "72": {"acRate": 57.073600596520095, "difficulty": "Medium", "likes": 14883, "dislikes": 234, "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": 926147, "totalSubmissionRaw": 1622732}, "73": {"acRate": 56.87991978772553, "difficulty": "Medium", "likes": 14583, "dislikes": 738, "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": 1540193, "totalSubmissionRaw": 2707800}, "74": {"acRate": 50.7559321241536, "difficulty": "Medium", "likes": 15832, "dislikes": 420, "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": 1910836, "totalSubmissionRaw": 3764754}, "75": {"acRate": 64.5405872568329, "difficulty": "Medium", "likes": 18632, "dislikes": 662, "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": 2259745, "totalSubmissionRaw": 3501282}, "76": {"acRate": 43.46487789384572, "difficulty": "Hard", "likes": 17941, "dislikes": 739, "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": 1431418, "totalSubmissionRaw": 3293277}, "77": {"acRate": 70.9756313743989, "difficulty": "Medium", "likes": 8245, "dislikes": 227, "categoryTitle": "Algorithms", "frontendQuestionId": "77", "paidOnly": false, "title": "Combinations", "titleSlug": "combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 944891, "totalSubmissionRaw": 1331289}, "78": {"acRate": 78.9080044493576, "difficulty": "Medium", "likes": 17312, "dislikes": 282, "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": 2065019, "totalSubmissionRaw": 2616998}, "79": {"acRate": 43.353784742937926, "difficulty": "Medium", "likes": 15926, "dislikes": 672, "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": 1759258, "totalSubmissionRaw": 4057911}, "80": {"acRate": 59.60298401171483, "difficulty": "Medium", "likes": 6966, "dislikes": 1348, "categoryTitle": "Algorithms", "frontendQuestionId": "80", "paidOnly": false, "title": "Remove Duplicates from Sorted Array II", "titleSlug": "remove-duplicates-from-sorted-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1086340, "totalSubmissionRaw": 1822621}, "81": {"acRate": 38.00615298545964, "difficulty": "Medium", "likes": 8526, "dislikes": 1048, "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": 777172, "totalSubmissionRaw": 2044859}, "82": {"acRate": 48.0219010900894, "difficulty": "Medium", "likes": 8844, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "82", "paidOnly": false, "title": "Remove Duplicates from Sorted List II", "titleSlug": "remove-duplicates-from-sorted-list-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 773750, "totalSubmissionRaw": 1611233}, "83": {"acRate": 53.128958368083026, "difficulty": "Easy", "likes": 8723, "dislikes": 309, "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": 1608529, "totalSubmissionRaw": 3027599}, "84": {"acRate": 45.163065790884794, "difficulty": "Hard", "likes": 17299, "dislikes": 290, "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": 955945, "totalSubmissionRaw": 2116657}, "85": {"acRate": 51.25948308987284, "difficulty": "Hard", "likes": 10590, "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": 509590, "totalSubmissionRaw": 994138}, "86": {"acRate": 56.89787418171623, "difficulty": "Medium", "likes": 7359, "dislikes": 879, "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": 653523, "totalSubmissionRaw": 1148591}, "87": {"acRate": 40.516642152109256, "difficulty": "Hard", "likes": 3336, "dislikes": 1280, "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": 236069, "totalSubmissionRaw": 582647}, "88": {"acRate": 50.577783578656486, "difficulty": "Easy", "likes": 15107, "dislikes": 1974, "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": 3464332, "totalSubmissionRaw": 6849499}, "89": {"acRate": 59.79259696645385, "difficulty": "Medium", "likes": 2255, "dislikes": 2723, "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": 307838, "totalSubmissionRaw": 514843}, "90": {"acRate": 57.83780104540003, "difficulty": "Medium", "likes": 9783, "dislikes": 320, "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": 985686, "totalSubmissionRaw": 1704224}, "91": {"acRate": 35.26818271685358, "difficulty": "Medium", "likes": 11951, "dislikes": 4519, "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": 1295075, "totalSubmissionRaw": 3672077}, "92": {"acRate": 48.10013231649853, "difficulty": "Medium", "likes": 11656, "dislikes": 624, "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": 912073, "totalSubmissionRaw": 1896187}, "93": {"acRate": 50.682265167386376, "difficulty": "Medium", "likes": 5235, "dislikes": 792, "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": 474163, "totalSubmissionRaw": 935560}, "94": {"acRate": 76.78003472788176, "difficulty": "Easy", "likes": 13524, "dislikes": 794, "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": 2661481, "totalSubmissionRaw": 3466373}, "95": {"acRate": 58.37656427615603, "difficulty": "Medium", "likes": 7573, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "95", "paidOnly": false, "title": "Unique Binary Search Trees II", "titleSlug": "unique-binary-search-trees-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 463730, "totalSubmissionRaw": 794377}, "96": {"acRate": 61.37468447414759, "difficulty": "Medium", "likes": 10366, "dislikes": 407, "categoryTitle": "Algorithms", "frontendQuestionId": "96", "paidOnly": false, "title": "Unique Binary Search Trees", "titleSlug": "unique-binary-search-trees", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 681776, "totalSubmissionRaw": 1110843}, "97": {"acRate": 40.398454226604244, "difficulty": "Medium", "likes": 8233, "dislikes": 487, "categoryTitle": "Algorithms", "frontendQuestionId": "97", "paidOnly": false, "title": "Interleaving String", "titleSlug": "interleaving-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 547576, "totalSubmissionRaw": 1355438}, "98": {"acRate": 33.25400982116552, "difficulty": "Medium", "likes": 16873, "dislikes": 1382, "categoryTitle": "Algorithms", "frontendQuestionId": "98", "paidOnly": false, "title": "Validate Binary Search Tree", "titleSlug": "validate-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2452712, "totalSubmissionRaw": 7375688}, "99": {"acRate": 53.91129321627874, "difficulty": "Medium", "likes": 7927, "dislikes": 257, "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": 473277, "totalSubmissionRaw": 877881}, "100": {"acRate": 62.94027732464187, "difficulty": "Easy", "likes": 11602, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "100", "paidOnly": false, "title": "Same Tree", "titleSlug": "same-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2303401, "totalSubmissionRaw": 3659663}, "101": {"acRate": 57.21843590482655, "difficulty": "Easy", "likes": 15345, "dislikes": 384, "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": 2092312, "totalSubmissionRaw": 3656718}, "102": {"acRate": 68.10734795273122, "difficulty": "Medium", "likes": 15372, "dislikes": 316, "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": 2364375, "totalSubmissionRaw": 3471545}, "103": {"acRate": 59.675821098666795, "difficulty": "Medium", "likes": 10868, "dislikes": 303, "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": 1238175, "totalSubmissionRaw": 2074836}, "104": {"acRate": 75.87690728704966, "difficulty": "Easy", "likes": 12889, "dislikes": 230, "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": 3288348, "totalSubmissionRaw": 4333793}, "105": {"acRate": 64.65239455793788, "difficulty": "Medium", "likes": 15051, "dislikes": 510, "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": 1303152, "totalSubmissionRaw": 2015630}, "106": {"acRate": 63.835004395212195, "difficulty": "Medium", "likes": 8041, "dislikes": 131, "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": 676081, "totalSubmissionRaw": 1059107}, "107": {"acRate": 64.01680813092852, "difficulty": "Medium", "likes": 4867, "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": 664690, "totalSubmissionRaw": 1038306}, "108": {"acRate": 72.32164933313369, "difficulty": "Easy", "likes": 10993, "dislikes": 562, "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": 1260671, "totalSubmissionRaw": 1743147}, "109": {"acRate": 62.501615374674614, "difficulty": "Medium", "likes": 7460, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "109", "paidOnly": false, "title": "Convert Sorted List to Binary Search Tree", "titleSlug": "convert-sorted-list-to-binary-search-tree", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 541684, "totalSubmissionRaw": 866672}, "110": {"acRate": 52.987568061372805, "difficulty": "Easy", "likes": 10762, "dislikes": 699, "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": 1589842, "totalSubmissionRaw": 3000407}, "111": {"acRate": 48.663097855402775, "difficulty": "Easy", "likes": 7304, "dislikes": 1312, "categoryTitle": "Algorithms", "frontendQuestionId": "111", "paidOnly": false, "title": "Minimum Depth of Binary Tree", "titleSlug": "minimum-depth-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1249481, "totalSubmissionRaw": 2567615}, "112": {"acRate": 51.049656829490054, "difficulty": "Easy", "likes": 9713, "dislikes": 1117, "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": 1530577, "totalSubmissionRaw": 2998214}, "113": {"acRate": 58.94159312008975, "difficulty": "Medium", "likes": 7970, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "113", "paidOnly": false, "title": "Path Sum II", "titleSlug": "path-sum-ii", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 887904, "totalSubmissionRaw": 1506414}, "114": {"acRate": 65.91451413786439, "difficulty": "Medium", "likes": 12294, "dislikes": 563, "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": 1002714, "totalSubmissionRaw": 1521234}, "115": {"acRate": 47.87264201414819, "difficulty": "Hard", "likes": 6651, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "115", "paidOnly": false, "title": "Distinct Subsequences", "titleSlug": "distinct-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433985, "totalSubmissionRaw": 906544}, "116": {"acRate": 63.35596299276608, "difficulty": "Medium", "likes": 9734, "dislikes": 303, "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": 1076289, "totalSubmissionRaw": 1698798}, "117": {"acRate": 53.2212928399283, "difficulty": "Medium", "likes": 5853, "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": 654985, "totalSubmissionRaw": 1230684}, "118": {"acRate": 75.04604403414518, "difficulty": "Easy", "likes": 12914, "dislikes": 456, "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": 1767594, "totalSubmissionRaw": 2355346}, "119": {"acRate": 64.4628696644576, "difficulty": "Easy", "likes": 4841, "dislikes": 344, "categoryTitle": "Algorithms", "frontendQuestionId": "119", "paidOnly": false, "title": "Pascal's Triangle II", "titleSlug": "pascals-triangle-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 918425, "totalSubmissionRaw": 1424736}, "120": {"acRate": 57.37342858254873, "difficulty": "Medium", "likes": 9560, "dislikes": 559, "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": 810764, "totalSubmissionRaw": 1413133}, "121": {"acRate": 53.982306506074316, "difficulty": "Easy", "likes": 31117, "dislikes": 1172, "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": 5014184, "totalSubmissionRaw": 9288553}, "122": {"acRate": 67.2968202365788, "difficulty": "Medium", "likes": 13657, "dislikes": 2705, "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": 2040859, "totalSubmissionRaw": 3032629}, "123": {"acRate": 48.84621089209609, "difficulty": "Hard", "likes": 9690, "dislikes": 195, "categoryTitle": "Algorithms", "frontendQuestionId": "123", "paidOnly": false, "title": "Best Time to Buy and Sell Stock III", "titleSlug": "best-time-to-buy-and-sell-stock-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 645486, "totalSubmissionRaw": 1321468}, "124": {"acRate": 40.2698670002455, "difficulty": "Hard", "likes": 16724, "dislikes": 736, "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": 1305709, "totalSubmissionRaw": 3242393}, "125": {"acRate": 48.3413997924595, "difficulty": "Easy", "likes": 9437, "dislikes": 8380, "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": 3239052, "totalSubmissionRaw": 6700367}, "126": {"acRate": 27.196974645965348, "difficulty": "Hard", "likes": 6018, "dislikes": 753, "categoryTitle": "Algorithms", "frontendQuestionId": "126", "paidOnly": false, "title": "Word Ladder II", "titleSlug": "word-ladder-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 374689, "totalSubmissionRaw": 1377689}, "127": {"acRate": 40.010988094805455, "difficulty": "Hard", "likes": 12102, "dislikes": 1881, "categoryTitle": "Algorithms", "frontendQuestionId": "127", "paidOnly": false, "title": "Word Ladder", "titleSlug": "word-ladder", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1122977, "totalSubmissionRaw": 2806672}, "128": {"acRate": 47.34606558757247, "difficulty": "Medium", "likes": 20114, "dislikes": 1031, "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": 1934471, "totalSubmissionRaw": 4085829}, "129": {"acRate": 66.43551572450166, "difficulty": "Medium", "likes": 8057, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "129", "paidOnly": false, "title": "Sum Root to Leaf Numbers", "titleSlug": "sum-root-to-leaf-numbers", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 923069, "totalSubmissionRaw": 1389422}, "130": {"acRate": 40.365004369238434, "difficulty": "Medium", "likes": 8686, "dislikes": 1867, "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": 758477, "totalSubmissionRaw": 1879045}, "131": {"acRate": 69.95713399947535, "difficulty": "Medium", "likes": 12901, "dislikes": 500, "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": 938715, "totalSubmissionRaw": 1341845}, "132": {"acRate": 34.21572753632624, "difficulty": "Hard", "likes": 5470, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "132", "paidOnly": false, "title": "Palindrome Partitioning II", "titleSlug": "palindrome-partitioning-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 294297, "totalSubmissionRaw": 860122}, "133": {"acRate": 58.52009750489787, "difficulty": "Medium", "likes": 9532, "dislikes": 3843, "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": 1306209, "totalSubmissionRaw": 2232079}, "134": {"acRate": 45.565034493125026, "difficulty": "Medium", "likes": 12025, "dislikes": 1172, "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": 866964, "totalSubmissionRaw": 1902695}, "135": {"acRate": 43.67002236282733, "difficulty": "Hard", "likes": 7880, "dislikes": 667, "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": 572168, "totalSubmissionRaw": 1310208}, "136": {"acRate": 73.72571106033337, "difficulty": "Easy", "likes": 16546, "dislikes": 730, "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": 2978063, "totalSubmissionRaw": 4039381}, "137": {"acRate": 63.44590974193062, "difficulty": "Medium", "likes": 7958, "dislikes": 694, "categoryTitle": "Algorithms", "frontendQuestionId": "137", "paidOnly": false, "title": "Single Number II", "titleSlug": "single-number-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 622832, "totalSubmissionRaw": 981674}, "138": {"acRate": 57.17480188408957, "difficulty": "Medium", "likes": 13913, "dislikes": 1484, "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": 1319077, "totalSubmissionRaw": 2307098}, "139": {"acRate": 47.083991251531344, "difficulty": "Medium", "likes": 17222, "dislikes": 795, "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": 1756018, "totalSubmissionRaw": 3729548}, "140": {"acRate": 51.41160246896075, "difficulty": "Hard", "likes": 7204, "dislikes": 538, "categoryTitle": "Algorithms", "frontendQuestionId": "140", "paidOnly": false, "title": "Word Break II", "titleSlug": "word-break-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 674421, "totalSubmissionRaw": 1311807}, "141": {"acRate": 50.898097689678856, "difficulty": "Easy", "likes": 15572, "dislikes": 1382, "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": 3168557, "totalSubmissionRaw": 6225293}, "142": {"acRate": 52.20739738877527, "difficulty": "Medium", "likes": 13625, "dislikes": 965, "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": 1367992, "totalSubmissionRaw": 2620303}, "143": {"acRate": 59.64891988784034, "difficulty": "Medium", "likes": 11141, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "143", "paidOnly": false, "title": "Reorder List", "titleSlug": "reorder-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1041720, "totalSubmissionRaw": 1746425}, "144": {"acRate": 70.41271379698836, "difficulty": "Easy", "likes": 8011, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "144", "paidOnly": false, "title": "Binary Tree Preorder Traversal", "titleSlug": "binary-tree-preorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1708718, "totalSubmissionRaw": 2426718}, "145": {"acRate": 71.94526934415798, "difficulty": "Easy", "likes": 6918, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "145", "paidOnly": false, "title": "Binary Tree Postorder Traversal", "titleSlug": "binary-tree-postorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1269729, "totalSubmissionRaw": 1764856}, "146": {"acRate": 42.981185237455364, "difficulty": "Medium", "likes": 20791, "dislikes": 1040, "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": 1717670, "totalSubmissionRaw": 3996330}, "147": {"acRate": 54.25178032657533, "difficulty": "Medium", "likes": 3112, "dislikes": 867, "categoryTitle": "Algorithms", "frontendQuestionId": "147", "paidOnly": false, "title": "Insertion Sort List", "titleSlug": "insertion-sort-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 382282, "totalSubmissionRaw": 704645}, "148": {"acRate": 59.01948508398165, "difficulty": "Medium", "likes": 11667, "dislikes": 351, "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": 844655, "totalSubmissionRaw": 1431146}, "149": {"acRate": 27.275003648897094, "difficulty": "Hard", "likes": 4191, "dislikes": 500, "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": 407372, "totalSubmissionRaw": 1493583}, "150": {"acRate": 52.29823005166616, "difficulty": "Medium", "likes": 7683, "dislikes": 1091, "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": 1118398, "totalSubmissionRaw": 2138509}, "151": {"acRate": 45.039794321365974, "difficulty": "Medium", "likes": 8520, "dislikes": 5189, "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": 1699638, "totalSubmissionRaw": 3773646}, "152": {"acRate": 33.97281432486101, "difficulty": "Medium", "likes": 18557, "dislikes": 694, "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": 1339926, "totalSubmissionRaw": 3944121}, "153": {"acRate": 51.013374106550735, "difficulty": "Medium", "likes": 13278, "dislikes": 587, "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": 1938444, "totalSubmissionRaw": 3799877}, "154": {"acRate": 43.703211716630456, "difficulty": "Hard", "likes": 4688, "dislikes": 489, "categoryTitle": "Algorithms", "frontendQuestionId": "154", "paidOnly": false, "title": "Find Minimum in Rotated Sorted Array II", "titleSlug": "find-minimum-in-rotated-sorted-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 465864, "totalSubmissionRaw": 1065972}, "155": {"acRate": 54.73324917465672, "difficulty": "Medium", "likes": 14197, "dislikes": 881, "categoryTitle": "Algorithms", "frontendQuestionId": "155", "paidOnly": false, "title": "Min Stack", "titleSlug": "min-stack", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1780244, "totalSubmissionRaw": 3252583}, "156": {"acRate": 63.071961175229696, "difficulty": "Medium", "likes": 262, "dislikes": 350, "categoryTitle": "Algorithms", "frontendQuestionId": "156", "paidOnly": true, "title": "Binary Tree Upside Down", "titleSlug": "binary-tree-upside-down", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 103450, "totalSubmissionRaw": 164019}, "157": {"acRate": 41.68330365266285, "difficulty": "Easy", "likes": 578, "dislikes": 3504, "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": 193337, "totalSubmissionRaw": 463825}, "158": {"acRate": 42.44087151416085, "difficulty": "Hard", "likes": 868, "dislikes": 1804, "categoryTitle": "Algorithms", "frontendQuestionId": "158", "paidOnly": true, "title": "Read N Characters Given read4 II - Call Multiple Times", "titleSlug": "read-n-characters-given-read4-ii-call-multiple-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 185383, "totalSubmissionRaw": 436803}, "159": {"acRate": 55.602747020307994, "difficulty": "Medium", "likes": 2215, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "159", "paidOnly": true, "title": "Longest Substring with At Most Two Distinct Characters", "titleSlug": "longest-substring-with-at-most-two-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 264187, "totalSubmissionRaw": 475133}, "160": {"acRate": 58.427643931841324, "difficulty": "Easy", "likes": 15028, "dislikes": 1363, "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": 1658565, "totalSubmissionRaw": 2838662}, "161": {"acRate": 34.35009006058621, "difficulty": "Medium", "likes": 1391, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "161", "paidOnly": true, "title": "One Edit Distance", "titleSlug": "one-edit-distance", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209776, "totalSubmissionRaw": 610700}, "162": {"acRate": 46.00257623962133, "difficulty": "Medium", "likes": 12115, "dislikes": 4696, "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": 1482088, "totalSubmissionRaw": 3221750}, "163": {"acRate": 34.062748819301284, "difficulty": "Easy", "likes": 1097, "dislikes": 2981, "categoryTitle": "Algorithms", "frontendQuestionId": "163", "paidOnly": true, "title": "Missing Ranges", "titleSlug": "missing-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249838, "totalSubmissionRaw": 733464}, "164": {"acRate": 46.81464459184206, "difficulty": "Medium", "likes": 3279, "dislikes": 401, "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": 224090, "totalSubmissionRaw": 478675}, "165": {"acRate": 41.126576612932816, "difficulty": "Medium", "likes": 2641, "dislikes": 2734, "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": 504458, "totalSubmissionRaw": 1226599}, "166": {"acRate": 25.266082329002977, "difficulty": "Medium", "likes": 2087, "dislikes": 3676, "categoryTitle": "Algorithms", "frontendQuestionId": "166", "paidOnly": false, "title": "Fraction to Recurring Decimal", "titleSlug": "fraction-to-recurring-decimal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232450, "totalSubmissionRaw": 920010}, "167": {"acRate": 61.81970038491621, "difficulty": "Medium", "likes": 11776, "dislikes": 1418, "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": 2167199, "totalSubmissionRaw": 3505680}, "168": {"acRate": 41.31384135541766, "difficulty": "Easy", "likes": 5577, "dislikes": 818, "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": 546527, "totalSubmissionRaw": 1322866}, "169": {"acRate": 65.08820849964587, "difficulty": "Easy", "likes": 19303, "dislikes": 640, "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": 3171449, "totalSubmissionRaw": 4872548}, "170": {"acRate": 38.24922760041194, "difficulty": "Easy", "likes": 670, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "170", "paidOnly": true, "title": "Two Sum III - Data structure design", "titleSlug": "two-sum-iii-data-structure-design", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157845, "totalSubmissionRaw": 412675}, "171": {"acRate": 64.2441325617333, "difficulty": "Easy", "likes": 4778, "dislikes": 371, "categoryTitle": "Algorithms", "frontendQuestionId": "171", "paidOnly": false, "title": "Excel Sheet Column Number", "titleSlug": "excel-sheet-column-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 708828, "totalSubmissionRaw": 1103335}, "172": {"acRate": 43.67194992610944, "difficulty": "Medium", "likes": 3208, "dislikes": 1957, "categoryTitle": "Algorithms", "frontendQuestionId": "172", "paidOnly": false, "title": "Factorial Trailing Zeroes", "titleSlug": "factorial-trailing-zeroes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 473123, "totalSubmissionRaw": 1083358}, "173": {"acRate": 72.75575453801996, "difficulty": "Medium", "likes": 8570, "dislikes": 510, "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": 821140, "totalSubmissionRaw": 1128627}, "174": {"acRate": 38.33860686176515, "difficulty": "Hard", "likes": 5806, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "174", "paidOnly": false, "title": "Dungeon Game", "titleSlug": "dungeon-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231671, "totalSubmissionRaw": 604275}, "175": {"acRate": 76.47760531038756, "difficulty": "Easy", "likes": 3529, "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": 1067437, "totalSubmissionRaw": 1395752}, "176": {"acRate": 41.19396413239102, "difficulty": "Medium", "likes": 3607, "dislikes": 958, "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": 920590, "totalSubmissionRaw": 2234767}, "177": {"acRate": 37.93852872142389, "difficulty": "Medium", "likes": 1979, "dislikes": 1034, "categoryTitle": "Database", "frontendQuestionId": "177", "paidOnly": false, "title": "Nth Highest Salary", "titleSlug": "nth-highest-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 412494, "totalSubmissionRaw": 1087270}, "178": {"acRate": 63.0343609628748, "difficulty": "Medium", "likes": 2166, "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": 410464, "totalSubmissionRaw": 651175}, "179": {"acRate": 36.69443887882971, "difficulty": "Medium", "likes": 8069, "dislikes": 671, "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": 496311, "totalSubmissionRaw": 1352551}, "180": {"acRate": 44.33460299687068, "difficulty": "Medium", "likes": 2123, "dislikes": 314, "categoryTitle": "Database", "frontendQuestionId": "180", "paidOnly": false, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 407030, "totalSubmissionRaw": 918087}, "181": {"acRate": 69.99293695218597, "difficulty": "Easy", "likes": 2608, "dislikes": 256, "categoryTitle": "Database", "frontendQuestionId": "181", "paidOnly": false, "title": "Employees Earning More Than Their Managers", "titleSlug": "employees-earning-more-than-their-managers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 674853, "totalSubmissionRaw": 964173}, "182": {"acRate": 71.37164064369314, "difficulty": "Easy", "likes": 2081, "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": 700973, "totalSubmissionRaw": 982145}, "183": {"acRate": 69.44866261121688, "difficulty": "Easy", "likes": 2635, "dislikes": 137, "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": 847445, "totalSubmissionRaw": 1220248}, "184": {"acRate": 52.348209417644064, "difficulty": "Medium", "likes": 2061, "dislikes": 186, "categoryTitle": "Database", "frontendQuestionId": "184", "paidOnly": false, "title": "Department Highest Salary", "titleSlug": "department-highest-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 405172, "totalSubmissionRaw": 773994}, "185": {"acRate": 54.44441738929285, "difficulty": "Hard", "likes": 2111, "dislikes": 243, "categoryTitle": "Database", "frontendQuestionId": "185", "paidOnly": false, "title": "Department Top Three Salaries", "titleSlug": "department-top-three-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 357751, "totalSubmissionRaw": 657094}, "186": {"acRate": 54.98702695121666, "difficulty": "Medium", "likes": 1074, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "186", "paidOnly": true, "title": "Reverse Words in a String II", "titleSlug": "reverse-words-in-a-string-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 164667, "totalSubmissionRaw": 299466}, "187": {"acRate": 49.38656501653498, "difficulty": "Medium", "likes": 3338, "dislikes": 537, "categoryTitle": "Algorithms", "frontendQuestionId": "187", "paidOnly": false, "title": "Repeated DNA Sequences", "titleSlug": "repeated-dna-sequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 391270, "totalSubmissionRaw": 792257}, "188": {"acRate": 44.01824429391456, "difficulty": "Hard", "likes": 7441, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "188", "paidOnly": false, "title": "Best Time to Buy and Sell Stock IV", "titleSlug": "best-time-to-buy-and-sell-stock-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 487173, "totalSubmissionRaw": 1106754}, "189": {"acRate": 41.22287893324064, "difficulty": "Medium", "likes": 18063, "dislikes": 1982, "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": 2381280, "totalSubmissionRaw": 5776595}, "190": {"acRate": 59.68203848895225, "difficulty": "Easy", "likes": 5116, "dislikes": 1448, "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": 837338, "totalSubmissionRaw": 1402999}, "191": {"acRate": 71.98806149421563, "difficulty": "Easy", "likes": 6533, "dislikes": 1339, "categoryTitle": "Algorithms", "frontendQuestionId": "191", "paidOnly": false, "title": "Number of 1 Bits", "titleSlug": "number-of-1-bits", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1543894, "totalSubmissionRaw": 2144654}, "192": {"acRate": 25.920905171359077, "difficulty": "Medium", "likes": 543, "dislikes": 307, "categoryTitle": "Shell", "frontendQuestionId": "192", "paidOnly": false, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52966, "totalSubmissionRaw": 204337}, "193": {"acRate": 26.209907174878428, "difficulty": "Easy", "likes": 423, "dislikes": 967, "categoryTitle": "Shell", "frontendQuestionId": "193", "paidOnly": false, "title": "Valid Phone Numbers", "titleSlug": "valid-phone-numbers", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86938, "totalSubmissionRaw": 331699}, "194": {"acRate": 26.67190405632514, "difficulty": "Medium", "likes": 146, "dislikes": 287, "categoryTitle": "Shell", "frontendQuestionId": "194", "paidOnly": false, "title": "Transpose File", "titleSlug": "transpose-file", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26821, "totalSubmissionRaw": 100559}, "195": {"acRate": 33.52040693038204, "difficulty": "Easy", "likes": 389, "dislikes": 467, "categoryTitle": "Shell", "frontendQuestionId": "195", "paidOnly": false, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 110974, "totalSubmissionRaw": 331059}, "196": {"acRate": 62.56140246371008, "difficulty": "Easy", "likes": 1619, "dislikes": 332, "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": 567131, "totalSubmissionRaw": 906519}, "197": {"acRate": 48.35724674043393, "difficulty": "Easy", "likes": 2977, "dislikes": 622, "categoryTitle": "Database", "frontendQuestionId": "197", "paidOnly": false, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 739135, "totalSubmissionRaw": 1528486}, "198": {"acRate": 51.34908398676794, "difficulty": "Medium", "likes": 21133, "dislikes": 428, "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": 2358347, "totalSubmissionRaw": 4592772}, "199": {"acRate": 63.6003144991951, "difficulty": "Medium", "likes": 12043, "dislikes": 973, "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": 1414769, "totalSubmissionRaw": 2224470}, "200": {"acRate": 60.0728543310103, "difficulty": "Medium", "likes": 22833, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "200", "paidOnly": false, "title": "Number of Islands", "titleSlug": "number-of-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2861873, "totalSubmissionRaw": 4764004}, "201": {"acRate": 47.15064692549858, "difficulty": "Medium", "likes": 4013, "dislikes": 303, "categoryTitle": "Algorithms", "frontendQuestionId": "201", "paidOnly": false, "title": "Bitwise AND of Numbers Range", "titleSlug": "bitwise-and-of-numbers-range", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 407531, "totalSubmissionRaw": 864318}, "202": {"acRate": 56.57795760158854, "difficulty": "Easy", "likes": 10395, "dislikes": 1460, "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": 1544883, "totalSubmissionRaw": 2730551}, "203": {"acRate": 49.54345665952634, "difficulty": "Easy", "likes": 8329, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "203", "paidOnly": false, "title": "Remove Linked List Elements", "titleSlug": "remove-linked-list-elements", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1181167, "totalSubmissionRaw": 2384107}, "204": {"acRate": 33.875373867196394, "difficulty": "Medium", "likes": 7975, "dislikes": 1456, "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": 907212, "totalSubmissionRaw": 2678089}, "205": {"acRate": 45.52460752267391, "difficulty": "Easy", "likes": 9052, "dislikes": 2103, "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": 1433802, "totalSubmissionRaw": 3149519}, "206": {"acRate": 77.28982681883691, "difficulty": "Easy", "likes": 21647, "dislikes": 445, "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": 4391562, "totalSubmissionRaw": 5681946}, "207": {"acRate": 47.247481835926024, "difficulty": "Medium", "likes": 16245, "dislikes": 723, "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": 1664663, "totalSubmissionRaw": 3523286}, "208": {"acRate": 65.93768270619464, "difficulty": "Medium", "likes": 11576, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "208", "paidOnly": false, "title": "Implement Trie (Prefix Tree)", "titleSlug": "implement-trie-prefix-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1098469, "totalSubmissionRaw": 1665922}, "209": {"acRate": 47.58982902124359, "difficulty": "Medium", "likes": 12640, "dislikes": 440, "categoryTitle": "Algorithms", "frontendQuestionId": "209", "paidOnly": false, "title": "Minimum Size Subarray Sum", "titleSlug": "minimum-size-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1122661, "totalSubmissionRaw": 2359046}, "210": {"acRate": 51.15453953558355, "difficulty": "Medium", "likes": 10806, "dislikes": 349, "categoryTitle": "Algorithms", "frontendQuestionId": "210", "paidOnly": false, "title": "Course Schedule II", "titleSlug": "course-schedule-ii", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1101513, "totalSubmissionRaw": 2153309}, "211": {"acRate": 45.70108549138704, "difficulty": "Medium", "likes": 7596, "dislikes": 454, "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": 664534, "totalSubmissionRaw": 1454086}, "212": {"acRate": 36.499437279774675, "difficulty": "Hard", "likes": 9444, "dislikes": 461, "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": 683969, "totalSubmissionRaw": 1873921}, "213": {"acRate": 42.356589244474115, "difficulty": "Medium", "likes": 9870, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "213", "paidOnly": false, "title": "House Robber II", "titleSlug": "house-robber-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 810831, "totalSubmissionRaw": 1914303}, "214": {"acRate": 33.83472249611474, "difficulty": "Hard", "likes": 3623, "dislikes": 246, "categoryTitle": "Algorithms", "frontendQuestionId": "214", "paidOnly": false, "title": "Shortest Palindrome", "titleSlug": "shortest-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187015, "totalSubmissionRaw": 552731}, "215": {"acRate": 66.97907415133753, "difficulty": "Medium", "likes": 17113, "dislikes": 883, "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": 2432106, "totalSubmissionRaw": 3631147}, "216": {"acRate": 70.25209628591558, "difficulty": "Medium", "likes": 6000, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "216", "paidOnly": false, "title": "Combination Sum III", "titleSlug": "combination-sum-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 544411, "totalSubmissionRaw": 774939}, "217": {"acRate": 62.05600920618697, "difficulty": "Easy", "likes": 12052, "dislikes": 1301, "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": 4219654, "totalSubmissionRaw": 6799750}, "218": {"acRate": 42.93517960717207, "difficulty": "Hard", "likes": 5899, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "218", "paidOnly": false, "title": "The Skyline Problem", "titleSlug": "the-skyline-problem", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295060, "totalSubmissionRaw": 687222}, "219": {"acRate": 46.020279565504104, "difficulty": "Easy", "likes": 6171, "dislikes": 3098, "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": 1012592, "totalSubmissionRaw": 2200322}, "220": {"acRate": 22.90998968378401, "difficulty": "Hard", "likes": 1012, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "220", "paidOnly": false, "title": "Contains Duplicate III", "titleSlug": "contains-duplicate-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 258053, "totalSubmissionRaw": 1126381}, "221": {"acRate": 47.06016917593233, "difficulty": "Medium", "likes": 10132, "dislikes": 226, "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": 707668, "totalSubmissionRaw": 1503756}, "222": {"acRate": 66.62404596180248, "difficulty": "Easy", "likes": 8680, "dislikes": 520, "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": 777423, "totalSubmissionRaw": 1166880}, "223": {"acRate": 46.4931036099295, "difficulty": "Medium", "likes": 1994, "dislikes": 1646, "categoryTitle": "Algorithms", "frontendQuestionId": "223", "paidOnly": false, "title": "Rectangle Area", "titleSlug": "rectangle-area", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 228104, "totalSubmissionRaw": 490617}, "224": {"acRate": 43.767455672796466, "difficulty": "Hard", "likes": 6322, "dislikes": 501, "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": 487835, "totalSubmissionRaw": 1114606}, "225": {"acRate": 64.76443983161172, "difficulty": "Easy", "likes": 6094, "dislikes": 1211, "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": 723843, "totalSubmissionRaw": 1117655}, "226": {"acRate": 77.55857295183807, "difficulty": "Easy", "likes": 13996, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "226", "paidOnly": false, "title": "Invert Binary Tree", "titleSlug": "invert-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2183565, "totalSubmissionRaw": 2815376}, "227": {"acRate": 44.04326523484547, "difficulty": "Medium", "likes": 6152, "dislikes": 847, "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": 660792, "totalSubmissionRaw": 1500322}, "228": {"acRate": 51.26612691725252, "difficulty": "Easy", "likes": 3969, "dislikes": 2174, "categoryTitle": "Algorithms", "frontendQuestionId": "228", "paidOnly": false, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 605977, "totalSubmissionRaw": 1182024}, "229": {"acRate": 52.270887317039005, "difficulty": "Medium", "likes": 9723, "dislikes": 430, "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": 746373, "totalSubmissionRaw": 1427893}, "230": {"acRate": 73.30388028961198, "difficulty": "Medium", "likes": 11511, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "230", "paidOnly": false, "title": "Kth Smallest Element in a BST", "titleSlug": "kth-smallest-element-in-a-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1526150, "totalSubmissionRaw": 2081951}, "231": {"acRate": 47.899721696233236, "difficulty": "Easy", "likes": 6840, "dislikes": 436, "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": 1400140, "totalSubmissionRaw": 2923065}, "232": {"acRate": 66.75819862412307, "difficulty": "Easy", "likes": 7663, "dislikes": 434, "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": 990688, "totalSubmissionRaw": 1483994}, "233": {"acRate": 34.80216695571329, "difficulty": "Hard", "likes": 1564, "dislikes": 1475, "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": 97325, "totalSubmissionRaw": 279653}, "234": {"acRate": 53.83743829718084, "difficulty": "Easy", "likes": 16536, "dislikes": 885, "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": 2034189, "totalSubmissionRaw": 3778392}, "235": {"acRate": 65.66039771819406, "difficulty": "Medium", "likes": 11160, "dislikes": 319, "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": 1582081, "totalSubmissionRaw": 2409492}, "236": {"acRate": 63.379881973210395, "difficulty": "Medium", "likes": 16633, "dislikes": 417, "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": 1735247, "totalSubmissionRaw": 2737852}, "237": {"acRate": 80.44314345540788, "difficulty": "Medium", "likes": 5122, "dislikes": 1579, "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": 1468310, "totalSubmissionRaw": 1825277}, "238": {"acRate": 66.54225862234222, "difficulty": "Medium", "likes": 22683, "dislikes": 1427, "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": 2839429, "totalSubmissionRaw": 4267110}, "239": {"acRate": 46.75216358975241, "difficulty": "Hard", "likes": 18276, "dislikes": 688, "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": 1086910, "totalSubmissionRaw": 2324829}, "240": {"acRate": 53.257473597255924, "difficulty": "Medium", "likes": 11938, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "240", "paidOnly": false, "title": "Search a 2D Matrix II", "titleSlug": "search-a-2d-matrix-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 973511, "totalSubmissionRaw": 1827932}, "241": {"acRate": 65.79495068319609, "difficulty": "Medium", "likes": 5377, "dislikes": 277, "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": 225401, "totalSubmissionRaw": 342581}, "242": {"acRate": 65.06157820538192, "difficulty": "Easy", "likes": 12184, "dislikes": 404, "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": 3770908, "totalSubmissionRaw": 5795921}, "243": {"acRate": 65.43980300977407, "difficulty": "Easy", "likes": 1266, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "243", "paidOnly": true, "title": "Shortest Word Distance", "titleSlug": "shortest-word-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216858, "totalSubmissionRaw": 331386}, "244": {"acRate": 61.35062802466309, "difficulty": "Medium", "likes": 1051, "dislikes": 337, "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": 155422, "totalSubmissionRaw": 253334}, "245": {"acRate": 58.57076363226042, "difficulty": "Medium", "likes": 504, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "245", "paidOnly": true, "title": "Shortest Word Distance III", "titleSlug": "shortest-word-distance-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83051, "totalSubmissionRaw": 141796}, "246": {"acRate": 47.68218536037496, "difficulty": "Easy", "likes": 595, "dislikes": 1016, "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": 176611, "totalSubmissionRaw": 370392}, "247": {"acRate": 52.558866369498546, "difficulty": "Medium", "likes": 926, "dislikes": 250, "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": 143615, "totalSubmissionRaw": 273246}, "248": {"acRate": 42.178552537773385, "difficulty": "Hard", "likes": 301, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "248", "paidOnly": true, "title": "Strobogrammatic Number III", "titleSlug": "strobogrammatic-number-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36681, "totalSubmissionRaw": 86966}, "249": {"acRate": 65.95305214498524, "difficulty": "Medium", "likes": 1670, "dislikes": 384, "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": 246825, "totalSubmissionRaw": 374243}, "250": {"acRate": 56.56253993756047, "difficulty": "Medium", "likes": 1204, "dislikes": 429, "categoryTitle": "Algorithms", "frontendQuestionId": "250", "paidOnly": true, "title": "Count Univalue Subtrees", "titleSlug": "count-univalue-subtrees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154905, "totalSubmissionRaw": 273865}, "251": {"acRate": 49.626875734401786, "difficulty": "Medium", "likes": 716, "dislikes": 404, "categoryTitle": "Algorithms", "frontendQuestionId": "251", "paidOnly": true, "title": "Flatten 2D Vector", "titleSlug": "flatten-2d-vector", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128814, "totalSubmissionRaw": 259565}, "252": {"acRate": 58.28830919624486, "difficulty": "Easy", "likes": 2035, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "252", "paidOnly": true, "title": "Meeting Rooms", "titleSlug": "meeting-rooms", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 411898, "totalSubmissionRaw": 706657}, "253": {"acRate": 51.43770111108188, "difficulty": "Medium", "likes": 6947, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "253", "paidOnly": true, "title": "Meeting Rooms II", "titleSlug": "meeting-rooms-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 919005, "totalSubmissionRaw": 1786637}, "254": {"acRate": 49.65959367249247, "difficulty": "Medium", "likes": 1132, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "254", "paidOnly": true, "title": "Factor Combinations", "titleSlug": "factor-combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128742, "totalSubmissionRaw": 259249}, "255": {"acRate": 50.12574163146715, "difficulty": "Medium", "likes": 1203, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "255", "paidOnly": true, "title": "Verify Preorder Sequence in Binary Search Tree", "titleSlug": "verify-preorder-sequence-in-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82120, "totalSubmissionRaw": 163828}, "256": {"acRate": 62.761909833786, "difficulty": "Medium", "likes": 2295, "dislikes": 130, "categoryTitle": "Algorithms", "frontendQuestionId": "256", "paidOnly": true, "title": "Paint House", "titleSlug": "paint-house", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 212133, "totalSubmissionRaw": 337997}, "257": {"acRate": 64.36276600907834, "difficulty": "Easy", "likes": 6586, "dislikes": 299, "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": 755904, "totalSubmissionRaw": 1174443}, "258": {"acRate": 66.96631783517914, "difficulty": "Easy", "likes": 4844, "dislikes": 1937, "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": 825612, "totalSubmissionRaw": 1232877}, "259": {"acRate": 50.817759711826035, "difficulty": "Medium", "likes": 1556, "dislikes": 159, "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": 153771, "totalSubmissionRaw": 302593}, "260": {"acRate": 70.7837462584298, "difficulty": "Medium", "likes": 6358, "dislikes": 264, "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": 471063, "totalSubmissionRaw": 665496}, "261": {"acRate": 48.39763152907748, "difficulty": "Medium", "likes": 3283, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "261", "paidOnly": true, "title": "Graph Valid Tree", "titleSlug": "graph-valid-tree", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 416282, "totalSubmissionRaw": 860130}, "262": {"acRate": 36.51534872392087, "difficulty": "Hard", "likes": 1242, "dislikes": 669, "categoryTitle": "Database", "frontendQuestionId": "262", "paidOnly": false, "title": "Trips and Users", "titleSlug": "trips-and-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191894, "totalSubmissionRaw": 525516}, "263": {"acRate": 42.014106050704015, "difficulty": "Easy", "likes": 3363, "dislikes": 1707, "categoryTitle": "Algorithms", "frontendQuestionId": "263", "paidOnly": false, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 538085, "totalSubmissionRaw": 1280725}, "264": {"acRate": 46.28558786229856, "difficulty": "Medium", "likes": 5977, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "264", "paidOnly": false, "title": "Ugly Number II", "titleSlug": "ugly-number-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 351471, "totalSubmissionRaw": 759353}, "265": {"acRate": 54.95705656232839, "difficulty": "Hard", "likes": 1304, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "265", "paidOnly": true, "title": "Paint House II", "titleSlug": "paint-house-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125096, "totalSubmissionRaw": 227625}, "266": {"acRate": 67.59303225638591, "difficulty": "Easy", "likes": 1054, "dislikes": 71, "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": 207830, "totalSubmissionRaw": 307472}, "267": {"acRate": 41.780903493205344, "difficulty": "Medium", "likes": 885, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "267", "paidOnly": true, "title": "Palindrome Permutation II", "titleSlug": "palindrome-permutation-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70161, "totalSubmissionRaw": 167926}, "268": {"acRate": 67.69505592423496, "difficulty": "Easy", "likes": 12193, "dislikes": 3336, "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": 2393113, "totalSubmissionRaw": 3535133}, "269": {"acRate": 35.90560937251539, "difficulty": "Hard", "likes": 4430, "dislikes": 994, "categoryTitle": "Algorithms", "frontendQuestionId": "269", "paidOnly": true, "title": "Alien Dictionary", "titleSlug": "alien-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 390633, "totalSubmissionRaw": 1087942}, "270": {"acRate": 51.25151939350996, "difficulty": "Easy", "likes": 1812, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "270", "paidOnly": true, "title": "Closest Binary Search Tree Value", "titleSlug": "closest-binary-search-tree-value", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 355868, "totalSubmissionRaw": 694354}, "271": {"acRate": 47.31414068392558, "difficulty": "Medium", "likes": 1463, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "271", "paidOnly": true, "title": "Encode and Decode Strings", "titleSlug": "encode-and-decode-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211400, "totalSubmissionRaw": 446802}, "272": {"acRate": 59.36891293654698, "difficulty": "Hard", "likes": 1293, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "272", "paidOnly": true, "title": "Closest Binary Search Tree Value II", "titleSlug": "closest-binary-search-tree-value-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120697, "totalSubmissionRaw": 203300}, "273": {"acRate": 33.88621324624579, "difficulty": "Hard", "likes": 3565, "dislikes": 6674, "categoryTitle": "Algorithms", "frontendQuestionId": "273", "paidOnly": false, "title": "Integer to English Words", "titleSlug": "integer-to-english-words", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 494828, "totalSubmissionRaw": 1460276}, "274": {"acRate": 39.19786168710539, "difficulty": "Medium", "likes": 1316, "dislikes": 594, "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": 520745, "totalSubmissionRaw": 1328512}, "275": {"acRate": 38.32085818863432, "difficulty": "Medium", "likes": 350, "dislikes": 98, "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": 211797, "totalSubmissionRaw": 552696}, "276": {"acRate": 46.90385947752374, "difficulty": "Medium", "likes": 1558, "dislikes": 388, "categoryTitle": "Algorithms", "frontendQuestionId": "276", "paidOnly": true, "title": "Paint Fence", "titleSlug": "paint-fence", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115087, "totalSubmissionRaw": 245369}, "277": {"acRate": 47.47901781535678, "difficulty": "Medium", "likes": 2841, "dislikes": 281, "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": 273914, "totalSubmissionRaw": 576917}, "278": {"acRate": 44.70767458413056, "difficulty": "Easy", "likes": 8383, "dislikes": 3310, "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": 1732370, "totalSubmissionRaw": 3874872}, "279": {"acRate": 55.015188791117865, "difficulty": "Medium", "likes": 11206, "dislikes": 471, "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": 876365, "totalSubmissionRaw": 1592951}, "280": {"acRate": 67.78493448238493, "difficulty": "Medium", "likes": 1210, "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": 143862, "totalSubmissionRaw": 212233}, "281": {"acRate": 64.18503063845277, "difficulty": "Medium", "likes": 680, "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": 95214, "totalSubmissionRaw": 148343}, "282": {"acRate": 40.142731395911674, "difficulty": "Hard", "likes": 3397, "dislikes": 628, "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": 233041, "totalSubmissionRaw": 580531}, "283": {"acRate": 61.97157775069103, "difficulty": "Easy", "likes": 16794, "dislikes": 465, "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": 3202009, "totalSubmissionRaw": 5166902}, "284": {"acRate": 59.75343366745361, "difficulty": "Medium", "likes": 1856, "dislikes": 1036, "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": 223488, "totalSubmissionRaw": 374017}, "285": {"acRate": 50.013869625520115, "difficulty": "Medium", "likes": 2571, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "285", "paidOnly": true, "title": "Inorder Successor in BST", "titleSlug": "inorder-successor-in-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 337159, "totalSubmissionRaw": 674133}, "286": {"acRate": 61.68073803181483, "difficulty": "Medium", "likes": 3134, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "286", "paidOnly": true, "title": "Walls and Gates", "titleSlug": "walls-and-gates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 327878, "totalSubmissionRaw": 531568}, "287": {"acRate": 61.334833364110054, "difficulty": "Medium", "likes": 23345, "dislikes": 4669, "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": 1833458, "totalSubmissionRaw": 2989261}, "288": {"acRate": 26.428754850490755, "difficulty": "Medium", "likes": 203, "dislikes": 1821, "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": 74102, "totalSubmissionRaw": 280384}, "289": {"acRate": 69.76294441705187, "difficulty": "Medium", "likes": 6361, "dislikes": 575, "categoryTitle": "Algorithms", "frontendQuestionId": "289", "paidOnly": false, "title": "Game of Life", "titleSlug": "game-of-life", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 490961, "totalSubmissionRaw": 703757}, "290": {"acRate": 42.28664986763984, "difficulty": "Easy", "likes": 7271, "dislikes": 1035, "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": 763715, "totalSubmissionRaw": 1806039}, "291": {"acRate": 48.30879972103913, "difficulty": "Medium", "likes": 916, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "291", "paidOnly": true, "title": "Word Pattern II", "titleSlug": "word-pattern-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77582, "totalSubmissionRaw": 160596}, "292": {"acRate": 57.13520987884817, "difficulty": "Easy", "likes": 1726, "dislikes": 2694, "categoryTitle": "Algorithms", "frontendQuestionId": "292", "paidOnly": false, "title": "Nim Game", "titleSlug": "nim-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 391711, "totalSubmissionRaw": 685586}, "293": {"acRate": 64.67262527005366, "difficulty": "Easy", "likes": 225, "dislikes": 466, "categoryTitle": "Algorithms", "frontendQuestionId": "293", "paidOnly": true, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74239, "totalSubmissionRaw": 114792}, "294": {"acRate": 52.146114050214834, "difficulty": "Medium", "likes": 619, "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": 71363, "totalSubmissionRaw": 136852}, "295": {"acRate": 52.20677674868519, "difficulty": "Hard", "likes": 11937, "dislikes": 241, "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": 830066, "totalSubmissionRaw": 1589959}, "296": {"acRate": 60.97538358382493, "difficulty": "Hard", "likes": 1181, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "296", "paidOnly": true, "title": "Best Meeting Point", "titleSlug": "best-meeting-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85482, "totalSubmissionRaw": 140191}, "297": {"acRate": 57.2809645102326, "difficulty": "Hard", "likes": 10191, "dislikes": 397, "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": 904699, "totalSubmissionRaw": 1579408}, "298": {"acRate": 53.67093683539681, "difficulty": "Medium", "likes": 1140, "dislikes": 237, "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": 149904, "totalSubmissionRaw": 279302}, "299": {"acRate": 50.517596424433044, "difficulty": "Medium", "likes": 2439, "dislikes": 1782, "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": 381471, "totalSubmissionRaw": 755125}, "300": {"acRate": 56.00792615540415, "difficulty": "Medium", "likes": 20920, "dislikes": 446, "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": 1787466, "totalSubmissionRaw": 3191455}, "301": {"acRate": 48.44575743017203, "difficulty": "Hard", "likes": 5858, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "301", "paidOnly": false, "title": "Remove Invalid Parentheses", "titleSlug": "remove-invalid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 439652, "totalSubmissionRaw": 907515}, "302": {"acRate": 59.05364473084075, "difficulty": "Hard", "likes": 528, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "302", "paidOnly": true, "title": "Smallest Rectangle Enclosing Black Pixels", "titleSlug": "smallest-rectangle-enclosing-black-pixels", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50495, "totalSubmissionRaw": 85507}, "303": {"acRate": 64.37389486480512, "difficulty": "Easy", "likes": 3249, "dislikes": 1910, "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": 559198, "totalSubmissionRaw": 868672}, "304": {"acRate": 55.049848351147446, "difficulty": "Medium", "likes": 4970, "dislikes": 344, "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": 376803, "totalSubmissionRaw": 684475}, "305": {"acRate": 39.89394204498042, "difficulty": "Hard", "likes": 1867, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "305", "paidOnly": true, "title": "Number of Islands II", "titleSlug": "number-of-islands-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148204, "totalSubmissionRaw": 371494}, "306": {"acRate": 31.887188411731586, "difficulty": "Medium", "likes": 1175, "dislikes": 802, "categoryTitle": "Algorithms", "frontendQuestionId": "306", "paidOnly": false, "title": "Additive Number", "titleSlug": "additive-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93446, "totalSubmissionRaw": 293053}, "307": {"acRate": 41.20276648164089, "difficulty": "Medium", "likes": 4760, "dislikes": 255, "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": 277616, "totalSubmissionRaw": 673780}, "308": {"acRate": 44.212728086932366, "difficulty": "Hard", "likes": 800, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "308", "paidOnly": true, "title": "Range Sum Query 2D - Mutable", "titleSlug": "range-sum-query-2d-mutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77997, "totalSubmissionRaw": 176413}, "309": {"acRate": 58.836366805946724, "difficulty": "Medium", "likes": 9405, "dislikes": 323, "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": 540006, "totalSubmissionRaw": 917809}, "310": {"acRate": 41.82215333503371, "difficulty": "Medium", "likes": 8257, "dislikes": 383, "categoryTitle": "Algorithms", "frontendQuestionId": "310", "paidOnly": false, "title": "Minimum Height Trees", "titleSlug": "minimum-height-trees", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 383693, "totalSubmissionRaw": 917440}, "311": {"acRate": 68.20621926648161, "difficulty": "Medium", "likes": 1063, "dislikes": 360, "categoryTitle": "Algorithms", "frontendQuestionId": "311", "paidOnly": true, "title": "Sparse Matrix Multiplication", "titleSlug": "sparse-matrix-multiplication", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193632, "totalSubmissionRaw": 283892}, "312": {"acRate": 59.53019163600847, "difficulty": "Hard", "likes": 8979, "dislikes": 252, "categoryTitle": "Algorithms", "frontendQuestionId": "312", "paidOnly": false, "title": "Burst Balloons", "titleSlug": "burst-balloons", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 300482, "totalSubmissionRaw": 504757}, "313": {"acRate": 45.30270606102444, "difficulty": "Medium", "likes": 2159, "dislikes": 386, "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": 131251, "totalSubmissionRaw": 289720}, "314": {"acRate": 54.886923449983406, "difficulty": "Medium", "likes": 3255, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "314", "paidOnly": true, "title": "Binary Tree Vertical Order Traversal", "titleSlug": "binary-tree-vertical-order-traversal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 430059, "totalSubmissionRaw": 783537}, "315": {"acRate": 42.55225779647374, "difficulty": "Hard", "likes": 8838, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "315", "paidOnly": false, "title": "Count of Smaller Numbers After Self", "titleSlug": "count-of-smaller-numbers-after-self", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 327745, "totalSubmissionRaw": 770219}, "316": {"acRate": 49.98422298185643, "difficulty": "Medium", "likes": 8667, "dislikes": 632, "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": 342162, "totalSubmissionRaw": 684540}, "317": {"acRate": 43.414662197292984, "difficulty": "Hard", "likes": 1875, "dislikes": 302, "categoryTitle": "Algorithms", "frontendQuestionId": "317", "paidOnly": true, "title": "Shortest Distance from All Buildings", "titleSlug": "shortest-distance-from-all-buildings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 181195, "totalSubmissionRaw": 417359}, "318": {"acRate": 60.080202168348215, "difficulty": "Medium", "likes": 3508, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "318", "paidOnly": false, "title": "Maximum Product of Word Lengths", "titleSlug": "maximum-product-of-word-lengths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220388, "totalSubmissionRaw": 366823}, "319": {"acRate": 52.98290828579126, "difficulty": "Medium", "likes": 2661, "dislikes": 3119, "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": 226139, "totalSubmissionRaw": 426814}, "320": {"acRate": 58.610408307563866, "difficulty": "Medium", "likes": 683, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "320", "paidOnly": true, "title": "Generalized Abbreviation", "titleSlug": "generalized-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68801, "totalSubmissionRaw": 117387}, "321": {"acRate": 30.54792914439809, "difficulty": "Hard", "likes": 1937, "dislikes": 354, "categoryTitle": "Algorithms", "frontendQuestionId": "321", "paidOnly": false, "title": "Create Maximum Number", "titleSlug": "create-maximum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62531, "totalSubmissionRaw": 204698}, "322": {"acRate": 44.54233371294698, "difficulty": "Medium", "likes": 18975, "dislikes": 453, "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": 1901993, "totalSubmissionRaw": 4270096}, "323": {"acRate": 63.10929858136638, "difficulty": "Medium", "likes": 2675, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "323", "paidOnly": true, "title": "Number of Connected Components in an Undirected Graph", "titleSlug": "number-of-connected-components-in-an-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 415498, "totalSubmissionRaw": 658379}, "324": {"acRate": 34.62191896460667, "difficulty": "Medium", "likes": 3073, "dislikes": 960, "categoryTitle": "Algorithms", "frontendQuestionId": "324", "paidOnly": false, "title": "Wiggle Sort II", "titleSlug": "wiggle-sort-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 163233, "totalSubmissionRaw": 471471}, "325": {"acRate": 49.57735175632653, "difficulty": "Medium", "likes": 2038, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "325", "paidOnly": true, "title": "Maximum Size Subarray Sum Equals k", "titleSlug": "maximum-size-subarray-sum-equals-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187800, "totalSubmissionRaw": 378802}, "326": {"acRate": 46.88177361087219, "difficulty": "Easy", "likes": 3099, "dislikes": 277, "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": 872076, "totalSubmissionRaw": 1860160}, "327": {"acRate": 36.03732067443269, "difficulty": "Hard", "likes": 2305, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "327", "paidOnly": false, "title": "Count of Range Sum", "titleSlug": "count-of-range-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79103, "totalSubmissionRaw": 219503}, "328": {"acRate": 61.530860793234986, "difficulty": "Medium", "likes": 10012, "dislikes": 534, "categoryTitle": "Algorithms", "frontendQuestionId": "328", "paidOnly": false, "title": "Odd Even Linked List", "titleSlug": "odd-even-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 990748, "totalSubmissionRaw": 1610163}, "329": {"acRate": 53.93523212035193, "difficulty": "Hard", "likes": 8968, "dislikes": 135, "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": 542647, "totalSubmissionRaw": 1006112}, "330": {"acRate": 53.12534546465625, "difficulty": "Hard", "likes": 2303, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "330", "paidOnly": false, "title": "Patching Array", "titleSlug": "patching-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158585, "totalSubmissionRaw": 298511}, "331": {"acRate": 45.425901370209004, "difficulty": "Medium", "likes": 2332, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "331", "paidOnly": false, "title": "Verify Preorder Serialization of a Binary Tree", "titleSlug": "verify-preorder-serialization-of-a-binary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143882, "totalSubmissionRaw": 316740}, "332": {"acRate": 43.25410735027428, "difficulty": "Hard", "likes": 5891, "dislikes": 1871, "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": 440534, "totalSubmissionRaw": 1018475}, "333": {"acRate": 44.156115263872046, "difficulty": "Medium", "likes": 1490, "dislikes": 130, "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": 109992, "totalSubmissionRaw": 249098}, "334": {"acRate": 39.52282497270323, "difficulty": "Medium", "likes": 8127, "dislikes": 546, "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": 615713, "totalSubmissionRaw": 1557859}, "335": {"acRate": 30.767233770054865, "difficulty": "Hard", "likes": 384, "dislikes": 510, "categoryTitle": "Algorithms", "frontendQuestionId": "335", "paidOnly": false, "title": "Self Crossing", "titleSlug": "self-crossing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35554, "totalSubmissionRaw": 115558}, "336": {"acRate": 35.48660829975457, "difficulty": "Hard", "likes": 4467, "dislikes": 468, "categoryTitle": "Algorithms", "frontendQuestionId": "336", "paidOnly": false, "title": "Palindrome Pairs", "titleSlug": "palindrome-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209514, "totalSubmissionRaw": 590403}, "337": {"acRate": 54.3654905307018, "difficulty": "Medium", "likes": 8538, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "337", "paidOnly": false, "title": "House Robber III", "titleSlug": "house-robber-iii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 392471, "totalSubmissionRaw": 721912}, "338": {"acRate": 78.67745276689416, "difficulty": "Easy", "likes": 11125, "dislikes": 544, "categoryTitle": "Algorithms", "frontendQuestionId": "338", "paidOnly": false, "title": "Counting Bits", "titleSlug": "counting-bits", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1164462, "totalSubmissionRaw": 1480047}, "339": {"acRate": 84.04954636822947, "difficulty": "Medium", "likes": 1730, "dislikes": 424, "categoryTitle": "Algorithms", "frontendQuestionId": "339", "paidOnly": true, "title": "Nested List Weight Sum", "titleSlug": "nested-list-weight-sum", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 293949, "totalSubmissionRaw": 349733}, "340": {"acRate": 48.95781042580012, "difficulty": "Medium", "likes": 2833, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "340", "paidOnly": true, "title": "Longest Substring with At Most K Distinct Characters", "titleSlug": "longest-substring-with-at-most-k-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 351098, "totalSubmissionRaw": 717144}, "341": {"acRate": 64.67740731507733, "difficulty": "Medium", "likes": 4887, "dislikes": 1757, "categoryTitle": "Algorithms", "frontendQuestionId": "341", "paidOnly": false, "title": "Flatten Nested List Iterator", "titleSlug": "flatten-nested-list-iterator", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 459214, "totalSubmissionRaw": 709998}, "342": {"acRate": 48.275443994782435, "difficulty": "Easy", "likes": 3927, "dislikes": 398, "categoryTitle": "Algorithms", "frontendQuestionId": "342", "paidOnly": false, "title": "Power of Four", "titleSlug": "power-of-four", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 692825, "totalSubmissionRaw": 1435150}, "343": {"acRate": 60.529026689441125, "difficulty": "Medium", "likes": 5115, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "343", "paidOnly": false, "title": "Integer Break", "titleSlug": "integer-break", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 366062, "totalSubmissionRaw": 604771}, "344": {"acRate": 78.86323465181667, "difficulty": "Easy", "likes": 8661, "dislikes": 1177, "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": 2773431, "totalSubmissionRaw": 3516761}, "345": {"acRate": 53.8798861857167, "difficulty": "Easy", "likes": 4594, "dislikes": 2791, "categoryTitle": "Algorithms", "frontendQuestionId": "345", "paidOnly": false, "title": "Reverse Vowels of a String", "titleSlug": "reverse-vowels-of-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 938089, "totalSubmissionRaw": 1741078}, "346": {"acRate": 78.70410358690873, "difficulty": "Easy", "likes": 1658, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "346", "paidOnly": true, "title": "Moving Average from Data Stream", "titleSlug": "moving-average-from-data-stream", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 400925, "totalSubmissionRaw": 509408}, "347": {"acRate": 63.096990148267494, "difficulty": "Medium", "likes": 17387, "dislikes": 662, "categoryTitle": "Algorithms", "frontendQuestionId": "347", "paidOnly": false, "title": "Top K Frequent Elements", "titleSlug": "top-k-frequent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2252967, "totalSubmissionRaw": 3570641}, "348": {"acRate": 58.15227089952975, "difficulty": "Medium", "likes": 2068, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "348", "paidOnly": true, "title": "Design Tic-Tac-Toe", "titleSlug": "design-tic-tac-toe", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250914, "totalSubmissionRaw": 431479}, "349": {"acRate": 74.99169980379217, "difficulty": "Easy", "likes": 6094, "dislikes": 2294, "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": 1276181, "totalSubmissionRaw": 1701764}, "350": {"acRate": 58.59655458786367, "difficulty": "Easy", "likes": 7689, "dislikes": 974, "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": 1408318, "totalSubmissionRaw": 2403420}, "351": {"acRate": 52.308871835632246, "difficulty": "Medium", "likes": 166, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "351", "paidOnly": true, "title": "Android Unlock Patterns", "titleSlug": "android-unlock-patterns", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74351, "totalSubmissionRaw": 142149}, "352": {"acRate": 60.12890943704107, "difficulty": "Hard", "likes": 1733, "dislikes": 364, "categoryTitle": "Algorithms", "frontendQuestionId": "352", "paidOnly": false, "title": "Data Stream as Disjoint Intervals", "titleSlug": "data-stream-as-disjoint-intervals", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110547, "totalSubmissionRaw": 183850}, "353": {"acRate": 38.846568921841765, "difficulty": "Medium", "likes": 943, "dislikes": 334, "categoryTitle": "Algorithms", "frontendQuestionId": "353", "paidOnly": true, "title": "Design Snake Game", "titleSlug": "design-snake-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86028, "totalSubmissionRaw": 221456}, "354": {"acRate": 37.07263050018182, "difficulty": "Hard", "likes": 5982, "dislikes": 147, "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": 224282, "totalSubmissionRaw": 604980}, "355": {"acRate": 40.24050551158464, "difficulty": "Medium", "likes": 3920, "dislikes": 534, "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": 193150, "totalSubmissionRaw": 479989}, "356": {"acRate": 35.68316695825186, "difficulty": "Medium", "likes": 300, "dislikes": 620, "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": 41608, "totalSubmissionRaw": 116604}, "357": {"acRate": 53.26704862117395, "difficulty": "Medium", "likes": 1535, "dislikes": 1495, "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": 143364, "totalSubmissionRaw": 269142}, "358": {"acRate": 38.91310648315185, "difficulty": "Hard", "likes": 963, "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": 65790, "totalSubmissionRaw": 169069}, "359": {"acRate": 76.0433904564076, "difficulty": "Easy", "likes": 1733, "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": 329477, "totalSubmissionRaw": 433275}, "360": {"acRate": 55.98584411635529, "difficulty": "Medium", "likes": 673, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "360", "paidOnly": true, "title": "Sort Transformed Array", "titleSlug": "sort-transformed-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66285, "totalSubmissionRaw": 118396}, "361": {"acRate": 51.83971790772793, "difficulty": "Medium", "likes": 961, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "361", "paidOnly": true, "title": "Bomb Enemy", "titleSlug": "bomb-enemy", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78800, "totalSubmissionRaw": 152007}, "362": {"acRate": 68.79167970058438, "difficulty": "Medium", "likes": 2036, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "362", "paidOnly": true, "title": "Design Hit Counter", "titleSlug": "design-hit-counter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 248501, "totalSubmissionRaw": 361237}, "363": {"acRate": 44.23198114291484, "difficulty": "Hard", "likes": 3459, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "363", "paidOnly": false, "title": "Max Sum of Rectangle No Larger Than K", "titleSlug": "max-sum-of-rectangle-no-larger-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127040, "totalSubmissionRaw": 287213}, "364": {"acRate": 64.83835120092638, "difficulty": "Medium", "likes": 1125, "dislikes": 455, "categoryTitle": "Algorithms", "frontendQuestionId": "364", "paidOnly": true, "title": "Nested List Weight Sum II", "titleSlug": "nested-list-weight-sum-ii", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138863, "totalSubmissionRaw": 214168}, "365": {"acRate": 41.23767100266186, "difficulty": "Medium", "likes": 1513, "dislikes": 1472, "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": 106740, "totalSubmissionRaw": 258841}, "366": {"acRate": 80.67770714877945, "difficulty": "Medium", "likes": 3223, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "366", "paidOnly": true, "title": "Find Leaves of Binary Tree", "titleSlug": "find-leaves-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 259803, "totalSubmissionRaw": 322026}, "367": {"acRate": 43.798777370780705, "difficulty": "Easy", "likes": 4248, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "367", "paidOnly": false, "title": "Valid Perfect Square", "titleSlug": "valid-perfect-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 641740, "totalSubmissionRaw": 1465202}, "368": {"acRate": 45.55638326489951, "difficulty": "Medium", "likes": 5952, "dislikes": 282, "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": 308219, "totalSubmissionRaw": 676566}, "369": {"acRate": 61.093407838103154, "difficulty": "Medium", "likes": 943, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "369", "paidOnly": true, "title": "Plus One Linked List", "titleSlug": "plus-one-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 80906, "totalSubmissionRaw": 132430}, "370": {"acRate": 71.74912955144521, "difficulty": "Medium", "likes": 1639, "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": 94998, "totalSubmissionRaw": 132403}, "371": {"acRate": 52.31253714716032, "difficulty": "Medium", "likes": 4212, "dislikes": 5548, "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": 504327, "totalSubmissionRaw": 964064}, "372": {"acRate": 35.070917629716426, "difficulty": "Medium", "likes": 941, "dislikes": 1440, "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": 74229, "totalSubmissionRaw": 211654}, "373": {"acRate": 40.072606674822694, "difficulty": "Medium", "likes": 6245, "dislikes": 449, "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": 311497, "totalSubmissionRaw": 777332}, "374": {"acRate": 53.9971678833262, "difficulty": "Easy", "likes": 3755, "dislikes": 539, "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": 688278, "totalSubmissionRaw": 1274651}, "375": {"acRate": 49.609676622293605, "difficulty": "Medium", "likes": 2156, "dislikes": 2122, "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": 128497, "totalSubmissionRaw": 259016}, "376": {"acRate": 48.56386237272889, "difficulty": "Medium", "likes": 5116, "dislikes": 165, "categoryTitle": "Algorithms", "frontendQuestionId": "376", "paidOnly": false, "title": "Wiggle Subsequence", "titleSlug": "wiggle-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250506, "totalSubmissionRaw": 515828}, "377": {"acRate": 54.24793265859614, "difficulty": "Medium", "likes": 7397, "dislikes": 664, "categoryTitle": "Algorithms", "frontendQuestionId": "377", "paidOnly": false, "title": "Combination Sum IV", "titleSlug": "combination-sum-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 497453, "totalSubmissionRaw": 916999}, "378": {"acRate": 62.67086170276118, "difficulty": "Medium", "likes": 9931, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "378", "paidOnly": false, "title": "Kth Smallest Element in a Sorted Matrix", "titleSlug": "kth-smallest-element-in-a-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 631432, "totalSubmissionRaw": 1007538}, "379": {"acRate": 51.83106452913269, "difficulty": "Medium", "likes": 353, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "379", "paidOnly": true, "title": "Design Phone Directory", "titleSlug": "design-phone-directory", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66860, "totalSubmissionRaw": 128996}, "380": {"acRate": 54.57683231782482, "difficulty": "Medium", "likes": 9234, "dislikes": 626, "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": 960747, "totalSubmissionRaw": 1760360}, "381": {"acRate": 35.550124502052405, "difficulty": "Hard", "likes": 2293, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "381", "paidOnly": false, "title": "Insert Delete GetRandom O(1) - Duplicates allowed", "titleSlug": "insert-delete-getrandom-o1-duplicates-allowed", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146624, "totalSubmissionRaw": 412443}, "382": {"acRate": 63.33721592512585, "difficulty": "Medium", "likes": 3078, "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": 246872, "totalSubmissionRaw": 389774}, "383": {"acRate": 62.22806099851091, "difficulty": "Easy", "likes": 5010, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "383", "paidOnly": false, "title": "Ransom Note", "titleSlug": "ransom-note", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1241978, "totalSubmissionRaw": 1995848}, "384": {"acRate": 58.46700394634342, "difficulty": "Medium", "likes": 1349, "dislikes": 928, "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": 341497, "totalSubmissionRaw": 584085}, "385": {"acRate": 38.569516512932765, "difficulty": "Medium", "likes": 458, "dislikes": 1384, "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": 58498, "totalSubmissionRaw": 151669}, "386": {"acRate": 64.50952325160844, "difficulty": "Medium", "likes": 1972, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "386", "paidOnly": false, "title": "Lexicographical Numbers", "titleSlug": "lexicographical-numbers", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 126638, "totalSubmissionRaw": 196309}, "387": {"acRate": 62.42346730427485, "difficulty": "Easy", "likes": 8981, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "387", "paidOnly": false, "title": "First Unique Character in a String", "titleSlug": "first-unique-character-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1773209, "totalSubmissionRaw": 2840613}, "388": {"acRate": 47.69277045013611, "difficulty": "Medium", "likes": 1290, "dislikes": 2498, "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": 158555, "totalSubmissionRaw": 332449}, "389": {"acRate": 59.60571585959637, "difficulty": "Easy", "likes": 5001, "dislikes": 480, "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": 766089, "totalSubmissionRaw": 1285259}, "390": {"acRate": 45.832954538567364, "difficulty": "Medium", "likes": 1558, "dislikes": 709, "categoryTitle": "Algorithms", "frontendQuestionId": "390", "paidOnly": false, "title": "Elimination Game", "titleSlug": "elimination-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75623, "totalSubmissionRaw": 164997}, "391": {"acRate": 33.939103977752694, "difficulty": "Hard", "likes": 882, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "391", "paidOnly": false, "title": "Perfect Rectangle", "titleSlug": "perfect-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45400, "totalSubmissionRaw": 133769}, "392": {"acRate": 48.08591146574419, "difficulty": "Easy", "likes": 9653, "dislikes": 536, "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": 1561311, "totalSubmissionRaw": 3246922}, "393": {"acRate": 45.20946266462437, "difficulty": "Medium", "likes": 904, "dislikes": 2865, "categoryTitle": "Algorithms", "frontendQuestionId": "393", "paidOnly": false, "title": "UTF-8 Validation", "titleSlug": "utf-8-validation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124850, "totalSubmissionRaw": 276159}, "394": {"acRate": 59.60032994568347, "difficulty": "Medium", "likes": 12703, "dislikes": 618, "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": 842489, "totalSubmissionRaw": 1413565}, "395": {"acRate": 45.02318609770949, "difficulty": "Medium", "likes": 6231, "dislikes": 516, "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": 230688, "totalSubmissionRaw": 512376}, "396": {"acRate": 42.820404373338, "difficulty": "Medium", "likes": 1564, "dislikes": 268, "categoryTitle": "Algorithms", "frontendQuestionId": "396", "paidOnly": false, "title": "Rotate Function", "titleSlug": "rotate-function", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88082, "totalSubmissionRaw": 205701}, "397": {"acRate": 35.986258063763515, "difficulty": "Medium", "likes": 1334, "dislikes": 479, "categoryTitle": "Algorithms", "frontendQuestionId": "397", "paidOnly": false, "title": "Integer Replacement", "titleSlug": "integer-replacement", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123393, "totalSubmissionRaw": 342891}, "398": {"acRate": 63.697267647011, "difficulty": "Medium", "likes": 1287, "dislikes": 1288, "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": 235033, "totalSubmissionRaw": 368985}, "399": {"acRate": 62.041596910015485, "difficulty": "Medium", "likes": 9298, "dislikes": 942, "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": 494729, "totalSubmissionRaw": 797415}, "400": {"acRate": 35.024593651005716, "difficulty": "Medium", "likes": 1076, "dislikes": 2060, "categoryTitle": "Algorithms", "frontendQuestionId": "400", "paidOnly": false, "title": "Nth Digit", "titleSlug": "nth-digit", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 99618, "totalSubmissionRaw": 284423}, "401": {"acRate": 54.90972260723328, "difficulty": "Easy", "likes": 1397, "dislikes": 2569, "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": 148560, "totalSubmissionRaw": 270554}, "402": {"acRate": 33.76950813281238, "difficulty": "Medium", "likes": 9502, "dislikes": 492, "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": 504145, "totalSubmissionRaw": 1492900}, "403": {"acRate": 46.15494120179166, "difficulty": "Hard", "likes": 5583, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "403", "paidOnly": false, "title": "Frog Jump", "titleSlug": "frog-jump", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272346, "totalSubmissionRaw": 590069}, "404": {"acRate": 60.857637087668984, "difficulty": "Easy", "likes": 5488, "dislikes": 310, "categoryTitle": "Algorithms", "frontendQuestionId": "404", "paidOnly": false, "title": "Sum of Left Leaves", "titleSlug": "sum-of-left-leaves", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 638197, "totalSubmissionRaw": 1048672}, "405": {"acRate": 49.01783006266012, "difficulty": "Easy", "likes": 1312, "dislikes": 220, "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": 151919, "totalSubmissionRaw": 309926}, "406": {"acRate": 73.64222507714288, "difficulty": "Medium", "likes": 7076, "dislikes": 717, "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": 306672, "totalSubmissionRaw": 416435}, "407": {"acRate": 48.14610027114679, "difficulty": "Hard", "likes": 3744, "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": 90558, "totalSubmissionRaw": 188090}, "408": {"acRate": 36.00668440923439, "difficulty": "Easy", "likes": 738, "dislikes": 2216, "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": 203615, "totalSubmissionRaw": 565494}, "409": {"acRate": 55.34929308711699, "difficulty": "Easy", "likes": 5914, "dislikes": 410, "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": 806969, "totalSubmissionRaw": 1457958}, "410": {"acRate": 56.06133595071928, "difficulty": "Hard", "likes": 9859, "dislikes": 225, "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": 372401, "totalSubmissionRaw": 664275}, "411": {"acRate": 39.804859692506184, "difficulty": "Hard", "likes": 181, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "411", "paidOnly": true, "title": "Minimum Unique Word Abbreviation", "titleSlug": "minimum-unique-word-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14809, "totalSubmissionRaw": 37204}, "412": {"acRate": 72.72072343006487, "difficulty": "Easy", "likes": 2782, "dislikes": 382, "categoryTitle": "Algorithms", "frontendQuestionId": "412", "paidOnly": false, "title": "Fizz Buzz", "titleSlug": "fizz-buzz", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1296087, "totalSubmissionRaw": 1782282}, "413": {"acRate": 65.02622302826411, "difficulty": "Medium", "likes": 5347, "dislikes": 295, "categoryTitle": "Algorithms", "frontendQuestionId": "413", "paidOnly": false, "title": "Arithmetic Slices", "titleSlug": "arithmetic-slices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 311575, "totalSubmissionRaw": 479155}, "414": {"acRate": 35.37077453747256, "difficulty": "Easy", "likes": 3040, "dislikes": 3180, "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": 563986, "totalSubmissionRaw": 1594496}, "415": {"acRate": 51.669331124579365, "difficulty": "Easy", "likes": 5044, "dislikes": 755, "categoryTitle": "Algorithms", "frontendQuestionId": "415", "paidOnly": false, "title": "Add Strings", "titleSlug": "add-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 696173, "totalSubmissionRaw": 1347362}, "416": {"acRate": 46.59474123604605, "difficulty": "Medium", "likes": 12297, "dislikes": 250, "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": 892431, "totalSubmissionRaw": 1915298}, "417": {"acRate": 55.73286331395179, "difficulty": "Medium", "likes": 7409, "dislikes": 1480, "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": 495168, "totalSubmissionRaw": 888467}, "418": {"acRate": 36.234804194095545, "difficulty": "Medium", "likes": 1117, "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": 102326, "totalSubmissionRaw": 282397}, "419": {"acRate": 75.54538023573872, "difficulty": "Medium", "likes": 2293, "dislikes": 971, "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": 213492, "totalSubmissionRaw": 282601}, "420": {"acRate": 13.906770718063694, "difficulty": "Hard", "likes": 880, "dislikes": 1731, "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": 43357, "totalSubmissionRaw": 311769}, "421": {"acRate": 53.29587861131036, "difficulty": "Medium", "likes": 5519, "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": 168666, "totalSubmissionRaw": 316471}, "422": {"acRate": 41.31779241375967, "difficulty": "Easy", "likes": 429, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "422", "paidOnly": true, "title": "Valid Word Square", "titleSlug": "valid-word-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59660, "totalSubmissionRaw": 144393}, "423": {"acRate": 51.192759118251494, "difficulty": "Medium", "likes": 828, "dislikes": 2728, "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": 81955, "totalSubmissionRaw": 160091}, "424": {"acRate": 54.815265022413996, "difficulty": "Medium", "likes": 10725, "dislikes": 542, "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": 816208, "totalSubmissionRaw": 1489014}, "425": {"acRate": 53.501366664768526, "difficulty": "Hard", "likes": 1090, "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": 75163, "totalSubmissionRaw": 140488}, "426": {"acRate": 64.88602514180124, "difficulty": "Medium", "likes": 2609, "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": 297771, "totalSubmissionRaw": 458913}, "427": {"acRate": 75.7646867011768, "difficulty": "Medium", "likes": 1512, "dislikes": 1838, "categoryTitle": "Algorithms", "frontendQuestionId": "427", "paidOnly": false, "title": "Construct Quad Tree", "titleSlug": "construct-quad-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130116, "totalSubmissionRaw": 171737}, "428": {"acRate": 67.45560350660872, "difficulty": "Hard", "likes": 1050, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "428", "paidOnly": true, "title": "Serialize and Deserialize N-ary Tree", "titleSlug": "serialize-and-deserialize-n-ary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89719, "totalSubmissionRaw": 133005}, "429": {"acRate": 70.91026054855678, "difficulty": "Medium", "likes": 3622, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "429", "paidOnly": false, "title": "N-ary Tree Level Order Traversal", "titleSlug": "n-ary-tree-level-order-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 311947, "totalSubmissionRaw": 439918}, "430": {"acRate": 60.32403395979659, "difficulty": "Medium", "likes": 5037, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "430", "paidOnly": false, "title": "Flatten a Multilevel Doubly Linked List", "titleSlug": "flatten-a-multilevel-doubly-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 334875, "totalSubmissionRaw": 555117}, "431": {"acRate": 79.61136995701953, "difficulty": "Hard", "likes": 519, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "431", "paidOnly": true, "title": "Encode N-ary Tree to Binary Tree", "titleSlug": "encode-n-ary-tree-to-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22042, "totalSubmissionRaw": 27687}, "432": {"acRate": 37.009413977691246, "difficulty": "Hard", "likes": 1576, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "432", "paidOnly": false, "title": "All O`one Data Structure", "titleSlug": "all-oone-data-structure", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 84209, "totalSubmissionRaw": 227534}, "433": {"acRate": 54.19105087995534, "difficulty": "Medium", "likes": 2976, "dislikes": 323, "categoryTitle": "Algorithms", "frontendQuestionId": "433", "paidOnly": false, "title": "Minimum Genetic Mutation", "titleSlug": "minimum-genetic-mutation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178622, "totalSubmissionRaw": 329617}, "434": {"acRate": 36.35480080562342, "difficulty": "Easy", "likes": 790, "dislikes": 1263, "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": 191516, "totalSubmissionRaw": 526797}, "435": {"acRate": 53.82463810296755, "difficulty": "Medium", "likes": 8182, "dislikes": 221, "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": 612128, "totalSubmissionRaw": 1137266}, "436": {"acRate": 52.47185034134232, "difficulty": "Medium", "likes": 2155, "dislikes": 357, "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": 118365, "totalSubmissionRaw": 225577}, "437": {"acRate": 46.13350553847192, "difficulty": "Medium", "likes": 10971, "dislikes": 520, "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": 587948, "totalSubmissionRaw": 1274443}, "438": {"acRate": 51.155462900898655, "difficulty": "Medium", "likes": 12346, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "438", "paidOnly": false, "title": "Find All Anagrams in a String", "titleSlug": "find-all-anagrams-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 900550, "totalSubmissionRaw": 1760419}, "439": {"acRate": 61.06741778541903, "difficulty": "Medium", "likes": 495, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "439", "paidOnly": true, "title": "Ternary Expression Parser", "titleSlug": "ternary-expression-parser", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33388, "totalSubmissionRaw": 54674}, "440": {"acRate": 32.547633346071954, "difficulty": "Hard", "likes": 766, "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": 23847, "totalSubmissionRaw": 73268}, "441": {"acRate": 46.760563667946926, "difficulty": "Easy", "likes": 3884, "dislikes": 1328, "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": 457889, "totalSubmissionRaw": 979224}, "442": {"acRate": 75.86137512056371, "difficulty": "Medium", "likes": 10454, "dislikes": 404, "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": 803040, "totalSubmissionRaw": 1058564}, "443": {"acRate": 55.34393558971994, "difficulty": "Medium", "likes": 5075, "dislikes": 7950, "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": 633497, "totalSubmissionRaw": 1144657}, "444": {"acRate": 28.429701056849282, "difficulty": "Medium", "likes": 571, "dislikes": 1510, "categoryTitle": "Algorithms", "frontendQuestionId": "444", "paidOnly": true, "title": "Sequence Reconstruction", "titleSlug": "sequence-reconstruction", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56195, "totalSubmissionRaw": 197663}, "445": {"acRate": 61.30251012452695, "difficulty": "Medium", "likes": 5887, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "445", "paidOnly": false, "title": "Add Two Numbers II", "titleSlug": "add-two-numbers-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 485145, "totalSubmissionRaw": 791393}, "446": {"acRate": 54.57249822197673, "difficulty": "Hard", "likes": 3349, "dislikes": 154, "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": 151161, "totalSubmissionRaw": 276992}, "447": {"acRate": 55.62652783322487, "difficulty": "Medium", "likes": 837, "dislikes": 1015, "categoryTitle": "Algorithms", "frontendQuestionId": "447", "paidOnly": false, "title": "Number of Boomerangs", "titleSlug": "number-of-boomerangs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101717, "totalSubmissionRaw": 182857}, "448": {"acRate": 61.22351301980159, "difficulty": "Easy", "likes": 9426, "dislikes": 492, "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": 920996, "totalSubmissionRaw": 1504319}, "449": {"acRate": 57.862354126742076, "difficulty": "Medium", "likes": 3487, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "449", "paidOnly": false, "title": "Serialize and Deserialize BST", "titleSlug": "serialize-and-deserialize-bst", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239433, "totalSubmissionRaw": 413799}, "450": {"acRate": 51.750942353238315, "difficulty": "Medium", "likes": 9158, "dislikes": 282, "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": 542989, "totalSubmissionRaw": 1049235}, "451": {"acRate": 72.86640245726034, "difficulty": "Medium", "likes": 8319, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "451", "paidOnly": false, "title": "Sort Characters By Frequency", "titleSlug": "sort-characters-by-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 774787, "totalSubmissionRaw": 1063298}, "452": {"acRate": 59.21348253777482, "difficulty": "Medium", "likes": 7469, "dislikes": 241, "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": 546869, "totalSubmissionRaw": 923556}, "453": {"acRate": 56.908408776846485, "difficulty": "Medium", "likes": 2576, "dislikes": 1893, "categoryTitle": "Algorithms", "frontendQuestionId": "453", "paidOnly": false, "title": "Minimum Moves to Equal Array Elements", "titleSlug": "minimum-moves-to-equal-array-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176259, "totalSubmissionRaw": 309724}, "454": {"acRate": 57.33346237867434, "difficulty": "Medium", "likes": 4907, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "454", "paidOnly": false, "title": "4Sum II", "titleSlug": "4sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 331734, "totalSubmissionRaw": 578606}, "455": {"acRate": 52.898205120235616, "difficulty": "Easy", "likes": 3957, "dislikes": 375, "categoryTitle": "Algorithms", "frontendQuestionId": "455", "paidOnly": false, "title": "Assign Cookies", "titleSlug": "assign-cookies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 493559, "totalSubmissionRaw": 933037}, "456": {"acRate": 33.772662305394896, "difficulty": "Medium", "likes": 7210, "dislikes": 437, "categoryTitle": "Algorithms", "frontendQuestionId": "456", "paidOnly": false, "title": "132 Pattern", "titleSlug": "132-pattern", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 263701, "totalSubmissionRaw": 780812}, "457": {"acRate": 34.369994220130465, "difficulty": "Medium", "likes": 691, "dislikes": 786, "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": 83251, "totalSubmissionRaw": 242220}, "458": {"acRate": 59.5629198653465, "difficulty": "Hard", "likes": 1787, "dislikes": 3356, "categoryTitle": "Algorithms", "frontendQuestionId": "458", "paidOnly": false, "title": "Poor Pigs", "titleSlug": "poor-pigs", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120494, "totalSubmissionRaw": 202297}, "459": {"acRate": 46.202172575858015, "difficulty": "Easy", "likes": 6401, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "459", "paidOnly": false, "title": "Repeated Substring Pattern", "titleSlug": "repeated-substring-pattern", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 464195, "totalSubmissionRaw": 1004702}, "460": {"acRate": 44.658378598890316, "difficulty": "Hard", "likes": 5681, "dislikes": 330, "categoryTitle": "Algorithms", "frontendQuestionId": "460", "paidOnly": false, "title": "LFU Cache", "titleSlug": "lfu-cache", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 260538, "totalSubmissionRaw": 583403}, "461": {"acRate": 75.52768659819374, "difficulty": "Easy", "likes": 3838, "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": 584900, "totalSubmissionRaw": 774418}, "462": {"acRate": 60.28644394913151, "difficulty": "Medium", "likes": 3353, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "462", "paidOnly": false, "title": "Minimum Moves to Equal Array Elements II", "titleSlug": "minimum-moves-to-equal-array-elements-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 185546, "totalSubmissionRaw": 307774}, "463": {"acRate": 72.99977956537454, "difficulty": "Easy", "likes": 6839, "dislikes": 386, "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": 652391, "totalSubmissionRaw": 893687}, "464": {"acRate": 29.749204709707584, "difficulty": "Medium", "likes": 2659, "dislikes": 400, "categoryTitle": "Algorithms", "frontendQuestionId": "464", "paidOnly": false, "title": "Can I Win", "titleSlug": "can-i-win", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97351, "totalSubmissionRaw": 327239}, "465": {"acRate": 49.61848063055509, "difficulty": "Hard", "likes": 1459, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "465", "paidOnly": true, "title": "Optimal Account Balancing", "titleSlug": "optimal-account-balancing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94678, "totalSubmissionRaw": 190814}, "466": {"acRate": 30.48755625950727, "difficulty": "Hard", "likes": 405, "dislikes": 358, "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": 19441, "totalSubmissionRaw": 63767}, "467": {"acRate": 39.995100783874584, "difficulty": "Medium", "likes": 1442, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "467", "paidOnly": false, "title": "Unique Substrings in Wraparound String", "titleSlug": "unique-substrings-in-wraparound-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45716, "totalSubmissionRaw": 114304}, "468": {"acRate": 27.26898253977558, "difficulty": "Medium", "likes": 1018, "dislikes": 2709, "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": 167485, "totalSubmissionRaw": 614196}, "469": {"acRate": 39.52859492051891, "difficulty": "Medium", "likes": 99, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "469", "paidOnly": true, "title": "Convex Polygon", "titleSlug": "convex-polygon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10817, "totalSubmissionRaw": 27365}, "470": {"acRate": 45.80794273271522, "difficulty": "Medium", "likes": 1109, "dislikes": 373, "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": 85621, "totalSubmissionRaw": 186913}, "471": {"acRate": 50.46591945783918, "difficulty": "Hard", "likes": 625, "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": 30978, "totalSubmissionRaw": 61384}, "472": {"acRate": 49.37044400265076, "difficulty": "Hard", "likes": 3869, "dislikes": 283, "categoryTitle": "Algorithms", "frontendQuestionId": "472", "paidOnly": false, "title": "Concatenated Words", "titleSlug": "concatenated-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229460, "totalSubmissionRaw": 464772}, "473": {"acRate": 40.32619584723714, "difficulty": "Medium", "likes": 3825, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "473", "paidOnly": false, "title": "Matchsticks to Square", "titleSlug": "matchsticks-to-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167859, "totalSubmissionRaw": 416253}, "474": {"acRate": 47.841599339505805, "difficulty": "Medium", "likes": 5437, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "474", "paidOnly": false, "title": "Ones and Zeroes", "titleSlug": "ones-and-zeroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210925, "totalSubmissionRaw": 440882}, "475": {"acRate": 38.319974030514146, "difficulty": "Medium", "likes": 2108, "dislikes": 1167, "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": 122768, "totalSubmissionRaw": 320376}, "476": {"acRate": 67.7027029709456, "difficulty": "Easy", "likes": 2672, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "476", "paidOnly": false, "title": "Number Complement", "titleSlug": "number-complement", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 341072, "totalSubmissionRaw": 503779}, "477": {"acRate": 52.890471326978364, "difficulty": "Medium", "likes": 2213, "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": 111857, "totalSubmissionRaw": 211488}, "478": {"acRate": 39.99713467048711, "difficulty": "Medium", "likes": 456, "dislikes": 770, "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": 41877, "totalSubmissionRaw": 104700}, "479": {"acRate": 33.54313415646678, "difficulty": "Hard", "likes": 177, "dislikes": 1560, "categoryTitle": "Algorithms", "frontendQuestionId": "479", "paidOnly": false, "title": "Largest Palindrome Product", "titleSlug": "largest-palindrome-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25048, "totalSubmissionRaw": 74674}, "480": {"acRate": 38.97281886344498, "difficulty": "Hard", "likes": 3219, "dislikes": 200, "categoryTitle": "Algorithms", "frontendQuestionId": "480", "paidOnly": false, "title": "Sliding Window Median", "titleSlug": "sliding-window-median", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153648, "totalSubmissionRaw": 394244}, "481": {"acRate": 51.46500972141021, "difficulty": "Medium", "likes": 319, "dislikes": 1303, "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": 37852, "totalSubmissionRaw": 73549}, "482": {"acRate": 43.975728281093566, "difficulty": "Easy", "likes": 1104, "dislikes": 1416, "categoryTitle": "Algorithms", "frontendQuestionId": "482", "paidOnly": false, "title": "License Key Formatting", "titleSlug": "license-key-formatting", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288583, "totalSubmissionRaw": 656235}, "483": {"acRate": 41.21180511842886, "difficulty": "Hard", "likes": 386, "dislikes": 505, "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": 22915, "totalSubmissionRaw": 55603}, "484": {"acRate": 66.9210722263589, "difficulty": "Medium", "likes": 701, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "484", "paidOnly": true, "title": "Find Permutation", "titleSlug": "find-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39545, "totalSubmissionRaw": 59092}, "485": {"acRate": 60.04148885559828, "difficulty": "Easy", "likes": 5781, "dislikes": 457, "categoryTitle": "Algorithms", "frontendQuestionId": "485", "paidOnly": false, "title": "Max Consecutive Ones", "titleSlug": "max-consecutive-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1270906, "totalSubmissionRaw": 2116713}, "486": {"acRate": 55.41737101470054, "difficulty": "Medium", "likes": 5838, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "486", "paidOnly": false, "title": "Predict the Winner", "titleSlug": "predict-the-winner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 239643, "totalSubmissionRaw": 432433}, "487": {"acRate": 50.472807240125185, "difficulty": "Medium", "likes": 1542, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "487", "paidOnly": true, "title": "Max Consecutive Ones II", "titleSlug": "max-consecutive-ones-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149184, "totalSubmissionRaw": 295574}, "488": {"acRate": 32.611083239549295, "difficulty": "Hard", "likes": 455, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "488", "paidOnly": false, "title": "Zuma Game", "titleSlug": "zuma-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24051, "totalSubmissionRaw": 73751}, "489": {"acRate": 76.8251400633409, "difficulty": "Hard", "likes": 2772, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "489", "paidOnly": true, "title": "Robot Room Cleaner", "titleSlug": "robot-room-cleaner", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169076, "totalSubmissionRaw": 220079}, "490": {"acRate": 58.285994091003836, "difficulty": "Medium", "likes": 1845, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "490", "paidOnly": true, "title": "The Maze", "titleSlug": "the-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176170, "totalSubmissionRaw": 302251}, "491": {"acRate": 60.93025558687371, "difficulty": "Medium", "likes": 3645, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "491", "paidOnly": false, "title": "Non-decreasing Subsequences", "titleSlug": "non-decreasing-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172286, "totalSubmissionRaw": 282760}, "492": {"acRate": 58.355922917510306, "difficulty": "Easy", "likes": 701, "dislikes": 389, "categoryTitle": "Algorithms", "frontendQuestionId": "492", "paidOnly": false, "title": "Construct the Rectangle", "titleSlug": "construct-the-rectangle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 122492, "totalSubmissionRaw": 209905}, "493": {"acRate": 30.855935961092822, "difficulty": "Hard", "likes": 6185, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "493", "paidOnly": false, "title": "Reverse Pairs", "titleSlug": "reverse-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 196933, "totalSubmissionRaw": 638235}, "494": {"acRate": 47.26231226090489, "difficulty": "Medium", "likes": 10918, "dislikes": 361, "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": 636362, "totalSubmissionRaw": 1346458}, "495": {"acRate": 56.65897730258067, "difficulty": "Easy", "likes": 1151, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "495", "paidOnly": false, "title": "Teemo Attacking", "titleSlug": "teemo-attacking", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157440, "totalSubmissionRaw": 277870}, "496": {"acRate": 72.77502952099623, "difficulty": "Easy", "likes": 8046, "dislikes": 764, "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": 781465, "totalSubmissionRaw": 1073810}, "497": {"acRate": 40.156003254055605, "difficulty": "Medium", "likes": 481, "dislikes": 674, "categoryTitle": "Algorithms", "frontendQuestionId": "497", "paidOnly": false, "title": "Random Point in Non-overlapping Rectangles", "titleSlug": "random-point-in-non-overlapping-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41957, "totalSubmissionRaw": 104485}, "498": {"acRate": 60.73495431913762, "difficulty": "Medium", "likes": 3448, "dislikes": 687, "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": 314105, "totalSubmissionRaw": 517174}, "499": {"acRate": 49.10089224433768, "difficulty": "Hard", "likes": 483, "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": 32193, "totalSubmissionRaw": 65565}, "500": {"acRate": 71.0608165643347, "difficulty": "Easy", "likes": 1607, "dislikes": 1136, "categoryTitle": "Algorithms", "frontendQuestionId": "500", "paidOnly": false, "title": "Keyboard Row", "titleSlug": "keyboard-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 237837, "totalSubmissionRaw": 334695}, "501": {"acRate": 56.4567847774195, "difficulty": "Easy", "likes": 3895, "dislikes": 783, "categoryTitle": "Algorithms", "frontendQuestionId": "501", "paidOnly": false, "title": "Find Mode in Binary Search Tree", "titleSlug": "find-mode-in-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 315511, "totalSubmissionRaw": 558853}, "502": {"acRate": 53.154847512630454, "difficulty": "Hard", "likes": 3789, "dislikes": 257, "categoryTitle": "Algorithms", "frontendQuestionId": "502", "paidOnly": false, "title": "IPO", "titleSlug": "ipo", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230622, "totalSubmissionRaw": 433868}, "503": {"acRate": 64.43222416394792, "difficulty": "Medium", "likes": 8002, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "503", "paidOnly": false, "title": "Next Greater Element II", "titleSlug": "next-greater-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 432116, "totalSubmissionRaw": 670652}, "504": {"acRate": 50.47893834123085, "difficulty": "Easy", "likes": 804, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "504", "paidOnly": false, "title": "Base 7", "titleSlug": "base-7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 138914, "totalSubmissionRaw": 275192}, "505": {"acRate": 53.53504711765223, "difficulty": "Medium", "likes": 1326, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "505", "paidOnly": true, "title": "The Maze II", "titleSlug": "the-maze-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109415, "totalSubmissionRaw": 204381}, "506": {"acRate": 71.94906710028762, "difficulty": "Easy", "likes": 1908, "dislikes": 125, "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": 300434, "totalSubmissionRaw": 417566}, "507": {"acRate": 41.547326772851775, "difficulty": "Easy", "likes": 1088, "dislikes": 1227, "categoryTitle": "Algorithms", "frontendQuestionId": "507", "paidOnly": false, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 204766, "totalSubmissionRaw": 492850}, "508": {"acRate": 66.85676101204643, "difficulty": "Medium", "likes": 2256, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "508", "paidOnly": false, "title": "Most Frequent Subtree Sum", "titleSlug": "most-frequent-subtree-sum", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146073, "totalSubmissionRaw": 218487}, "509": {"acRate": 71.55301553540568, "difficulty": "Easy", "likes": 8193, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "509", "paidOnly": false, "title": "Fibonacci Number", "titleSlug": "fibonacci-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1921586, "totalSubmissionRaw": 2685542}, "510": {"acRate": 60.902296805278, "difficulty": "Medium", "likes": 863, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "510", "paidOnly": true, "title": "Inorder Successor in BST II", "titleSlug": "inorder-successor-in-bst-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66741, "totalSubmissionRaw": 109587}, "511": {"acRate": 74.86248652955327, "difficulty": "Easy", "likes": 856, "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": 293160, "totalSubmissionRaw": 391598}, "512": {"acRate": 53.02133021330213, "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": 88368, "totalSubmissionRaw": 166665}, "513": {"acRate": 71.31407871056787, "difficulty": "Medium", "likes": 3799, "dislikes": 295, "categoryTitle": "Algorithms", "frontendQuestionId": "513", "paidOnly": false, "title": "Find Bottom Left Tree Value", "titleSlug": "find-bottom-left-tree-value", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 368917, "totalSubmissionRaw": 517313}, "514": {"acRate": 58.97359849873817, "difficulty": "Hard", "likes": 1483, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "514", "paidOnly": false, "title": "Freedom Trail", "titleSlug": "freedom-trail", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109363, "totalSubmissionRaw": 185444}, "515": {"acRate": 65.68756600626196, "difficulty": "Medium", "likes": 3614, "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": 352042, "totalSubmissionRaw": 535934}, "516": {"acRate": 63.00822710512087, "difficulty": "Medium", "likes": 9565, "dislikes": 330, "categoryTitle": "Algorithms", "frontendQuestionId": "516", "paidOnly": false, "title": "Longest Palindromic Subsequence", "titleSlug": "longest-palindromic-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 517416, "totalSubmissionRaw": 821188}, "517": {"acRate": 41.45691199190604, "difficulty": "Hard", "likes": 770, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "517", "paidOnly": false, "title": "Super Washing Machines", "titleSlug": "super-washing-machines", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30322, "totalSubmissionRaw": 73141}, "518": {"acRate": 64.48890844110845, "difficulty": "Medium", "likes": 9372, "dislikes": 168, "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": 662588, "totalSubmissionRaw": 1027446}, "519": {"acRate": 42.25714776173492, "difficulty": "Medium", "likes": 432, "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": 22155, "totalSubmissionRaw": 52429}, "520": {"acRate": 56.40477826402318, "difficulty": "Easy", "likes": 3402, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "520", "paidOnly": false, "title": "Detect Capital", "titleSlug": "detect-capital", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 442478, "totalSubmissionRaw": 784469}, "521": {"acRate": 60.883655499400824, "difficulty": "Easy", "likes": 39, "dislikes": 128, "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": 116854, "totalSubmissionRaw": 191930}, "522": {"acRate": 41.91464142114519, "difficulty": "Medium", "likes": 514, "dislikes": 1308, "categoryTitle": "Algorithms", "frontendQuestionId": "522", "paidOnly": false, "title": "Longest Uncommon Subsequence II", "titleSlug": "longest-uncommon-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54103, "totalSubmissionRaw": 129079}, "523": {"acRate": 30.282867480927383, "difficulty": "Medium", "likes": 6273, "dislikes": 652, "categoryTitle": "Algorithms", "frontendQuestionId": "523", "paidOnly": false, "title": "Continuous Subarray Sum", "titleSlug": "continuous-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 586516, "totalSubmissionRaw": 1936793}, "524": {"acRate": 51.30291566107886, "difficulty": "Medium", "likes": 1796, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "524", "paidOnly": false, "title": "Longest Word in Dictionary through Deleting", "titleSlug": "longest-word-in-dictionary-through-deleting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157305, "totalSubmissionRaw": 306620}, "525": {"acRate": 48.96019322426361, "difficulty": "Medium", "likes": 7964, "dislikes": 379, "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": 471094, "totalSubmissionRaw": 962198}, "526": {"acRate": 64.30625204159652, "difficulty": "Medium", "likes": 3218, "dislikes": 370, "categoryTitle": "Algorithms", "frontendQuestionId": "526", "paidOnly": false, "title": "Beautiful Arrangement", "titleSlug": "beautiful-arrangement", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 179145, "totalSubmissionRaw": 278581}, "527": {"acRate": 61.16029926070211, "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": 27631, "totalSubmissionRaw": 45178}, "528": {"acRate": 47.097548032251005, "difficulty": "Medium", "likes": 1908, "dislikes": 843, "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": 477460, "totalSubmissionRaw": 1013779}, "529": {"acRate": 66.95767783787345, "difficulty": "Medium", "likes": 1963, "dislikes": 1064, "categoryTitle": "Algorithms", "frontendQuestionId": "529", "paidOnly": false, "title": "Minesweeper", "titleSlug": "minesweeper", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 162671, "totalSubmissionRaw": 242946}, "530": {"acRate": 58.48186718676905, "difficulty": "Easy", "likes": 4396, "dislikes": 227, "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": 406293, "totalSubmissionRaw": 694734}, "531": {"acRate": 62.34721625876628, "difficulty": "Medium", "likes": 433, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "531", "paidOnly": true, "title": "Lonely Pixel I", "titleSlug": "lonely-pixel-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 43562, "totalSubmissionRaw": 69870}, "532": {"acRate": 43.21296578597084, "difficulty": "Medium", "likes": 3879, "dislikes": 2252, "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": 348669, "totalSubmissionRaw": 806862}, "533": {"acRate": 48.63763687293099, "difficulty": "Medium", "likes": 87, "dislikes": 774, "categoryTitle": "Algorithms", "frontendQuestionId": "533", "paidOnly": true, "title": "Lonely Pixel II", "titleSlug": "lonely-pixel-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13370, "totalSubmissionRaw": 27489}, "534": {"acRate": 80.93227774279787, "difficulty": "Medium", "likes": 397, "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": 78407, "totalSubmissionRaw": 96880}, "535": {"acRate": 86.45890078058997, "difficulty": "Medium", "likes": 2020, "dislikes": 3782, "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": 265050, "totalSubmissionRaw": 306562}, "536": {"acRate": 57.19451327223797, "difficulty": "Medium", "likes": 1063, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "536", "paidOnly": true, "title": "Construct Binary Tree from String", "titleSlug": "construct-binary-tree-from-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96486, "totalSubmissionRaw": 168698}, "537": {"acRate": 71.98228046561849, "difficulty": "Medium", "likes": 715, "dislikes": 1251, "categoryTitle": "Algorithms", "frontendQuestionId": "537", "paidOnly": false, "title": "Complex Number Multiplication", "titleSlug": "complex-number-multiplication", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97333, "totalSubmissionRaw": 135218}, "538": {"acRate": 69.62294933381673, "difficulty": "Medium", "likes": 5241, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "538", "paidOnly": false, "title": "Convert BST to Greater Tree", "titleSlug": "convert-bst-to-greater-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 307260, "totalSubmissionRaw": 441320}, "539": {"acRate": 56.97311471501896, "difficulty": "Medium", "likes": 1868, "dislikes": 263, "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": 152958, "totalSubmissionRaw": 268472}, "540": {"acRate": 59.20350191179404, "difficulty": "Medium", "likes": 11245, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "540", "paidOnly": false, "title": "Single Element in a Sorted Array", "titleSlug": "single-element-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 703427, "totalSubmissionRaw": 1188151}, "541": {"acRate": 50.9696515519183, "difficulty": "Easy", "likes": 1996, "dislikes": 3839, "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": 257095, "totalSubmissionRaw": 504408}, "542": {"acRate": 49.17136931303259, "difficulty": "Medium", "likes": 9518, "dislikes": 423, "categoryTitle": "Algorithms", "frontendQuestionId": "542", "paidOnly": false, "title": "01 Matrix", "titleSlug": "01-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 597912, "totalSubmissionRaw": 1215976}, "543": {"acRate": 61.134312088072704, "difficulty": "Easy", "likes": 13907, "dislikes": 1031, "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": 1606165, "totalSubmissionRaw": 2627277}, "544": {"acRate": 77.1749907929403, "difficulty": "Medium", "likes": 390, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "544", "paidOnly": true, "title": "Output Contest Matches", "titleSlug": "output-contest-matches", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27242, "totalSubmissionRaw": 35299}, "545": {"acRate": 45.740359022594006, "difficulty": "Medium", "likes": 1330, "dislikes": 2196, "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": 137135, "totalSubmissionRaw": 299812}, "546": {"acRate": 47.88759729514393, "difficulty": "Hard", "likes": 2262, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "546", "paidOnly": false, "title": "Remove Boxes", "titleSlug": "remove-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46881, "totalSubmissionRaw": 97898}, "547": {"acRate": 66.87293423542758, "difficulty": "Medium", "likes": 9766, "dislikes": 362, "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": 956182, "totalSubmissionRaw": 1429847}, "548": {"acRate": 50.12520345561538, "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": 24021, "totalSubmissionRaw": 47922}, "549": {"acRate": 49.50493250731247, "difficulty": "Medium", "likes": 1156, "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": 54498, "totalSubmissionRaw": 110086}, "550": {"acRate": 37.22237956190123, "difficulty": "Medium", "likes": 923, "dislikes": 195, "categoryTitle": "Database", "frontendQuestionId": "550", "paidOnly": false, "title": "Game Play Analysis IV", "titleSlug": "game-play-analysis-iv", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190566, "totalSubmissionRaw": 511975}, "551": {"acRate": 49.20972518528365, "difficulty": "Easy", "likes": 770, "dislikes": 50, "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": 225819, "totalSubmissionRaw": 458891}, "552": {"acRate": 55.193685749241304, "difficulty": "Hard", "likes": 2270, "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": 138949, "totalSubmissionRaw": 251748}, "553": {"acRate": 61.013102238728976, "difficulty": "Medium", "likes": 377, "dislikes": 1601, "categoryTitle": "Algorithms", "frontendQuestionId": "553", "paidOnly": false, "title": "Optimal Division", "titleSlug": "optimal-division", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41398, "totalSubmissionRaw": 67851}, "554": {"acRate": 55.174270364231404, "difficulty": "Medium", "likes": 2525, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "554", "paidOnly": false, "title": "Brick Wall", "titleSlug": "brick-wall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 143467, "totalSubmissionRaw": 260025}, "555": {"acRate": 43.37318748410074, "difficulty": "Medium", "likes": 76, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "555", "paidOnly": true, "title": "Split Concatenated Strings", "titleSlug": "split-concatenated-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6820, "totalSubmissionRaw": 15724}, "556": {"acRate": 34.15339282239457, "difficulty": "Medium", "likes": 3682, "dislikes": 469, "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": 159717, "totalSubmissionRaw": 467641}, "557": {"acRate": 83.2240027643028, "difficulty": "Easy", "likes": 5922, "dislikes": 250, "categoryTitle": "Algorithms", "frontendQuestionId": "557", "paidOnly": false, "title": "Reverse Words in a String III", "titleSlug": "reverse-words-in-a-string-iii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 927281, "totalSubmissionRaw": 1114200}, "558": {"acRate": 49.929017134933474, "difficulty": "Medium", "likes": 190, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "558", "paidOnly": false, "title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "titleSlug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15123, "totalSubmissionRaw": 30289}, "559": {"acRate": 72.32227251755141, "difficulty": "Easy", "likes": 2769, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "559", "paidOnly": false, "title": "Maximum Depth of N-ary Tree", "titleSlug": "maximum-depth-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 289987, "totalSubmissionRaw": 400965}, "560": {"acRate": 43.94980274680934, "difficulty": "Medium", "likes": 21699, "dislikes": 664, "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": 1339190, "totalSubmissionRaw": 3047095}, "561": {"acRate": 79.16850216748705, "difficulty": "Easy", "likes": 2062, "dislikes": 263, "categoryTitle": "Algorithms", "frontendQuestionId": "561", "paidOnly": false, "title": "Array Partition", "titleSlug": "array-partition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 496014, "totalSubmissionRaw": 626530}, "562": {"acRate": 50.4031519149716, "difficulty": "Medium", "likes": 890, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "562", "paidOnly": true, "title": "Longest Line of Consecutive One in Matrix", "titleSlug": "longest-line-of-consecutive-one-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77014, "totalSubmissionRaw": 152796}, "563": {"acRate": 62.34552909410404, "difficulty": "Easy", "likes": 2237, "dislikes": 2185, "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": 218196, "totalSubmissionRaw": 349980}, "564": {"acRate": 22.554867807299487, "difficulty": "Hard", "likes": 776, "dislikes": 1449, "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": 48209, "totalSubmissionRaw": 213741}, "565": {"acRate": 56.30537991526686, "difficulty": "Medium", "likes": 2208, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "565", "paidOnly": false, "title": "Array Nesting", "titleSlug": "array-nesting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132236, "totalSubmissionRaw": 234855}, "566": {"acRate": 63.19928072808201, "difficulty": "Easy", "likes": 3496, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "566", "paidOnly": false, "title": "Reshape the Matrix", "titleSlug": "reshape-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 384500, "totalSubmissionRaw": 608393}, "567": {"acRate": 44.626406812734366, "difficulty": "Medium", "likes": 11320, "dislikes": 419, "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": 902428, "totalSubmissionRaw": 2022178}, "568": {"acRate": 45.80894124393682, "difficulty": "Hard", "likes": 569, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "568", "paidOnly": true, "title": "Maximum Vacation Days", "titleSlug": "maximum-vacation-days", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38343, "totalSubmissionRaw": 83702}, "569": {"acRate": 65.86014654348519, "difficulty": "Hard", "likes": 323, "dislikes": 152, "categoryTitle": "Database", "frontendQuestionId": "569", "paidOnly": true, "title": "Median Employee Salary", "titleSlug": "median-employee-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41347, "totalSubmissionRaw": 62780}, "570": {"acRate": 49.74970575344354, "difficulty": "Medium", "likes": 1143, "dislikes": 127, "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": 404071, "totalSubmissionRaw": 812218}, "571": {"acRate": 42.35820381946436, "difficulty": "Hard", "likes": 308, "dislikes": 78, "categoryTitle": "Database", "frontendQuestionId": "571", "paidOnly": true, "title": "Find Median Given Frequency of Numbers", "titleSlug": "find-median-given-frequency-of-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29543, "totalSubmissionRaw": 69747}, "572": {"acRate": 48.41124028266452, "difficulty": "Easy", "likes": 8220, "dislikes": 517, "categoryTitle": "Algorithms", "frontendQuestionId": "572", "paidOnly": false, "title": "Subtree of Another Tree", "titleSlug": "subtree-of-another-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 896684, "totalSubmissionRaw": 1852221}, "573": {"acRate": 57.11273687954071, "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": 22483, "totalSubmissionRaw": 39366}, "574": {"acRate": 61.00460940615638, "difficulty": "Medium", "likes": 173, "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": 65776, "totalSubmissionRaw": 107822}, "575": {"acRate": 68.08664360246203, "difficulty": "Easy", "likes": 1530, "dislikes": 1368, "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": 294024, "totalSubmissionRaw": 431838}, "576": {"acRate": 48.086565892928284, "difficulty": "Medium", "likes": 3879, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "576", "paidOnly": false, "title": "Out of Boundary Paths", "titleSlug": "out-of-boundary-paths", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210018, "totalSubmissionRaw": 436752}, "577": {"acRate": 75.88002426444032, "difficulty": "Easy", "likes": 944, "dislikes": 223, "categoryTitle": "Database", "frontendQuestionId": "577", "paidOnly": false, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 432800, "totalSubmissionRaw": 570373}, "578": {"acRate": 40.23358443894761, "difficulty": "Medium", "likes": 129, "dislikes": 914, "categoryTitle": "Database", "frontendQuestionId": "578", "paidOnly": true, "title": "Get Highest Answer Rate Question", "titleSlug": "get-highest-answer-rate-question", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57254, "totalSubmissionRaw": 142304}, "579": {"acRate": 47.233756475659426, "difficulty": "Hard", "likes": 239, "dislikes": 403, "categoryTitle": "Database", "frontendQuestionId": "579", "paidOnly": true, "title": "Find Cumulative Salary of an Employee", "titleSlug": "find-cumulative-salary-of-an-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35832, "totalSubmissionRaw": 75861}, "580": {"acRate": 59.12742980561555, "difficulty": "Medium", "likes": 245, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "580", "paidOnly": true, "title": "Count Student Number in Departments", "titleSlug": "count-student-number-in-departments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68440, "totalSubmissionRaw": 115750}, "581": {"acRate": 36.98404894933, "difficulty": "Medium", "likes": 7755, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "581", "paidOnly": false, "title": "Shortest Unsorted Continuous Subarray", "titleSlug": "shortest-unsorted-continuous-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 334017, "totalSubmissionRaw": 903138}, "582": {"acRate": 69.56490419247947, "difficulty": "Medium", "likes": 1107, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "582", "paidOnly": true, "title": "Kill Process", "titleSlug": "kill-process", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 86913, "totalSubmissionRaw": 124938}, "583": {"acRate": 62.33698535994707, "difficulty": "Medium", "likes": 5779, "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": 266677, "totalSubmissionRaw": 427799}, "584": {"acRate": 70.44800478971054, "difficulty": "Easy", "likes": 2082, "dislikes": 367, "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": 1004864, "totalSubmissionRaw": 1426391}, "585": {"acRate": 48.36716045544337, "difficulty": "Medium", "likes": 579, "dislikes": 492, "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": 127565, "totalSubmissionRaw": 263743}, "586": {"acRate": 64.66434338181485, "difficulty": "Easy", "likes": 991, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "586", "paidOnly": false, "title": "Customer Placing the Largest Number of Orders", "titleSlug": "customer-placing-the-largest-number-of-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274806, "totalSubmissionRaw": 424973}, "587": {"acRate": 51.93674626627266, "difficulty": "Hard", "likes": 1477, "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": 58527, "totalSubmissionRaw": 112689}, "588": {"acRate": 48.07563303310287, "difficulty": "Hard", "likes": 1489, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "588", "paidOnly": true, "title": "Design In-Memory File System", "titleSlug": "design-in-memory-file-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107500, "totalSubmissionRaw": 223606}, "589": {"acRate": 75.63435059436063, "difficulty": "Easy", "likes": 3139, "dislikes": 202, "categoryTitle": "Algorithms", "frontendQuestionId": "589", "paidOnly": false, "title": "N-ary Tree Preorder Traversal", "titleSlug": "n-ary-tree-preorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 434061, "totalSubmissionRaw": 573894}, "590": {"acRate": 78.04224055486534, "difficulty": "Easy", "likes": 2337, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "590", "paidOnly": false, "title": "N-ary Tree Postorder Traversal", "titleSlug": "n-ary-tree-postorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 261948, "totalSubmissionRaw": 335649}, "591": {"acRate": 38.978554057041784, "difficulty": "Hard", "likes": 170, "dislikes": 648, "categoryTitle": "Algorithms", "frontendQuestionId": "591", "paidOnly": false, "title": "Tag Validator", "titleSlug": "tag-validator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 15867, "totalSubmissionRaw": 40707}, "592": {"acRate": 53.55719482326343, "difficulty": "Medium", "likes": 399, "dislikes": 507, "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": 36955, "totalSubmissionRaw": 69001}, "593": {"acRate": 44.091530735523385, "difficulty": "Medium", "likes": 1050, "dislikes": 908, "categoryTitle": "Algorithms", "frontendQuestionId": "593", "paidOnly": false, "title": "Valid Square", "titleSlug": "valid-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110582, "totalSubmissionRaw": 250801}, "594": {"acRate": 55.0596122449661, "difficulty": "Easy", "likes": 2160, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "594", "paidOnly": false, "title": "Longest Harmonious Subsequence", "titleSlug": "longest-harmonious-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164914, "totalSubmissionRaw": 299519}, "595": {"acRate": 68.08454959740521, "difficulty": "Easy", "likes": 2715, "dislikes": 1322, "categoryTitle": "Database", "frontendQuestionId": "595", "paidOnly": false, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1306068, "totalSubmissionRaw": 1918301}, "596": {"acRate": 56.478036485837734, "difficulty": "Easy", "likes": 1043, "dislikes": 1078, "categoryTitle": "Database", "frontendQuestionId": "596", "paidOnly": false, "title": "Classes More Than 5 Students", "titleSlug": "classes-more-than-5-students", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 451752, "totalSubmissionRaw": 799872}, "597": {"acRate": 41.79407986443272, "difficulty": "Easy", "likes": 305, "dislikes": 766, "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": 76456, "totalSubmissionRaw": 182935}, "598": {"acRate": 56.32899483358332, "difficulty": "Easy", "likes": 942, "dislikes": 968, "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": 104777, "totalSubmissionRaw": 186009}, "599": {"acRate": 55.99269447661008, "difficulty": "Easy", "likes": 1940, "dislikes": 395, "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": 237904, "totalSubmissionRaw": 424884}, "600": {"acRate": 39.995637776852455, "difficulty": "Hard", "likes": 1532, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "600", "paidOnly": false, "title": "Non-negative Integers without Consecutive Ones", "titleSlug": "non-negative-integers-without-consecutive-ones", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40342, "totalSubmissionRaw": 100866}, "601": {"acRate": 48.763091038692814, "difficulty": "Hard", "likes": 681, "dislikes": 568, "categoryTitle": "Database", "frontendQuestionId": "601", "paidOnly": false, "title": "Human Traffic of Stadium", "titleSlug": "human-traffic-of-stadium", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 106716, "totalSubmissionRaw": 218849}, "602": {"acRate": 57.85155847181536, "difficulty": "Medium", "likes": 645, "dislikes": 126, "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": 151470, "totalSubmissionRaw": 261826}, "603": {"acRate": 65.92542828350688, "difficulty": "Easy", "likes": 641, "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": 88317, "totalSubmissionRaw": 133965}, "604": {"acRate": 39.93228627856673, "difficulty": "Easy", "likes": 441, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "604", "paidOnly": true, "title": "Design Compressed String Iterator", "titleSlug": "design-compressed-string-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33968, "totalSubmissionRaw": 85064}, "605": {"acRate": 28.983904714668345, "difficulty": "Easy", "likes": 6564, "dislikes": 1185, "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": 858436, "totalSubmissionRaw": 2961774}, "606": {"acRate": 69.42722677657308, "difficulty": "Medium", "likes": 73, "dislikes": 36, "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": 322922, "totalSubmissionRaw": 465123}, "607": {"acRate": 65.75723392533907, "difficulty": "Easy", "likes": 1170, "dislikes": 101, "categoryTitle": "Database", "frontendQuestionId": "607", "paidOnly": false, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 225592, "totalSubmissionRaw": 343069}, "608": {"acRate": 72.62585284897658, "difficulty": "Medium", "likes": 1237, "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": 165417, "totalSubmissionRaw": 227766}, "609": {"acRate": 67.64995866106048, "difficulty": "Medium", "likes": 1512, "dislikes": 1649, "categoryTitle": "Algorithms", "frontendQuestionId": "609", "paidOnly": false, "title": "Find Duplicate File in System", "titleSlug": "find-duplicate-file-in-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153010, "totalSubmissionRaw": 226179}, "610": {"acRate": 72.10340669069312, "difficulty": "Easy", "likes": 593, "dislikes": 168, "categoryTitle": "Database", "frontendQuestionId": "610", "paidOnly": false, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 206869, "totalSubmissionRaw": 286906}, "611": {"acRate": 51.34268926334191, "difficulty": "Medium", "likes": 3819, "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": 200887, "totalSubmissionRaw": 391267}, "612": {"acRate": 61.30662123259503, "difficulty": "Medium", "likes": 218, "dislikes": 70, "categoryTitle": "Database", "frontendQuestionId": "612", "paidOnly": true, "title": "Shortest Distance in a Plane", "titleSlug": "shortest-distance-in-a-plane", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41740, "totalSubmissionRaw": 68084}, "613": {"acRate": 80.17509642356241, "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": 73171, "totalSubmissionRaw": 91264}, "614": {"acRate": 38.871198453145105, "difficulty": "Medium", "likes": 158, "dislikes": 744, "categoryTitle": "Database", "frontendQuestionId": "614", "paidOnly": true, "title": "Second Degree Follower", "titleSlug": "second-degree-follower", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54078, "totalSubmissionRaw": 139121}, "615": {"acRate": 56.17963890153239, "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": 37028, "totalSubmissionRaw": 65910}, "616": {"acRate": 49.93452545900098, "difficulty": "Medium", "likes": 1076, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "616", "paidOnly": true, "title": "Add Bold Tag in String", "titleSlug": "add-bold-tag-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91900, "totalSubmissionRaw": 184041}, "617": {"acRate": 79.05221279442313, "difficulty": "Easy", "likes": 8782, "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": 785862, "totalSubmissionRaw": 994105}, "618": {"acRate": 63.42914541801885, "difficulty": "Hard", "likes": 186, "dislikes": 170, "categoryTitle": "Database", "frontendQuestionId": "618", "paidOnly": true, "title": "Students Report By Geography", "titleSlug": "students-report-by-geography", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24627, "totalSubmissionRaw": 38826}, "619": {"acRate": 65.03233627501682, "difficulty": "Easy", "likes": 638, "dislikes": 182, "categoryTitle": "Database", "frontendQuestionId": "619", "paidOnly": false, "title": "Biggest Single Number", "titleSlug": "biggest-single-number", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233889, "totalSubmissionRaw": 359652}, "620": {"acRate": 74.007191425291, "difficulty": "Easy", "likes": 1138, "dislikes": 543, "categoryTitle": "Database", "frontendQuestionId": "620", "paidOnly": false, "title": "Not Boring Movies", "titleSlug": "not-boring-movies", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 538215, "totalSubmissionRaw": 727249}, "621": {"acRate": 60.21809185601739, "difficulty": "Medium", "likes": 10514, "dislikes": 2080, "categoryTitle": "Algorithms", "frontendQuestionId": "621", "paidOnly": false, "title": "Task Scheduler", "titleSlug": "task-scheduler", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 659635, "totalSubmissionRaw": 1095410}, "622": {"acRate": 51.70358140436171, "difficulty": "Medium", "likes": 3536, "dislikes": 290, "categoryTitle": "Algorithms", "frontendQuestionId": "622", "paidOnly": false, "title": "Design Circular Queue", "titleSlug": "design-circular-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 328187, "totalSubmissionRaw": 634749}, "623": {"acRate": 64.04472550806567, "difficulty": "Medium", "likes": 3550, "dislikes": 265, "categoryTitle": "Algorithms", "frontendQuestionId": "623", "paidOnly": false, "title": "Add One Row to Tree", "titleSlug": "add-one-row-to-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 276882, "totalSubmissionRaw": 432325}, "624": {"acRate": 42.42938660257326, "difficulty": "Medium", "likes": 764, "dislikes": 73, "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": 50488, "totalSubmissionRaw": 118993}, "625": {"acRate": 33.651776500073716, "difficulty": "Medium", "likes": 128, "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": 11413, "totalSubmissionRaw": 33915}, "626": {"acRate": 70.42116925825896, "difficulty": "Medium", "likes": 1448, "dislikes": 588, "categoryTitle": "Database", "frontendQuestionId": "626", "paidOnly": false, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239618, "totalSubmissionRaw": 340265}, "627": {"acRate": 83.38528011659314, "difficulty": "Easy", "likes": 1725, "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": 421098, "totalSubmissionRaw": 505003}, "628": {"acRate": 45.17869076367238, "difficulty": "Easy", "likes": 4214, "dislikes": 676, "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": 339376, "totalSubmissionRaw": 751186}, "629": {"acRate": 49.45432021827191, "difficulty": "Hard", "likes": 2679, "dislikes": 324, "categoryTitle": "Algorithms", "frontendQuestionId": "629", "paidOnly": false, "title": "K Inverse Pairs Array", "titleSlug": "k-inverse-pairs-array", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130143, "totalSubmissionRaw": 263158}, "630": {"acRate": 40.25771846274687, "difficulty": "Hard", "likes": 3791, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "630", "paidOnly": false, "title": "Course Schedule III", "titleSlug": "course-schedule-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 113782, "totalSubmissionRaw": 282634}, "631": {"acRate": 44.06968573574665, "difficulty": "Hard", "likes": 237, "dislikes": 275, "categoryTitle": "Algorithms", "frontendQuestionId": "631", "paidOnly": true, "title": "Design Excel Sum Formula", "titleSlug": "design-excel-sum-formula", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18188, "totalSubmissionRaw": 41271}, "632": {"acRate": 62.98662385092887, "difficulty": "Hard", "likes": 3463, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "632", "paidOnly": false, "title": "Smallest Range Covering Elements from K Lists", "titleSlug": "smallest-range-covering-elements-from-k-lists", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111411, "totalSubmissionRaw": 176878}, "633": {"acRate": 36.61003202852851, "difficulty": "Medium", "likes": 3201, "dislikes": 607, "categoryTitle": "Algorithms", "frontendQuestionId": "633", "paidOnly": false, "title": "Sum of Square Numbers", "titleSlug": "sum-of-square-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 354801, "totalSubmissionRaw": 969136}, "634": {"acRate": 41.88609467455621, "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": 11326, "totalSubmissionRaw": 27040}, "635": {"acRate": 60.6573448222486, "difficulty": "Medium", "likes": 472, "dislikes": 211, "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": 35268, "totalSubmissionRaw": 58143}, "636": {"acRate": 62.30096163601515, "difficulty": "Medium", "likes": 1949, "dislikes": 2797, "categoryTitle": "Algorithms", "frontendQuestionId": "636", "paidOnly": false, "title": "Exclusive Time of Functions", "titleSlug": "exclusive-time-of-functions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 227206, "totalSubmissionRaw": 364691}, "637": {"acRate": 73.04759183242301, "difficulty": "Easy", "likes": 5274, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "637", "paidOnly": false, "title": "Average of Levels in Binary Tree", "titleSlug": "average-of-levels-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 539371, "totalSubmissionRaw": 738383}, "638": {"acRate": 51.896668026882296, "difficulty": "Medium", "likes": 1505, "dislikes": 760, "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": 62317, "totalSubmissionRaw": 120079}, "639": {"acRate": 30.77923656698274, "difficulty": "Hard", "likes": 1569, "dislikes": 817, "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": 75957, "totalSubmissionRaw": 246780}, "640": {"acRate": 43.874761775115715, "difficulty": "Medium", "likes": 495, "dislikes": 834, "categoryTitle": "Algorithms", "frontendQuestionId": "640", "paidOnly": false, "title": "Solve the Equation", "titleSlug": "solve-the-equation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40288, "totalSubmissionRaw": 91825}, "641": {"acRate": 57.207705424213096, "difficulty": "Medium", "likes": 1177, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "641", "paidOnly": false, "title": "Design Circular Deque", "titleSlug": "design-circular-deque", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74481, "totalSubmissionRaw": 130194}, "642": {"acRate": 49.05217364788632, "difficulty": "Hard", "likes": 2108, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "642", "paidOnly": true, "title": "Design Search Autocomplete System", "titleSlug": "design-search-autocomplete-system", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144777, "totalSubmissionRaw": 295149}, "643": {"acRate": 43.60901633306102, "difficulty": "Easy", "likes": 3523, "dislikes": 321, "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": 526861, "totalSubmissionRaw": 1208154}, "644": {"acRate": 36.776249043304915, "difficulty": "Hard", "likes": 622, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "644", "paidOnly": true, "title": "Maximum Average Subarray II", "titleSlug": "maximum-average-subarray-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 20662, "totalSubmissionRaw": 56183}, "645": {"acRate": 44.50861258406159, "difficulty": "Easy", "likes": 4743, "dislikes": 1159, "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": 466270, "totalSubmissionRaw": 1047592}, "646": {"acRate": 60.08751540374413, "difficulty": "Medium", "likes": 4597, "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": 244290, "totalSubmissionRaw": 406557}, "647": {"acRate": 70.47258345177531, "difficulty": "Medium", "likes": 10788, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "647", "paidOnly": false, "title": "Palindromic Substrings", "titleSlug": "palindromic-substrings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 848858, "totalSubmissionRaw": 1204524}, "648": {"acRate": 68.0526666633253, "difficulty": "Medium", "likes": 2932, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "648", "paidOnly": false, "title": "Replace Words", "titleSlug": "replace-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 271555, "totalSubmissionRaw": 399037}, "649": {"acRate": 47.83231648238078, "difficulty": "Medium", "likes": 2373, "dislikes": 1823, "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": 162914, "totalSubmissionRaw": 340593}, "650": {"acRate": 54.27483316445966, "difficulty": "Medium", "likes": 3524, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "650", "paidOnly": false, "title": "2 Keys Keyboard", "titleSlug": "2-keys-keyboard", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139806, "totalSubmissionRaw": 257589}, "651": {"acRate": 55.83481613285883, "difficulty": "Medium", "likes": 709, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "651", "paidOnly": true, "title": "4 Keys Keyboard", "titleSlug": "4-keys-keyboard", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30124, "totalSubmissionRaw": 53952}, "652": {"acRate": 59.57086129109459, "difficulty": "Medium", "likes": 5835, "dislikes": 474, "categoryTitle": "Algorithms", "frontendQuestionId": "652", "paidOnly": false, "title": "Find Duplicate Subtrees", "titleSlug": "find-duplicate-subtrees", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 268829, "totalSubmissionRaw": 451276}, "653": {"acRate": 61.44917938507252, "difficulty": "Easy", "likes": 6752, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "653", "paidOnly": false, "title": "Two Sum IV - Input is a BST", "titleSlug": "two-sum-iv-input-is-a-bst", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 564158, "totalSubmissionRaw": 918088}, "654": {"acRate": 85.53241759646049, "difficulty": "Medium", "likes": 5215, "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": 301182, "totalSubmissionRaw": 352127}, "655": {"acRate": 64.40398246848115, "difficulty": "Medium", "likes": 492, "dislikes": 452, "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": 71415, "totalSubmissionRaw": 110886}, "656": {"acRate": 32.1336876717265, "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": 14268, "totalSubmissionRaw": 44402}, "657": {"acRate": 75.88449759369988, "difficulty": "Easy", "likes": 2428, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "657", "paidOnly": false, "title": "Robot Return to Origin", "titleSlug": "robot-return-to-origin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 442289, "totalSubmissionRaw": 582845}, "658": {"acRate": 47.66073878249738, "difficulty": "Medium", "likes": 8205, "dislikes": 698, "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": 571864, "totalSubmissionRaw": 1199864}, "659": {"acRate": 51.14905022724624, "difficulty": "Medium", "likes": 4431, "dislikes": 804, "categoryTitle": "Algorithms", "frontendQuestionId": "659", "paidOnly": false, "title": "Split Array into Consecutive Subsequences", "titleSlug": "split-array-into-consecutive-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131673, "totalSubmissionRaw": 257430}, "660": {"acRate": 57.41853171016958, "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": 10801, "totalSubmissionRaw": 18811}, "661": {"acRate": 67.47993476801074, "difficulty": "Easy", "likes": 1131, "dislikes": 2913, "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": 168824, "totalSubmissionRaw": 250184}, "662": {"acRate": 43.09738483269664, "difficulty": "Medium", "likes": 8783, "dislikes": 1211, "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": 400605, "totalSubmissionRaw": 929535}, "663": {"acRate": 41.54926772270392, "difficulty": "Medium", "likes": 483, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "663", "paidOnly": true, "title": "Equal Tree Partition", "titleSlug": "equal-tree-partition", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31292, "totalSubmissionRaw": 75313}, "664": {"acRate": 54.96774288251657, "difficulty": "Hard", "likes": 2206, "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": 74893, "totalSubmissionRaw": 136249}, "665": {"acRate": 24.79062786532485, "difficulty": "Medium", "likes": 5721, "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": 266588, "totalSubmissionRaw": 1075353}, "666": {"acRate": 61.4185828086409, "difficulty": "Medium", "likes": 399, "dislikes": 508, "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": 35312, "totalSubmissionRaw": 57494}, "667": {"acRate": 60.231818081368374, "difficulty": "Medium", "likes": 793, "dislikes": 1053, "categoryTitle": "Algorithms", "frontendQuestionId": "667", "paidOnly": false, "title": "Beautiful Arrangement II", "titleSlug": "beautiful-arrangement-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54511, "totalSubmissionRaw": 90502}, "668": {"acRate": 51.896890987800084, "difficulty": "Hard", "likes": 2154, "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": 65935, "totalSubmissionRaw": 127050}, "669": {"acRate": 66.29100876756333, "difficulty": "Medium", "likes": 5846, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "669", "paidOnly": false, "title": "Trim a Binary Search Tree", "titleSlug": "trim-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 299640, "totalSubmissionRaw": 452007}, "670": {"acRate": 48.925610183346954, "difficulty": "Medium", "likes": 3386, "dislikes": 206, "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": 259745, "totalSubmissionRaw": 530900}, "671": {"acRate": 44.656689682936374, "difficulty": "Easy", "likes": 1855, "dislikes": 1876, "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": 197450, "totalSubmissionRaw": 442151}, "672": {"acRate": 50.14459470953474, "difficulty": "Medium", "likes": 163, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "672", "paidOnly": false, "title": "Bulb Switcher II", "titleSlug": "bulb-switcher-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23582, "totalSubmissionRaw": 47028}, "673": {"acRate": 48.499496313335335, "difficulty": "Medium", "likes": 6800, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "673", "paidOnly": false, "title": "Number of Longest Increasing Subsequence", "titleSlug": "number-of-longest-increasing-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241204, "totalSubmissionRaw": 497332}, "674": {"acRate": 50.433222677380876, "difficulty": "Easy", "likes": 2344, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "674", "paidOnly": false, "title": "Longest Continuous Increasing Subsequence", "titleSlug": "longest-continuous-increasing-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272700, "totalSubmissionRaw": 540715}, "675": {"acRate": 34.494449474471516, "difficulty": "Hard", "likes": 1230, "dislikes": 673, "categoryTitle": "Algorithms", "frontendQuestionId": "675", "paidOnly": false, "title": "Cut Off Trees for Golf Event", "titleSlug": "cut-off-trees-for-golf-event", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70101, "totalSubmissionRaw": 203223}, "676": {"acRate": 57.591464847552984, "difficulty": "Medium", "likes": 1403, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "676", "paidOnly": false, "title": "Implement Magic Dictionary", "titleSlug": "implement-magic-dictionary", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85775, "totalSubmissionRaw": 148937}, "677": {"acRate": 56.81105640000952, "difficulty": "Medium", "likes": 1651, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "677", "paidOnly": false, "title": "Map Sum Pairs", "titleSlug": "map-sum-pairs", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119414, "totalSubmissionRaw": 210195}, "678": {"acRate": 38.13583443023465, "difficulty": "Medium", "likes": 6172, "dislikes": 189, "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": 392576, "totalSubmissionRaw": 1029415}, "679": {"acRate": 49.43085925469664, "difficulty": "Hard", "likes": 1470, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "679", "paidOnly": false, "title": "24 Game", "titleSlug": "24-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80251, "totalSubmissionRaw": 162350}, "680": {"acRate": 41.11550216428751, "difficulty": "Easy", "likes": 8250, "dislikes": 445, "categoryTitle": "Algorithms", "frontendQuestionId": "680", "paidOnly": false, "title": "Valid Palindrome II", "titleSlug": "valid-palindrome-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 779456, "totalSubmissionRaw": 1895759}, "681": {"acRate": 46.75892516024961, "difficulty": "Medium", "likes": 730, "dislikes": 1065, "categoryTitle": "Algorithms", "frontendQuestionId": "681", "paidOnly": true, "title": "Next Closest Time", "titleSlug": "next-closest-time", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110150, "totalSubmissionRaw": 235570}, "682": {"acRate": 76.97612408149973, "difficulty": "Easy", "likes": 2861, "dislikes": 1909, "categoryTitle": "Algorithms", "frontendQuestionId": "682", "paidOnly": false, "title": "Baseball Game", "titleSlug": "baseball-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 378168, "totalSubmissionRaw": 491282}, "683": {"acRate": 37.13452582493388, "difficulty": "Hard", "likes": 800, "dislikes": 693, "categoryTitle": "Algorithms", "frontendQuestionId": "683", "paidOnly": true, "title": "K Empty Slots", "titleSlug": "k-empty-slots", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61637, "totalSubmissionRaw": 165983}, "684": {"acRate": 63.260846373874024, "difficulty": "Medium", "likes": 6205, "dislikes": 403, "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": 379514, "totalSubmissionRaw": 599921}, "685": {"acRate": 34.553633976524864, "difficulty": "Hard", "likes": 2339, "dislikes": 316, "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": 72506, "totalSubmissionRaw": 209838}, "686": {"acRate": 35.381724993864886, "difficulty": "Medium", "likes": 2554, "dislikes": 983, "categoryTitle": "Algorithms", "frontendQuestionId": "686", "paidOnly": false, "title": "Repeated String Match", "titleSlug": "repeated-string-match", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 175896, "totalSubmissionRaw": 497138}, "687": {"acRate": 41.75244544603111, "difficulty": "Medium", "likes": 4247, "dislikes": 673, "categoryTitle": "Algorithms", "frontendQuestionId": "687", "paidOnly": false, "title": "Longest Univalue Path", "titleSlug": "longest-univalue-path", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187680, "totalSubmissionRaw": 449507}, "688": {"acRate": 56.260463601708864, "difficulty": "Medium", "likes": 3844, "dislikes": 475, "categoryTitle": "Algorithms", "frontendQuestionId": "688", "paidOnly": false, "title": "Knight Probability in Chessboard", "titleSlug": "knight-probability-in-chessboard", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158951, "totalSubmissionRaw": 282527}, "689": {"acRate": 50.2232386630092, "difficulty": "Hard", "likes": 1971, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "689", "paidOnly": false, "title": "Maximum Sum of 3 Non-Overlapping Subarrays", "titleSlug": "maximum-sum-of-3-non-overlapping-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78179, "totalSubmissionRaw": 155663}, "690": {"acRate": 67.2883163231998, "difficulty": "Medium", "likes": 2104, "dislikes": 1337, "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": 216447, "totalSubmissionRaw": 321671}, "691": {"acRate": 48.95260821092574, "difficulty": "Hard", "likes": 1222, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "691", "paidOnly": false, "title": "Stickers to Spell Word", "titleSlug": "stickers-to-spell-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75084, "totalSubmissionRaw": 153381}, "692": {"acRate": 58.29429073536687, "difficulty": "Medium", "likes": 7653, "dislikes": 346, "categoryTitle": "Algorithms", "frontendQuestionId": "692", "paidOnly": false, "title": "Top K Frequent Words", "titleSlug": "top-k-frequent-words", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 631578, "totalSubmissionRaw": 1083431}, "693": {"acRate": 62.74793200618126, "difficulty": "Easy", "likes": 1358, "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": 138057, "totalSubmissionRaw": 220019}, "694": {"acRate": 61.4942859196435, "difficulty": "Medium", "likes": 2231, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "694", "paidOnly": true, "title": "Number of Distinct Islands", "titleSlug": "number-of-distinct-islands", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 171113, "totalSubmissionRaw": 278259}, "695": {"acRate": 72.36822600620675, "difficulty": "Medium", "likes": 9968, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "695", "paidOnly": false, "title": "Max Area of Island", "titleSlug": "max-area-of-island", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 908037, "totalSubmissionRaw": 1254744}, "696": {"acRate": 65.6276449183589, "difficulty": "Easy", "likes": 3979, "dislikes": 867, "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": 212459, "totalSubmissionRaw": 323734}, "697": {"acRate": 56.669085949990574, "difficulty": "Easy", "likes": 3036, "dislikes": 1736, "categoryTitle": "Algorithms", "frontendQuestionId": "697", "paidOnly": false, "title": "Degree of an Array", "titleSlug": "degree-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219404, "totalSubmissionRaw": 387167}, "698": {"acRate": 38.19769566746017, "difficulty": "Medium", "likes": 7127, "dislikes": 511, "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": 274871, "totalSubmissionRaw": 719601}, "699": {"acRate": 45.34767424702005, "difficulty": "Hard", "likes": 630, "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": 27658, "totalSubmissionRaw": 60991}, "700": {"acRate": 80.35002067118745, "difficulty": "Easy", "likes": 5960, "dislikes": 194, "categoryTitle": "Algorithms", "frontendQuestionId": "700", "paidOnly": false, "title": "Search in a Binary Search Tree", "titleSlug": "search-in-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 936780, "totalSubmissionRaw": 1165874}, "701": {"acRate": 73.68777430448647, "difficulty": "Medium", "likes": 5855, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "701", "paidOnly": false, "title": "Insert into a Binary Search Tree", "titleSlug": "insert-into-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 564800, "totalSubmissionRaw": 766479}, "702": {"acRate": 72.25438149952731, "difficulty": "Medium", "likes": 910, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "702", "paidOnly": true, "title": "Search in a Sorted Array of Unknown Size", "titleSlug": "search-in-a-sorted-array-of-unknown-size", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99357, "totalSubmissionRaw": 137510}, "703": {"acRate": 57.06995190145877, "difficulty": "Easy", "likes": 5495, "dislikes": 3576, "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": 577479, "totalSubmissionRaw": 1011880}, "704": {"acRate": 58.10995114151114, "difficulty": "Easy", "likes": 11880, "dislikes": 252, "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": 2572209, "totalSubmissionRaw": 4426451}, "705": {"acRate": 67.12833490075731, "difficulty": "Easy", "likes": 3782, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "705", "paidOnly": false, "title": "Design HashSet", "titleSlug": "design-hashset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433982, "totalSubmissionRaw": 646496}, "706": {"acRate": 65.58986020355977, "difficulty": "Easy", "likes": 5109, "dislikes": 467, "categoryTitle": "Algorithms", "frontendQuestionId": "706", "paidOnly": false, "title": "Design HashMap", "titleSlug": "design-hashmap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 597643, "totalSubmissionRaw": 911182}, "707": {"acRate": 28.353870094889285, "difficulty": "Medium", "likes": 2658, "dislikes": 1622, "categoryTitle": "Algorithms", "frontendQuestionId": "707", "paidOnly": false, "title": "Design Linked List", "titleSlug": "design-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 345275, "totalSubmissionRaw": 1217735}, "708": {"acRate": 36.46677241795665, "difficulty": "Medium", "likes": 1220, "dislikes": 777, "categoryTitle": "Algorithms", "frontendQuestionId": "708", "paidOnly": true, "title": "Insert into a Sorted Circular Linked List", "titleSlug": "insert-into-a-sorted-circular-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180004, "totalSubmissionRaw": 493609}, "709": {"acRate": 83.5540489897767, "difficulty": "Easy", "likes": 1847, "dislikes": 2773, "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": 541779, "totalSubmissionRaw": 648418}, "710": {"acRate": 33.48327791902992, "difficulty": "Hard", "likes": 865, "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": 42800, "totalSubmissionRaw": 127825}, "711": {"acRate": 53.07330257700732, "difficulty": "Hard", "likes": 263, "dislikes": 271, "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": 11389, "totalSubmissionRaw": 21459}, "712": {"acRate": 65.19870681123403, "difficulty": "Medium", "likes": 3983, "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": 148226, "totalSubmissionRaw": 227345}, "713": {"acRate": 51.64833952140157, "difficulty": "Medium", "likes": 6851, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "713", "paidOnly": false, "title": "Subarray Product Less Than K", "titleSlug": "subarray-product-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 421217, "totalSubmissionRaw": 815548}, "714": {"acRate": 69.0892954693718, "difficulty": "Medium", "likes": 7163, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "714", "paidOnly": false, "title": "Best Time to Buy and Sell Stock with Transaction Fee", "titleSlug": "best-time-to-buy-and-sell-stock-with-transaction-fee", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 390796, "totalSubmissionRaw": 565639}, "715": {"acRate": 43.89442405173921, "difficulty": "Hard", "likes": 1493, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "715", "paidOnly": false, "title": "Range Module", "titleSlug": "range-module", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75336, "totalSubmissionRaw": 171630}, "716": {"acRate": 45.06311033377059, "difficulty": "Hard", "likes": 1921, "dislikes": 510, "categoryTitle": "Algorithms", "frontendQuestionId": "716", "paidOnly": true, "title": "Max Stack", "titleSlug": "max-stack", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154589, "totalSubmissionRaw": 343050}, "717": {"acRate": 45.228658335857155, "difficulty": "Easy", "likes": 869, "dislikes": 2112, "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": 137392, "totalSubmissionRaw": 303772}, "718": {"acRate": 50.95112410094293, "difficulty": "Medium", "likes": 6800, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "718", "paidOnly": false, "title": "Maximum Length of Repeated Subarray", "titleSlug": "maximum-length-of-repeated-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 307515, "totalSubmissionRaw": 603549}, "719": {"acRate": 38.38241574140989, "difficulty": "Hard", "likes": 2988, "dislikes": 99, "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": 93475, "totalSubmissionRaw": 243536}, "720": {"acRate": 52.638450768374355, "difficulty": "Medium", "likes": 1965, "dislikes": 1493, "categoryTitle": "Algorithms", "frontendQuestionId": "720", "paidOnly": false, "title": "Longest Word in Dictionary", "titleSlug": "longest-word-in-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 156022, "totalSubmissionRaw": 296403}, "721": {"acRate": 57.68907557150188, "difficulty": "Medium", "likes": 6773, "dislikes": 1164, "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": 412575, "totalSubmissionRaw": 715171}, "722": {"acRate": 38.88335625424828, "difficulty": "Medium", "likes": 719, "dislikes": 1807, "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": 73794, "totalSubmissionRaw": 189783}, "723": {"acRate": 76.89897375504711, "difficulty": "Medium", "likes": 1016, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "723", "paidOnly": true, "title": "Candy Crush", "titleSlug": "candy-crush", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73134, "totalSubmissionRaw": 95104}, "724": {"acRate": 58.30047229889376, "difficulty": "Easy", "likes": 8372, "dislikes": 853, "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": 1153051, "totalSubmissionRaw": 1977773}, "725": {"acRate": 64.2582456583119, "difficulty": "Medium", "likes": 3950, "dislikes": 316, "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": 203689, "totalSubmissionRaw": 316985}, "726": {"acRate": 65.20548551205485, "difficulty": "Hard", "likes": 1873, "dislikes": 405, "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": 147397, "totalSubmissionRaw": 226050}, "727": {"acRate": 43.5210738759035, "difficulty": "Hard", "likes": 1456, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "727", "paidOnly": true, "title": "Minimum Window Subsequence", "titleSlug": "minimum-window-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92725, "totalSubmissionRaw": 213059}, "728": {"acRate": 78.8671160644548, "difficulty": "Easy", "likes": 1783, "dislikes": 375, "categoryTitle": "Algorithms", "frontendQuestionId": "728", "paidOnly": false, "title": "Self Dividing Numbers", "titleSlug": "self-dividing-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251426, "totalSubmissionRaw": 318797}, "729": {"acRate": 56.59185148478005, "difficulty": "Medium", "likes": 4215, "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": 288927, "totalSubmissionRaw": 510546}, "730": {"acRate": 45.737838462193146, "difficulty": "Hard", "likes": 1926, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "730", "paidOnly": false, "title": "Count Different Palindromic Subsequences", "titleSlug": "count-different-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37618, "totalSubmissionRaw": 82247}, "731": {"acRate": 55.698928221692015, "difficulty": "Medium", "likes": 1752, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "731", "paidOnly": false, "title": "My Calendar II", "titleSlug": "my-calendar-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102950, "totalSubmissionRaw": 184833}, "732": {"acRate": 71.6517405186512, "difficulty": "Hard", "likes": 1961, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "732", "paidOnly": false, "title": "My Calendar III", "titleSlug": "my-calendar-iii", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92008, "totalSubmissionRaw": 128410}, "733": {"acRate": 64.5444181651919, "difficulty": "Easy", "likes": 8443, "dislikes": 875, "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": 955693, "totalSubmissionRaw": 1480676}, "734": {"acRate": 44.358329934076345, "difficulty": "Easy", "likes": 47, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "734", "paidOnly": true, "title": "Sentence Similarity", "titleSlug": "sentence-similarity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67422, "totalSubmissionRaw": 151994}, "735": {"acRate": 44.60464720537098, "difficulty": "Medium", "likes": 8003, "dislikes": 1091, "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": 560924, "totalSubmissionRaw": 1257557}, "736": {"acRate": 51.962154360724846, "difficulty": "Hard", "likes": 476, "dislikes": 362, "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": 22682, "totalSubmissionRaw": 43651}, "737": {"acRate": 50.14227330422775, "difficulty": "Medium", "likes": 840, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "737", "paidOnly": true, "title": "Sentence Similarity II", "titleSlug": "sentence-similarity-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71897, "totalSubmissionRaw": 143386}, "738": {"acRate": 48.24618993846127, "difficulty": "Medium", "likes": 1324, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "738", "paidOnly": false, "title": "Monotone Increasing Digits", "titleSlug": "monotone-increasing-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55115, "totalSubmissionRaw": 114237}, "739": {"acRate": 66.22877584608739, "difficulty": "Medium", "likes": 13217, "dislikes": 324, "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": 1041006, "totalSubmissionRaw": 1571835}, "740": {"acRate": 56.51515491800912, "difficulty": "Medium", "likes": 7534, "dislikes": 381, "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": 352294, "totalSubmissionRaw": 623362}, "741": {"acRate": 37.12643678160919, "difficulty": "Hard", "likes": 4279, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "741", "paidOnly": false, "title": "Cherry Pickup", "titleSlug": "cherry-pickup", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83334, "totalSubmissionRaw": 224460}, "742": {"acRate": 46.41954423325704, "difficulty": "Medium", "likes": 859, "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": 46645, "totalSubmissionRaw": 100488}, "743": {"acRate": 54.68370132510226, "difficulty": "Medium", "likes": 7455, "dislikes": 367, "categoryTitle": "Algorithms", "frontendQuestionId": "743", "paidOnly": false, "title": "Network Delay Time", "titleSlug": "network-delay-time", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 527234, "totalSubmissionRaw": 964152}, "744": {"acRate": 52.54649133208926, "difficulty": "Easy", "likes": 4446, "dislikes": 2194, "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": 505162, "totalSubmissionRaw": 961362}, "745": {"acRate": 41.14641023059108, "difficulty": "Hard", "likes": 2276, "dislikes": 484, "categoryTitle": "Algorithms", "frontendQuestionId": "745", "paidOnly": false, "title": "Prefix and Suffix Search", "titleSlug": "prefix-and-suffix-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98067, "totalSubmissionRaw": 238340}, "746": {"acRate": 66.06619884400833, "difficulty": "Easy", "likes": 11442, "dislikes": 1770, "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": 1238685, "totalSubmissionRaw": 1874919}, "747": {"acRate": 49.24435029616047, "difficulty": "Easy", "likes": 1202, "dislikes": 905, "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": 254319, "totalSubmissionRaw": 516443}, "748": {"acRate": 60.32344683553019, "difficulty": "Easy", "likes": 549, "dislikes": 1107, "categoryTitle": "Algorithms", "frontendQuestionId": "748", "paidOnly": false, "title": "Shortest Completing Word", "titleSlug": "shortest-completing-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78853, "totalSubmissionRaw": 130717}, "749": {"acRate": 51.32420449640993, "difficulty": "Hard", "likes": 395, "dislikes": 458, "categoryTitle": "Algorithms", "frontendQuestionId": "749", "paidOnly": false, "title": "Contain Virus", "titleSlug": "contain-virus", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13081, "totalSubmissionRaw": 25487}, "750": {"acRate": 67.80062043219938, "difficulty": "Medium", "likes": 620, "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": 38685, "totalSubmissionRaw": 57057}, "751": {"acRate": 55.63855960635205, "difficulty": "Medium", "likes": 88, "dislikes": 317, "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": 24876, "totalSubmissionRaw": 44710}, "752": {"acRate": 60.34447254033657, "difficulty": "Medium", "likes": 4770, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "752", "paidOnly": false, "title": "Open the Lock", "titleSlug": "open-the-lock", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 325272, "totalSubmissionRaw": 539023}, "753": {"acRate": 57.030826187507735, "difficulty": "Hard", "likes": 563, "dislikes": 102, "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": 59924, "totalSubmissionRaw": 105073}, "754": {"acRate": 43.28834299242133, "difficulty": "Medium", "likes": 1816, "dislikes": 812, "categoryTitle": "Algorithms", "frontendQuestionId": "754", "paidOnly": false, "title": "Reach a Number", "titleSlug": "reach-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56317, "totalSubmissionRaw": 130099}, "755": {"acRate": 47.06998467488871, "difficulty": "Medium", "likes": 301, "dislikes": 763, "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": 38700, "totalSubmissionRaw": 82218}, "756": {"acRate": 52.913012488766306, "difficulty": "Medium", "likes": 537, "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": 34149, "totalSubmissionRaw": 64537}, "757": {"acRate": 44.64238684675872, "difficulty": "Hard", "likes": 712, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "757", "paidOnly": false, "title": "Set Intersection Size At Least Two", "titleSlug": "set-intersection-size-at-least-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23730, "totalSubmissionRaw": 53157}, "758": {"acRate": 51.56380485439509, "difficulty": "Medium", "likes": 269, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "758", "paidOnly": true, "title": "Bold Words in String", "titleSlug": "bold-words-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19141, "totalSubmissionRaw": 37121}, "759": {"acRate": 72.25174321320054, "difficulty": "Hard", "likes": 1900, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "759", "paidOnly": true, "title": "Employee Free Time", "titleSlug": "employee-free-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 152423, "totalSubmissionRaw": 210961}, "760": {"acRate": 83.70148864571536, "difficulty": "Easy", "likes": 612, "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": 102726, "totalSubmissionRaw": 122729}, "761": {"acRate": 61.36031287196055, "difficulty": "Hard", "likes": 705, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "761", "paidOnly": false, "title": "Special Binary String", "titleSlug": "special-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18043, "totalSubmissionRaw": 29405}, "762": {"acRate": 69.80271363501677, "difficulty": "Easy", "likes": 716, "dislikes": 509, "categoryTitle": "Algorithms", "frontendQuestionId": "762", "paidOnly": false, "title": "Prime Number of Set Bits in Binary Representation", "titleSlug": "prime-number-of-set-bits-in-binary-representation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101297, "totalSubmissionRaw": 145119}, "763": {"acRate": 79.94938609625049, "difficulty": "Medium", "likes": 10292, "dislikes": 400, "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": 551592, "totalSubmissionRaw": 689927}, "764": {"acRate": 48.350161256340854, "difficulty": "Medium", "likes": 1460, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "764", "paidOnly": false, "title": "Largest Plus Sign", "titleSlug": "largest-plus-sign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59667, "totalSubmissionRaw": 123406}, "765": {"acRate": 57.53610598327723, "difficulty": "Hard", "likes": 2350, "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": 63582, "totalSubmissionRaw": 110508}, "766": {"acRate": 69.10873296314992, "difficulty": "Easy", "likes": 3538, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "766", "paidOnly": false, "title": "Toeplitz Matrix", "titleSlug": "toeplitz-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 342261, "totalSubmissionRaw": 495250}, "767": {"acRate": 54.87405984270561, "difficulty": "Medium", "likes": 8508, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "767", "paidOnly": false, "title": "Reorganize String", "titleSlug": "reorganize-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 409006, "totalSubmissionRaw": 745354}, "768": {"acRate": 53.39156533157169, "difficulty": "Hard", "likes": 1835, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "768", "paidOnly": false, "title": "Max Chunks To Make Sorted II", "titleSlug": "max-chunks-to-make-sorted-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65464, "totalSubmissionRaw": 122612}, "769": {"acRate": 58.51436053750053, "difficulty": "Medium", "likes": 2819, "dislikes": 245, "categoryTitle": "Algorithms", "frontendQuestionId": "769", "paidOnly": false, "title": "Max Chunks To Make Sorted", "titleSlug": "max-chunks-to-make-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 109035, "totalSubmissionRaw": 186341}, "770": {"acRate": 55.667361835245046, "difficulty": "Hard", "likes": 167, "dislikes": 1411, "categoryTitle": "Algorithms", "frontendQuestionId": "770", "paidOnly": false, "title": "Basic Calculator IV", "titleSlug": "basic-calculator-iv", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10677, "totalSubmissionRaw": 19180}, "771": {"acRate": 88.77234542374612, "difficulty": "Easy", "likes": 5100, "dislikes": 595, "categoryTitle": "Algorithms", "frontendQuestionId": "771", "paidOnly": false, "title": "Jewels and Stones", "titleSlug": "jewels-and-stones", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1078489, "totalSubmissionRaw": 1214894}, "772": {"acRate": 50.95367525407705, "difficulty": "Hard", "likes": 1135, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "772", "paidOnly": true, "title": "Basic Calculator III", "titleSlug": "basic-calculator-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129351, "totalSubmissionRaw": 253860}, "773": {"acRate": 64.99629255139871, "difficulty": "Hard", "likes": 2025, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "773", "paidOnly": false, "title": "Sliding Puzzle", "titleSlug": "sliding-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96422, "totalSubmissionRaw": 148350}, "774": {"acRate": 52.369326755166746, "difficulty": "Hard", "likes": 681, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "774", "paidOnly": true, "title": "Minimize Max Distance to Gas Station", "titleSlug": "minimize-max-distance-to-gas-station", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30889, "totalSubmissionRaw": 58983}, "775": {"acRate": 42.41293669628567, "difficulty": "Medium", "likes": 1832, "dislikes": 376, "categoryTitle": "Algorithms", "frontendQuestionId": "775", "paidOnly": false, "title": "Global and Local Inversions", "titleSlug": "global-and-local-inversions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76848, "totalSubmissionRaw": 181190}, "776": {"acRate": 82.62107177922047, "difficulty": "Medium", "likes": 1058, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "776", "paidOnly": true, "title": "Split BST", "titleSlug": "split-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108555, "totalSubmissionRaw": 131389}, "777": {"acRate": 36.8537392329486, "difficulty": "Medium", "likes": 1221, "dislikes": 933, "categoryTitle": "Algorithms", "frontendQuestionId": "777", "paidOnly": false, "title": "Swap Adjacent in LR String", "titleSlug": "swap-adjacent-in-lr-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77526, "totalSubmissionRaw": 210362}, "778": {"acRate": 61.294341447231425, "difficulty": "Hard", "likes": 3715, "dislikes": 248, "categoryTitle": "Algorithms", "frontendQuestionId": "778", "paidOnly": false, "title": "Swim in Rising Water", "titleSlug": "swim-in-rising-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 173672, "totalSubmissionRaw": 283341}, "779": {"acRate": 46.692006336413286, "difficulty": "Medium", "likes": 3792, "dislikes": 396, "categoryTitle": "Algorithms", "frontendQuestionId": "779", "paidOnly": false, "title": "K-th Symbol in Grammar", "titleSlug": "k-th-symbol-in-grammar", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208096, "totalSubmissionRaw": 445678}, "780": {"acRate": 33.28574234751321, "difficulty": "Hard", "likes": 1525, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "780", "paidOnly": false, "title": "Reaching Points", "titleSlug": "reaching-points", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69475, "totalSubmissionRaw": 208723}, "781": {"acRate": 53.05989926113129, "difficulty": "Medium", "likes": 1333, "dislikes": 620, "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": 60466, "totalSubmissionRaw": 113958}, "782": {"acRate": 50.92210216665723, "difficulty": "Hard", "likes": 357, "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": 18003, "totalSubmissionRaw": 35354}, "783": {"acRate": 59.70557885818892, "difficulty": "Easy", "likes": 3491, "dislikes": 419, "categoryTitle": "Algorithms", "frontendQuestionId": "783", "paidOnly": false, "title": "Minimum Distance Between BST Nodes", "titleSlug": "minimum-distance-between-bst-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 258638, "totalSubmissionRaw": 433189}, "784": {"acRate": 74.3848896839882, "difficulty": "Medium", "likes": 4657, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "784", "paidOnly": false, "title": "Letter Case Permutation", "titleSlug": "letter-case-permutation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 308521, "totalSubmissionRaw": 414763}, "785": {"acRate": 56.18188618856203, "difficulty": "Medium", "likes": 8295, "dislikes": 384, "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": 593306, "totalSubmissionRaw": 1056045}, "786": {"acRate": 68.14540917391086, "difficulty": "Medium", "likes": 2002, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "786", "paidOnly": false, "title": "K-th Smallest Prime Fraction", "titleSlug": "k-th-smallest-prime-fraction", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149648, "totalSubmissionRaw": 219601}, "787": {"acRate": 39.50006232479439, "difficulty": "Medium", "likes": 9941, "dislikes": 414, "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": 595751, "totalSubmissionRaw": 1508226}, "788": {"acRate": 56.45474657147446, "difficulty": "Medium", "likes": 747, "dislikes": 1927, "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": 108965, "totalSubmissionRaw": 193013}, "789": {"acRate": 61.985022547799296, "difficulty": "Medium", "likes": 290, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "789", "paidOnly": false, "title": "Escape The Ghosts", "titleSlug": "escape-the-ghosts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30377, "totalSubmissionRaw": 49007}, "790": {"acRate": 50.11510104492653, "difficulty": "Medium", "likes": 3452, "dislikes": 1116, "categoryTitle": "Algorithms", "frontendQuestionId": "790", "paidOnly": false, "title": "Domino and Tromino Tiling", "titleSlug": "domino-and-tromino-tiling", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141723, "totalSubmissionRaw": 282795}, "791": {"acRate": 70.91601707954948, "difficulty": "Medium", "likes": 3611, "dislikes": 414, "categoryTitle": "Algorithms", "frontendQuestionId": "791", "paidOnly": false, "title": "Custom Sort String", "titleSlug": "custom-sort-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 446599, "totalSubmissionRaw": 629758}, "792": {"acRate": 50.88673512405991, "difficulty": "Medium", "likes": 5497, "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": 232961, "totalSubmissionRaw": 457803}, "793": {"acRate": 44.80848885372551, "difficulty": "Hard", "likes": 434, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "793", "paidOnly": false, "title": "Preimage Size of Factorial Zeroes Function", "titleSlug": "preimage-size-of-factorial-zeroes-function", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19256, "totalSubmissionRaw": 42974}, "794": {"acRate": 34.70952313968209, "difficulty": "Medium", "likes": 550, "dislikes": 1150, "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": 59220, "totalSubmissionRaw": 170616}, "795": {"acRate": 53.2855266692535, "difficulty": "Medium", "likes": 2297, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "795", "paidOnly": false, "title": "Number of Subarrays with Bounded Maximum", "titleSlug": "number-of-subarrays-with-bounded-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71409, "totalSubmissionRaw": 134012}, "796": {"acRate": 58.841567233589096, "difficulty": "Easy", "likes": 3632, "dislikes": 180, "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": 347318, "totalSubmissionRaw": 590259}, "797": {"acRate": 82.59117320954542, "difficulty": "Medium", "likes": 7242, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "797", "paidOnly": false, "title": "All Paths From Source to Target", "titleSlug": "all-paths-from-source-to-target", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 538560, "totalSubmissionRaw": 652080}, "798": {"acRate": 51.564769096717974, "difficulty": "Hard", "likes": 540, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "798", "paidOnly": false, "title": "Smallest Rotation with Highest Score", "titleSlug": "smallest-rotation-with-highest-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14203, "totalSubmissionRaw": 27544}, "799": {"acRate": 58.19531845562847, "difficulty": "Medium", "likes": 3649, "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": 155733, "totalSubmissionRaw": 267604}, "800": {"acRate": 67.48711190356215, "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": 17411, "totalSubmissionRaw": 25799}, "801": {"acRate": 40.172709499022446, "difficulty": "Hard", "likes": 2811, "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": 80341, "totalSubmissionRaw": 199989}, "802": {"acRate": 63.69133639966334, "difficulty": "Medium", "likes": 5770, "dislikes": 458, "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": 270163, "totalSubmissionRaw": 424175}, "803": {"acRate": 34.8820125672438, "difficulty": "Hard", "likes": 1116, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "803", "paidOnly": false, "title": "Bricks Falling When Hit", "titleSlug": "bricks-falling-when-hit", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30864, "totalSubmissionRaw": 88482}, "804": {"acRate": 82.93263849301505, "difficulty": "Easy", "likes": 2517, "dislikes": 1536, "categoryTitle": "Algorithms", "frontendQuestionId": "804", "paidOnly": false, "title": "Unique Morse Code Words", "titleSlug": "unique-morse-code-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 359338, "totalSubmissionRaw": 433289}, "805": {"acRate": 25.532343842330285, "difficulty": "Hard", "likes": 1270, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "805", "paidOnly": false, "title": "Split Array With Same Average", "titleSlug": "split-array-with-same-average", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36727, "totalSubmissionRaw": 143845}, "806": {"acRate": 68.84797666788188, "difficulty": "Easy", "likes": 601, "dislikes": 1332, "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": 83094, "totalSubmissionRaw": 120692}, "807": {"acRate": 86.20402155396468, "difficulty": "Medium", "likes": 2569, "dislikes": 527, "categoryTitle": "Algorithms", "frontendQuestionId": "807", "paidOnly": false, "title": "Max Increase to Keep City Skyline", "titleSlug": "max-increase-to-keep-city-skyline", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167496, "totalSubmissionRaw": 194302}, "808": {"acRate": 53.823468460569735, "difficulty": "Medium", "likes": 983, "dislikes": 2670, "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": 67528, "totalSubmissionRaw": 125462}, "809": {"acRate": 46.2063806826372, "difficulty": "Medium", "likes": 865, "dislikes": 1905, "categoryTitle": "Algorithms", "frontendQuestionId": "809", "paidOnly": false, "title": "Expressive Words", "titleSlug": "expressive-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 118603, "totalSubmissionRaw": 256681}, "810": {"acRate": 60.433775531690884, "difficulty": "Hard", "likes": 222, "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": 11480, "totalSubmissionRaw": 18996}, "811": {"acRate": 76.339203635122, "difficulty": "Medium", "likes": 1556, "dislikes": 1299, "categoryTitle": "Algorithms", "frontendQuestionId": "811", "paidOnly": false, "title": "Subdomain Visit Count", "titleSlug": "subdomain-visit-count", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232517, "totalSubmissionRaw": 304584}, "812": {"acRate": 60.921727899942226, "difficulty": "Easy", "likes": 529, "dislikes": 1590, "categoryTitle": "Algorithms", "frontendQuestionId": "812", "paidOnly": false, "title": "Largest Triangle Area", "titleSlug": "largest-triangle-area", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53775, "totalSubmissionRaw": 88269}, "813": {"acRate": 53.58722190083049, "difficulty": "Medium", "likes": 2101, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "813", "paidOnly": false, "title": "Largest Sum of Averages", "titleSlug": "largest-sum-of-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54652, "totalSubmissionRaw": 101987}, "814": {"acRate": 72.25847594587276, "difficulty": "Medium", "likes": 4524, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "814", "paidOnly": false, "title": "Binary Tree Pruning", "titleSlug": "binary-tree-pruning", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 248145, "totalSubmissionRaw": 343413}, "815": {"acRate": 47.615479850701945, "difficulty": "Hard", "likes": 4258, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "815", "paidOnly": false, "title": "Bus Routes", "titleSlug": "bus-routes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208450, "totalSubmissionRaw": 437774}, "816": {"acRate": 56.84547188867691, "difficulty": "Medium", "likes": 322, "dislikes": 661, "categoryTitle": "Algorithms", "frontendQuestionId": "816", "paidOnly": false, "title": "Ambiguous Coordinates", "titleSlug": "ambiguous-coordinates", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30393, "totalSubmissionRaw": 53466}, "817": {"acRate": 56.899368107753034, "difficulty": "Medium", "likes": 1101, "dislikes": 2229, "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": 97880, "totalSubmissionRaw": 172023}, "818": {"acRate": 43.78453578053305, "difficulty": "Hard", "likes": 1906, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "818", "paidOnly": false, "title": "Race Car", "titleSlug": "race-car", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 89697, "totalSubmissionRaw": 204860}, "819": {"acRate": 44.31626896153604, "difficulty": "Easy", "likes": 1709, "dislikes": 3057, "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": 365414, "totalSubmissionRaw": 824561}, "820": {"acRate": 60.463004993191106, "difficulty": "Medium", "likes": 1752, "dislikes": 653, "categoryTitle": "Algorithms", "frontendQuestionId": "820", "paidOnly": false, "title": "Short Encoding of Words", "titleSlug": "short-encoding-of-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97236, "totalSubmissionRaw": 160819}, "821": {"acRate": 71.70247734957069, "difficulty": "Easy", "likes": 3140, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "821", "paidOnly": false, "title": "Shortest Distance to a Character", "titleSlug": "shortest-distance-to-a-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190649, "totalSubmissionRaw": 265889}, "822": {"acRate": 47.8567802142011, "difficulty": "Medium", "likes": 174, "dislikes": 756, "categoryTitle": "Algorithms", "frontendQuestionId": "822", "paidOnly": false, "title": "Card Flipping Game", "titleSlug": "card-flipping-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19795, "totalSubmissionRaw": 41363}, "823": {"acRate": 52.89051592869627, "difficulty": "Medium", "likes": 3300, "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": 150400, "totalSubmissionRaw": 284361}, "824": {"acRate": 68.41862592214957, "difficulty": "Easy", "likes": 910, "dislikes": 1242, "categoryTitle": "Algorithms", "frontendQuestionId": "824", "paidOnly": false, "title": "Goat Latin", "titleSlug": "goat-latin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 182519, "totalSubmissionRaw": 266768}, "825": {"acRate": 47.86422479557691, "difficulty": "Medium", "likes": 763, "dislikes": 1215, "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": 92548, "totalSubmissionRaw": 193352}, "826": {"acRate": 55.907468910886834, "difficulty": "Medium", "likes": 2363, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "826", "paidOnly": false, "title": "Most Profit Assigning Work", "titleSlug": "most-profit-assigning-work", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208063, "totalSubmissionRaw": 372156}, "827": {"acRate": 48.12405911009903, "difficulty": "Hard", "likes": 3917, "dislikes": 76, "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": 189565, "totalSubmissionRaw": 393909}, "828": {"acRate": 52.52321703897594, "difficulty": "Hard", "likes": 2154, "dislikes": 250, "categoryTitle": "Algorithms", "frontendQuestionId": "828", "paidOnly": false, "title": "Count Unique Characters of All Substrings of a Given String", "titleSlug": "count-unique-characters-of-all-substrings-of-a-given-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73241, "totalSubmissionRaw": 139445}, "829": {"acRate": 41.86588282374015, "difficulty": "Hard", "likes": 1373, "dislikes": 1380, "categoryTitle": "Algorithms", "frontendQuestionId": "829", "paidOnly": false, "title": "Consecutive Numbers Sum", "titleSlug": "consecutive-numbers-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87879, "totalSubmissionRaw": 209906}, "830": {"acRate": 52.38327317130646, "difficulty": "Easy", "likes": 877, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "830", "paidOnly": false, "title": "Positions of Large Groups", "titleSlug": "positions-of-large-groups", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97809, "totalSubmissionRaw": 186718}, "831": {"acRate": 49.126385373405746, "difficulty": "Medium", "likes": 168, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "831", "paidOnly": false, "title": "Masking Personal Information", "titleSlug": "masking-personal-information", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19991, "totalSubmissionRaw": 40693}, "832": {"acRate": 82.23747795869885, "difficulty": "Easy", "likes": 3453, "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": 445860, "totalSubmissionRaw": 542162}, "833": {"acRate": 52.303081090290796, "difficulty": "Medium", "likes": 1190, "dislikes": 1016, "categoryTitle": "Algorithms", "frontendQuestionId": "833", "paidOnly": false, "title": "Find And Replace in String", "titleSlug": "find-and-replace-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 150420, "totalSubmissionRaw": 287593}, "834": {"acRate": 65.25385695404594, "difficulty": "Hard", "likes": 5579, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "834", "paidOnly": false, "title": "Sum of Distances in Tree", "titleSlug": "sum-of-distances-in-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158484, "totalSubmissionRaw": 242873}, "835": {"acRate": 63.703598829605056, "difficulty": "Medium", "likes": 1329, "dislikes": 481, "categoryTitle": "Algorithms", "frontendQuestionId": "835", "paidOnly": false, "title": "Image Overlap", "titleSlug": "image-overlap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94486, "totalSubmissionRaw": 148322}, "836": {"acRate": 44.98691214076317, "difficulty": "Easy", "likes": 1993, "dislikes": 470, "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": 149006, "totalSubmissionRaw": 331222}, "837": {"acRate": 44.95168997464746, "difficulty": "Medium", "likes": 1983, "dislikes": 1832, "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": 76951, "totalSubmissionRaw": 171186}, "838": {"acRate": 57.20288879591057, "difficulty": "Medium", "likes": 3384, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "838", "paidOnly": false, "title": "Push Dominoes", "titleSlug": "push-dominoes", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125780, "totalSubmissionRaw": 219884}, "839": {"acRate": 55.02463654880566, "difficulty": "Hard", "likes": 2337, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "839", "paidOnly": false, "title": "Similar String Groups", "titleSlug": "similar-string-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 121835, "totalSubmissionRaw": 221419}, "840": {"acRate": 39.31572629051621, "difficulty": "Medium", "likes": 336, "dislikes": 1596, "categoryTitle": "Algorithms", "frontendQuestionId": "840", "paidOnly": false, "title": "Magic Squares In Grid", "titleSlug": "magic-squares-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39787, "totalSubmissionRaw": 101433}, "841": {"acRate": 73.42824608512348, "difficulty": "Medium", "likes": 6136, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "841", "paidOnly": false, "title": "Keys and Rooms", "titleSlug": "keys-and-rooms", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 468153, "totalSubmissionRaw": 637566}, "842": {"acRate": 39.10541205292476, "difficulty": "Medium", "likes": 1133, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "842", "paidOnly": false, "title": "Split Array into Fibonacci Sequence", "titleSlug": "split-array-into-fibonacci-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40225, "totalSubmissionRaw": 102863}, "843": {"acRate": 38.86671987230647, "difficulty": "Hard", "likes": 1542, "dislikes": 1785, "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": 146100, "totalSubmissionRaw": 375900}, "844": {"acRate": 49.229240052631305, "difficulty": "Easy", "likes": 7530, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "844", "paidOnly": false, "title": "Backspace String Compare", "titleSlug": "backspace-string-compare", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 845939, "totalSubmissionRaw": 1718367}, "845": {"acRate": 40.55146991398757, "difficulty": "Medium", "likes": 2779, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "845", "paidOnly": false, "title": "Longest Mountain in Array", "titleSlug": "longest-mountain-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132669, "totalSubmissionRaw": 327162}, "846": {"acRate": 56.72883824132885, "difficulty": "Medium", "likes": 3267, "dislikes": 257, "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": 312423, "totalSubmissionRaw": 550731}, "847": {"acRate": 65.39480408414423, "difficulty": "Hard", "likes": 4313, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "847", "paidOnly": false, "title": "Shortest Path Visiting All Nodes", "titleSlug": "shortest-path-visiting-all-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125405, "totalSubmissionRaw": 191766}, "848": {"acRate": 44.79353640249771, "difficulty": "Medium", "likes": 1373, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "848", "paidOnly": false, "title": "Shifting Letters", "titleSlug": "shifting-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100071, "totalSubmissionRaw": 223405}, "849": {"acRate": 48.24410406638415, "difficulty": "Medium", "likes": 3221, "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": 231219, "totalSubmissionRaw": 479270}, "850": {"acRate": 54.24711013511453, "difficulty": "Hard", "likes": 968, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "850", "paidOnly": false, "title": "Rectangle Area II", "titleSlug": "rectangle-area-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35570, "totalSubmissionRaw": 65572}, "851": {"acRate": 59.96701510999005, "difficulty": "Medium", "likes": 1304, "dislikes": 814, "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": 49447, "totalSubmissionRaw": 82459}, "852": {"acRate": 68.26274014090833, "difficulty": "Medium", "likes": 7549, "dislikes": 1920, "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": 851074, "totalSubmissionRaw": 1246752}, "853": {"acRate": 51.61274956165825, "difficulty": "Medium", "likes": 3571, "dislikes": 985, "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": 281704, "totalSubmissionRaw": 545800}, "854": {"acRate": 39.97721902041788, "difficulty": "Hard", "likes": 1134, "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": 47030, "totalSubmissionRaw": 117642}, "855": {"acRate": 43.549259819359854, "difficulty": "Medium", "likes": 1333, "dislikes": 486, "categoryTitle": "Algorithms", "frontendQuestionId": "855", "paidOnly": false, "title": "Exam Room", "titleSlug": "exam-room", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62778, "totalSubmissionRaw": 144153}, "856": {"acRate": 64.05309752393396, "difficulty": "Medium", "likes": 5423, "dislikes": 209, "categoryTitle": "Algorithms", "frontendQuestionId": "856", "paidOnly": false, "title": "Score of Parentheses", "titleSlug": "score-of-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190212, "totalSubmissionRaw": 296960}, "857": {"acRate": 63.423015787001916, "difficulty": "Hard", "likes": 2903, "dislikes": 393, "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": 140442, "totalSubmissionRaw": 221438}, "858": {"acRate": 62.50726468240746, "difficulty": "Medium", "likes": 1107, "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": 80665, "totalSubmissionRaw": 129049}, "859": {"acRate": 33.15182014422145, "difficulty": "Easy", "likes": 3183, "dislikes": 1797, "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": 248027, "totalSubmissionRaw": 748155}, "860": {"acRate": 53.90376177219237, "difficulty": "Easy", "likes": 2405, "dislikes": 167, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 212404, "totalSubmissionRaw": 394043}, "861": {"acRate": 80.38841761469499, "difficulty": "Medium", "likes": 2288, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "861", "paidOnly": false, "title": "Score After Flipping Matrix", "titleSlug": "score-after-flipping-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146696, "totalSubmissionRaw": 182484}, "862": {"acRate": 26.07289041414196, "difficulty": "Hard", "likes": 4276, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "862", "paidOnly": false, "title": "Shortest Subarray with Sum at Least K", "titleSlug": "shortest-subarray-with-sum-at-least-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102109, "totalSubmissionRaw": 391629}, "863": {"acRate": 64.82700623015846, "difficulty": "Medium", "likes": 10997, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "863", "paidOnly": false, "title": "All Nodes Distance K in Binary Tree", "titleSlug": "all-nodes-distance-k-in-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 462517, "totalSubmissionRaw": 713462}, "864": {"acRate": 53.51879678517763, "difficulty": "Hard", "likes": 2331, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "864", "paidOnly": false, "title": "Shortest Path to Get All Keys", "titleSlug": "shortest-path-to-get-all-keys", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77644, "totalSubmissionRaw": 145078}, "865": {"acRate": 70.92196453751762, "difficulty": "Medium", "likes": 2644, "dislikes": 374, "categoryTitle": "Algorithms", "frontendQuestionId": "865", "paidOnly": false, "title": "Smallest Subtree with all the Deepest Nodes", "titleSlug": "smallest-subtree-with-all-the-deepest-nodes", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141832, "totalSubmissionRaw": 199984}, "866": {"acRate": 26.068948807062974, "difficulty": "Medium", "likes": 437, "dislikes": 829, "categoryTitle": "Algorithms", "frontendQuestionId": "866", "paidOnly": false, "title": "Prime Palindrome", "titleSlug": "prime-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34429, "totalSubmissionRaw": 132069}, "867": {"acRate": 72.18452341737259, "difficulty": "Easy", "likes": 3760, "dislikes": 443, "categoryTitle": "Algorithms", "frontendQuestionId": "867", "paidOnly": false, "title": "Transpose Matrix", "titleSlug": "transpose-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 416356, "totalSubmissionRaw": 576794}, "868": {"acRate": 63.7075954526926, "difficulty": "Easy", "likes": 638, "dislikes": 662, "categoryTitle": "Algorithms", "frontendQuestionId": "868", "paidOnly": false, "title": "Binary Gap", "titleSlug": "binary-gap", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84396, "totalSubmissionRaw": 132474}, "869": {"acRate": 62.59624336016647, "difficulty": "Medium", "likes": 2117, "dislikes": 436, "categoryTitle": "Algorithms", "frontendQuestionId": "869", "paidOnly": false, "title": "Reordered Power of 2", "titleSlug": "reordered-power-of-2", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114307, "totalSubmissionRaw": 182610}, "870": {"acRate": 52.67258435789457, "difficulty": "Medium", "likes": 1615, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "870", "paidOnly": false, "title": "Advantage Shuffle", "titleSlug": "advantage-shuffle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68418, "totalSubmissionRaw": 129893}, "871": {"acRate": 40.08359679075775, "difficulty": "Hard", "likes": 4665, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "871", "paidOnly": false, "title": "Minimum Number of Refueling Stops", "titleSlug": "minimum-number-of-refueling-stops", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139339, "totalSubmissionRaw": 347621}, "872": {"acRate": 70.04607068094371, "difficulty": "Easy", "likes": 4123, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "872", "paidOnly": false, "title": "Leaf-Similar Trees", "titleSlug": "leaf-similar-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 499909, "totalSubmissionRaw": 713686}, "873": {"acRate": 48.41106953654651, "difficulty": "Medium", "likes": 2022, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "873", "paidOnly": false, "title": "Length of Longest Fibonacci Subsequence", "titleSlug": "length-of-longest-fibonacci-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65338, "totalSubmissionRaw": 134965}, "874": {"acRate": 40.476622743734055, "difficulty": "Medium", "likes": 205, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "874", "paidOnly": false, "title": "Walking Robot Simulation", "titleSlug": "walking-robot-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42360, "totalSubmissionRaw": 104652}, "875": {"acRate": 48.423457939885495, "difficulty": "Medium", "likes": 10736, "dislikes": 675, "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": 739347, "totalSubmissionRaw": 1526856}, "876": {"acRate": 79.05740139049017, "difficulty": "Easy", "likes": 11695, "dislikes": 376, "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": 2036573, "totalSubmissionRaw": 2576068}, "877": {"acRate": 70.76991955717197, "difficulty": "Medium", "likes": 3243, "dislikes": 2884, "categoryTitle": "Algorithms", "frontendQuestionId": "877", "paidOnly": false, "title": "Stone Game", "titleSlug": "stone-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 243428, "totalSubmissionRaw": 343971}, "878": {"acRate": 35.49859487711887, "difficulty": "Hard", "likes": 1276, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "878", "paidOnly": false, "title": "Nth Magical Number", "titleSlug": "nth-magical-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39664, "totalSubmissionRaw": 111734}, "879": {"acRate": 48.22410195427315, "difficulty": "Hard", "likes": 1836, "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": 64479, "totalSubmissionRaw": 133707}, "880": {"acRate": 36.46760603165989, "difficulty": "Medium", "likes": 2515, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "880", "paidOnly": false, "title": "Decoded String at Index", "titleSlug": "decoded-string-at-index", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98115, "totalSubmissionRaw": 269047}, "881": {"acRate": 59.502142677085956, "difficulty": "Medium", "likes": 6427, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "881", "paidOnly": false, "title": "Boats to Save People", "titleSlug": "boats-to-save-people", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 424881, "totalSubmissionRaw": 714060}, "882": {"acRate": 50.53284555431844, "difficulty": "Hard", "likes": 812, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "882", "paidOnly": false, "title": "Reachable Nodes In Subdivided Graph", "titleSlug": "reachable-nodes-in-subdivided-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28593, "totalSubmissionRaw": 56583}, "883": {"acRate": 72.99601038566273, "difficulty": "Easy", "likes": 587, "dislikes": 1411, "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": 57634, "totalSubmissionRaw": 78955}, "884": {"acRate": 67.6504599826775, "difficulty": "Easy", "likes": 1338, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "884", "paidOnly": false, "title": "Uncommon Words from Two Sentences", "titleSlug": "uncommon-words-from-two-sentences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144498, "totalSubmissionRaw": 213595}, "885": {"acRate": 84.38346546528976, "difficulty": "Medium", "likes": 1426, "dislikes": 1003, "categoryTitle": "Algorithms", "frontendQuestionId": "885", "paidOnly": false, "title": "Spiral Matrix III", "titleSlug": "spiral-matrix-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143901, "totalSubmissionRaw": 170537}, "886": {"acRate": 50.7123473541384, "difficulty": "Medium", "likes": 4670, "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": 213785, "totalSubmissionRaw": 421564}, "887": {"acRate": 27.892378687461328, "difficulty": "Hard", "likes": 3621, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "887", "paidOnly": false, "title": "Super Egg Drop", "titleSlug": "super-egg-drop", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74828, "totalSubmissionRaw": 268274}, "888": {"acRate": 62.00581892863255, "difficulty": "Easy", "likes": 2108, "dislikes": 381, "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": 126804, "totalSubmissionRaw": 204504}, "889": {"acRate": 71.58104717640768, "difficulty": "Medium", "likes": 2740, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "889", "paidOnly": false, "title": "Construct Binary Tree from Preorder and Postorder Traversal", "titleSlug": "construct-binary-tree-from-preorder-and-postorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104421, "totalSubmissionRaw": 145878}, "890": {"acRate": 76.79987037449618, "difficulty": "Medium", "likes": 3917, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "890", "paidOnly": false, "title": "Find and Replace Pattern", "titleSlug": "find-and-replace-pattern", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 189590, "totalSubmissionRaw": 246863}, "891": {"acRate": 37.98849260112963, "difficulty": "Hard", "likes": 713, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "891", "paidOnly": false, "title": "Sum of Subsequence Widths", "titleSlug": "sum-of-subsequence-widths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21590, "totalSubmissionRaw": 56833}, "892": {"acRate": 66.40309232052351, "difficulty": "Easy", "likes": 570, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "892", "paidOnly": false, "title": "Surface Area of 3D Shapes", "titleSlug": "surface-area-of-3d-shapes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41401, "totalSubmissionRaw": 62348}, "893": {"acRate": 71.95922795797168, "difficulty": "Medium", "likes": 533, "dislikes": 1481, "categoryTitle": "Algorithms", "frontendQuestionId": "893", "paidOnly": false, "title": "Groups of Special-Equivalent Strings", "titleSlug": "groups-of-special-equivalent-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50406, "totalSubmissionRaw": 70048}, "894": {"acRate": 82.76257976198362, "difficulty": "Medium", "likes": 5068, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "894", "paidOnly": false, "title": "All Possible Full Binary Trees", "titleSlug": "all-possible-full-binary-trees", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187419, "totalSubmissionRaw": 226454}, "895": {"acRate": 66.44956000462564, "difficulty": "Hard", "likes": 4695, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "895", "paidOnly": false, "title": "Maximum Frequency Stack", "titleSlug": "maximum-frequency-stack", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178132, "totalSubmissionRaw": 268071}, "896": {"acRate": 61.27080389493999, "difficulty": "Easy", "likes": 3049, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "896", "paidOnly": false, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 445747, "totalSubmissionRaw": 727503}, "897": {"acRate": 78.35836580279049, "difficulty": "Easy", "likes": 4328, "dislikes": 672, "categoryTitle": "Algorithms", "frontendQuestionId": "897", "paidOnly": false, "title": "Increasing Order Search Tree", "titleSlug": "increasing-order-search-tree", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290801, "totalSubmissionRaw": 371117}, "898": {"acRate": 39.26111064437537, "difficulty": "Medium", "likes": 1469, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "898", "paidOnly": false, "title": "Bitwise ORs of Subarrays", "titleSlug": "bitwise-ors-of-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37386, "totalSubmissionRaw": 95224}, "899": {"acRate": 65.97516909107755, "difficulty": "Hard", "likes": 1753, "dislikes": 613, "categoryTitle": "Algorithms", "frontendQuestionId": "899", "paidOnly": false, "title": "Orderly Queue", "titleSlug": "orderly-queue", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71207, "totalSubmissionRaw": 107930}, "900": {"acRate": 59.60739452004735, "difficulty": "Medium", "likes": 746, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "900", "paidOnly": false, "title": "RLE Iterator", "titleSlug": "rle-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75032, "totalSubmissionRaw": 125877}, "901": {"acRate": 66.29989405789425, "difficulty": "Medium", "likes": 6362, "dislikes": 412, "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": 340442, "totalSubmissionRaw": 513488}, "902": {"acRate": 42.577621337750465, "difficulty": "Hard", "likes": 1394, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "902", "paidOnly": false, "title": "Numbers At Most N Given Digit Set", "titleSlug": "numbers-at-most-n-given-digit-set", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45240, "totalSubmissionRaw": 106253}, "903": {"acRate": 57.42036553524804, "difficulty": "Hard", "likes": 723, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "903", "paidOnly": false, "title": "Valid Permutations for DI Sequence", "titleSlug": "valid-permutations-for-di-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16494, "totalSubmissionRaw": 28725}, "904": {"acRate": 44.70560654251873, "difficulty": "Medium", "likes": 4680, "dislikes": 348, "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": 427150, "totalSubmissionRaw": 955468}, "905": {"acRate": 76.24508540317117, "difficulty": "Easy", "likes": 5373, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "905", "paidOnly": false, "title": "Sort Array By Parity", "titleSlug": "sort-array-by-parity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 820494, "totalSubmissionRaw": 1076127}, "906": {"acRate": 38.96089526760029, "difficulty": "Hard", "likes": 362, "dislikes": 420, "categoryTitle": "Algorithms", "frontendQuestionId": "906", "paidOnly": false, "title": "Super Palindromes", "titleSlug": "super-palindromes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24649, "totalSubmissionRaw": 63266}, "907": {"acRate": 37.259069246095365, "difficulty": "Medium", "likes": 8099, "dislikes": 627, "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": 271907, "totalSubmissionRaw": 729774}, "908": {"acRate": 70.40690505548706, "difficulty": "Easy", "likes": 713, "dislikes": 2039, "categoryTitle": "Algorithms", "frontendQuestionId": "908", "paidOnly": false, "title": "Smallest Range I", "titleSlug": "smallest-range-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93073, "totalSubmissionRaw": 132193}, "909": {"acRate": 43.836739941436335, "difficulty": "Medium", "likes": 2906, "dislikes": 1032, "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": 197762, "totalSubmissionRaw": 451133}, "910": {"acRate": 36.409060626249165, "difficulty": "Medium", "likes": 1652, "dislikes": 460, "categoryTitle": "Algorithms", "frontendQuestionId": "910", "paidOnly": false, "title": "Smallest Range II", "titleSlug": "smallest-range-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55743, "totalSubmissionRaw": 153102}, "911": {"acRate": 52.075594155372805, "difficulty": "Medium", "likes": 1013, "dislikes": 660, "categoryTitle": "Algorithms", "frontendQuestionId": "911", "paidOnly": false, "title": "Online Election", "titleSlug": "online-election", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60980, "totalSubmissionRaw": 117099}, "912": {"acRate": 58.04610298555416, "difficulty": "Medium", "likes": 6467, "dislikes": 796, "categoryTitle": "Algorithms", "frontendQuestionId": "912", "paidOnly": false, "title": "Sort an Array", "titleSlug": "sort-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Radix Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYx", "slug": "radix-sort"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 773260, "totalSubmissionRaw": 1332148}, "913": {"acRate": 33.83106230540025, "difficulty": "Hard", "likes": 914, "dislikes": 161, "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": 20210, "totalSubmissionRaw": 59737}, "914": {"acRate": 29.908809523809527, "difficulty": "Easy", "likes": 1818, "dislikes": 515, "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": 125617, "totalSubmissionRaw": 419998}, "915": {"acRate": 48.79619895099412, "difficulty": "Medium", "likes": 1660, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "915", "paidOnly": false, "title": "Partition Array into Disjoint Intervals", "titleSlug": "partition-array-into-disjoint-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84008, "totalSubmissionRaw": 172161}, "916": {"acRate": 51.925748427616405, "difficulty": "Medium", "likes": 2710, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "916", "paidOnly": false, "title": "Word Subsets", "titleSlug": "word-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115500, "totalSubmissionRaw": 222433}, "917": {"acRate": 65.18469826662285, "difficulty": "Easy", "likes": 2256, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "917", "paidOnly": false, "title": "Reverse Only Letters", "titleSlug": "reverse-only-letters", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 228077, "totalSubmissionRaw": 349894}, "918": {"acRate": 45.42183594226, "difficulty": "Medium", "likes": 6638, "dislikes": 303, "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": 275835, "totalSubmissionRaw": 607273}, "919": {"acRate": 65.85170014196942, "difficulty": "Medium", "likes": 1109, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "919", "paidOnly": false, "title": "Complete Binary Tree Inserter", "titleSlug": "complete-binary-tree-inserter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56589, "totalSubmissionRaw": 85934}, "920": {"acRate": 60.39155851948364, "difficulty": "Hard", "likes": 2355, "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": 70454, "totalSubmissionRaw": 116662}, "921": {"acRate": 74.93420253472081, "difficulty": "Medium", "likes": 4095, "dislikes": 206, "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": 370129, "totalSubmissionRaw": 493938}, "922": {"acRate": 70.81193244298424, "difficulty": "Easy", "likes": 2610, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "922", "paidOnly": false, "title": "Sort Array By Parity II", "titleSlug": "sort-array-by-parity-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 262087, "totalSubmissionRaw": 370117}, "923": {"acRate": 45.48676573677771, "difficulty": "Medium", "likes": 2616, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "923", "paidOnly": false, "title": "3Sum With Multiplicity", "titleSlug": "3sum-with-multiplicity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104469, "totalSubmissionRaw": 229668}, "924": {"acRate": 42.05496192774105, "difficulty": "Hard", "likes": 993, "dislikes": 594, "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": 53684, "totalSubmissionRaw": 127652}, "925": {"acRate": 32.29114562790175, "difficulty": "Easy", "likes": 2428, "dislikes": 379, "categoryTitle": "Algorithms", "frontendQuestionId": "925", "paidOnly": false, "title": "Long Pressed Name", "titleSlug": "long-pressed-name", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 146540, "totalSubmissionRaw": 453814}, "926": {"acRate": 61.490572693384514, "difficulty": "Medium", "likes": 4426, "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": 193493, "totalSubmissionRaw": 314671}, "927": {"acRate": 39.96893878571711, "difficulty": "Hard", "likes": 831, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "927", "paidOnly": false, "title": "Three Equal Parts", "titleSlug": "three-equal-parts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30368, "totalSubmissionRaw": 75979}, "928": {"acRate": 44.05385190725505, "difficulty": "Hard", "likes": 671, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "928", "paidOnly": false, "title": "Minimize Malware Spread II", "titleSlug": "minimize-malware-spread-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23560, "totalSubmissionRaw": 53480}, "929": {"acRate": 67.2496236366984, "difficulty": "Easy", "likes": 2690, "dislikes": 341, "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": 496737, "totalSubmissionRaw": 738647}, "930": {"acRate": 63.433336136775964, "difficulty": "Medium", "likes": 3928, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "930", "paidOnly": false, "title": "Binary Subarrays With Sum", "titleSlug": "binary-subarrays-with-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 263981, "totalSubmissionRaw": 416155}, "931": {"acRate": 63.172545051159915, "difficulty": "Medium", "likes": 6349, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "931", "paidOnly": false, "title": "Minimum Falling Path Sum", "titleSlug": "minimum-falling-path-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 460705, "totalSubmissionRaw": 729281}, "932": {"acRate": 65.93262359632493, "difficulty": "Medium", "likes": 1068, "dislikes": 1518, "categoryTitle": "Algorithms", "frontendQuestionId": "932", "paidOnly": false, "title": "Beautiful Array", "titleSlug": "beautiful-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45210, "totalSubmissionRaw": 68570}, "933": {"acRate": 75.89965004050212, "difficulty": "Easy", "likes": 554, "dislikes": 859, "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": 286707, "totalSubmissionRaw": 377747}, "934": {"acRate": 57.842806289504956, "difficulty": "Medium", "likes": 5385, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "934", "paidOnly": false, "title": "Shortest Bridge", "titleSlug": "shortest-bridge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210752, "totalSubmissionRaw": 364353}, "935": {"acRate": 60.402973927213466, "difficulty": "Medium", "likes": 3034, "dislikes": 444, "categoryTitle": "Algorithms", "frontendQuestionId": "935", "paidOnly": false, "title": "Knight Dialer", "titleSlug": "knight-dialer", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 177923, "totalSubmissionRaw": 294560}, "936": {"acRate": 62.52704824133396, "difficulty": "Hard", "likes": 1545, "dislikes": 219, "categoryTitle": "Algorithms", "frontendQuestionId": "936", "paidOnly": false, "title": "Stamping The Sequence", "titleSlug": "stamping-the-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58948, "totalSubmissionRaw": 94276}, "937": {"acRate": 56.48240007704314, "difficulty": "Medium", "likes": 2100, "dislikes": 4385, "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": 369495, "totalSubmissionRaw": 654178}, "938": {"acRate": 86.97405318394644, "difficulty": "Easy", "likes": 6952, "dislikes": 377, "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": 1089266, "totalSubmissionRaw": 1252402}, "939": {"acRate": 54.09754272171635, "difficulty": "Medium", "likes": 1974, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "939", "paidOnly": false, "title": "Minimum Area Rectangle", "titleSlug": "minimum-area-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 147457, "totalSubmissionRaw": 272577}, "940": {"acRate": 43.15320180872806, "difficulty": "Hard", "likes": 1719, "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": 40750, "totalSubmissionRaw": 94431}, "941": {"acRate": 33.52505164554587, "difficulty": "Easy", "likes": 2937, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "941", "paidOnly": false, "title": "Valid Mountain Array", "titleSlug": "valid-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 436057, "totalSubmissionRaw": 1300687}, "942": {"acRate": 79.02959680775538, "difficulty": "Easy", "likes": 2465, "dislikes": 1020, "categoryTitle": "Algorithms", "frontendQuestionId": "942", "paidOnly": false, "title": "DI String Match", "titleSlug": "di-string-match", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161414, "totalSubmissionRaw": 204245}, "943": {"acRate": 44.1061531374909, "difficulty": "Hard", "likes": 1445, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "943", "paidOnly": false, "title": "Find the Shortest Superstring", "titleSlug": "find-the-shortest-superstring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29683, "totalSubmissionRaw": 67299}, "944": {"acRate": 74.60839198742518, "difficulty": "Easy", "likes": 1707, "dislikes": 2879, "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": 192709, "totalSubmissionRaw": 258294}, "945": {"acRate": 60.019912355465706, "difficulty": "Medium", "likes": 2647, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "945", "paidOnly": false, "title": "Minimum Increment to Make Array Unique", "titleSlug": "minimum-increment-to-make-array-unique", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 238725, "totalSubmissionRaw": 397743}, "946": {"acRate": 69.52866853471934, "difficulty": "Medium", "likes": 5904, "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": 312895, "totalSubmissionRaw": 450023}, "947": {"acRate": 58.95788093196684, "difficulty": "Medium", "likes": 5390, "dislikes": 649, "categoryTitle": "Algorithms", "frontendQuestionId": "947", "paidOnly": false, "title": "Most Stones Removed with Same Row or Column", "titleSlug": "most-stones-removed-with-same-row-or-column", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220733, "totalSubmissionRaw": 374391}, "948": {"acRate": 58.976475652680364, "difficulty": "Medium", "likes": 3257, "dislikes": 534, "categoryTitle": "Algorithms", "frontendQuestionId": "948", "paidOnly": false, "title": "Bag of Tokens", "titleSlug": "bag-of-tokens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232903, "totalSubmissionRaw": 394909}, "949": {"acRate": 35.33287457782629, "difficulty": "Medium", "likes": 713, "dislikes": 1058, "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": 89342, "totalSubmissionRaw": 252858}, "950": {"acRate": 83.02659676119416, "difficulty": "Medium", "likes": 3469, "dislikes": 657, "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": 199850, "totalSubmissionRaw": 240706}, "951": {"acRate": 67.06410805409841, "difficulty": "Medium", "likes": 2305, "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": 150347, "totalSubmissionRaw": 224184}, "952": {"acRate": 40.84100005974072, "difficulty": "Hard", "likes": 1628, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "952", "paidOnly": false, "title": "Largest Component Size by Common Factor", "titleSlug": "largest-component-size-by-common-factor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54691, "totalSubmissionRaw": 133912}, "953": {"acRate": 55.144818377897224, "difficulty": "Easy", "likes": 4886, "dislikes": 1632, "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": 515430, "totalSubmissionRaw": 934684}, "954": {"acRate": 39.18750493711216, "difficulty": "Medium", "likes": 1526, "dislikes": 159, "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": 89295, "totalSubmissionRaw": 227866}, "955": {"acRate": 35.31227615376744, "difficulty": "Medium", "likes": 663, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "955", "paidOnly": false, "title": "Delete Columns to Make Sorted II", "titleSlug": "delete-columns-to-make-sorted-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20704, "totalSubmissionRaw": 58633}, "956": {"acRate": 52.135220481414144, "difficulty": "Hard", "likes": 2365, "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": 59931, "totalSubmissionRaw": 114953}, "957": {"acRate": 38.98901744967736, "difficulty": "Medium", "likes": 1490, "dislikes": 1750, "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": 161813, "totalSubmissionRaw": 415022}, "958": {"acRate": 57.14541864157656, "difficulty": "Medium", "likes": 4284, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "958", "paidOnly": false, "title": "Check Completeness of a Binary Tree", "titleSlug": "check-completeness-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242216, "totalSubmissionRaw": 423859}, "959": {"acRate": 69.54018403276422, "difficulty": "Medium", "likes": 3079, "dislikes": 584, "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": 52297, "totalSubmissionRaw": 75204}, "960": {"acRate": 58.243762368553796, "difficulty": "Hard", "likes": 601, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "960", "paidOnly": false, "title": "Delete Columns to Make Sorted III", "titleSlug": "delete-columns-to-make-sorted-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 15010, "totalSubmissionRaw": 25771}, "961": {"acRate": 76.8974012556624, "difficulty": "Easy", "likes": 1348, "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": 241898, "totalSubmissionRaw": 314573}, "962": {"acRate": 50.42223497581373, "difficulty": "Medium", "likes": 1687, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "962", "paidOnly": false, "title": "Maximum Width Ramp", "titleSlug": "maximum-width-ramp", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49200, "totalSubmissionRaw": 97576}, "963": {"acRate": 55.16641735228123, "difficulty": "Medium", "likes": 382, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "963", "paidOnly": false, "title": "Minimum Area Rectangle II", "titleSlug": "minimum-area-rectangle-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29503, "totalSubmissionRaw": 53480}, "964": {"acRate": 48.59933917540583, "difficulty": "Hard", "likes": 317, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "964", "paidOnly": false, "title": "Least Operators to Express Number", "titleSlug": "least-operators-to-express-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10149, "totalSubmissionRaw": 20883}, "965": {"acRate": 71.20042219276367, "difficulty": "Easy", "likes": 1896, "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": 226658, "totalSubmissionRaw": 318338}, "966": {"acRate": 51.32408421565048, "difficulty": "Medium", "likes": 423, "dislikes": 811, "categoryTitle": "Algorithms", "frontendQuestionId": "966", "paidOnly": false, "title": "Vowel Spellchecker", "titleSlug": "vowel-spellchecker", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42173, "totalSubmissionRaw": 82170}, "967": {"acRate": 58.165418725589625, "difficulty": "Medium", "likes": 2809, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "967", "paidOnly": false, "title": "Numbers With Same Consecutive Differences", "titleSlug": "numbers-with-same-consecutive-differences", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134776, "totalSubmissionRaw": 231712}, "968": {"acRate": 46.7428267627961, "difficulty": "Hard", "likes": 5345, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "968", "paidOnly": false, "title": "Binary Tree Cameras", "titleSlug": "binary-tree-cameras", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144189, "totalSubmissionRaw": 308473}, "969": {"acRate": 70.89865426028415, "difficulty": "Medium", "likes": 1498, "dislikes": 1533, "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": 96464, "totalSubmissionRaw": 136059}, "970": {"acRate": 43.86305112423062, "difficulty": "Medium", "likes": 391, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "970", "paidOnly": false, "title": "Powerful Integers", "titleSlug": "powerful-integers", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55871, "totalSubmissionRaw": 127376}, "971": {"acRate": 50.672360101915636, "difficulty": "Medium", "likes": 953, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "971", "paidOnly": false, "title": "Flip Binary Tree To Match Preorder Traversal", "titleSlug": "flip-binary-tree-to-match-preorder-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42958, "totalSubmissionRaw": 84776}, "972": {"acRate": 44.14044423877834, "difficulty": "Hard", "likes": 95, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "972", "paidOnly": false, "title": "Equal Rational Numbers", "titleSlug": "equal-rational-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7631, "totalSubmissionRaw": 17288}, "973": {"acRate": 66.69911200823367, "difficulty": "Medium", "likes": 8409, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "973", "paidOnly": false, "title": "K Closest Points to Origin", "titleSlug": "k-closest-points-to-origin", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1253997, "totalSubmissionRaw": 1880081}, "974": {"acRate": 55.461383950053865, "difficulty": "Medium", "likes": 7216, "dislikes": 319, "categoryTitle": "Algorithms", "frontendQuestionId": "974", "paidOnly": false, "title": "Subarray Sums Divisible by K", "titleSlug": "subarray-sums-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 357289, "totalSubmissionRaw": 644212}, "975": {"acRate": 40.183932646444134, "difficulty": "Hard", "likes": 2000, "dislikes": 506, "categoryTitle": "Algorithms", "frontendQuestionId": "975", "paidOnly": false, "title": "Odd Even Jump", "titleSlug": "odd-even-jump", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87869, "totalSubmissionRaw": 218667}, "976": {"acRate": 56.24417488956621, "difficulty": "Easy", "likes": 2975, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "976", "paidOnly": false, "title": "Largest Perimeter Triangle", "titleSlug": "largest-perimeter-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 245611, "totalSubmissionRaw": 436687}, "977": {"acRate": 72.92230902530096, "difficulty": "Easy", "likes": 9337, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "977", "paidOnly": false, "title": "Squares of a Sorted Array", "titleSlug": "squares-of-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1916794, "totalSubmissionRaw": 2628545}, "978": {"acRate": 47.561404389974385, "difficulty": "Medium", "likes": 1976, "dislikes": 233, "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": 104159, "totalSubmissionRaw": 218999}, "979": {"acRate": 77.12265977050653, "difficulty": "Medium", "likes": 5813, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "979", "paidOnly": false, "title": "Distribute Coins in Binary Tree", "titleSlug": "distribute-coins-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199214, "totalSubmissionRaw": 258308}, "980": {"acRate": 81.89858420474944, "difficulty": "Hard", "likes": 5150, "dislikes": 189, "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": 206679, "totalSubmissionRaw": 252361}, "981": {"acRate": 49.29069768665283, "difficulty": "Medium", "likes": 4793, "dislikes": 589, "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": 468478, "totalSubmissionRaw": 950438}, "982": {"acRate": 58.316626989099106, "difficulty": "Hard", "likes": 440, "dislikes": 219, "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": 18617, "totalSubmissionRaw": 31924}, "983": {"acRate": 65.23260694108151, "difficulty": "Medium", "likes": 7883, "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": 303087, "totalSubmissionRaw": 464625}, "984": {"acRate": 44.015635273031855, "difficulty": "Medium", "likes": 814, "dislikes": 368, "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": 48871, "totalSubmissionRaw": 111031}, "985": {"acRate": 68.1960936364077, "difficulty": "Medium", "likes": 2081, "dislikes": 318, "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": 140709, "totalSubmissionRaw": 206330}, "986": {"acRate": 71.8226254041695, "difficulty": "Medium", "likes": 5557, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "986", "paidOnly": false, "title": "Interval List Intersections", "titleSlug": "interval-list-intersections", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 426267, "totalSubmissionRaw": 593500}, "987": {"acRate": 48.43661417655969, "difficulty": "Hard", "likes": 7629, "dislikes": 4332, "categoryTitle": "Algorithms", "frontendQuestionId": "987", "paidOnly": false, "title": "Vertical Order Traversal of a Binary Tree", "titleSlug": "vertical-order-traversal-of-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 457943, "totalSubmissionRaw": 945448}, "988": {"acRate": 60.54045706253329, "difficulty": "Medium", "likes": 2279, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "988", "paidOnly": false, "title": "Smallest String Starting From Leaf", "titleSlug": "smallest-string-starting-from-leaf", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192086, "totalSubmissionRaw": 317285}, "989": {"acRate": 45.143664275359626, "difficulty": "Easy", "likes": 3447, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "989", "paidOnly": false, "title": "Add to Array-Form of Integer", "titleSlug": "add-to-array-form-of-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267190, "totalSubmissionRaw": 591866}, "990": {"acRate": 50.576652710615356, "difficulty": "Medium", "likes": 3738, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "990", "paidOnly": false, "title": "Satisfiability of Equality Equations", "titleSlug": "satisfiability-of-equality-equations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130947, "totalSubmissionRaw": 258908}, "991": {"acRate": 54.54656719277147, "difficulty": "Medium", "likes": 2700, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "991", "paidOnly": false, "title": "Broken Calculator", "titleSlug": "broken-calculator", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102505, "totalSubmissionRaw": 187922}, "992": {"acRate": 63.854894135905106, "difficulty": "Hard", "likes": 6050, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "992", "paidOnly": false, "title": "Subarrays with K Different Integers", "titleSlug": "subarrays-with-k-different-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230400, "totalSubmissionRaw": 360825}, "993": {"acRate": 56.51038195487526, "difficulty": "Easy", "likes": 4028, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "993", "paidOnly": false, "title": "Cousins in Binary Tree", "titleSlug": "cousins-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 284049, "totalSubmissionRaw": 502648}, "994": {"acRate": 54.6993480164128, "difficulty": "Medium", "likes": 12931, "dislikes": 403, "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": 925296, "totalSubmissionRaw": 1691605}, "995": {"acRate": 62.72509558853759, "difficulty": "Hard", "likes": 1871, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "995", "paidOnly": false, "title": "Minimum Number of K Consecutive Bit Flips", "titleSlug": "minimum-number-of-k-consecutive-bit-flips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122053, "totalSubmissionRaw": 194584}, "996": {"acRate": 50.13472403302912, "difficulty": "Hard", "likes": 988, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "996", "paidOnly": false, "title": "Number of Squareful Arrays", "titleSlug": "number-of-squareful-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40376, "totalSubmissionRaw": 80535}, "997": {"acRate": 49.75675593678688, "difficulty": "Easy", "likes": 6631, "dislikes": 598, "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": 606812, "totalSubmissionRaw": 1219557}, "998": {"acRate": 69.54289904668785, "difficulty": "Medium", "likes": 533, "dislikes": 787, "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": 36985, "totalSubmissionRaw": 53183}, "999": {"acRate": 69.29591194329929, "difficulty": "Easy", "likes": 709, "dislikes": 636, "categoryTitle": "Algorithms", "frontendQuestionId": "999", "paidOnly": false, "title": "Available Captures for Rook", "titleSlug": "available-captures-for-rook", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68243, "totalSubmissionRaw": 98480}, "1000": {"acRate": 43.28712109884007, "difficulty": "Hard", "likes": 2468, "dislikes": 110, "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": 40528, "totalSubmissionRaw": 93626}, "1001": {"acRate": 37.240453152439656, "difficulty": "Hard", "likes": 611, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1001", "paidOnly": false, "title": "Grid Illumination", "titleSlug": "grid-illumination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21630, "totalSubmissionRaw": 58082}, "1002": {"acRate": 74.59423438367159, "difficulty": "Easy", "likes": 4253, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "1002", "paidOnly": false, "title": "Find Common Characters", "titleSlug": "find-common-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 361558, "totalSubmissionRaw": 484700}, "1003": {"acRate": 59.91421579859043, "difficulty": "Medium", "likes": 994, "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": 65373, "totalSubmissionRaw": 109111}, "1004": {"acRate": 63.73978788539212, "difficulty": "Medium", "likes": 8639, "dislikes": 135, "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": 625871, "totalSubmissionRaw": 981910}, "1005": {"acRate": 51.339353550263745, "difficulty": "Easy", "likes": 1551, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "1005", "paidOnly": false, "title": "Maximize Sum Of Array After K Negations", "titleSlug": "maximize-sum-of-array-after-k-negations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 94602, "totalSubmissionRaw": 184268}, "1006": {"acRate": 57.58069948416146, "difficulty": "Medium", "likes": 374, "dislikes": 354, "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": 32483, "totalSubmissionRaw": 56413}, "1007": {"acRate": 52.26099472578668, "difficulty": "Medium", "likes": 2839, "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": 205508, "totalSubmissionRaw": 393234}, "1008": {"acRate": 82.37104130532536, "difficulty": "Medium", "likes": 6163, "dislikes": 82, "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": 384681, "totalSubmissionRaw": 467010}, "1009": {"acRate": 60.79937383103522, "difficulty": "Easy", "likes": 2422, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1009", "paidOnly": false, "title": "Complement of Base 10 Integer", "titleSlug": "complement-of-base-10-integer", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 253230, "totalSubmissionRaw": 416501}, "1010": {"acRate": 52.98230712644375, "difficulty": "Medium", "likes": 4204, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "1010", "paidOnly": false, "title": "Pairs of Songs With Total Durations Divisible by 60", "titleSlug": "pairs-of-songs-with-total-durations-divisible-by-60", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 279451, "totalSubmissionRaw": 527441}, "1011": {"acRate": 70.11718421910224, "difficulty": "Medium", "likes": 9526, "dislikes": 229, "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": 417406, "totalSubmissionRaw": 595299}, "1012": {"acRate": 42.44286954006364, "difficulty": "Hard", "likes": 774, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1012", "paidOnly": false, "title": "Numbers With Repeated Digits", "titleSlug": "numbers-with-repeated-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17607, "totalSubmissionRaw": 41484}, "1013": {"acRate": 41.97979640052811, "difficulty": "Easy", "likes": 1705, "dislikes": 157, "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": 96661, "totalSubmissionRaw": 230256}, "1014": {"acRate": 59.1282203587971, "difficulty": "Medium", "likes": 2496, "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": 93571, "totalSubmissionRaw": 158251}, "1015": {"acRate": 46.5910759921276, "difficulty": "Medium", "likes": 1142, "dislikes": 853, "categoryTitle": "Algorithms", "frontendQuestionId": "1015", "paidOnly": false, "title": "Smallest Integer Divisible by K", "titleSlug": "smallest-integer-divisible-by-k", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63444, "totalSubmissionRaw": 136172}, "1016": {"acRate": 57.4053989808198, "difficulty": "Medium", "likes": 356, "dislikes": 532, "categoryTitle": "Algorithms", "frontendQuestionId": "1016", "paidOnly": false, "title": "Binary String With Substrings Representing 1 To N", "titleSlug": "binary-string-with-substrings-representing-1-to-n", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38639, "totalSubmissionRaw": 67309}, "1017": {"acRate": 60.88262375586443, "difficulty": "Medium", "likes": 515, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "1017", "paidOnly": false, "title": "Convert to Base -2", "titleSlug": "convert-to-base-2", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27771, "totalSubmissionRaw": 45614}, "1018": {"acRate": 46.782607266961854, "difficulty": "Easy", "likes": 728, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "1018", "paidOnly": false, "title": "Binary Prefix Divisible By 5", "titleSlug": "binary-prefix-divisible-by-5", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56948, "totalSubmissionRaw": 121729}, "1019": {"acRate": 61.122463901251976, "difficulty": "Medium", "likes": 3299, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1019", "paidOnly": false, "title": "Next Greater Node In Linked List", "titleSlug": "next-greater-node-in-linked-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163013, "totalSubmissionRaw": 266698}, "1020": {"acRate": 69.21450306875032, "difficulty": "Medium", "likes": 4065, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "1020", "paidOnly": false, "title": "Number of Enclaves", "titleSlug": "number-of-enclaves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241559, "totalSubmissionRaw": 349001}, "1021": {"acRate": 83.45385175282941, "difficulty": "Easy", "likes": 2965, "dislikes": 1605, "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": 350845, "totalSubmissionRaw": 420406}, "1022": {"acRate": 73.13683112237294, "difficulty": "Easy", "likes": 3347, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1022", "paidOnly": false, "title": "Sum of Root To Leaf Binary Numbers", "titleSlug": "sum-of-root-to-leaf-binary-numbers", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 215897, "totalSubmissionRaw": 295196}, "1023": {"acRate": 62.56303989614022, "difficulty": "Medium", "likes": 901, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "1023", "paidOnly": false, "title": "Camelcase Matching", "titleSlug": "camelcase-matching", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50118, "totalSubmissionRaw": 80108}, "1024": {"acRate": 51.43820323103192, "difficulty": "Medium", "likes": 1760, "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": 70494, "totalSubmissionRaw": 137046}, "1025": {"acRate": 69.10212329980665, "difficulty": "Easy", "likes": 2186, "dislikes": 4135, "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": 269112, "totalSubmissionRaw": 389441}, "1026": {"acRate": 78.10271948880585, "difficulty": "Medium", "likes": 4930, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1026", "paidOnly": false, "title": "Maximum Difference Between Node and Ancestor", "titleSlug": "maximum-difference-between-node-and-ancestor", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 331479, "totalSubmissionRaw": 424414}, "1027": {"acRate": 49.169427937672864, "difficulty": "Medium", "likes": 4681, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "1027", "paidOnly": false, "title": "Longest Arithmetic Subsequence", "titleSlug": "longest-arithmetic-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 179551, "totalSubmissionRaw": 365168}, "1028": {"acRate": 75.04059577803909, "difficulty": "Hard", "likes": 1635, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1028", "paidOnly": false, "title": "Recover a Tree From Preorder Traversal", "titleSlug": "recover-a-tree-from-preorder-traversal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53606, "totalSubmissionRaw": 71436}, "1029": {"acRate": 66.8774374313733, "difficulty": "Medium", "likes": 4724, "dislikes": 352, "categoryTitle": "Algorithms", "frontendQuestionId": "1029", "paidOnly": false, "title": "Two City Scheduling", "titleSlug": "two-city-scheduling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 247281, "totalSubmissionRaw": 369753}, "1030": {"acRate": 71.45959071222609, "difficulty": "Easy", "likes": 756, "dislikes": 326, "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": 61213, "totalSubmissionRaw": 85661}, "1031": {"acRate": 59.82384992411613, "difficulty": "Medium", "likes": 2553, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1031", "paidOnly": false, "title": "Maximum Sum of Two Non-Overlapping Subarrays", "titleSlug": "maximum-sum-of-two-non-overlapping-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72135, "totalSubmissionRaw": 120579}, "1032": {"acRate": 52.10453097874199, "difficulty": "Hard", "likes": 1813, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "1032", "paidOnly": false, "title": "Stream of Characters", "titleSlug": "stream-of-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90640, "totalSubmissionRaw": 173958}, "1033": {"acRate": 48.45283161007213, "difficulty": "Medium", "likes": 219, "dislikes": 648, "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": 25727, "totalSubmissionRaw": 53097}, "1034": {"acRate": 49.138209630507376, "difficulty": "Medium", "likes": 736, "dislikes": 883, "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": 36492, "totalSubmissionRaw": 74264}, "1035": {"acRate": 63.33789811409344, "difficulty": "Medium", "likes": 3820, "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": 161879, "totalSubmissionRaw": 255580}, "1036": {"acRate": 34.803592346739556, "difficulty": "Hard", "likes": 670, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "1036", "paidOnly": false, "title": "Escape a Large Maze", "titleSlug": "escape-a-large-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22283, "totalSubmissionRaw": 64025}, "1037": {"acRate": 37.160269126158, "difficulty": "Easy", "likes": 419, "dislikes": 528, "categoryTitle": "Algorithms", "frontendQuestionId": "1037", "paidOnly": false, "title": "Valid Boomerang", "titleSlug": "valid-boomerang", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54513, "totalSubmissionRaw": 146697}, "1038": {"acRate": 88.24959184047842, "difficulty": "Medium", "likes": 4311, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1038", "paidOnly": false, "title": "Binary Search Tree to Greater Sum Tree", "titleSlug": "binary-search-tree-to-greater-sum-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288645, "totalSubmissionRaw": 327078}, "1039": {"acRate": 59.46917365861329, "difficulty": "Medium", "likes": 1834, "dislikes": 176, "categoryTitle": "Algorithms", "frontendQuestionId": "1039", "paidOnly": false, "title": "Minimum Score Triangulation of Polygon", "titleSlug": "minimum-score-triangulation-of-polygon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52946, "totalSubmissionRaw": 89031}, "1040": {"acRate": 56.775401069518715, "difficulty": "Medium", "likes": 373, "dislikes": 646, "categoryTitle": "Algorithms", "frontendQuestionId": "1040", "paidOnly": false, "title": "Moving Stones Until Consecutive II", "titleSlug": "moving-stones-until-consecutive-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10617, "totalSubmissionRaw": 18700}, "1041": {"acRate": 55.84512355280683, "difficulty": "Medium", "likes": 3734, "dislikes": 702, "categoryTitle": "Algorithms", "frontendQuestionId": "1041", "paidOnly": false, "title": "Robot Bounded In Circle", "titleSlug": "robot-bounded-in-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239828, "totalSubmissionRaw": 429452}, "1042": {"acRate": 51.50961295218821, "difficulty": "Medium", "likes": 1451, "dislikes": 716, "categoryTitle": "Algorithms", "frontendQuestionId": "1042", "paidOnly": false, "title": "Flower Planting With No Adjacent", "titleSlug": "flower-planting-with-no-adjacent", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81446, "totalSubmissionRaw": 158119}, "1043": {"acRate": 76.64157328923683, "difficulty": "Medium", "likes": 4711, "dislikes": 421, "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": 198832, "totalSubmissionRaw": 259431}, "1044": {"acRate": 30.55717344941296, "difficulty": "Hard", "likes": 2226, "dislikes": 385, "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": 69777, "totalSubmissionRaw": 228349}, "1045": {"acRate": 62.05147402901263, "difficulty": "Medium", "likes": 744, "dislikes": 66, "categoryTitle": "Database", "frontendQuestionId": "1045", "paidOnly": false, "title": "Customers Who Bought All Products", "titleSlug": "customers-who-bought-all-products", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 198906, "totalSubmissionRaw": 320550}, "1046": {"acRate": 65.52766607134902, "difficulty": "Easy", "likes": 6027, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1046", "paidOnly": false, "title": "Last Stone Weight", "titleSlug": "last-stone-weight", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 647218, "totalSubmissionRaw": 987704}, "1047": {"acRate": 69.91939867554315, "difficulty": "Easy", "likes": 6609, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "1047", "paidOnly": false, "title": "Remove All Adjacent Duplicates In String", "titleSlug": "remove-all-adjacent-duplicates-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 598122, "totalSubmissionRaw": 855445}, "1048": {"acRate": 61.27902209421594, "difficulty": "Medium", "likes": 7300, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1048", "paidOnly": false, "title": "Longest String Chain", "titleSlug": "longest-string-chain", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 419996, "totalSubmissionRaw": 685383}, "1049": {"acRate": 55.864451390031256, "difficulty": "Medium", "likes": 3115, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1049", "paidOnly": false, "title": "Last Stone Weight II", "titleSlug": "last-stone-weight-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91692, "totalSubmissionRaw": 164133}, "1050": {"acRate": 70.14051783839331, "difficulty": "Easy", "likes": 653, "dislikes": 51, "categoryTitle": "Database", "frontendQuestionId": "1050", "paidOnly": false, "title": "Actors and Directors Who Cooperated At Least Three Times", "titleSlug": "actors-and-directors-who-cooperated-at-least-three-times", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188381, "totalSubmissionRaw": 268577}, "1051": {"acRate": 80.77712637971203, "difficulty": "Easy", "likes": 1600, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1051", "paidOnly": false, "title": "Height Checker", "titleSlug": "height-checker", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 507597, "totalSubmissionRaw": 628392}, "1052": {"acRate": 64.31910140291312, "difficulty": "Medium", "likes": 2438, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1052", "paidOnly": false, "title": "Grumpy Bookstore Owner", "titleSlug": "grumpy-bookstore-owner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 196635, "totalSubmissionRaw": 305717}, "1053": {"acRate": 49.682938861949054, "difficulty": "Medium", "likes": 448, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1053", "paidOnly": false, "title": "Previous Permutation With One Swap", "titleSlug": "previous-permutation-with-one-swap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41290, "totalSubmissionRaw": 83107}, "1054": {"acRate": 46.637817299065915, "difficulty": "Medium", "likes": 1267, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1054", "paidOnly": false, "title": "Distant Barcodes", "titleSlug": "distant-barcodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44187, "totalSubmissionRaw": 94745}, "1055": {"acRate": 60.355880768776025, "difficulty": "Medium", "likes": 1271, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1055", "paidOnly": true, "title": "Shortest Way to Form String", "titleSlug": "shortest-way-to-form-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91887, "totalSubmissionRaw": 152242}, "1056": {"acRate": 48.823467893746084, "difficulty": "Easy", "likes": 314, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "1056", "paidOnly": true, "title": "Confusing Number", "titleSlug": "confusing-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 46685, "totalSubmissionRaw": 95620}, "1057": {"acRate": 58.632439800090864, "difficulty": "Medium", "likes": 982, "dislikes": 195, "categoryTitle": "Algorithms", "frontendQuestionId": "1057", "paidOnly": true, "title": "Campus Bikes", "titleSlug": "campus-bikes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72268, "totalSubmissionRaw": 123256}, "1058": {"acRate": 45.05812551251749, "difficulty": "Medium", "likes": 150, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1058", "paidOnly": true, "title": "Minimize Rounding Error to Meet Target", "titleSlug": "minimize-rounding-error-to-meet-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9341, "totalSubmissionRaw": 20731}, "1059": {"acRate": 37.525434576533165, "difficulty": "Medium", "likes": 709, "dislikes": 390, "categoryTitle": "Algorithms", "frontendQuestionId": "1059", "paidOnly": true, "title": "All Paths from Source Lead to Destination", "titleSlug": "all-paths-from-source-lead-to-destination", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 62150, "totalSubmissionRaw": 165621}, "1060": {"acRate": 57.28348878989984, "difficulty": "Medium", "likes": 1657, "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": 139656, "totalSubmissionRaw": 243798}, "1061": {"acRate": 76.62052254925901, "difficulty": "Medium", "likes": 2349, "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": 81584, "totalSubmissionRaw": 106478}, "1062": {"acRate": 62.323258528992085, "difficulty": "Medium", "likes": 704, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1062", "paidOnly": true, "title": "Longest Repeating Substring", "titleSlug": "longest-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 48039, "totalSubmissionRaw": 77084}, "1063": {"acRate": 79.14150129421915, "difficulty": "Hard", "likes": 310, "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": 14676, "totalSubmissionRaw": 18544}, "1064": {"acRate": 64.13609934678057, "difficulty": "Easy", "likes": 437, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1064", "paidOnly": true, "title": "Fixed Point", "titleSlug": "fixed-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44674, "totalSubmissionRaw": 69655}, "1065": {"acRate": 67.53577259195237, "difficulty": "Easy", "likes": 377, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1065", "paidOnly": true, "title": "Index Pairs of a String", "titleSlug": "index-pairs-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28130, "totalSubmissionRaw": 41652}, "1066": {"acRate": 55.18469260800549, "difficulty": "Medium", "likes": 935, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1066", "paidOnly": true, "title": "Campus Bikes II", "titleSlug": "campus-bikes-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51452, "totalSubmissionRaw": 93236}, "1067": {"acRate": 46.38278898673504, "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": 4161, "totalSubmissionRaw": 8971}, "1068": {"acRate": 83.69891877243677, "difficulty": "Easy", "likes": 888, "dislikes": 216, "categoryTitle": "Database", "frontendQuestionId": "1068", "paidOnly": false, "title": "Product Sales Analysis I", "titleSlug": "product-sales-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 549753, "totalSubmissionRaw": 656826}, "1069": {"acRate": 81.88318001645352, "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": 54743, "totalSubmissionRaw": 66855}, "1070": {"acRate": 43.19067676928934, "difficulty": "Medium", "likes": 429, "dislikes": 896, "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": 175850, "totalSubmissionRaw": 407144}, "1071": {"acRate": 51.5946132520572, "difficulty": "Easy", "likes": 5183, "dislikes": 1351, "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": 514954, "totalSubmissionRaw": 998069}, "1072": {"acRate": 64.07211961301671, "difficulty": "Medium", "likes": 743, "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": 23312, "totalSubmissionRaw": 36384}, "1073": {"acRate": 36.93717436697955, "difficulty": "Medium", "likes": 320, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1073", "paidOnly": false, "title": "Adding Two Negabinary Numbers", "titleSlug": "adding-two-negabinary-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18220, "totalSubmissionRaw": 49327}, "1074": {"acRate": 74.44183454287122, "difficulty": "Hard", "likes": 3722, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1074", "paidOnly": false, "title": "Number of Submatrices That Sum to Target", "titleSlug": "number-of-submatrices-that-sum-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155608, "totalSubmissionRaw": 209033}, "1075": {"acRate": 62.61665886289146, "difficulty": "Easy", "likes": 606, "dislikes": 168, "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": 275481, "totalSubmissionRaw": 439952}, "1076": {"acRate": 49.9597898807385, "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": 58395, "totalSubmissionRaw": 116883}, "1077": {"acRate": 76.59543973941368, "difficulty": "Medium", "likes": 269, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1077", "paidOnly": true, "title": "Project Employees III", "titleSlug": "project-employees-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58787, "totalSubmissionRaw": 76750}, "1078": {"acRate": 63.48538923881621, "difficulty": "Easy", "likes": 493, "dislikes": 360, "categoryTitle": "Algorithms", "frontendQuestionId": "1078", "paidOnly": false, "title": "Occurrences After Bigram", "titleSlug": "occurrences-after-bigram", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74888, "totalSubmissionRaw": 117961}, "1079": {"acRate": 76.42925158518672, "difficulty": "Medium", "likes": 2488, "dislikes": 69, "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": 103541, "totalSubmissionRaw": 135473}, "1080": {"acRate": 55.8784504889094, "difficulty": "Medium", "likes": 700, "dislikes": 714, "categoryTitle": "Algorithms", "frontendQuestionId": "1080", "paidOnly": false, "title": "Insufficient Nodes in Root to Leaf Paths", "titleSlug": "insufficient-nodes-in-root-to-leaf-paths", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38745, "totalSubmissionRaw": 69338}, "1081": {"acRate": 61.10992456408635, "difficulty": "Medium", "likes": 2607, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1081", "paidOnly": false, "title": "Smallest Subsequence of Distinct Characters", "titleSlug": "smallest-subsequence-of-distinct-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71531, "totalSubmissionRaw": 117053}, "1082": {"acRate": 74.39544985002925, "difficulty": "Easy", "likes": 195, "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": 59776, "totalSubmissionRaw": 80349}, "1083": {"acRate": 49.73290687743859, "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": 59397, "totalSubmissionRaw": 119433}, "1084": {"acRate": 46.54451849361573, "difficulty": "Easy", "likes": 729, "dislikes": 154, "categoryTitle": "Database", "frontendQuestionId": "1084", "paidOnly": false, "title": "Sales Analysis III", "titleSlug": "sales-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141216, "totalSubmissionRaw": 303401}, "1085": {"acRate": 76.44483638310604, "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": 24272, "totalSubmissionRaw": 31751}, "1086": {"acRate": 74.51400982599216, "difficulty": "Easy", "likes": 798, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1086", "paidOnly": true, "title": "High Five", "titleSlug": "high-five", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105257, "totalSubmissionRaw": 141258}, "1087": {"acRate": 66.415892647022, "difficulty": "Medium", "likes": 644, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1087", "paidOnly": true, "title": "Brace Expansion", "titleSlug": "brace-expansion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53056, "totalSubmissionRaw": 79885}, "1088": {"acRate": 47.16087334484019, "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": 37433, "totalSubmissionRaw": 79373}, "1089": {"acRate": 52.05573392350612, "difficulty": "Easy", "likes": 2609, "dislikes": 752, "categoryTitle": "Algorithms", "frontendQuestionId": "1089", "paidOnly": false, "title": "Duplicate Zeros", "titleSlug": "duplicate-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 434196, "totalSubmissionRaw": 834098}, "1090": {"acRate": 62.31038506417737, "difficulty": "Medium", "likes": 451, "dislikes": 628, "categoryTitle": "Algorithms", "frontendQuestionId": "1090", "paidOnly": false, "title": "Largest Values From Labels", "titleSlug": "largest-values-from-labels", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39516, "totalSubmissionRaw": 63418}, "1091": {"acRate": 47.879256451972466, "difficulty": "Medium", "likes": 6541, "dislikes": 241, "categoryTitle": "Algorithms", "frontendQuestionId": "1091", "paidOnly": false, "title": "Shortest Path in Binary Matrix", "titleSlug": "shortest-path-in-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 504706, "totalSubmissionRaw": 1054128}, "1092": {"acRate": 59.41519009554419, "difficulty": "Hard", "likes": 4894, "dislikes": 68, "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": 128663, "totalSubmissionRaw": 216549}, "1093": {"acRate": 41.99500010330365, "difficulty": "Medium", "likes": 156, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1093", "paidOnly": false, "title": "Statistics from a Large Sample", "titleSlug": "statistics-from-a-large-sample", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20326, "totalSubmissionRaw": 48401}, "1094": {"acRate": 55.980993248119894, "difficulty": "Medium", "likes": 4458, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "1094", "paidOnly": false, "title": "Car Pooling", "titleSlug": "car-pooling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227261, "totalSubmissionRaw": 405961}, "1095": {"acRate": 40.27235223248512, "difficulty": "Hard", "likes": 3252, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "1095", "paidOnly": false, "title": "Find in Mountain Array", "titleSlug": "find-in-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143402, "totalSubmissionRaw": 356082}, "1096": {"acRate": 63.78546660254626, "difficulty": "Hard", "likes": 482, "dislikes": 288, "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": 25201, "totalSubmissionRaw": 39509}, "1097": {"acRate": 51.031575361423975, "difficulty": "Hard", "likes": 183, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1097", "paidOnly": true, "title": "Game Play Analysis V", "titleSlug": "game-play-analysis-v", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23968, "totalSubmissionRaw": 46967}, "1098": {"acRate": 43.138768732879974, "difficulty": "Medium", "likes": 202, "dislikes": 605, "categoryTitle": "Database", "frontendQuestionId": "1098", "paidOnly": true, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40789, "totalSubmissionRaw": 94552}, "1099": {"acRate": 61.839645172296144, "difficulty": "Easy", "likes": 1135, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "1099", "paidOnly": true, "title": "Two Sum Less Than K", "titleSlug": "two-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 135938, "totalSubmissionRaw": 219822}, "1100": {"acRate": 74.79249115679613, "difficulty": "Medium", "likes": 572, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1100", "paidOnly": true, "title": "Find K-Length Substrings With No Repeated Characters", "titleSlug": "find-k-length-substrings-with-no-repeated-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42711, "totalSubmissionRaw": 57106}, "1101": {"acRate": 65.30446885393728, "difficulty": "Medium", "likes": 1038, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1101", "paidOnly": true, "title": "The Earliest Moment When Everyone Become Friends", "titleSlug": "the-earliest-moment-when-everyone-become-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99940, "totalSubmissionRaw": 153037}, "1102": {"acRate": 53.77862011524537, "difficulty": "Medium", "likes": 1295, "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": 63277, "totalSubmissionRaw": 117662}, "1103": {"acRate": 65.43155075933433, "difficulty": "Easy", "likes": 980, "dislikes": 196, "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": 89918, "totalSubmissionRaw": 137423}, "1104": {"acRate": 75.48207119318738, "difficulty": "Medium", "likes": 1491, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "1104", "paidOnly": false, "title": "Path In Zigzag Labelled Binary Tree", "titleSlug": "path-in-zigzag-labelled-binary-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46269, "totalSubmissionRaw": 61298}, "1105": {"acRate": 68.86226950143278, "difficulty": "Medium", "likes": 2512, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "1105", "paidOnly": false, "title": "Filling Bookcase Shelves", "titleSlug": "filling-bookcase-shelves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138659, "totalSubmissionRaw": 201356}, "1106": {"acRate": 59.67663702506063, "difficulty": "Hard", "likes": 1187, "dislikes": 62, "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": 33219, "totalSubmissionRaw": 55665}, "1107": {"acRate": 44.59689583029242, "difficulty": "Medium", "likes": 150, "dislikes": 166, "categoryTitle": "Database", "frontendQuestionId": "1107", "paidOnly": true, "title": "New Users Daily Count", "titleSlug": "new-users-daily-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36664, "totalSubmissionRaw": 82212}, "1108": {"acRate": 89.23568740009968, "difficulty": "Easy", "likes": 2110, "dislikes": 1754, "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": 674960, "totalSubmissionRaw": 756379}, "1109": {"acRate": 62.36711025202587, "difficulty": "Medium", "likes": 1647, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "1109", "paidOnly": false, "title": "Corporate Flight Bookings", "titleSlug": "corporate-flight-bookings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 67112, "totalSubmissionRaw": 107608}, "1110": {"acRate": 72.4169790682115, "difficulty": "Medium", "likes": 4562, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1110", "paidOnly": false, "title": "Delete Nodes And Return Forest", "titleSlug": "delete-nodes-and-return-forest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 340943, "totalSubmissionRaw": 470808}, "1111": {"acRate": 72.02165595148234, "difficulty": "Medium", "likes": 439, "dislikes": 1767, "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": 27670, "totalSubmissionRaw": 38419}, "1112": {"acRate": 70.87958044171168, "difficulty": "Medium", "likes": 300, "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": 62710, "totalSubmissionRaw": 88474}, "1113": {"acRate": 64.8379563240054, "difficulty": "Easy", "likes": 110, "dislikes": 403, "categoryTitle": "Database", "frontendQuestionId": "1113", "paidOnly": true, "title": "Reported Posts", "titleSlug": "reported-posts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47475, "totalSubmissionRaw": 73221}, "1114": {"acRate": 69.73772352381481, "difficulty": "Easy", "likes": 1476, "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": 163443, "totalSubmissionRaw": 234369}, "1115": {"acRate": 66.59464065614681, "difficulty": "Medium", "likes": 683, "dislikes": 55, "categoryTitle": "Concurrency", "frontendQuestionId": "1115", "paidOnly": false, "title": "Print FooBar Alternately", "titleSlug": "print-foobar-alternately", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87527, "totalSubmissionRaw": 131433}, "1116": {"acRate": 61.408089520923184, "difficulty": "Medium", "likes": 490, "dislikes": 333, "categoryTitle": "Concurrency", "frontendQuestionId": "1116", "paidOnly": false, "title": "Print Zero Even Odd", "titleSlug": "print-zero-even-odd", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52682, "totalSubmissionRaw": 85790}, "1117": {"acRate": 56.55329975595825, "difficulty": "Medium", "likes": 519, "dislikes": 163, "categoryTitle": "Concurrency", "frontendQuestionId": "1117", "paidOnly": false, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54458, "totalSubmissionRaw": 96295}, "1118": {"acRate": 58.336144659604614, "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": 8646, "totalSubmissionRaw": 14821}, "1119": {"acRate": 91.16625432143267, "difficulty": "Easy", "likes": 360, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1119", "paidOnly": true, "title": "Remove Vowels from a String", "titleSlug": "remove-vowels-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111283, "totalSubmissionRaw": 122066}, "1120": {"acRate": 66.64463981305904, "difficulty": "Medium", "likes": 837, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1120", "paidOnly": true, "title": "Maximum Average Subtree", "titleSlug": "maximum-average-subtree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69589, "totalSubmissionRaw": 104418}, "1121": {"acRate": 61.33233158026547, "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": 4898, "totalSubmissionRaw": 7986}, "1122": {"acRate": 74.76631781664406, "difficulty": "Easy", "likes": 3149, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "1122", "paidOnly": false, "title": "Relative Sort Array", "titleSlug": "relative-sort-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 336984, "totalSubmissionRaw": 450716}, "1123": {"acRate": 72.52325251442444, "difficulty": "Medium", "likes": 1969, "dislikes": 846, "categoryTitle": "Algorithms", "frontendQuestionId": "1123", "paidOnly": false, "title": "Lowest Common Ancestor of Deepest Leaves", "titleSlug": "lowest-common-ancestor-of-deepest-leaves", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 115011, "totalSubmissionRaw": 158585}, "1124": {"acRate": 35.19689731232817, "difficulty": "Medium", "likes": 1429, "dislikes": 115, "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": 33669, "totalSubmissionRaw": 95659}, "1125": {"acRate": 55.49963555586408, "difficulty": "Hard", "likes": 2178, "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": 63960, "totalSubmissionRaw": 115244}, "1126": {"acRate": 65.68051575931231, "difficulty": "Medium", "likes": 270, "dislikes": 30, "categoryTitle": "Database", "frontendQuestionId": "1126", "paidOnly": true, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45845, "totalSubmissionRaw": 69800}, "1127": {"acRate": 47.02465204057561, "difficulty": "Hard", "likes": 181, "dislikes": 133, "categoryTitle": "Database", "frontendQuestionId": "1127", "paidOnly": true, "title": "User Purchase Platform", "titleSlug": "user-purchase-platform", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15947, "totalSubmissionRaw": 33912}, "1128": {"acRate": 48.438869412795796, "difficulty": "Easy", "likes": 687, "dislikes": 334, "categoryTitle": "Algorithms", "frontendQuestionId": "1128", "paidOnly": false, "title": "Number of Equivalent Domino Pairs", "titleSlug": "number-of-equivalent-domino-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70744, "totalSubmissionRaw": 146048}, "1129": {"acRate": 47.13399699770878, "difficulty": "Medium", "likes": 3488, "dislikes": 187, "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": 119315, "totalSubmissionRaw": 253139}, "1130": {"acRate": 67.70665659797433, "difficulty": "Medium", "likes": 4279, "dislikes": 275, "categoryTitle": "Algorithms", "frontendQuestionId": "1130", "paidOnly": false, "title": "Minimum Cost Tree From Leaf Values", "titleSlug": "minimum-cost-tree-from-leaf-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102210, "totalSubmissionRaw": 150960}, "1131": {"acRate": 48.4835482046381, "difficulty": "Medium", "likes": 646, "dislikes": 405, "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": 24858, "totalSubmissionRaw": 51271}, "1132": {"acRate": 32.249045511369395, "difficulty": "Medium", "likes": 153, "dislikes": 566, "categoryTitle": "Database", "frontendQuestionId": "1132", "paidOnly": true, "title": "Reported Posts II", "titleSlug": "reported-posts-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38179, "totalSubmissionRaw": 118388}, "1133": {"acRate": 69.11720018861006, "difficulty": "Easy", "likes": 318, "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": 65960, "totalSubmissionRaw": 95432}, "1134": {"acRate": 77.78147901399068, "difficulty": "Easy", "likes": 207, "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": 37360, "totalSubmissionRaw": 48032}, "1135": {"acRate": 62.07835051546392, "difficulty": "Medium", "likes": 1120, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1135", "paidOnly": true, "title": "Connecting Cities With Minimum Cost", "titleSlug": "connecting-cities-with-minimum-cost", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75270, "totalSubmissionRaw": 121250}, "1136": {"acRate": 61.48493653463832, "difficulty": "Medium", "likes": 1165, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1136", "paidOnly": true, "title": "Parallel Courses", "titleSlug": "parallel-courses", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88451, "totalSubmissionRaw": 143858}, "1137": {"acRate": 63.785839062839166, "difficulty": "Easy", "likes": 4447, "dislikes": 192, "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": 802215, "totalSubmissionRaw": 1257669}, "1138": {"acRate": 51.663695781342845, "difficulty": "Medium", "likes": 903, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "1138", "paidOnly": false, "title": "Alphabet Board Path", "titleSlug": "alphabet-board-path", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52170, "totalSubmissionRaw": 100980}, "1139": {"acRate": 50.262128325508606, "difficulty": "Medium", "likes": 708, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1139", "paidOnly": false, "title": "Largest 1-Bordered Square", "titleSlug": "largest-1-bordered-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25694, "totalSubmissionRaw": 51120}, "1140": {"acRate": 67.44519751185906, "difficulty": "Medium", "likes": 2840, "dislikes": 626, "categoryTitle": "Algorithms", "frontendQuestionId": "1140", "paidOnly": false, "title": "Stone Game II", "titleSlug": "stone-game-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96825, "totalSubmissionRaw": 143561}, "1141": {"acRate": 48.71037590464858, "difficulty": "Easy", "likes": 678, "dislikes": 804, "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": 249703, "totalSubmissionRaw": 512629}, "1142": {"acRate": 35.71558887433035, "difficulty": "Easy", "likes": 99, "dislikes": 369, "categoryTitle": "Database", "frontendQuestionId": "1142", "paidOnly": true, "title": "User Activity for the Past 30 Days II", "titleSlug": "user-activity-for-the-past-30-days-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43068, "totalSubmissionRaw": 120586}, "1143": {"acRate": 57.74185449233481, "difficulty": "Medium", "likes": 13563, "dislikes": 196, "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": 1163695, "totalSubmissionRaw": 2015341}, "1144": {"acRate": 47.96079598800064, "difficulty": "Medium", "likes": 435, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "1144", "paidOnly": false, "title": "Decrease Elements To Make Array Zigzag", "titleSlug": "decrease-elements-to-make-array-zigzag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20944, "totalSubmissionRaw": 43669}, "1145": {"acRate": 52.11041494793641, "difficulty": "Medium", "likes": 1352, "dislikes": 213, "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": 46742, "totalSubmissionRaw": 89698}, "1146": {"acRate": 36.90254138493822, "difficulty": "Medium", "likes": 3712, "dislikes": 501, "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": 221585, "totalSubmissionRaw": 600460}, "1147": {"acRate": 58.700679629979234, "difficulty": "Hard", "likes": 672, "dislikes": 30, "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": 24875, "totalSubmissionRaw": 42376}, "1148": {"acRate": 76.03079693908471, "difficulty": "Easy", "likes": 1469, "dislikes": 84, "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": 712587, "totalSubmissionRaw": 937235}, "1149": {"acRate": 47.05007436787308, "difficulty": "Medium", "likes": 130, "dislikes": 27, "categoryTitle": "Database", "frontendQuestionId": "1149", "paidOnly": true, "title": "Article Views II", "titleSlug": "article-views-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37960, "totalSubmissionRaw": 80680}, "1150": {"acRate": 58.9633989676033, "difficulty": "Easy", "likes": 455, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1150", "paidOnly": true, "title": "Check If a Number Is Majority Element in a Sorted Array", "titleSlug": "check-if-a-number-is-majority-element-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50488, "totalSubmissionRaw": 85626}, "1151": {"acRate": 60.26847556997434, "difficulty": "Medium", "likes": 1204, "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": 67435, "totalSubmissionRaw": 111891}, "1152": {"acRate": 42.750676090836514, "difficulty": "Medium", "likes": 495, "dislikes": 3746, "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": 102278, "totalSubmissionRaw": 239242}, "1153": {"acRate": 34.953284759277935, "difficulty": "Hard", "likes": 879, "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": 52338, "totalSubmissionRaw": 149737}, "1154": {"acRate": 48.89394748863751, "difficulty": "Easy", "likes": 454, "dislikes": 477, "categoryTitle": "Algorithms", "frontendQuestionId": "1154", "paidOnly": false, "title": "Day of the Year", "titleSlug": "day-of-the-year", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63148, "totalSubmissionRaw": 129153}, "1155": {"acRate": 61.06298595176387, "difficulty": "Medium", "likes": 5054, "dislikes": 170, "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": 295921, "totalSubmissionRaw": 484616}, "1156": {"acRate": 44.038021898688484, "difficulty": "Medium", "likes": 1020, "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": 32940, "totalSubmissionRaw": 74799}, "1157": {"acRate": 41.82842372220055, "difficulty": "Hard", "likes": 632, "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": 17153, "totalSubmissionRaw": 41008}, "1158": {"acRate": 57.1029581800039, "difficulty": "Medium", "likes": 646, "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": 108157, "totalSubmissionRaw": 189407}, "1159": {"acRate": 57.07087078237808, "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": 19367, "totalSubmissionRaw": 33935}, "1160": {"acRate": 70.64230158288186, "difficulty": "Easy", "likes": 2114, "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": 266390, "totalSubmissionRaw": 377097}, "1161": {"acRate": 67.15046333008587, "difficulty": "Medium", "likes": 3537, "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": 296379, "totalSubmissionRaw": 441366}, "1162": {"acRate": 51.60756687780782, "difficulty": "Medium", "likes": 4135, "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": 156919, "totalSubmissionRaw": 304062}, "1163": {"acRate": 34.56285770672982, "difficulty": "Hard", "likes": 594, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "1163", "paidOnly": false, "title": "Last Substring in Lexicographical Order", "titleSlug": "last-substring-in-lexicographical-order", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35026, "totalSubmissionRaw": 101340}, "1164": {"acRate": 56.11731799682585, "difficulty": "Medium", "likes": 897, "dislikes": 243, "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": 142844, "totalSubmissionRaw": 254549}, "1165": {"acRate": 87.53580356871755, "difficulty": "Easy", "likes": 527, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1165", "paidOnly": true, "title": "Single-Row Keyboard", "titleSlug": "single-row-keyboard", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 86488, "totalSubmissionRaw": 98803}, "1166": {"acRate": 63.13389906572559, "difficulty": "Medium", "likes": 576, "dislikes": 69, "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": 61899, "totalSubmissionRaw": 98044}, "1167": {"acRate": 70.1699523372642, "difficulty": "Medium", "likes": 1313, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "1167", "paidOnly": true, "title": "Minimum Cost to Connect Sticks", "titleSlug": "minimum-cost-to-connect-sticks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 125432, "totalSubmissionRaw": 178755}, "1168": {"acRate": 64.84712704269899, "difficulty": "Hard", "likes": 1154, "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": 49206, "totalSubmissionRaw": 75880}, "1169": {"acRate": 31.117355174269147, "difficulty": "Medium", "likes": 547, "dislikes": 2324, "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": 78075, "totalSubmissionRaw": 250905}, "1170": {"acRate": 62.38852120667464, "difficulty": "Medium", "likes": 708, "dislikes": 975, "categoryTitle": "Algorithms", "frontendQuestionId": "1170", "paidOnly": false, "title": "Compare Strings by Frequency of the Smallest Character", "titleSlug": "compare-strings-by-frequency-of-the-smallest-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81918, "totalSubmissionRaw": 131303}, "1171": {"acRate": 52.74874941934505, "difficulty": "Medium", "likes": 3300, "dislikes": 214, "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": 166925, "totalSubmissionRaw": 316453}, "1172": {"acRate": 32.685666445739, "difficulty": "Hard", "likes": 483, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1172", "paidOnly": false, "title": "Dinner Plate Stacks", "titleSlug": "dinner-plate-stacks", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18740, "totalSubmissionRaw": 57334}, "1173": {"acRate": 80.91826662845862, "difficulty": "Easy", "likes": 291, "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": 76242, "totalSubmissionRaw": 94221}, "1174": {"acRate": 51.959696391317856, "difficulty": "Medium", "likes": 727, "dislikes": 129, "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": 175588, "totalSubmissionRaw": 337933}, "1175": {"acRate": 57.73648467038185, "difficulty": "Easy", "likes": 406, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "1175", "paidOnly": false, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32221, "totalSubmissionRaw": 55807}, "1176": {"acRate": 53.51516233186767, "difficulty": "Easy", "likes": 154, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "1176", "paidOnly": true, "title": "Diet Plan Performance", "titleSlug": "diet-plan-performance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32983, "totalSubmissionRaw": 61633}, "1177": {"acRate": 39.24408190260975, "difficulty": "Medium", "likes": 804, "dislikes": 277, "categoryTitle": "Algorithms", "frontendQuestionId": "1177", "paidOnly": false, "title": "Can Make Palindrome from Substring", "titleSlug": "can-make-palindrome-from-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28481, "totalSubmissionRaw": 72574}, "1178": {"acRate": 46.7951871896945, "difficulty": "Hard", "likes": 1269, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1178", "paidOnly": false, "title": "Number of Valid Words for Each Puzzle", "titleSlug": "number-of-valid-words-for-each-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31386, "totalSubmissionRaw": 67071}, "1179": {"acRate": 76.97375075864859, "difficulty": "Easy", "likes": 739, "dislikes": 605, "categoryTitle": "Database", "frontendQuestionId": "1179", "paidOnly": false, "title": "Reformat Department Table", "titleSlug": "reformat-department-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 121754, "totalSubmissionRaw": 158176}, "1180": {"acRate": 79.99827348066299, "difficulty": "Easy", "likes": 355, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1180", "paidOnly": true, "title": "Count Substrings with Only One Distinct Letter", "titleSlug": "count-substrings-with-only-one-distinct-letter", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27801, "totalSubmissionRaw": 34752}, "1181": {"acRate": 45.95195308805447, "difficulty": "Medium", "likes": 74, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1181", "paidOnly": true, "title": "Before and After Puzzle", "titleSlug": "before-and-after-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9717, "totalSubmissionRaw": 21146}, "1182": {"acRate": 55.41235525991623, "difficulty": "Medium", "likes": 516, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1182", "paidOnly": true, "title": "Shortest Distance to Target Color", "titleSlug": "shortest-distance-to-target-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35987, "totalSubmissionRaw": 64944}, "1183": {"acRate": 68.1265206812652, "difficulty": "Hard", "likes": 163, "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": 5040, "totalSubmissionRaw": 7398}, "1184": {"acRate": 54.11950398521025, "difficulty": "Easy", "likes": 758, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1184", "paidOnly": false, "title": "Distance Between Bus Stops", "titleSlug": "distance-between-bus-stops", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62061, "totalSubmissionRaw": 114674}, "1185": {"acRate": 57.689302606927725, "difficulty": "Easy", "likes": 402, "dislikes": 2449, "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": 68667, "totalSubmissionRaw": 119029}, "1186": {"acRate": 44.13933321901869, "difficulty": "Medium", "likes": 1820, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1186", "paidOnly": false, "title": "Maximum Subarray Sum with One Deletion", "titleSlug": "maximum-subarray-sum-with-one-deletion", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54057, "totalSubmissionRaw": 122469}, "1187": {"acRate": 58.14731367430597, "difficulty": "Hard", "likes": 2234, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1187", "paidOnly": false, "title": "Make Array Strictly Increasing", "titleSlug": "make-array-strictly-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58584, "totalSubmissionRaw": 100751}, "1188": {"acRate": 72.45436162841669, "difficulty": "Medium", "likes": 520, "dislikes": 41, "categoryTitle": "Concurrency", "frontendQuestionId": "1188", "paidOnly": true, "title": "Design Bounded Blocking Queue", "titleSlug": "design-bounded-blocking-queue", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51239, "totalSubmissionRaw": 70719}, "1189": {"acRate": 59.68113074362067, "difficulty": "Easy", "likes": 1702, "dislikes": 103, "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": 214750, "totalSubmissionRaw": 359822}, "1190": {"acRate": 71.68733983250112, "difficulty": "Medium", "likes": 2808, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1190", "paidOnly": false, "title": "Reverse Substrings Between Each Pair of Parentheses", "titleSlug": "reverse-substrings-between-each-pair-of-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217072, "totalSubmissionRaw": 302805}, "1191": {"acRate": 23.831521016669768, "difficulty": "Medium", "likes": 1445, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "1191", "paidOnly": false, "title": "K-Concatenation Maximum Sum", "titleSlug": "k-concatenation-maximum-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35855, "totalSubmissionRaw": 150452}, "1192": {"acRate": 56.263416579666625, "difficulty": "Hard", "likes": 6188, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "1192", "paidOnly": false, "title": "Critical Connections in a Network", "titleSlug": "critical-connections-in-a-network", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Biconnected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg0", "slug": "biconnected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239820, "totalSubmissionRaw": 426245}, "1193": {"acRate": 57.875745565735556, "difficulty": "Medium", "likes": 818, "dislikes": 81, "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": 207065, "totalSubmissionRaw": 357771}, "1194": {"acRate": 49.14143643841346, "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": 21148, "totalSubmissionRaw": 43036}, "1195": {"acRate": 72.69838531107564, "difficulty": "Medium", "likes": 604, "dislikes": 408, "categoryTitle": "Concurrency", "frontendQuestionId": "1195", "paidOnly": false, "title": "Fizz Buzz Multithreaded", "titleSlug": "fizz-buzz-multithreaded", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50561, "totalSubmissionRaw": 69549}, "1196": {"acRate": 67.02617145801892, "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": 36418, "totalSubmissionRaw": 54334}, "1197": {"acRate": 40.6532802907319, "difficulty": "Medium", "likes": 1513, "dislikes": 406, "categoryTitle": "Algorithms", "frontendQuestionId": "1197", "paidOnly": true, "title": "Minimum Knight Moves", "titleSlug": "minimum-knight-moves", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159518, "totalSubmissionRaw": 392387}, "1198": {"acRate": 76.50191267420502, "difficulty": "Medium", "likes": 574, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1198", "paidOnly": true, "title": "Find Smallest Common Element in All Rows", "titleSlug": "find-smallest-common-element-in-all-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 45397, "totalSubmissionRaw": 59341}, "1199": {"acRate": 45.7415870378064, "difficulty": "Hard", "likes": 234, "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": 6606, "totalSubmissionRaw": 14442}, "1200": {"acRate": 69.666909832146, "difficulty": "Easy", "likes": 2351, "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": 199592, "totalSubmissionRaw": 286493}, "1201": {"acRate": 29.706356134304045, "difficulty": "Medium", "likes": 1218, "dislikes": 499, "categoryTitle": "Algorithms", "frontendQuestionId": "1201", "paidOnly": false, "title": "Ugly Number III", "titleSlug": "ugly-number-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33010, "totalSubmissionRaw": 111121}, "1202": {"acRate": 58.481557295599984, "difficulty": "Medium", "likes": 3688, "dislikes": 141, "categoryTitle": "Algorithms", "frontendQuestionId": "1202", "paidOnly": false, "title": "Smallest String With Swaps", "titleSlug": "smallest-string-with-swaps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 117707, "totalSubmissionRaw": 201272}, "1203": {"acRate": 66.23632885348863, "difficulty": "Hard", "likes": 1768, "dislikes": 297, "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": 55051, "totalSubmissionRaw": 83113}, "1204": {"acRate": 67.35616919516337, "difficulty": "Medium", "likes": 715, "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": 139985, "totalSubmissionRaw": 207829}, "1205": {"acRate": 41.77017808097811, "difficulty": "Medium", "likes": 156, "dislikes": 546, "categoryTitle": "Database", "frontendQuestionId": "1205", "paidOnly": true, "title": "Monthly Transactions II", "titleSlug": "monthly-transactions-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23573, "totalSubmissionRaw": 56435}, "1206": {"acRate": 61.719048711478166, "difficulty": "Hard", "likes": 665, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1206", "paidOnly": false, "title": "Design Skiplist", "titleSlug": "design-skiplist", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24213, "totalSubmissionRaw": 39231}, "1207": {"acRate": 77.35340404010147, "difficulty": "Easy", "likes": 5081, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "1207", "paidOnly": false, "title": "Unique Number of Occurrences", "titleSlug": "unique-number-of-occurrences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 671427, "totalSubmissionRaw": 867999}, "1208": {"acRate": 58.30476784044873, "difficulty": "Medium", "likes": 1790, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "1208", "paidOnly": false, "title": "Get Equal Substrings Within Budget", "titleSlug": "get-equal-substrings-within-budget", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160905, "totalSubmissionRaw": 275973}, "1209": {"acRate": 58.14231318842252, "difficulty": "Medium", "likes": 5778, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1209", "paidOnly": false, "title": "Remove All Adjacent Duplicates in String II", "titleSlug": "remove-all-adjacent-duplicates-in-string-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 327533, "totalSubmissionRaw": 563332}, "1210": {"acRate": 49.8075559607009, "difficulty": "Hard", "likes": 270, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1210", "paidOnly": false, "title": "Minimum Moves to Reach Target with Rotations", "titleSlug": "minimum-moves-to-reach-target-with-rotations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9835, "totalSubmissionRaw": 19746}, "1211": {"acRate": 45.33858274636283, "difficulty": "Easy", "likes": 625, "dislikes": 418, "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": 206354, "totalSubmissionRaw": 455142}, "1212": {"acRate": 55.71562880212366, "difficulty": "Medium", "likes": 307, "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": 40298, "totalSubmissionRaw": 72328}, "1213": {"acRate": 79.80283526152844, "difficulty": "Easy", "likes": 583, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1213", "paidOnly": true, "title": "Intersection of Three Sorted Arrays", "titleSlug": "intersection-of-three-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88151, "totalSubmissionRaw": 110462}, "1214": {"acRate": 67.27765359344306, "difficulty": "Medium", "likes": 546, "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": 49660, "totalSubmissionRaw": 73814}, "1215": {"acRate": 47.28877058069605, "difficulty": "Medium", "likes": 183, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1215", "paidOnly": true, "title": "Stepping Numbers", "titleSlug": "stepping-numbers", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9593, "totalSubmissionRaw": 20286}, "1216": {"acRate": 49.30362499399381, "difficulty": "Hard", "likes": 768, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1216", "paidOnly": true, "title": "Valid Palindrome III", "titleSlug": "valid-palindrome-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71825, "totalSubmissionRaw": 145681}, "1217": {"acRate": 71.7918918918919, "difficulty": "Easy", "likes": 2304, "dislikes": 314, "categoryTitle": "Algorithms", "frontendQuestionId": "1217", "paidOnly": false, "title": "Minimum Cost to Move Chips to The Same Position", "titleSlug": "minimum-cost-to-move-chips-to-the-same-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132814, "totalSubmissionRaw": 184999}, "1218": {"acRate": 54.66877490449383, "difficulty": "Medium", "likes": 3214, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1218", "paidOnly": false, "title": "Longest Arithmetic Subsequence of Given Difference", "titleSlug": "longest-arithmetic-subsequence-of-given-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146251, "totalSubmissionRaw": 267522}, "1219": {"acRate": 68.02301313879526, "difficulty": "Medium", "likes": 3285, "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": 218377, "totalSubmissionRaw": 321034}, "1220": {"acRate": 61.82436633627153, "difficulty": "Hard", "likes": 3250, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "1220", "paidOnly": false, "title": "Count Vowels Permutation", "titleSlug": "count-vowels-permutation", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169034, "totalSubmissionRaw": 273410}, "1221": {"acRate": 86.30886585752903, "difficulty": "Easy", "likes": 2744, "dislikes": 940, "categoryTitle": "Algorithms", "frontendQuestionId": "1221", "paidOnly": false, "title": "Split a String in Balanced Strings", "titleSlug": "split-a-string-in-balanced-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 315452, "totalSubmissionRaw": 365492}, "1222": {"acRate": 71.98507807599617, "difficulty": "Medium", "likes": 943, "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": 43610, "totalSubmissionRaw": 60582}, "1223": {"acRate": 49.34814021073824, "difficulty": "Hard", "likes": 931, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "1223", "paidOnly": false, "title": "Dice Roll Simulation", "titleSlug": "dice-roll-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30395, "totalSubmissionRaw": 61593}, "1224": {"acRate": 37.129709519700896, "difficulty": "Hard", "likes": 540, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1224", "paidOnly": false, "title": "Maximum Equal Frequency", "titleSlug": "maximum-equal-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15492, "totalSubmissionRaw": 41724}, "1225": {"acRate": 57.54088869590389, "difficulty": "Hard", "likes": 322, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1225", "paidOnly": true, "title": "Report Contiguous Dates", "titleSlug": "report-contiguous-dates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23853, "totalSubmissionRaw": 41454}, "1226": {"acRate": 53.951189372876115, "difficulty": "Medium", "likes": 352, "dislikes": 332, "categoryTitle": "Concurrency", "frontendQuestionId": "1226", "paidOnly": false, "title": "The Dining Philosophers", "titleSlug": "the-dining-philosophers", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34928, "totalSubmissionRaw": 64740}, "1227": {"acRate": 66.50866945964955, "difficulty": "Medium", "likes": 617, "dislikes": 972, "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": 43497, "totalSubmissionRaw": 65401}, "1228": {"acRate": 51.94158397303875, "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": 27742, "totalSubmissionRaw": 53410}, "1229": {"acRate": 55.005739330063655, "difficulty": "Medium", "likes": 882, "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": 79068, "totalSubmissionRaw": 143745}, "1230": {"acRate": 58.174852543961194, "difficulty": "Medium", "likes": 400, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1230", "paidOnly": true, "title": "Toss Strange Coins", "titleSlug": "toss-strange-coins", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21107, "totalSubmissionRaw": 36282}, "1231": {"acRate": 58.83044742893745, "difficulty": "Hard", "likes": 988, "dislikes": 61, "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": 56026, "totalSubmissionRaw": 95233}, "1232": {"acRate": 39.511643994937, "difficulty": "Easy", "likes": 2601, "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": 261590, "totalSubmissionRaw": 662058}, "1233": {"acRate": 66.02431974241075, "difficulty": "Medium", "likes": 812, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1233", "paidOnly": false, "title": "Remove Sub-Folders from the Filesystem", "titleSlug": "remove-sub-folders-from-the-filesystem", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54134, "totalSubmissionRaw": 81991}, "1234": {"acRate": 38.527785036146675, "difficulty": "Medium", "likes": 1195, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "1234", "paidOnly": false, "title": "Replace the Substring for Balanced String", "titleSlug": "replace-the-substring-for-balanced-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35387, "totalSubmissionRaw": 91848}, "1235": {"acRate": 54.35914783137268, "difficulty": "Hard", "likes": 6803, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1235", "paidOnly": false, "title": "Maximum Profit in Job Scheduling", "titleSlug": "maximum-profit-in-job-scheduling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 316573, "totalSubmissionRaw": 582373}, "1236": {"acRate": 67.95186640471512, "difficulty": "Medium", "likes": 288, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "1236", "paidOnly": true, "title": "Web Crawler", "titleSlug": "web-crawler", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38738, "totalSubmissionRaw": 57008}, "1237": {"acRate": 69.6515454343569, "difficulty": "Medium", "likes": 517, "dislikes": 1427, "categoryTitle": "Algorithms", "frontendQuestionId": "1237", "paidOnly": false, "title": "Find Positive Integer Solution for a Given Equation", "titleSlug": "find-positive-integer-solution-for-a-given-equation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69001, "totalSubmissionRaw": 99066}, "1238": {"acRate": 70.35000568806645, "difficulty": "Medium", "likes": 421, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "1238", "paidOnly": false, "title": "Circular Permutation in Binary Representation", "titleSlug": "circular-permutation-in-binary-representation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18552, "totalSubmissionRaw": 26371}, "1239": {"acRate": 54.10138043474224, "difficulty": "Medium", "likes": 4422, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "1239", "paidOnly": false, "title": "Maximum Length of a Concatenated String with Unique Characters", "titleSlug": "maximum-length-of-a-concatenated-string-with-unique-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 291350, "totalSubmissionRaw": 538526}, "1240": {"acRate": 54.33879633392027, "difficulty": "Hard", "likes": 687, "dislikes": 568, "categoryTitle": "Algorithms", "frontendQuestionId": "1240", "paidOnly": false, "title": "Tiling a Rectangle with the Fewest Squares", "titleSlug": "tiling-a-rectangle-with-the-fewest-squares", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24071, "totalSubmissionRaw": 44298}, "1241": {"acRate": 65.90081101367555, "difficulty": "Easy", "likes": 177, "dislikes": 536, "categoryTitle": "Database", "frontendQuestionId": "1241", "paidOnly": true, "title": "Number of Comments per Post", "titleSlug": "number-of-comments-per-post", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35997, "totalSubmissionRaw": 54623}, "1242": {"acRate": 49.33409983711795, "difficulty": "Medium", "likes": 534, "dislikes": 90, "categoryTitle": "Concurrency", "frontendQuestionId": "1242", "paidOnly": true, "title": "Web Crawler Multithreaded", "titleSlug": "web-crawler-multithreaded", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56639, "totalSubmissionRaw": 114807}, "1243": {"acRate": 52.340881272949815, "difficulty": "Easy", "likes": 151, "dislikes": 71, "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": 13684, "totalSubmissionRaw": 26144}, "1244": {"acRate": 67.89330094535435, "difficulty": "Medium", "likes": 773, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1244", "paidOnly": true, "title": "Design A Leaderboard", "titleSlug": "design-a-leaderboard", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74906, "totalSubmissionRaw": 110328}, "1245": {"acRate": 61.21360719214331, "difficulty": "Medium", "likes": 853, "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": 45688, "totalSubmissionRaw": 74637}, "1246": {"acRate": 46.436349660503055, "difficulty": "Hard", "likes": 310, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1246", "paidOnly": true, "title": "Palindrome Removal", "titleSlug": "palindrome-removal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10874, "totalSubmissionRaw": 23417}, "1247": {"acRate": 64.42130177514794, "difficulty": "Medium", "likes": 1382, "dislikes": 241, "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": 40827, "totalSubmissionRaw": 63375}, "1248": {"acRate": 71.28037769157886, "difficulty": "Medium", "likes": 4569, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "1248", "paidOnly": false, "title": "Count Number of Nice Subarrays", "titleSlug": "count-number-of-nice-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 264066, "totalSubmissionRaw": 370453}, "1249": {"acRate": 69.13687651106734, "difficulty": "Medium", "likes": 6882, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1249", "paidOnly": false, "title": "Minimum Remove to Make Valid Parentheses", "titleSlug": "minimum-remove-to-make-valid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 758933, "totalSubmissionRaw": 1097728}, "1250": {"acRate": 59.763371949716536, "difficulty": "Hard", "likes": 508, "dislikes": 377, "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": 24246, "totalSubmissionRaw": 40570}, "1251": {"acRate": 37.911130165481566, "difficulty": "Easy", "likes": 1183, "dislikes": 166, "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": 268814, "totalSubmissionRaw": 709061}, "1252": {"acRate": 78.78647147905097, "difficulty": "Easy", "likes": 1218, "dislikes": 1520, "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": 117057, "totalSubmissionRaw": 148575}, "1253": {"acRate": 46.71485864237263, "difficulty": "Medium", "likes": 463, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1253", "paidOnly": false, "title": "Reconstruct a 2-Row Binary Matrix", "titleSlug": "reconstruct-a-2-row-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28305, "totalSubmissionRaw": 60591}, "1254": {"acRate": 66.40779673459714, "difficulty": "Medium", "likes": 4541, "dislikes": 165, "categoryTitle": "Algorithms", "frontendQuestionId": "1254", "paidOnly": false, "title": "Number of Closed Islands", "titleSlug": "number-of-closed-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229765, "totalSubmissionRaw": 345990}, "1255": {"acRate": 82.10417154993004, "difficulty": "Hard", "likes": 1740, "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": 115592, "totalSubmissionRaw": 140787}, "1256": {"acRate": 69.7941726811013, "difficulty": "Medium", "likes": 78, "dislikes": 251, "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": 7833, "totalSubmissionRaw": 11223}, "1257": {"acRate": 65.89610664409649, "difficulty": "Medium", "likes": 436, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1257", "paidOnly": true, "title": "Smallest Common Region", "titleSlug": "smallest-common-region", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24914, "totalSubmissionRaw": 37808}, "1258": {"acRate": 56.38847323454168, "difficulty": "Medium", "likes": 353, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "1258", "paidOnly": true, "title": "Synonymous Sentences", "titleSlug": "synonymous-sentences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23364, "totalSubmissionRaw": 41434}, "1259": {"acRate": 59.644066939683505, "difficulty": "Hard", "likes": 232, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1259", "paidOnly": true, "title": "Handshakes That Don't Cross", "titleSlug": "handshakes-that-dont-cross", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11797, "totalSubmissionRaw": 19779}, "1260": {"acRate": 67.41769707540412, "difficulty": "Easy", "likes": 1726, "dislikes": 342, "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": 108229, "totalSubmissionRaw": 160535}, "1261": {"acRate": 77.48932436384908, "difficulty": "Medium", "likes": 992, "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": 66234, "totalSubmissionRaw": 85475}, "1262": {"acRate": 50.584584102522946, "difficulty": "Medium", "likes": 1811, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1262", "paidOnly": false, "title": "Greatest Sum Divisible by Three", "titleSlug": "greatest-sum-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56721, "totalSubmissionRaw": 112131}, "1263": {"acRate": 49.051682443170044, "difficulty": "Hard", "likes": 849, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1263", "paidOnly": false, "title": "Minimum Moves to Move a Box to Their Target Location", "titleSlug": "minimum-moves-to-move-a-box-to-their-target-location", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28397, "totalSubmissionRaw": 57892}, "1264": {"acRate": 65.21364940359354, "difficulty": "Medium", "likes": 249, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1264", "paidOnly": true, "title": "Page Recommendations", "titleSlug": "page-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43191, "totalSubmissionRaw": 66230}, "1265": {"acRate": 94.04794181910975, "difficulty": "Medium", "likes": 578, "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": 58969, "totalSubmissionRaw": 62701}, "1266": {"acRate": 82.4675393019152, "difficulty": "Easy", "likes": 2198, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1266", "paidOnly": false, "title": "Minimum Time Visiting All Points", "titleSlug": "minimum-time-visiting-all-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235063, "totalSubmissionRaw": 285037}, "1267": {"acRate": 60.59481784453533, "difficulty": "Medium", "likes": 1299, "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": 60593, "totalSubmissionRaw": 99997}, "1268": {"acRate": 65.09212601454014, "difficulty": "Medium", "likes": 4728, "dislikes": 241, "categoryTitle": "Algorithms", "frontendQuestionId": "1268", "paidOnly": false, "title": "Search Suggestions System", "titleSlug": "search-suggestions-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 321517, "totalSubmissionRaw": 493942}, "1269": {"acRate": 50.291689299293864, "difficulty": "Hard", "likes": 1548, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1269", "paidOnly": false, "title": "Number of Ways to Stay in the Same Place After Some Steps", "titleSlug": "number-of-ways-to-stay-in-the-same-place-after-some-steps", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92587, "totalSubmissionRaw": 184100}, "1270": {"acRate": 84.72680187301444, "difficulty": "Medium", "likes": 420, "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": 56273, "totalSubmissionRaw": 66416}, "1271": {"acRate": 58.06950603279365, "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": 11262, "totalSubmissionRaw": 19394}, "1272": {"acRate": 66.21442159290764, "difficulty": "Medium", "likes": 462, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1272", "paidOnly": true, "title": "Remove Interval", "titleSlug": "remove-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 36896, "totalSubmissionRaw": 55722}, "1273": {"acRate": 61.13824966158554, "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": 10388, "totalSubmissionRaw": 16991}, "1274": {"acRate": 68.65696095871174, "difficulty": "Hard", "likes": 526, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1274", "paidOnly": true, "title": "Number of Ships in a Rectangle", "titleSlug": "number-of-ships-in-a-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29333, "totalSubmissionRaw": 42724}, "1275": {"acRate": 53.91193987756524, "difficulty": "Easy", "likes": 1490, "dislikes": 348, "categoryTitle": "Algorithms", "frontendQuestionId": "1275", "paidOnly": false, "title": "Find Winner on a Tic Tac Toe Game", "titleSlug": "find-winner-on-a-tic-tac-toe-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129985, "totalSubmissionRaw": 241107}, "1276": {"acRate": 51.12963495257258, "difficulty": "Medium", "likes": 330, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "1276", "paidOnly": false, "title": "Number of Burgers with No Waste of Ingredients", "titleSlug": "number-of-burgers-with-no-waste-of-ingredients", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26682, "totalSubmissionRaw": 52185}, "1277": {"acRate": 75.42445016270862, "difficulty": "Medium", "likes": 4866, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "1277", "paidOnly": false, "title": "Count Square Submatrices with All Ones", "titleSlug": "count-square-submatrices-with-all-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 230387, "totalSubmissionRaw": 305454}, "1278": {"acRate": 61.10316226023846, "difficulty": "Hard", "likes": 1148, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1278", "paidOnly": false, "title": "Palindrome Partitioning III", "titleSlug": "palindrome-partitioning-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29467, "totalSubmissionRaw": 48225}, "1279": {"acRate": 72.87735849056604, "difficulty": "Easy", "likes": 75, "dislikes": 353, "categoryTitle": "Concurrency", "frontendQuestionId": "1279", "paidOnly": true, "title": "Traffic Light Controlled Intersection", "titleSlug": "traffic-light-controlled-intersection", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14523, "totalSubmissionRaw": 19928}, "1280": {"acRate": 58.04726161579576, "difficulty": "Easy", "likes": 1761, "dislikes": 239, "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": 290073, "totalSubmissionRaw": 499722}, "1281": {"acRate": 86.55007949125596, "difficulty": "Easy", "likes": 2570, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "1281", "paidOnly": false, "title": "Subtract the Product and Sum of Digits of an Integer", "titleSlug": "subtract-the-product-and-sum-of-digits-of-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 509014, "totalSubmissionRaw": 588115}, "1282": {"acRate": 87.44118964362465, "difficulty": "Medium", "likes": 2993, "dislikes": 707, "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": 212803, "totalSubmissionRaw": 243367}, "1283": {"acRate": 60.898639795806695, "difficulty": "Medium", "likes": 2926, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "1283", "paidOnly": false, "title": "Find the Smallest Divisor Given a Threshold", "titleSlug": "find-the-smallest-divisor-given-a-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 205905, "totalSubmissionRaw": 338111}, "1284": {"acRate": 72.14664613278576, "difficulty": "Hard", "likes": 967, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "1284", "paidOnly": false, "title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "titleSlug": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33730, "totalSubmissionRaw": 46752}, "1285": {"acRate": 82.33289267123854, "difficulty": "Medium", "likes": 559, "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": 39859, "totalSubmissionRaw": 48412}, "1286": {"acRate": 73.29565734681736, "difficulty": "Medium", "likes": 1363, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1286", "paidOnly": false, "title": "Iterator for Combination", "titleSlug": "iterator-for-combination", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73926, "totalSubmissionRaw": 100860}, "1287": {"acRate": 60.97991521300994, "difficulty": "Easy", "likes": 1702, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1287", "paidOnly": false, "title": "Element Appearing More Than 25% In Sorted Array", "titleSlug": "element-appearing-more-than-25-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219360, "totalSubmissionRaw": 359725}, "1288": {"acRate": 56.31180758219112, "difficulty": "Medium", "likes": 2227, "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": 122142, "totalSubmissionRaw": 216903}, "1289": {"acRate": 64.32212851243561, "difficulty": "Hard", "likes": 2250, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "1289", "paidOnly": false, "title": "Minimum Falling Path Sum II", "titleSlug": "minimum-falling-path-sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143457, "totalSubmissionRaw": 223028}, "1290": {"acRate": 81.10179323146276, "difficulty": "Easy", "likes": 4155, "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": 489348, "totalSubmissionRaw": 603375}, "1291": {"acRate": 65.27006337677135, "difficulty": "Medium", "likes": 2860, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "1291", "paidOnly": false, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [{"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219981, "totalSubmissionRaw": 337031}, "1292": {"acRate": 53.587099605089946, "difficulty": "Medium", "likes": 1082, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1292", "paidOnly": false, "title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "titleSlug": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34195, "totalSubmissionRaw": 63812}, "1293": {"acRate": 45.28883064567102, "difficulty": "Hard", "likes": 4511, "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": 214957, "totalSubmissionRaw": 474636}, "1294": {"acRate": 66.73893256102606, "difficulty": "Easy", "likes": 140, "dislikes": 30, "categoryTitle": "Database", "frontendQuestionId": "1294", "paidOnly": true, "title": "Weather Type in Each Country", "titleSlug": "weather-type-in-each-country", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40325, "totalSubmissionRaw": 60423}, "1295": {"acRate": 77.38450717309658, "difficulty": "Easy", "likes": 2387, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1295", "paidOnly": false, "title": "Find Numbers with Even Number of Digits", "titleSlug": "find-numbers-with-even-number-of-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 699719, "totalSubmissionRaw": 904211}, "1296": {"acRate": 58.4975770234369, "difficulty": "Medium", "likes": 1863, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1296", "paidOnly": false, "title": "Divide Array in Sets of K Consecutive Numbers", "titleSlug": "divide-array-in-sets-of-k-consecutive-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 98865, "totalSubmissionRaw": 169007}, "1297": {"acRate": 52.09209360209681, "difficulty": "Medium", "likes": 1084, "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": 55252, "totalSubmissionRaw": 106066}, "1298": {"acRate": 57.79652012219418, "difficulty": "Hard", "likes": 344, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1298", "paidOnly": false, "title": "Maximum Candies You Can Get from Boxes", "titleSlug": "maximum-candies-you-can-get-from-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17406, "totalSubmissionRaw": 30116}, "1299": {"acRate": 71.23650749603318, "difficulty": "Easy", "likes": 2585, "dislikes": 244, "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": 400466, "totalSubmissionRaw": 562164}, "1300": {"acRate": 44.612664883731476, "difficulty": "Medium", "likes": 1145, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "1300", "paidOnly": false, "title": "Sum of Mutated Array Closest to Target", "titleSlug": "sum-of-mutated-array-closest-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39368, "totalSubmissionRaw": 88244}, "1301": {"acRate": 39.6455223880597, "difficulty": "Hard", "likes": 513, "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": 14025, "totalSubmissionRaw": 35376}, "1302": {"acRate": 86.32210332826698, "difficulty": "Medium", "likes": 4696, "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": 339062, "totalSubmissionRaw": 392787}, "1303": {"acRate": 89.54388876316915, "difficulty": "Easy", "likes": 333, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "1303", "paidOnly": true, "title": "Find the Team Size", "titleSlug": "find-the-team-size", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71225, "totalSubmissionRaw": 79542}, "1304": {"acRate": 76.16436771047105, "difficulty": "Easy", "likes": 1988, "dislikes": 598, "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": 223793, "totalSubmissionRaw": 293829}, "1305": {"acRate": 79.82501657585979, "difficulty": "Medium", "likes": 3064, "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": 221522, "totalSubmissionRaw": 277510}, "1306": {"acRate": 65.09725350418753, "difficulty": "Medium", "likes": 4146, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1306", "paidOnly": false, "title": "Jump Game III", "titleSlug": "jump-game-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 238157, "totalSubmissionRaw": 365848}, "1307": {"acRate": 34.522793238859485, "difficulty": "Hard", "likes": 503, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1307", "paidOnly": false, "title": "Verbal Arithmetic Puzzle", "titleSlug": "verbal-arithmetic-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14154, "totalSubmissionRaw": 40999}, "1308": {"acRate": 86.41035798427956, "difficulty": "Medium", "likes": 215, "dislikes": 62, "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": 41445, "totalSubmissionRaw": 47963}, "1309": {"acRate": 79.81223300120716, "difficulty": "Easy", "likes": 1538, "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": 127603, "totalSubmissionRaw": 159879}, "1310": {"acRate": 73.19164983820346, "difficulty": "Medium", "likes": 1498, "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": 60165, "totalSubmissionRaw": 82202}, "1311": {"acRate": 47.547767056939094, "difficulty": "Medium", "likes": 401, "dislikes": 421, "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": 24935, "totalSubmissionRaw": 52442}, "1312": {"acRate": 71.10953753554976, "difficulty": "Hard", "likes": 5057, "dislikes": 65, "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": 184776, "totalSubmissionRaw": 259847}, "1313": {"acRate": 85.80788436848398, "difficulty": "Easy", "likes": 1267, "dislikes": 1318, "categoryTitle": "Algorithms", "frontendQuestionId": "1313", "paidOnly": false, "title": "Decompress Run-Length Encoded List", "titleSlug": "decompress-run-length-encoded-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 272017, "totalSubmissionRaw": 317007}, "1314": {"acRate": 75.56726907630522, "difficulty": "Medium", "likes": 2395, "dislikes": 376, "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": 90318, "totalSubmissionRaw": 119520}, "1315": {"acRate": 85.58531169754778, "difficulty": "Medium", "likes": 2748, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1315", "paidOnly": false, "title": "Sum of Nodes with Even-Valued Grandparent", "titleSlug": "sum-of-nodes-with-even-valued-grandparent", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157649, "totalSubmissionRaw": 184201}, "1316": {"acRate": 50.72758936214174, "difficulty": "Hard", "likes": 316, "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": 17186, "totalSubmissionRaw": 33879}, "1317": {"acRate": 53.939542995125876, "difficulty": "Easy", "likes": 412, "dislikes": 314, "categoryTitle": "Algorithms", "frontendQuestionId": "1317", "paidOnly": false, "title": "Convert Integer to the Sum of Two No-Zero Integers", "titleSlug": "convert-integer-to-the-sum-of-two-no-zero-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48250, "totalSubmissionRaw": 89452}, "1318": {"acRate": 71.11355471690057, "difficulty": "Medium", "likes": 1977, "dislikes": 99, "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": 133222, "totalSubmissionRaw": 187337}, "1319": {"acRate": 63.176250982446945, "difficulty": "Medium", "likes": 5023, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1319", "paidOnly": false, "title": "Number of Operations to Make Network Connected", "titleSlug": "number-of-operations-to-make-network-connected", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231498, "totalSubmissionRaw": 366432}, "1320": {"acRate": 59.078117240237646, "difficulty": "Hard", "likes": 1003, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1320", "paidOnly": false, "title": "Minimum Distance to Type a Word Using Two Fingers", "titleSlug": "minimum-distance-to-type-a-word-using-two-fingers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32118, "totalSubmissionRaw": 54366}, "1321": {"acRate": 52.0931089791486, "difficulty": "Medium", "likes": 780, "dislikes": 292, "categoryTitle": "Database", "frontendQuestionId": "1321", "paidOnly": false, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104578, "totalSubmissionRaw": 200753}, "1322": {"acRate": 59.39063458523618, "difficulty": "Easy", "likes": 259, "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": 43566, "totalSubmissionRaw": 73355}, "1323": {"acRate": 82.39431905999184, "difficulty": "Easy", "likes": 2794, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "1323", "paidOnly": false, "title": "Maximum 69 Number", "titleSlug": "maximum-69-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 270811, "totalSubmissionRaw": 328677}, "1324": {"acRate": 64.40415382019542, "difficulty": "Medium", "likes": 782, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1324", "paidOnly": false, "title": "Print Words Vertically", "titleSlug": "print-words-vertically", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41987, "totalSubmissionRaw": 65193}, "1325": {"acRate": 77.44369605637267, "difficulty": "Medium", "likes": 2744, "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": 214088, "totalSubmissionRaw": 276444}, "1326": {"acRate": 50.81936320328047, "difficulty": "Hard", "likes": 3400, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1326", "paidOnly": false, "title": "Minimum Number of Taps to Open to Water a Garden", "titleSlug": "minimum-number-of-taps-to-open-to-water-a-garden", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134838, "totalSubmissionRaw": 265328}, "1327": {"acRate": 70.94213494881973, "difficulty": "Easy", "likes": 372, "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": 132444, "totalSubmissionRaw": 186693}, "1328": {"acRate": 51.71874153570203, "difficulty": "Medium", "likes": 2334, "dislikes": 748, "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": 171849, "totalSubmissionRaw": 332276}, "1329": {"acRate": 82.91493615599774, "difficulty": "Medium", "likes": 3393, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "1329", "paidOnly": false, "title": "Sort the Matrix Diagonally", "titleSlug": "sort-the-matrix-diagonally", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 166300, "totalSubmissionRaw": 200567}, "1330": {"acRate": 41.675697642915196, "difficulty": "Hard", "likes": 479, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1330", "paidOnly": false, "title": "Reverse Subarray To Maximize Array Value", "titleSlug": "reverse-subarray-to-maximize-array-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6153, "totalSubmissionRaw": 14764}, "1331": {"acRate": 62.49580018711781, "difficulty": "Easy", "likes": 1696, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1331", "paidOnly": false, "title": "Rank Transform of an Array", "titleSlug": "rank-transform-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 120905, "totalSubmissionRaw": 193461}, "1332": {"acRate": 76.48495396362003, "difficulty": "Easy", "likes": 1664, "dislikes": 1767, "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": 136235, "totalSubmissionRaw": 178120}, "1333": {"acRate": 61.61743768673925, "difficulty": "Medium", "likes": 306, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1333", "paidOnly": false, "title": "Filter Restaurants by Vegan-Friendly, Price and Distance", "titleSlug": "filter-restaurants-by-vegan-friendly-price-and-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30728, "totalSubmissionRaw": 49869}, "1334": {"acRate": 68.20803940666988, "difficulty": "Medium", "likes": 3158, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "1334", "paidOnly": false, "title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance", "titleSlug": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 207982, "totalSubmissionRaw": 304923}, "1335": {"acRate": 59.58444717385545, "difficulty": "Hard", "likes": 3413, "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": 197930, "totalSubmissionRaw": 332184}, "1336": {"acRate": 47.635524798154556, "difficulty": "Hard", "likes": 91, "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": 12803, "totalSubmissionRaw": 26877}, "1337": {"acRate": 73.57220503386571, "difficulty": "Easy", "likes": 4173, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "1337", "paidOnly": false, "title": "The K Weakest Rows in a Matrix", "titleSlug": "the-k-weakest-rows-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 369530, "totalSubmissionRaw": 502271}, "1338": {"acRate": 68.94840474655422, "difficulty": "Medium", "likes": 3256, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1338", "paidOnly": false, "title": "Reduce Array Size to The Half", "titleSlug": "reduce-array-size-to-the-half", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 197841, "totalSubmissionRaw": 286942}, "1339": {"acRate": 47.6877092752691, "difficulty": "Medium", "likes": 3010, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1339", "paidOnly": false, "title": "Maximum Product of Splitted Binary Tree", "titleSlug": "maximum-product-of-splitted-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126041, "totalSubmissionRaw": 264305}, "1340": {"acRate": 63.45195117758294, "difficulty": "Hard", "likes": 1106, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1340", "paidOnly": false, "title": "Jump Game V", "titleSlug": "jump-game-v", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33219, "totalSubmissionRaw": 52353}, "1341": {"acRate": 40.12936242803327, "difficulty": "Medium", "likes": 585, "dislikes": 188, "categoryTitle": "Database", "frontendQuestionId": "1341", "paidOnly": false, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 112916, "totalSubmissionRaw": 281379}, "1342": {"acRate": 85.24935262868837, "difficulty": "Easy", "likes": 3958, "dislikes": 170, "categoryTitle": "Algorithms", "frontendQuestionId": "1342", "paidOnly": false, "title": "Number of Steps to Reduce a Number to Zero", "titleSlug": "number-of-steps-to-reduce-a-number-to-zero", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 696943, "totalSubmissionRaw": 817534}, "1343": {"acRate": 68.70378852319571, "difficulty": "Medium", "likes": 1596, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1343", "paidOnly": false, "title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "titleSlug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 105000, "totalSubmissionRaw": 152829}, "1344": {"acRate": 63.86606799230275, "difficulty": "Medium", "likes": 1315, "dislikes": 240, "categoryTitle": "Algorithms", "frontendQuestionId": "1344", "paidOnly": false, "title": "Angle Between Hands of a Clock", "titleSlug": "angle-between-hands-of-a-clock", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124459, "totalSubmissionRaw": 194875}, "1345": {"acRate": 46.17402766127863, "difficulty": "Hard", "likes": 3734, "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": 146428, "totalSubmissionRaw": 317122}, "1346": {"acRate": 37.354507792464, "difficulty": "Easy", "likes": 1924, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "1346", "paidOnly": false, "title": "Check If N and Its Double Exist", "titleSlug": "check-if-n-and-its-double-exist", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 363552, "totalSubmissionRaw": 973248}, "1347": {"acRate": 82.0577873366046, "difficulty": "Medium", "likes": 2714, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "1347", "paidOnly": false, "title": "Minimum Number of Steps to Make Two Strings Anagram", "titleSlug": "minimum-number-of-steps-to-make-two-strings-anagram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 284624, "totalSubmissionRaw": 346858}, "1348": {"acRate": 44.62763466042154, "difficulty": "Medium", "likes": 193, "dislikes": 299, "categoryTitle": "Algorithms", "frontendQuestionId": "1348", "paidOnly": false, "title": "Tweet Counts Per Frequency", "titleSlug": "tweet-counts-per-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33348, "totalSubmissionRaw": 74725}, "1349": {"acRate": 50.718704240504444, "difficulty": "Hard", "likes": 828, "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": 16972, "totalSubmissionRaw": 33463}, "1350": {"acRate": 89.72737118013592, "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": 57168, "totalSubmissionRaw": 63713}, "1351": {"acRate": 77.4040747485803, "difficulty": "Easy", "likes": 4972, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1351", "paidOnly": false, "title": "Count Negative Numbers in a Sorted Matrix", "titleSlug": "count-negative-numbers-in-a-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 431398, "totalSubmissionRaw": 557333}, "1352": {"acRate": 51.74097141449272, "difficulty": "Medium", "likes": 1483, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1352", "paidOnly": false, "title": "Product of the Last K Numbers", "titleSlug": "product-of-the-last-k-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90303, "totalSubmissionRaw": 174529}, "1353": {"acRate": 32.47765478237392, "difficulty": "Medium", "likes": 3043, "dislikes": 425, "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": 91422, "totalSubmissionRaw": 281492}, "1354": {"acRate": 36.176850665325745, "difficulty": "Hard", "likes": 2038, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1354", "paidOnly": false, "title": "Construct Target Array With Multiple Sums", "titleSlug": "construct-target-array-with-multiple-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66907, "totalSubmissionRaw": 184946}, "1355": {"acRate": 72.39604725893354, "difficulty": "Medium", "likes": 146, "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": 29963, "totalSubmissionRaw": 41388}, "1356": {"acRate": 78.29635802300483, "difficulty": "Easy", "likes": 2451, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1356", "paidOnly": false, "title": "Sort Integers by The Number of 1 Bits", "titleSlug": "sort-integers-by-the-number-of-1-bits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229258, "totalSubmissionRaw": 292808}, "1357": {"acRate": 71.17156239337449, "difficulty": "Medium", "likes": 193, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1357", "paidOnly": false, "title": "Apply Discount Every n Orders", "titleSlug": "apply-discount-every-n-orders", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22945, "totalSubmissionRaw": 32239}, "1358": {"acRate": 67.47993962886956, "difficulty": "Medium", "likes": 3253, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1358", "paidOnly": false, "title": "Number of Substrings Containing All Three Characters", "titleSlug": "number-of-substrings-containing-all-three-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 124294, "totalSubmissionRaw": 184194}, "1359": {"acRate": 65.00028802899142, "difficulty": "Hard", "likes": 3032, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1359", "paidOnly": false, "title": "Count All Valid Pickup and Delivery Options", "titleSlug": "count-all-valid-pickup-and-delivery-options", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124119, "totalSubmissionRaw": 190952}, "1360": {"acRate": 50.078077516480434, "difficulty": "Easy", "likes": 371, "dislikes": 1279, "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": 53556, "totalSubmissionRaw": 106945}, "1361": {"acRate": 43.82307584995155, "difficulty": "Medium", "likes": 2130, "dislikes": 507, "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": 116228, "totalSubmissionRaw": 265221}, "1362": {"acRate": 60.859806173915345, "difficulty": "Medium", "likes": 322, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1362", "paidOnly": false, "title": "Closest Divisors", "titleSlug": "closest-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23047, "totalSubmissionRaw": 37869}, "1363": {"acRate": 32.65154950869237, "difficulty": "Hard", "likes": 603, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1363", "paidOnly": false, "title": "Largest Multiple of Three", "titleSlug": "largest-multiple-of-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21599, "totalSubmissionRaw": 66150}, "1364": {"acRate": 75.03944230416437, "difficulty": "Medium", "likes": 88, "dislikes": 385, "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": 20452, "totalSubmissionRaw": 27255}, "1365": {"acRate": 86.88110097140166, "difficulty": "Easy", "likes": 5465, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "1365", "paidOnly": false, "title": "How Many Numbers Are Smaller Than the Current Number", "titleSlug": "how-many-numbers-are-smaller-than-the-current-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 584841, "totalSubmissionRaw": 673151}, "1366": {"acRate": 58.52605493431432, "difficulty": "Medium", "likes": 1455, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "1366", "paidOnly": false, "title": "Rank Teams by Votes", "titleSlug": "rank-teams-by-votes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76047, "totalSubmissionRaw": 129937}, "1367": {"acRate": 44.001625529849356, "difficulty": "Medium", "likes": 2244, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1367", "paidOnly": false, "title": "Linked List in Binary Tree", "titleSlug": "linked-list-in-binary-tree", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77959, "totalSubmissionRaw": 177173}, "1368": {"acRate": 62.298595430364735, "difficulty": "Hard", "likes": 1767, "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": 48834, "totalSubmissionRaw": 78387}, "1369": {"acRate": 67.63580719204285, "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": 22100, "totalSubmissionRaw": 32675}, "1370": {"acRate": 76.53084560995597, "difficulty": "Easy", "likes": 781, "dislikes": 865, "categoryTitle": "Algorithms", "frontendQuestionId": "1370", "paidOnly": false, "title": "Increasing Decreasing String", "titleSlug": "increasing-decreasing-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80313, "totalSubmissionRaw": 104942}, "1371": {"acRate": 64.07515312793926, "difficulty": "Medium", "likes": 1629, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1371", "paidOnly": false, "title": "Find the Longest Substring Containing Vowels in Even Counts", "titleSlug": "find-the-longest-substring-containing-vowels-in-even-counts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27931, "totalSubmissionRaw": 43591}, "1372": {"acRate": 65.90967865877538, "difficulty": "Medium", "likes": 3450, "dislikes": 74, "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": 178403, "totalSubmissionRaw": 270677}, "1373": {"acRate": 41.65695218335241, "difficulty": "Hard", "likes": 2662, "dislikes": 182, "categoryTitle": "Algorithms", "frontendQuestionId": "1373", "paidOnly": false, "title": "Maximum Sum BST in Binary Tree", "titleSlug": "maximum-sum-bst-in-binary-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77901, "totalSubmissionRaw": 187006}, "1374": {"acRate": 77.9318229393105, "difficulty": "Easy", "likes": 483, "dislikes": 1275, "categoryTitle": "Algorithms", "frontendQuestionId": "1374", "paidOnly": false, "title": "Generate a String With Characters That Have Odd Counts", "titleSlug": "generate-a-string-with-characters-that-have-odd-counts", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96796, "totalSubmissionRaw": 124206}, "1375": {"acRate": 65.7633896808067, "difficulty": "Medium", "likes": 942, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1375", "paidOnly": false, "title": "Number of Times Binary String Is Prefix-Aligned", "titleSlug": "number-of-times-binary-string-is-prefix-aligned", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53609, "totalSubmissionRaw": 81518}, "1376": {"acRate": 60.019102870586195, "difficulty": "Medium", "likes": 4086, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "1376", "paidOnly": false, "title": "Time Needed to Inform All Employees", "titleSlug": "time-needed-to-inform-all-employees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 221189, "totalSubmissionRaw": 368531}, "1377": {"acRate": 35.4777911854278, "difficulty": "Hard", "likes": 789, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "1377", "paidOnly": false, "title": "Frog Position After T Seconds", "titleSlug": "frog-position-after-t-seconds", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30871, "totalSubmissionRaw": 87015}, "1378": {"acRate": 83.13983436405977, "difficulty": "Easy", "likes": 1228, "dislikes": 114, "categoryTitle": "Database", "frontendQuestionId": "1378", "paidOnly": false, "title": "Replace Employee ID With The Unique Identifier", "titleSlug": "replace-employee-id-with-the-unique-identifier", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 539087, "totalSubmissionRaw": 648410}, "1379": {"acRate": 85.88499888642646, "difficulty": "Easy", "likes": 1749, "dislikes": 2004, "categoryTitle": "Algorithms", "frontendQuestionId": "1379", "paidOnly": false, "title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree", "titleSlug": "find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235231, "totalSubmissionRaw": 273891}, "1380": {"acRate": 79.89140236518692, "difficulty": "Easy", "likes": 2179, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1380", "paidOnly": false, "title": "Lucky Numbers in a Matrix", "titleSlug": "lucky-numbers-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 248065, "totalSubmissionRaw": 310503}, "1381": {"acRate": 77.18031528371564, "difficulty": "Medium", "likes": 1823, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1381", "paidOnly": false, "title": "Design a Stack With Increment Operation", "titleSlug": "design-a-stack-with-increment-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 116619, "totalSubmissionRaw": 151100}, "1382": {"acRate": 84.67830060598033, "difficulty": "Medium", "likes": 3641, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1382", "paidOnly": false, "title": "Balance a Binary Search Tree", "titleSlug": "balance-a-binary-search-tree", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 255720, "totalSubmissionRaw": 301990}, "1383": {"acRate": 47.7079266298693, "difficulty": "Hard", "likes": 3099, "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": 96287, "totalSubmissionRaw": 201826}, "1384": {"acRate": 61.332889776003555, "difficulty": "Hard", "likes": 228, "dislikes": 129, "categoryTitle": "Database", "frontendQuestionId": "1384", "paidOnly": true, "title": "Total Sales Amount by Year", "titleSlug": "total-sales-amount-by-year", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16593, "totalSubmissionRaw": 27054}, "1385": {"acRate": 68.77103512062277, "difficulty": "Easy", "likes": 909, "dislikes": 3051, "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": 107070, "totalSubmissionRaw": 155691}, "1386": {"acRate": 42.16172529669488, "difficulty": "Medium", "likes": 904, "dislikes": 398, "categoryTitle": "Algorithms", "frontendQuestionId": "1386", "paidOnly": false, "title": "Cinema Seat Allocation", "titleSlug": "cinema-seat-allocation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49559, "totalSubmissionRaw": 117545}, "1387": {"acRate": 70.12929277960953, "difficulty": "Medium", "likes": 1448, "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": 94650, "totalSubmissionRaw": 134965}, "1388": {"acRate": 52.07824438668829, "difficulty": "Hard", "likes": 1061, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1388", "paidOnly": false, "title": "Pizza With 3n Slices", "titleSlug": "pizza-with-3n-slices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26649, "totalSubmissionRaw": 51171}, "1389": {"acRate": 85.95034146504366, "difficulty": "Easy", "likes": 2043, "dislikes": 1866, "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": 257373, "totalSubmissionRaw": 299444}, "1390": {"acRate": 43.02314562554784, "difficulty": "Medium", "likes": 415, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "1390", "paidOnly": false, "title": "Four Divisors", "titleSlug": "four-divisors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36317, "totalSubmissionRaw": 84416}, "1391": {"acRate": 48.144296392590185, "difficulty": "Medium", "likes": 827, "dislikes": 315, "categoryTitle": "Algorithms", "frontendQuestionId": "1391", "paidOnly": false, "title": "Check if There is a Valid Path in a Grid", "titleSlug": "check-if-there-is-a-valid-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29628, "totalSubmissionRaw": 61540}, "1392": {"acRate": 46.3542996288514, "difficulty": "Hard", "likes": 1357, "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": 47210, "totalSubmissionRaw": 101846}, "1393": {"acRate": 85.35941349146641, "difficulty": "Medium", "likes": 817, "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": 115731, "totalSubmissionRaw": 135581}, "1394": {"acRate": 67.55198394845301, "difficulty": "Easy", "likes": 1150, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1394", "paidOnly": false, "title": "Find Lucky Integer in an Array", "titleSlug": "find-lucky-integer-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130629, "totalSubmissionRaw": 193376}, "1395": {"acRate": 70.15940148347511, "difficulty": "Medium", "likes": 3331, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1395", "paidOnly": false, "title": "Count Number of Teams", "titleSlug": "count-number-of-teams", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 218971, "totalSubmissionRaw": 312105}, "1396": {"acRate": 74.69863714888987, "difficulty": "Medium", "likes": 3506, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1396", "paidOnly": false, "title": "Design Underground System", "titleSlug": "design-underground-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233493, "totalSubmissionRaw": 312580}, "1397": {"acRate": 42.444874757948654, "difficulty": "Hard", "likes": 488, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "1397", "paidOnly": false, "title": "Find All Good Strings", "titleSlug": "find-all-good-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6795, "totalSubmissionRaw": 16009}, "1398": {"acRate": 72.6064155826466, "difficulty": "Medium", "likes": 303, "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": 53304, "totalSubmissionRaw": 73415}, "1399": {"acRate": 66.38105189829328, "difficulty": "Easy", "likes": 443, "dislikes": 983, "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": 47644, "totalSubmissionRaw": 71773}, "1400": {"acRate": 62.16209966470112, "difficulty": "Medium", "likes": 1053, "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": 53764, "totalSubmissionRaw": 86490}, "1401": {"acRate": 46.60074496878098, "difficulty": "Medium", "likes": 372, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "1401", "paidOnly": false, "title": "Circle and Rectangle Overlapping", "titleSlug": "circle-and-rectangle-overlapping", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17390, "totalSubmissionRaw": 37317}, "1402": {"acRate": 76.229137788339, "difficulty": "Hard", "likes": 3306, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "1402", "paidOnly": false, "title": "Reducing Dishes", "titleSlug": "reducing-dishes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150131, "totalSubmissionRaw": 196947}, "1403": {"acRate": 72.68280397911641, "difficulty": "Easy", "likes": 585, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "1403", "paidOnly": false, "title": "Minimum Subsequence in Non-Increasing Order", "titleSlug": "minimum-subsequence-in-non-increasing-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75037, "totalSubmissionRaw": 103239}, "1404": {"acRate": 61.44176511613162, "difficulty": "Medium", "likes": 1372, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1404", "paidOnly": false, "title": "Number of Steps to Reduce a Number in Binary Representation to One", "titleSlug": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145362, "totalSubmissionRaw": 236585}, "1405": {"acRate": 57.47944062344374, "difficulty": "Medium", "likes": 2011, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "1405", "paidOnly": false, "title": "Longest Happy String", "titleSlug": "longest-happy-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85411, "totalSubmissionRaw": 148594}, "1406": {"acRate": 63.81693060510767, "difficulty": "Hard", "likes": 2186, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "1406", "paidOnly": false, "title": "Stone Game III", "titleSlug": "stone-game-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90509, "totalSubmissionRaw": 141826}, "1407": {"acRate": 57.6101063901451, "difficulty": "Easy", "likes": 632, "dislikes": 67, "categoryTitle": "Database", "frontendQuestionId": "1407", "paidOnly": false, "title": "Top Travellers", "titleSlug": "top-travellers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128279, "totalSubmissionRaw": 222668}, "1408": {"acRate": 64.03517322045226, "difficulty": "Easy", "likes": 902, "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": 91974, "totalSubmissionRaw": 143630}, "1409": {"acRate": 84.32828449127429, "difficulty": "Medium", "likes": 491, "dislikes": 627, "categoryTitle": "Algorithms", "frontendQuestionId": "1409", "paidOnly": false, "title": "Queries on a Permutation With Key", "titleSlug": "queries-on-a-permutation-with-key", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51221, "totalSubmissionRaw": 60740}, "1410": {"acRate": 50.84772968960052, "difficulty": "Medium", "likes": 191, "dislikes": 322, "categoryTitle": "Algorithms", "frontendQuestionId": "1410", "paidOnly": false, "title": "HTML Entity Parser", "titleSlug": "html-entity-parser", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25342, "totalSubmissionRaw": 49839}, "1411": {"acRate": 63.73766965808796, "difficulty": "Hard", "likes": 1081, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1411", "paidOnly": false, "title": "Number of Ways to Paint N \u00d7 3 Grid", "titleSlug": "number-of-ways-to-paint-n-3-grid", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34375, "totalSubmissionRaw": 53932}, "1412": {"acRate": 59.00151613601906, "difficulty": "Hard", "likes": 214, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1412", "paidOnly": true, "title": "Find the Quiet Students in All Exams", "titleSlug": "find-the-quiet-students-in-all-exams", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27241, "totalSubmissionRaw": 46170}, "1413": {"acRate": 65.44288713612893, "difficulty": "Easy", "likes": 1557, "dislikes": 334, "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": 149928, "totalSubmissionRaw": 229098}, "1414": {"acRate": 65.36962085590143, "difficulty": "Medium", "likes": 1015, "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": 43931, "totalSubmissionRaw": 67204}, "1415": {"acRate": 74.85147415372656, "difficulty": "Medium", "likes": 964, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1415", "paidOnly": false, "title": "The k-th Lexicographical String of All Happy Strings of Length n", "titleSlug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40443, "totalSubmissionRaw": 54031}, "1416": {"acRate": 47.50515430964216, "difficulty": "Hard", "likes": 1599, "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": 59447, "totalSubmissionRaw": 125138}, "1417": {"acRate": 52.737229521896055, "difficulty": "Easy", "likes": 589, "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": 59322, "totalSubmissionRaw": 112486}, "1418": {"acRate": 74.93228394746257, "difficulty": "Medium", "likes": 393, "dislikes": 479, "categoryTitle": "Algorithms", "frontendQuestionId": "1418", "paidOnly": false, "title": "Display Table of Food Orders in a Restaurant", "titleSlug": "display-table-of-food-orders-in-a-restaurant", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29324, "totalSubmissionRaw": 39134}, "1419": {"acRate": 50.341080471020646, "difficulty": "Medium", "likes": 1036, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1419", "paidOnly": false, "title": "Minimum Number of Frogs Croaking", "titleSlug": "minimum-number-of-frogs-croaking", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50403, "totalSubmissionRaw": 100123}, "1420": {"acRate": 68.2223271925681, "difficulty": "Hard", "likes": 1352, "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": 64992, "totalSubmissionRaw": 95265}, "1421": {"acRate": 82.80030372057708, "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": 27262, "totalSubmissionRaw": 32925}, "1422": {"acRate": 62.24341367024713, "difficulty": "Easy", "likes": 1544, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1422", "paidOnly": false, "title": "Maximum Score After Splitting a String", "titleSlug": "maximum-score-after-splitting-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164744, "totalSubmissionRaw": 264677}, "1423": {"acRate": 53.55612511598714, "difficulty": "Medium", "likes": 6187, "dislikes": 241, "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": 296089, "totalSubmissionRaw": 552860}, "1424": {"acRate": 57.06969938813514, "difficulty": "Medium", "likes": 2164, "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": 137291, "totalSubmissionRaw": 240571}, "1425": {"acRate": 56.569316773765955, "difficulty": "Hard", "likes": 2126, "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": 78525, "totalSubmissionRaw": 138812}, "1426": {"acRate": 60.25767533652324, "difficulty": "Easy", "likes": 155, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1426", "paidOnly": true, "title": "Counting Elements", "titleSlug": "counting-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129460, "totalSubmissionRaw": 214844}, "1427": {"acRate": 54.7918578910426, "difficulty": "Easy", "likes": 246, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1427", "paidOnly": true, "title": "Perform String Shifts", "titleSlug": "perform-string-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81184, "totalSubmissionRaw": 148168}, "1428": {"acRate": 54.540037001019904, "difficulty": "Medium", "likes": 1223, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "1428", "paidOnly": true, "title": "Leftmost Column with at Least a One", "titleSlug": "leftmost-column-with-at-least-a-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 183958, "totalSubmissionRaw": 337289}, "1429": {"acRate": 53.87953069087191, "difficulty": "Medium", "likes": 555, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1429", "paidOnly": true, "title": "First Unique Number", "titleSlug": "first-unique-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86423, "totalSubmissionRaw": 160400}, "1430": {"acRate": 46.96539093090817, "difficulty": "Medium", "likes": 215, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1430", "paidOnly": true, "title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree", "titleSlug": "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44619, "totalSubmissionRaw": 95004}, "1431": {"acRate": 87.63571905380965, "difficulty": "Easy", "likes": 4452, "dislikes": 568, "categoryTitle": "Algorithms", "frontendQuestionId": "1431", "paidOnly": false, "title": "Kids With the Greatest Number of Candies", "titleSlug": "kids-with-the-greatest-number-of-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 975419, "totalSubmissionRaw": 1113036}, "1432": {"acRate": 41.01339904512552, "difficulty": "Medium", "likes": 232, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "1432", "paidOnly": false, "title": "Max Difference You Can Get From Changing an Integer", "titleSlug": "max-difference-you-can-get-from-changing-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18641, "totalSubmissionRaw": 45451}, "1433": {"acRate": 69.80914462666289, "difficulty": "Medium", "likes": 757, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "1433", "paidOnly": false, "title": "Check If a String Can Break Another String", "titleSlug": "check-if-a-string-can-break-another-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44185, "totalSubmissionRaw": 63294}, "1434": {"acRate": 43.845275478161575, "difficulty": "Hard", "likes": 897, "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": 15359, "totalSubmissionRaw": 35030}, "1435": {"acRate": 75.1987434286447, "difficulty": "Easy", "likes": 152, "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": 23459, "totalSubmissionRaw": 31196}, "1436": {"acRate": 79.47983325463431, "difficulty": "Easy", "likes": 2208, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1436", "paidOnly": false, "title": "Destination City", "titleSlug": "destination-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274362, "totalSubmissionRaw": 345197}, "1437": {"acRate": 58.02693768666454, "difficulty": "Easy", "likes": 629, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1437", "paidOnly": false, "title": "Check If All 1's Are at Least Length K Places Away", "titleSlug": "check-if-all-1s-are-at-least-length-k-places-away", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80047, "totalSubmissionRaw": 137948}, "1438": {"acRate": 56.603314917127065, "difficulty": "Medium", "likes": 4056, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1438", "paidOnly": false, "title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit", "titleSlug": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230515, "totalSubmissionRaw": 407248}, "1439": {"acRate": 61.76682417833366, "difficulty": "Hard", "likes": 1230, "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": 35162, "totalSubmissionRaw": 56927}, "1440": {"acRate": 72.56501037724331, "difficulty": "Medium", "likes": 211, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1440", "paidOnly": true, "title": "Evaluate Boolean Expression", "titleSlug": "evaluate-boolean-expression", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29719, "totalSubmissionRaw": 40955}, "1441": {"acRate": 79.99131596211116, "difficulty": "Medium", "likes": 982, "dislikes": 481, "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": 169488, "totalSubmissionRaw": 211883}, "1442": {"acRate": 84.96650821089024, "difficulty": "Medium", "likes": 1924, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1442", "paidOnly": false, "title": "Count Triplets That Can Form Two Arrays of Equal XOR", "titleSlug": "count-triplets-that-can-form-two-arrays-of-equal-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125832, "totalSubmissionRaw": 148096}, "1443": {"acRate": 62.44560155140558, "difficulty": "Medium", "likes": 3646, "dislikes": 321, "categoryTitle": "Algorithms", "frontendQuestionId": "1443", "paidOnly": false, "title": "Minimum Time to Collect All Apples in a Tree", "titleSlug": "minimum-time-to-collect-all-apples-in-a-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122685, "totalSubmissionRaw": 196467}, "1444": {"acRate": 62.03852617503027, "difficulty": "Hard", "likes": 1834, "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": 68663, "totalSubmissionRaw": 110678}, "1445": {"acRate": 86.30956198294106, "difficulty": "Medium", "likes": 239, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1445", "paidOnly": true, "title": "Apples & Oranges", "titleSlug": "apples-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53833, "totalSubmissionRaw": 62372}, "1446": {"acRate": 60.31748824638946, "difficulty": "Easy", "likes": 1741, "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": 171402, "totalSubmissionRaw": 284164}, "1447": {"acRate": 67.04283199687072, "difficulty": "Medium", "likes": 415, "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": 34279, "totalSubmissionRaw": 51130}, "1448": {"acRate": 73.0405484723652, "difficulty": "Medium", "likes": 5852, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1448", "paidOnly": false, "title": "Count Good Nodes in Binary Tree", "titleSlug": "count-good-nodes-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 541309, "totalSubmissionRaw": 741109}, "1449": {"acRate": 48.31897676846776, "difficulty": "Hard", "likes": 692, "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": 18511, "totalSubmissionRaw": 38310}, "1450": {"acRate": 75.678339136719, "difficulty": "Easy", "likes": 878, "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": 126709, "totalSubmissionRaw": 167431}, "1451": {"acRate": 64.74409760735224, "difficulty": "Medium", "likes": 757, "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": 53118, "totalSubmissionRaw": 82043}, "1452": {"acRate": 58.028116907140216, "difficulty": "Medium", "likes": 353, "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": 25096, "totalSubmissionRaw": 43248}, "1453": {"acRate": 38.1755945231804, "difficulty": "Hard", "likes": 146, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "1453", "paidOnly": false, "title": "Maximum Number of Darts Inside of a Circular Dartboard", "titleSlug": "maximum-number-of-darts-inside-of-a-circular-dartboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6357, "totalSubmissionRaw": 16652}, "1454": {"acRate": 36.64221814746902, "difficulty": "Medium", "likes": 404, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1454", "paidOnly": true, "title": "Active Users", "titleSlug": "active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39566, "totalSubmissionRaw": 107978}, "1455": {"acRate": 64.37593996680407, "difficulty": "Easy", "likes": 828, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1455", "paidOnly": false, "title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence", "titleSlug": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 82613, "totalSubmissionRaw": 128329}, "1456": {"acRate": 58.83503040179288, "difficulty": "Medium", "likes": 3496, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1456", "paidOnly": false, "title": "Maximum Number of Vowels in a Substring of Given Length", "titleSlug": "maximum-number-of-vowels-in-a-substring-of-given-length", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 355989, "totalSubmissionRaw": 605062}, "1457": {"acRate": 68.35046536605599, "difficulty": "Medium", "likes": 3254, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1457", "paidOnly": false, "title": "Pseudo-Palindromic Paths in a Binary Tree", "titleSlug": "pseudo-palindromic-paths-in-a-binary-tree", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220826, "totalSubmissionRaw": 323079}, "1458": {"acRate": 62.45445524905735, "difficulty": "Hard", "likes": 1656, "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": 78677, "totalSubmissionRaw": 125975}, "1459": {"acRate": 68.53460132825087, "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": 17440, "totalSubmissionRaw": 25447}, "1460": {"acRate": 75.991862178693, "difficulty": "Easy", "likes": 1436, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "1460", "paidOnly": false, "title": "Make Two Arrays Equal by Reversing Subarrays", "titleSlug": "make-two-arrays-equal-by-reversing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 291347, "totalSubmissionRaw": 383390}, "1461": {"acRate": 56.52169918366784, "difficulty": "Medium", "likes": 2242, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1461", "paidOnly": false, "title": "Check If a String Contains All Binary Codes of Size K", "titleSlug": "check-if-a-string-contains-all-binary-codes-of-size-k", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123037, "totalSubmissionRaw": 217681}, "1462": {"acRate": 50.054627503760585, "difficulty": "Medium", "likes": 1465, "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": 63224, "totalSubmissionRaw": 126310}, "1463": {"acRate": 71.85529602238982, "difficulty": "Hard", "likes": 4114, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1463", "paidOnly": false, "title": "Cherry Pickup II", "titleSlug": "cherry-pickup-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176639, "totalSubmissionRaw": 245826}, "1464": {"acRate": 82.80451627943783, "difficulty": "Easy", "likes": 2475, "dislikes": 236, "categoryTitle": "Algorithms", "frontendQuestionId": "1464", "paidOnly": false, "title": "Maximum Product of Two Elements in an Array", "titleSlug": "maximum-product-of-two-elements-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 387152, "totalSubmissionRaw": 467548}, "1465": {"acRate": 41.067080244727485, "difficulty": "Medium", "likes": 2619, "dislikes": 350, "categoryTitle": "Algorithms", "frontendQuestionId": "1465", "paidOnly": false, "title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "titleSlug": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168143, "totalSubmissionRaw": 409435}, "1466": {"acRate": 64.5040073745935, "difficulty": "Medium", "likes": 4170, "dislikes": 120, "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": 201524, "totalSubmissionRaw": 312422}, "1467": {"acRate": 60.5460088691796, "difficulty": "Hard", "likes": 284, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "1467", "paidOnly": false, "title": "Probability of a Two Boxes Having The Same Number of Distinct Balls", "titleSlug": "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8738, "totalSubmissionRaw": 14432}, "1468": {"acRate": 78.47539280204036, "difficulty": "Medium", "likes": 126, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1468", "paidOnly": true, "title": "Calculate Salaries", "titleSlug": "calculate-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24923, "totalSubmissionRaw": 31759}, "1469": {"acRate": 83.68766737982315, "difficulty": "Easy", "likes": 507, "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": 55936, "totalSubmissionRaw": 66839}, "1470": {"acRate": 88.5756963403266, "difficulty": "Easy", "likes": 5761, "dislikes": 308, "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": 719291, "totalSubmissionRaw": 812064}, "1471": {"acRate": 61.349512149648874, "difficulty": "Medium", "likes": 697, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1471", "paidOnly": false, "title": "The k Strongest Values in an Array", "titleSlug": "the-k-strongest-values-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39487, "totalSubmissionRaw": 64364}, "1472": {"acRate": 77.65467292831345, "difficulty": "Medium", "likes": 3850, "dislikes": 238, "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": 244889, "totalSubmissionRaw": 315357}, "1473": {"acRate": 60.98257226076775, "difficulty": "Hard", "likes": 2063, "dislikes": 152, "categoryTitle": "Algorithms", "frontendQuestionId": "1473", "paidOnly": false, "title": "Paint House III", "titleSlug": "paint-house-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63020, "totalSubmissionRaw": 103341}, "1474": {"acRate": 73.24976724118355, "difficulty": "Easy", "likes": 405, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1474", "paidOnly": true, "title": "Delete N Nodes After M Nodes of a Linked List", "titleSlug": "delete-n-nodes-after-m-nodes-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 32257, "totalSubmissionRaw": 44037}, "1475": {"acRate": 78.25706088180435, "difficulty": "Easy", "likes": 2127, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1475", "paidOnly": false, "title": "Final Prices With a Special Discount in a Shop", "titleSlug": "final-prices-with-a-special-discount-in-a-shop", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 159016, "totalSubmissionRaw": 203197}, "1476": {"acRate": 88.22066291054442, "difficulty": "Medium", "likes": 632, "dislikes": 1441, "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": 111016, "totalSubmissionRaw": 125839}, "1477": {"acRate": 36.51282051282052, "difficulty": "Medium", "likes": 1697, "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": 48416, "totalSubmissionRaw": 132600}, "1478": {"acRate": 55.43276494711849, "difficulty": "Hard", "likes": 1111, "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": 25682, "totalSubmissionRaw": 46330}, "1479": {"acRate": 77.44009601783188, "difficulty": "Hard", "likes": 151, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1479", "paidOnly": true, "title": "Sales by Day of the Week", "titleSlug": "sales-by-day-of-the-week", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18066, "totalSubmissionRaw": 23329}, "1480": {"acRate": 86.82040742783906, "difficulty": "Easy", "likes": 7880, "dislikes": 345, "categoryTitle": "Algorithms", "frontendQuestionId": "1480", "paidOnly": false, "title": "Running Sum of 1d Array", "titleSlug": "running-sum-of-1d-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1874411, "totalSubmissionRaw": 2158953}, "1481": {"acRate": 63.08013676458687, "difficulty": "Medium", "likes": 2244, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1481", "paidOnly": false, "title": "Least Number of Unique Integers after K Removals", "titleSlug": "least-number-of-unique-integers-after-k-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249434, "totalSubmissionRaw": 395424}, "1482": {"acRate": 55.8561870295371, "difficulty": "Medium", "likes": 4642, "dislikes": 221, "categoryTitle": "Algorithms", "frontendQuestionId": "1482", "paidOnly": false, "title": "Minimum Number of Days to Make m Bouquets", "titleSlug": "minimum-number-of-days-to-make-m-bouquets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 264387, "totalSubmissionRaw": 473335}, "1483": {"acRate": 34.79031580911508, "difficulty": "Hard", "likes": 1927, "dislikes": 118, "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": 37290, "totalSubmissionRaw": 107185}, "1484": {"acRate": 76.99266121188624, "difficulty": "Easy", "likes": 1420, "dislikes": 107, "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": 226399, "totalSubmissionRaw": 294053}, "1485": {"acRate": 80.69494882799604, "difficulty": "Medium", "likes": 420, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1485", "paidOnly": true, "title": "Clone Binary Tree With Random Pointer", "titleSlug": "clone-binary-tree-with-random-pointer", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29331, "totalSubmissionRaw": 36348}, "1486": {"acRate": 86.0746568966035, "difficulty": "Easy", "likes": 1386, "dislikes": 333, "categoryTitle": "Algorithms", "frontendQuestionId": "1486", "paidOnly": false, "title": "XOR Operation in an Array", "titleSlug": "xor-operation-in-an-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 200633, "totalSubmissionRaw": 233092}, "1487": {"acRate": 37.14581066376496, "difficulty": "Medium", "likes": 444, "dislikes": 719, "categoryTitle": "Algorithms", "frontendQuestionId": "1487", "paidOnly": false, "title": "Making File Names Unique", "titleSlug": "making-file-names-unique", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34137, "totalSubmissionRaw": 91900}, "1488": {"acRate": 27.00530074035134, "difficulty": "Medium", "likes": 1530, "dislikes": 291, "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": 36987, "totalSubmissionRaw": 136962}, "1489": {"acRate": 67.57296053275878, "difficulty": "Hard", "likes": 1844, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "1489", "paidOnly": false, "title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "titleSlug": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55199, "totalSubmissionRaw": 81688}, "1490": {"acRate": 83.12343982273582, "difficulty": "Medium", "likes": 409, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1490", "paidOnly": true, "title": "Clone N-ary Tree", "titleSlug": "clone-n-ary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29633, "totalSubmissionRaw": 35649}, "1491": {"acRate": 63.46875476873804, "difficulty": "Easy", "likes": 2224, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1491", "paidOnly": false, "title": "Average Salary Excluding the Minimum and Maximum Salary", "titleSlug": "average-salary-excluding-the-minimum-and-maximum-salary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 345210, "totalSubmissionRaw": 543904}, "1492": {"acRate": 68.13296935878235, "difficulty": "Medium", "likes": 1780, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "1492", "paidOnly": false, "title": "The kth Factor of n", "titleSlug": "the-kth-factor-of-n", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 248840, "totalSubmissionRaw": 365227}, "1493": {"acRate": 67.70724499069644, "difficulty": "Medium", "likes": 3958, "dislikes": 82, "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": 298744, "totalSubmissionRaw": 441226}, "1494": {"acRate": 29.446489878982774, "difficulty": "Hard", "likes": 1039, "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": 18955, "totalSubmissionRaw": 64371}, "1495": {"acRate": 49.01583813970521, "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": 32124, "totalSubmissionRaw": 65538}, "1496": {"acRate": 62.46032016930061, "difficulty": "Easy", "likes": 1471, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1496", "paidOnly": false, "title": "Path Crossing", "titleSlug": "path-crossing", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164691, "totalSubmissionRaw": 263673}, "1497": {"acRate": 38.45209204409228, "difficulty": "Medium", "likes": 1744, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1497", "paidOnly": false, "title": "Check If Array Pairs Are Divisible by k", "titleSlug": "check-if-array-pairs-are-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52604, "totalSubmissionRaw": 136804}, "1498": {"acRate": 43.63225827001278, "difficulty": "Medium", "likes": 3911, "dislikes": 372, "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": 123286, "totalSubmissionRaw": 282556}, "1499": {"acRate": 44.13804033440311, "difficulty": "Hard", "likes": 1326, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1499", "paidOnly": false, "title": "Max Value of Equation", "titleSlug": "max-value-of-equation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44560, "totalSubmissionRaw": 100956}, "1500": {"acRate": 43.34835423197492, "difficulty": "Medium", "likes": 49, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1500", "paidOnly": true, "title": "Design a File Sharing System", "titleSlug": "design-a-file-sharing-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4425, "totalSubmissionRaw": 10208}, "1501": {"acRate": 50.16811608858327, "difficulty": "Medium", "likes": 296, "dislikes": 145, "categoryTitle": "Database", "frontendQuestionId": "1501", "paidOnly": true, "title": "Countries You Can Safely Invest In", "titleSlug": "countries-you-can-safely-invest-in", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39689, "totalSubmissionRaw": 79112}, "1502": {"acRate": 69.56307526313472, "difficulty": "Easy", "likes": 2168, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1502", "paidOnly": false, "title": "Can Make Arithmetic Progression From Sequence", "titleSlug": "can-make-arithmetic-progression-from-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 252731, "totalSubmissionRaw": 363312}, "1503": {"acRate": 68.48965454379729, "difficulty": "Medium", "likes": 1498, "dislikes": 409, "categoryTitle": "Algorithms", "frontendQuestionId": "1503", "paidOnly": false, "title": "Last Moment Before All Ants Fall Out of a Plank", "titleSlug": "last-moment-before-all-ants-fall-out-of-a-plank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90168, "totalSubmissionRaw": 131652}, "1504": {"acRate": 57.2543979956587, "difficulty": "Medium", "likes": 2107, "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": 53017, "totalSubmissionRaw": 92599}, "1505": {"acRate": 39.67560586492441, "difficulty": "Hard", "likes": 486, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1505", "paidOnly": false, "title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits", "titleSlug": "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10445, "totalSubmissionRaw": 26326}, "1506": {"acRate": 78.40785411252527, "difficulty": "Medium", "likes": 473, "dislikes": 201, "categoryTitle": "Algorithms", "frontendQuestionId": "1506", "paidOnly": true, "title": "Find Root of N-Ary Tree", "titleSlug": "find-root-of-n-ary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35300, "totalSubmissionRaw": 45021}, "1507": {"acRate": 66.3952787111226, "difficulty": "Easy", "likes": 468, "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": 77065, "totalSubmissionRaw": 116070}, "1508": {"acRate": 63.257886092915264, "difficulty": "Medium", "likes": 1486, "dislikes": 250, "categoryTitle": "Algorithms", "frontendQuestionId": "1508", "paidOnly": false, "title": "Range Sum of Sorted Subarray Sums", "titleSlug": "range-sum-of-sorted-subarray-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167546, "totalSubmissionRaw": 264863}, "1509": {"acRate": 59.198272336945415, "difficulty": "Medium", "likes": 2468, "dislikes": 275, "categoryTitle": "Algorithms", "frontendQuestionId": "1509", "paidOnly": false, "title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "titleSlug": "minimum-difference-between-largest-and-smallest-value-in-three-moves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231630, "totalSubmissionRaw": 391278}, "1510": {"acRate": 59.694294522709434, "difficulty": "Hard", "likes": 1596, "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": 73769, "totalSubmissionRaw": 123580}, "1511": {"acRate": 67.7820536887554, "difficulty": "Easy", "likes": 317, "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": 43329, "totalSubmissionRaw": 63924}, "1512": {"acRate": 89.18467571617511, "difficulty": "Easy", "likes": 5432, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "1512", "paidOnly": false, "title": "Number of Good Pairs", "titleSlug": "number-of-good-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 811212, "totalSubmissionRaw": 909586}, "1513": {"acRate": 46.94890540108661, "difficulty": "Medium", "likes": 872, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1513", "paidOnly": false, "title": "Number of Substrings With Only 1s", "titleSlug": "number-of-substrings-with-only-1s", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47009, "totalSubmissionRaw": 100128}, "1514": {"acRate": 55.47729538860609, "difficulty": "Medium", "likes": 3142, "dislikes": 74, "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": 147999, "totalSubmissionRaw": 266774}, "1515": {"acRate": 35.12043882661579, "difficulty": "Hard", "likes": 234, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "1515", "paidOnly": false, "title": "Best Position for a Service Centre", "titleSlug": "best-position-for-a-service-centre", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14726, "totalSubmissionRaw": 41927}, "1516": {"acRate": 62.055016181229774, "difficulty": "Hard", "likes": 33, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1516", "paidOnly": true, "title": "Move Sub-Tree of N-Ary Tree", "titleSlug": "move-sub-tree-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2301, "totalSubmissionRaw": 3708}, "1517": {"acRate": 44.23455277437424, "difficulty": "Easy", "likes": 458, "dislikes": 252, "categoryTitle": "Database", "frontendQuestionId": "1517", "paidOnly": false, "title": "Find Users With Valid E-Mails", "titleSlug": "find-users-with-valid-e-mails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126356, "totalSubmissionRaw": 285650}, "1518": {"acRate": 71.00619096729706, "difficulty": "Easy", "likes": 1669, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1518", "paidOnly": false, "title": "Water Bottles", "titleSlug": "water-bottles", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 234776, "totalSubmissionRaw": 330642}, "1519": {"acRate": 54.98711933916045, "difficulty": "Medium", "likes": 2251, "dislikes": 807, "categoryTitle": "Algorithms", "frontendQuestionId": "1519", "paidOnly": false, "title": "Number of Nodes in the Sub-Tree With the Same Label", "titleSlug": "number-of-nodes-in-the-sub-tree-with-the-same-label", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84739, "totalSubmissionRaw": 154107}, "1520": {"acRate": 39.58720330237358, "difficulty": "Hard", "likes": 822, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1520", "paidOnly": false, "title": "Maximum Number of Non-Overlapping Substrings", "titleSlug": "maximum-number-of-non-overlapping-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17262, "totalSubmissionRaw": 43605}, "1521": {"acRate": 45.49176971582999, "difficulty": "Hard", "likes": 385, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1521", "paidOnly": false, "title": "Find a Value of a Mysterious Function Closest to Target", "titleSlug": "find-a-value-of-a-mysterious-function-closest-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11110, "totalSubmissionRaw": 24422}, "1522": {"acRate": 74.4624054575115, "difficulty": "Medium", "likes": 608, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1522", "paidOnly": true, "title": "Diameter of N-Ary Tree", "titleSlug": "diameter-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50209, "totalSubmissionRaw": 67429}, "1523": {"acRate": 49.97066748574498, "difficulty": "Easy", "likes": 2746, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "1523", "paidOnly": false, "title": "Count Odd Numbers in an Interval Range", "titleSlug": "count-odd-numbers-in-an-interval-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343263, "totalSubmissionRaw": 686939}, "1524": {"acRate": 43.670649738610905, "difficulty": "Medium", "likes": 1352, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1524", "paidOnly": false, "title": "Number of Sub-arrays With Odd Sum", "titleSlug": "number-of-sub-arrays-with-odd-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39763, "totalSubmissionRaw": 91052}, "1525": {"acRate": 68.3190230375149, "difficulty": "Medium", "likes": 2050, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1525", "paidOnly": false, "title": "Number of Good Ways to Split a String", "titleSlug": "number-of-good-ways-to-split-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104951, "totalSubmissionRaw": 153619}, "1526": {"acRate": 70.63264203202053, "difficulty": "Hard", "likes": 1485, "dislikes": 69, "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": 41823, "totalSubmissionRaw": 59212}, "1527": {"acRate": 40.304164901490296, "difficulty": "Easy", "likes": 651, "dislikes": 570, "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": 234989, "totalSubmissionRaw": 583039}, "1528": {"acRate": 84.80052549791566, "difficulty": "Easy", "likes": 2747, "dislikes": 518, "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": 398910, "totalSubmissionRaw": 470410}, "1529": {"acRate": 73.39793026168347, "difficulty": "Medium", "likes": 1024, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1529", "paidOnly": false, "title": "Minimum Suffix Flips", "titleSlug": "minimum-suffix-flips", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55676, "totalSubmissionRaw": 75855}, "1530": {"acRate": 71.90302863137778, "difficulty": "Medium", "likes": 2386, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "1530", "paidOnly": false, "title": "Number of Good Leaf Nodes Pairs", "titleSlug": "number-of-good-leaf-nodes-pairs", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145984, "totalSubmissionRaw": 203029}, "1531": {"acRate": 52.49821725695269, "difficulty": "Hard", "likes": 2429, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "1531", "paidOnly": false, "title": "String Compression II", "titleSlug": "string-compression-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99387, "totalSubmissionRaw": 189315}, "1532": {"acRate": 68.47838603440731, "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": 29734, "totalSubmissionRaw": 43421}, "1533": {"acRate": 56.19338996014653, "difficulty": "Medium", "likes": 246, "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": 13959, "totalSubmissionRaw": 24841}, "1534": {"acRate": 81.37063174900094, "difficulty": "Easy", "likes": 761, "dislikes": 1198, "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": 124410, "totalSubmissionRaw": 152893}, "1535": {"acRate": 57.00175430837498, "difficulty": "Medium", "likes": 1574, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1535", "paidOnly": false, "title": "Find the Winner of an Array Game", "titleSlug": "find-the-winner-of-an-array-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115998, "totalSubmissionRaw": 203499}, "1536": {"acRate": 47.67064925442253, "difficulty": "Medium", "likes": 565, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "1536", "paidOnly": false, "title": "Minimum Swaps to Arrange a Binary Grid", "titleSlug": "minimum-swaps-to-arrange-a-binary-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15441, "totalSubmissionRaw": 32391}, "1537": {"acRate": 39.50963121263754, "difficulty": "Hard", "likes": 986, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1537", "paidOnly": false, "title": "Get the Maximum Score", "titleSlug": "get-the-maximum-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27362, "totalSubmissionRaw": 69254}, "1538": {"acRate": 69.77748256393225, "difficulty": "Medium", "likes": 138, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "1538", "paidOnly": true, "title": "Guess the Majority in a Hidden Array", "titleSlug": "guess-the-majority-in-a-hidden-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4202, "totalSubmissionRaw": 6022}, "1539": {"acRate": 60.46983040453687, "difficulty": "Easy", "likes": 6659, "dislikes": 451, "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": 461486, "totalSubmissionRaw": 763163}, "1540": {"acRate": 35.29889566735219, "difficulty": "Medium", "likes": 393, "dislikes": 315, "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": 20425, "totalSubmissionRaw": 57863}, "1541": {"acRate": 52.69333811063248, "difficulty": "Medium", "likes": 1115, "dislikes": 263, "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": 64708, "totalSubmissionRaw": 122802}, "1542": {"acRate": 43.804639235342115, "difficulty": "Hard", "likes": 815, "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": 15032, "totalSubmissionRaw": 34316}, "1543": {"acRate": 59.3784874238132, "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": 20751, "totalSubmissionRaw": 34947}, "1544": {"acRate": 68.35111600098934, "difficulty": "Easy", "likes": 3021, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "1544", "paidOnly": false, "title": "Make The String Great", "titleSlug": "make-the-string-great", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 320564, "totalSubmissionRaw": 468996}, "1545": {"acRate": 58.9436032595541, "difficulty": "Medium", "likes": 926, "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": 43834, "totalSubmissionRaw": 74366}, "1546": {"acRate": 47.8027955429551, "difficulty": "Medium", "likes": 1063, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1546", "paidOnly": false, "title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "titleSlug": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29001, "totalSubmissionRaw": 60668}, "1547": {"acRate": 61.695597391388624, "difficulty": "Hard", "likes": 4267, "dislikes": 110, "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": 133674, "totalSubmissionRaw": 216667}, "1548": {"acRate": 59.22029281579844, "difficulty": "Hard", "likes": 377, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "1548", "paidOnly": true, "title": "The Most Similar Path in a Graph", "titleSlug": "the-most-similar-path-in-a-graph", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17392, "totalSubmissionRaw": 29369}, "1549": {"acRate": 64.82107420895392, "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": 29725, "totalSubmissionRaw": 45857}, "1550": {"acRate": 68.33973860528205, "difficulty": "Easy", "likes": 1127, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1550", "paidOnly": false, "title": "Three Consecutive Odds", "titleSlug": "three-consecutive-odds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 275090, "totalSubmissionRaw": 402533}, "1551": {"acRate": 82.4057332588185, "difficulty": "Medium", "likes": 1442, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1551", "paidOnly": false, "title": "Minimum Operations to Make Array Equal", "titleSlug": "minimum-operations-to-make-array-equal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100268, "totalSubmissionRaw": 121676}, "1552": {"acRate": 71.08939379751253, "difficulty": "Medium", "likes": 2874, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1552", "paidOnly": false, "title": "Magnetic Force Between Two Balls", "titleSlug": "magnetic-force-between-two-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167016, "totalSubmissionRaw": 234938}, "1553": {"acRate": 35.44168385343382, "difficulty": "Hard", "likes": 992, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1553", "paidOnly": false, "title": "Minimum Number of Days to Eat N Oranges", "titleSlug": "minimum-number-of-days-to-eat-n-oranges", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36775, "totalSubmissionRaw": 103759}, "1554": {"acRate": 41.67522518730533, "difficulty": "Medium", "likes": 376, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1554", "paidOnly": true, "title": "Strings Differ by One Character", "titleSlug": "strings-differ-by-one-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24753, "totalSubmissionRaw": 59395}, "1555": {"acRate": 51.35105296569237, "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": 18605, "totalSubmissionRaw": 36231}, "1556": {"acRate": 53.69902274943773, "difficulty": "Easy", "likes": 489, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1556", "paidOnly": false, "title": "Thousand Separator", "titleSlug": "thousand-separator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53960, "totalSubmissionRaw": 100486}, "1557": {"acRate": 81.04446634284169, "difficulty": "Medium", "likes": 3690, "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": 185869, "totalSubmissionRaw": 229342}, "1558": {"acRate": 63.708979756618035, "difficulty": "Medium", "likes": 627, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1558", "paidOnly": false, "title": "Minimum Numbers of Function Calls to Make Target Array", "titleSlug": "minimum-numbers-of-function-calls-to-make-target-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22093, "totalSubmissionRaw": 34678}, "1559": {"acRate": 48.77940425153824, "difficulty": "Medium", "likes": 1161, "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": 43920, "totalSubmissionRaw": 90038}, "1560": {"acRate": 58.95066194024452, "difficulty": "Easy", "likes": 317, "dislikes": 633, "categoryTitle": "Algorithms", "frontendQuestionId": "1560", "paidOnly": false, "title": "Most Visited Sector in  a Circular Track", "titleSlug": "most-visited-sector-in-a-circular-track", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32595, "totalSubmissionRaw": 55292}, "1561": {"acRate": 84.56712103892966, "difficulty": "Medium", "likes": 1889, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "1561", "paidOnly": false, "title": "Maximum Number of Coins You Can Get", "titleSlug": "maximum-number-of-coins-you-can-get", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167941, "totalSubmissionRaw": 198589}, "1562": {"acRate": 42.92530020513057, "difficulty": "Medium", "likes": 648, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "1562", "paidOnly": false, "title": "Find Latest Group of Size M", "titleSlug": "find-latest-group-of-size-m", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18624, "totalSubmissionRaw": 43387}, "1563": {"acRate": 40.87916925108546, "difficulty": "Hard", "likes": 646, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1563", "paidOnly": false, "title": "Stone Game V", "titleSlug": "stone-game-v", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20431, "totalSubmissionRaw": 49979}, "1564": {"acRate": 67.36641221374046, "difficulty": "Medium", "likes": 337, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1564", "paidOnly": true, "title": "Put Boxes Into the Warehouse I", "titleSlug": "put-boxes-into-the-warehouse-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16591, "totalSubmissionRaw": 24628}, "1565": {"acRate": 82.08530455351863, "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": 22209, "totalSubmissionRaw": 27056}, "1566": {"acRate": 43.245218662443655, "difficulty": "Easy", "likes": 654, "dislikes": 134, "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": 35500, "totalSubmissionRaw": 82090}, "1567": {"acRate": 44.27260931915959, "difficulty": "Medium", "likes": 2410, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1567", "paidOnly": false, "title": "Maximum Length of Subarray With Positive Product", "titleSlug": "maximum-length-of-subarray-with-positive-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97247, "totalSubmissionRaw": 219655}, "1568": {"acRate": 44.95603957969549, "difficulty": "Hard", "likes": 713, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 14675, "totalSubmissionRaw": 32643}, "1569": {"acRate": 53.48256096746812, "difficulty": "Hard", "likes": 1788, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "1569", "paidOnly": false, "title": "Number of Ways to Reorder Array to Get Same BST", "titleSlug": "number-of-ways-to-reorder-array-to-get-same-bst", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56077, "totalSubmissionRaw": 104851}, "1570": {"acRate": 89.82024007803531, "difficulty": "Medium", "likes": 1211, "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": 270713, "totalSubmissionRaw": 301395}, "1571": {"acRate": 87.75005113520147, "difficulty": "Easy", "likes": 159, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1571", "paidOnly": true, "title": "Warehouse Manager", "titleSlug": "warehouse-manager", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42901, "totalSubmissionRaw": 48890}, "1572": {"acRate": 83.13703029344055, "difficulty": "Easy", "likes": 3484, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1572", "paidOnly": false, "title": "Matrix Diagonal Sum", "titleSlug": "matrix-diagonal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 373043, "totalSubmissionRaw": 448709}, "1573": {"acRate": 33.463132635253054, "difficulty": "Medium", "likes": 739, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1573", "paidOnly": false, "title": "Number of Ways to Split a String", "titleSlug": "number-of-ways-to-split-a-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30678, "totalSubmissionRaw": 91678}, "1574": {"acRate": 38.02262724837352, "difficulty": "Medium", "likes": 1617, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1574", "paidOnly": false, "title": "Shortest Subarray to be Removed to Make Array Sorted", "titleSlug": "shortest-subarray-to-be-removed-to-make-array-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31793, "totalSubmissionRaw": 83616}, "1575": {"acRate": 65.26054037177043, "difficulty": "Hard", "likes": 1624, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1575", "paidOnly": false, "title": "Count All Possible Routes", "titleSlug": "count-all-possible-routes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58525, "totalSubmissionRaw": 89679}, "1576": {"acRate": 46.22357173306609, "difficulty": "Easy", "likes": 561, "dislikes": 177, "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": 61805, "totalSubmissionRaw": 133709}, "1577": {"acRate": 41.40507645495513, "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": 21500, "totalSubmissionRaw": 51926}, "1578": {"acRate": 63.70729897068303, "difficulty": "Medium", "likes": 3817, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1578", "paidOnly": false, "title": "Minimum Time to Make Rope Colorful", "titleSlug": "minimum-time-to-make-rope-colorful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 260940, "totalSubmissionRaw": 409592}, "1579": {"acRate": 70.9716767495542, "difficulty": "Hard", "likes": 2528, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1579", "paidOnly": false, "title": "Remove Max Number of Edges to Keep Graph Fully Traversable", "titleSlug": "remove-max-number-of-edges-to-keep-graph-fully-traversable", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129749, "totalSubmissionRaw": 182818}, "1580": {"acRate": 66.2214172515282, "difficulty": "Medium", "likes": 220, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1580", "paidOnly": true, "title": "Put Boxes Into the Warehouse II", "titleSlug": "put-boxes-into-the-warehouse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8775, "totalSubmissionRaw": 13251}, "1581": {"acRate": 67.94014966735973, "difficulty": "Easy", "likes": 2087, "dislikes": 290, "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": 490795, "totalSubmissionRaw": 722379}, "1582": {"acRate": 68.63681766892954, "difficulty": "Easy", "likes": 1452, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1582", "paidOnly": false, "title": "Special Positions in a Binary Matrix", "titleSlug": "special-positions-in-a-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148423, "totalSubmissionRaw": 216244}, "1583": {"acRate": 61.606495886790846, "difficulty": "Medium", "likes": 285, "dislikes": 860, "categoryTitle": "Algorithms", "frontendQuestionId": "1583", "paidOnly": false, "title": "Count Unhappy Friends", "titleSlug": "count-unhappy-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28907, "totalSubmissionRaw": 46922}, "1584": {"acRate": 67.31156011108128, "difficulty": "Medium", "likes": 5060, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1584", "paidOnly": false, "title": "Min Cost to Connect All Points", "titleSlug": "min-cost-to-connect-all-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 305889, "totalSubmissionRaw": 454433}, "1585": {"acRate": 48.65270292794044, "difficulty": "Hard", "likes": 438, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1585", "paidOnly": false, "title": "Check If String Is Transformable With Substring Sort Operations", "titleSlug": "check-if-string-is-transformable-with-substring-sort-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8757, "totalSubmissionRaw": 17999}, "1586": {"acRate": 63.93963818735446, "difficulty": "Medium", "likes": 261, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1586", "paidOnly": true, "title": "Binary Search Tree Iterator II", "titleSlug": "binary-search-tree-iterator-ii", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14279, "totalSubmissionRaw": 22332}, "1587": {"acRate": 83.36929370732122, "difficulty": "Easy", "likes": 476, "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": 107804, "totalSubmissionRaw": 129309}, "1588": {"acRate": 83.17014632006855, "difficulty": "Easy", "likes": 3701, "dislikes": 299, "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": 204799, "totalSubmissionRaw": 246241}, "1589": {"acRate": 38.17769685258816, "difficulty": "Medium", "likes": 767, "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": 20548, "totalSubmissionRaw": 53822}, "1590": {"acRate": 29.155370575432432, "difficulty": "Medium", "likes": 1548, "dislikes": 68, "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": 30542, "totalSubmissionRaw": 104756}, "1591": {"acRate": 59.13214785629115, "difficulty": "Hard", "likes": 627, "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": 11406, "totalSubmissionRaw": 19289}, "1592": {"acRate": 43.29900753675099, "difficulty": "Easy", "likes": 457, "dislikes": 348, "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": 58021, "totalSubmissionRaw": 134004}, "1593": {"acRate": 56.70974242933159, "difficulty": "Medium", "likes": 841, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1593", "paidOnly": false, "title": "Split a String Into the Max Number of Unique Substrings", "titleSlug": "split-a-string-into-the-max-number-of-unique-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32079, "totalSubmissionRaw": 56567}, "1594": {"acRate": 33.86324902856364, "difficulty": "Medium", "likes": 832, "dislikes": 40, "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": 24837, "totalSubmissionRaw": 73345}, "1595": {"acRate": 48.20803295571576, "difficulty": "Hard", "likes": 472, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1595", "paidOnly": false, "title": "Minimum Cost to Connect Two Groups of Points", "titleSlug": "minimum-cost-to-connect-two-groups-of-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9362, "totalSubmissionRaw": 19420}, "1596": {"acRate": 78.37298400972722, "difficulty": "Medium", "likes": 242, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1596", "paidOnly": true, "title": "The Most Frequently Ordered Products for Each Customer", "titleSlug": "the-most-frequently-ordered-products-for-each-customer", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34162, "totalSubmissionRaw": 43589}, "1597": {"acRate": 62.50884225418534, "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": 13255, "totalSubmissionRaw": 21205}, "1598": {"acRate": 71.77081751419067, "difficulty": "Easy", "likes": 1444, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "1598", "paidOnly": false, "title": "Crawler Log Folder", "titleSlug": "crawler-log-folder", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250477, "totalSubmissionRaw": 348995}, "1599": {"acRate": 44.13767149064285, "difficulty": "Medium", "likes": 109, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "1599", "paidOnly": false, "title": "Maximum Profit of Operating a Centennial Wheel", "titleSlug": "maximum-profit-of-operating-a-centennial-wheel", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12901, "totalSubmissionRaw": 29229}, "1600": {"acRate": 65.52294039449575, "difficulty": "Medium", "likes": 292, "dislikes": 305, "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": 18237, "totalSubmissionRaw": 27833}, "1601": {"acRate": 64.51322697094963, "difficulty": "Hard", "likes": 1414, "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": 56651, "totalSubmissionRaw": 87813}, "1602": {"acRate": 75.44615384615385, "difficulty": "Medium", "likes": 329, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "1602", "paidOnly": true, "title": "Find Nearest Right Node in Binary Tree", "titleSlug": "find-nearest-right-node-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 23294, "totalSubmissionRaw": 30875}, "1603": {"acRate": 87.97558401028041, "difficulty": "Easy", "likes": 1946, "dislikes": 447, "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": 287535, "totalSubmissionRaw": 326835}, "1604": {"acRate": 45.847687007874015, "difficulty": "Medium", "likes": 309, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1604", "paidOnly": false, "title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "titleSlug": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37265, "totalSubmissionRaw": 81280}, "1605": {"acRate": 83.1372100993945, "difficulty": "Medium", "likes": 2117, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1605", "paidOnly": false, "title": "Find Valid Matrix Given Row and Column Sums", "titleSlug": "find-valid-matrix-given-row-and-column-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145539, "totalSubmissionRaw": 175057}, "1606": {"acRate": 43.61327633894896, "difficulty": "Hard", "likes": 609, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1606", "paidOnly": false, "title": "Find Servers That Handled Most Number of Requests", "titleSlug": "find-servers-that-handled-most-number-of-requests", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17345, "totalSubmissionRaw": 39770}, "1607": {"acRate": 54.329606742456406, "difficulty": "Easy", "likes": 132, "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": 34551, "totalSubmissionRaw": 63596}, "1608": {"acRate": 66.88838569676385, "difficulty": "Easy", "likes": 2196, "dislikes": 424, "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": 198506, "totalSubmissionRaw": 296772}, "1609": {"acRate": 65.86516355754073, "difficulty": "Medium", "likes": 1770, "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": 160437, "totalSubmissionRaw": 243584}, "1610": {"acRate": 37.418612864374396, "difficulty": "Hard", "likes": 578, "dislikes": 747, "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": 41321, "totalSubmissionRaw": 110429}, "1611": {"acRate": 74.03654153354633, "difficulty": "Hard", "likes": 921, "dislikes": 1024, "categoryTitle": "Algorithms", "frontendQuestionId": "1611", "paidOnly": false, "title": "Minimum One Bit Operations to Make Integers Zero", "titleSlug": "minimum-one-bit-operations-to-make-integers-zero", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59324, "totalSubmissionRaw": 80128}, "1612": {"acRate": 70.62937062937063, "difficulty": "Medium", "likes": 140, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1612", "paidOnly": true, "title": "Check If Two Expression Trees are Equivalent", "titleSlug": "check-if-two-expression-trees-are-equivalent", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7474, "totalSubmissionRaw": 10582}, "1613": {"acRate": 73.01509061954957, "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": 19257, "totalSubmissionRaw": 26374}, "1614": {"acRate": 83.88598349674697, "difficulty": "Easy", "likes": 2457, "dislikes": 503, "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": 357538, "totalSubmissionRaw": 426219}, "1615": {"acRate": 65.14135519782552, "difficulty": "Medium", "likes": 2350, "dislikes": 368, "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": 145232, "totalSubmissionRaw": 222949}, "1616": {"acRate": 30.999782287912144, "difficulty": "Medium", "likes": 735, "dislikes": 248, "categoryTitle": "Algorithms", "frontendQuestionId": "1616", "paidOnly": false, "title": "Split Two Strings to Make Palindrome", "titleSlug": "split-two-strings-to-make-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25630, "totalSubmissionRaw": 82678}, "1617": {"acRate": 66.25037707390649, "difficulty": "Hard", "likes": 541, "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": 10981, "totalSubmissionRaw": 16575}, "1618": {"acRate": 60.925110132158586, "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": 6915, "totalSubmissionRaw": 11350}, "1619": {"acRate": 68.75923679276498, "difficulty": "Easy", "likes": 499, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "1619", "paidOnly": false, "title": "Mean of Array After Removing Some Elements", "titleSlug": "mean-of-array-after-removing-some-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62344, "totalSubmissionRaw": 90670}, "1620": {"acRate": 38.01801801801802, "difficulty": "Medium", "likes": 79, "dislikes": 265, "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": 9073, "totalSubmissionRaw": 23865}, "1621": {"acRate": 43.64988315275122, "difficulty": "Medium", "likes": 461, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "1621", "paidOnly": false, "title": "Number of Sets of K Non-Overlapping Line Segments", "titleSlug": "number-of-sets-of-k-non-overlapping-line-segments", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10273, "totalSubmissionRaw": 23535}, "1622": {"acRate": 17.390384886507825, "difficulty": "Hard", "likes": 370, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1622", "paidOnly": false, "title": "Fancy Sequence", "titleSlug": "fancy-sequence", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12335, "totalSubmissionRaw": 70930}, "1623": {"acRate": 81.9791581861109, "difficulty": "Easy", "likes": 73, "dislikes": 138, "categoryTitle": "Database", "frontendQuestionId": "1623", "paidOnly": true, "title": "All Valid Triplets That Can Represent a Country", "titleSlug": "all-valid-triplets-that-can-represent-a-country", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20139, "totalSubmissionRaw": 24566}, "1624": {"acRate": 68.54332118924681, "difficulty": "Easy", "likes": 1341, "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": 156908, "totalSubmissionRaw": 228918}, "1625": {"acRate": 65.57158234660926, "difficulty": "Medium", "likes": 354, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "1625", "paidOnly": false, "title": "Lexicographically Smallest String After Applying Operations", "titleSlug": "lexicographically-smallest-string-after-applying-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15229, "totalSubmissionRaw": 23225}, "1626": {"acRate": 50.36231019004871, "difficulty": "Medium", "likes": 2946, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1626", "paidOnly": false, "title": "Best Team With No Conflicts", "titleSlug": "best-team-with-no-conflicts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84375, "totalSubmissionRaw": 167536}, "1627": {"acRate": 47.20741901776385, "difficulty": "Hard", "likes": 580, "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": 18071, "totalSubmissionRaw": 38280}, "1628": {"acRate": 82.54408681711678, "difficulty": "Medium", "likes": 536, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1628", "paidOnly": true, "title": "Design an Expression Tree With Evaluate Function", "titleSlug": "design-an-expression-tree-with-evaluate-function", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26774, "totalSubmissionRaw": 32436}, "1629": {"acRate": 59.098412107967356, "difficulty": "Easy", "likes": 764, "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": 101680, "totalSubmissionRaw": 172052}, "1630": {"acRate": 83.76897209305123, "difficulty": "Medium", "likes": 1819, "dislikes": 202, "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": 139250, "totalSubmissionRaw": 166231}, "1631": {"acRate": 60.019662890663405, "difficulty": "Medium", "likes": 5911, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "1631", "paidOnly": false, "title": "Path With Minimum Effort", "titleSlug": "path-with-minimum-effort", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274719, "totalSubmissionRaw": 457714}, "1632": {"acRate": 40.95516391197151, "difficulty": "Hard", "likes": 872, "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": 22425, "totalSubmissionRaw": 54755}, "1633": {"acRate": 56.656225210566355, "difficulty": "Easy", "likes": 683, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "1633", "paidOnly": false, "title": "Percentage of Users Attended a Contest", "titleSlug": "percentage-of-users-attended-a-contest", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209262, "totalSubmissionRaw": 369351}, "1634": {"acRate": 55.48870535470108, "difficulty": "Medium", "likes": 144, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1634", "paidOnly": true, "title": "Add Two Polynomials Represented as Linked Lists", "titleSlug": "add-two-polynomials-represented-as-linked-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10145, "totalSubmissionRaw": 18283}, "1635": {"acRate": 47.709713024282564, "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": 8645, "totalSubmissionRaw": 18120}, "1636": {"acRate": 79.76721453489733, "difficulty": "Easy", "likes": 3393, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1636", "paidOnly": false, "title": "Sort Array by Increasing Frequency", "titleSlug": "sort-array-by-increasing-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272555, "totalSubmissionRaw": 341688}, "1637": {"acRate": 87.40857471609385, "difficulty": "Easy", "likes": 933, "dislikes": 1724, "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": 174721, "totalSubmissionRaw": 199890}, "1638": {"acRate": 71.26836636609146, "difficulty": "Medium", "likes": 1152, "dislikes": 347, "categoryTitle": "Algorithms", "frontendQuestionId": "1638", "paidOnly": false, "title": "Count Substrings That Differ by One Character", "titleSlug": "count-substrings-that-differ-by-one-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31140, "totalSubmissionRaw": 43694}, "1639": {"acRate": 51.02607499867774, "difficulty": "Hard", "likes": 1572, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1639", "paidOnly": false, "title": "Number of Ways to Form a Target String Given a Dictionary", "titleSlug": "number-of-ways-to-form-a-target-string-given-a-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57885, "totalSubmissionRaw": 113442}, "1640": {"acRate": 56.60930112142146, "difficulty": "Easy", "likes": 900, "dislikes": 140, "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": 83090, "totalSubmissionRaw": 146778}, "1641": {"acRate": 78.53918495297806, "difficulty": "Medium", "likes": 3860, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1641", "paidOnly": false, "title": "Count Sorted Vowel Strings", "titleSlug": "count-sorted-vowel-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187904, "totalSubmissionRaw": 239249}, "1642": {"acRate": 49.804879946066485, "difficulty": "Medium", "likes": 5892, "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": 230493, "totalSubmissionRaw": 462792}, "1643": {"acRate": 48.250776823249865, "difficulty": "Hard", "likes": 549, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1643", "paidOnly": false, "title": "Kth Smallest Instructions", "titleSlug": "kth-smallest-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13199, "totalSubmissionRaw": 27355}, "1644": {"acRate": 64.82075037627993, "difficulty": "Medium", "likes": 637, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1644", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree II", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83117, "totalSubmissionRaw": 128226}, "1645": {"acRate": 39.12000468082616, "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": 6686, "totalSubmissionRaw": 17091}, "1646": {"acRate": 50.50629547495555, "difficulty": "Easy", "likes": 760, "dislikes": 944, "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": 110231, "totalSubmissionRaw": 218252}, "1647": {"acRate": 61.249244247979675, "difficulty": "Medium", "likes": 4931, "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": 276563, "totalSubmissionRaw": 451537}, "1648": {"acRate": 29.94890234670704, "difficulty": "Medium", "likes": 1076, "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": 37980, "totalSubmissionRaw": 126816}, "1649": {"acRate": 39.09578793299723, "difficulty": "Hard", "likes": 653, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1649", "paidOnly": false, "title": "Create Sorted Array through Instructions", "titleSlug": "create-sorted-array-through-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26444, "totalSubmissionRaw": 67639}, "1650": {"acRate": 80.11983544983008, "difficulty": "Medium", "likes": 1386, "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": 250848, "totalSubmissionRaw": 313092}, "1651": {"acRate": 65.16086172534877, "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": 6866, "totalSubmissionRaw": 10537}, "1652": {"acRate": 66.25892082972054, "difficulty": "Easy", "likes": 803, "dislikes": 95, "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": 49670, "totalSubmissionRaw": 74964}, "1653": {"acRate": 65.84298115674575, "difficulty": "Medium", "likes": 2064, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1653", "paidOnly": false, "title": "Minimum Deletions to Make String Balanced", "titleSlug": "minimum-deletions-to-make-string-balanced", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159124, "totalSubmissionRaw": 241673}, "1654": {"acRate": 29.507201110532712, "difficulty": "Medium", "likes": 1482, "dislikes": 269, "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": 44212, "totalSubmissionRaw": 149837}, "1655": {"acRate": 39.54449770473509, "difficulty": "Hard", "likes": 426, "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": 15592, "totalSubmissionRaw": 39429}, "1656": {"acRate": 84.33161368636674, "difficulty": "Easy", "likes": 527, "dislikes": 3491, "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": 88926, "totalSubmissionRaw": 105448}, "1657": {"acRate": 54.533307133032025, "difficulty": "Medium", "likes": 3690, "dislikes": 296, "categoryTitle": "Algorithms", "frontendQuestionId": "1657", "paidOnly": false, "title": "Determine if Two Strings Are Close", "titleSlug": "determine-if-two-strings-are-close", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 360774, "totalSubmissionRaw": 661563}, "1658": {"acRate": 39.75859911680615, "difficulty": "Medium", "likes": 5458, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1658", "paidOnly": false, "title": "Minimum Operations to Reduce X to Zero", "titleSlug": "minimum-operations-to-reduce-x-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 195103, "totalSubmissionRaw": 490717}, "1659": {"acRate": 39.67364661390854, "difficulty": "Hard", "likes": 330, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1659", "paidOnly": false, "title": "Maximize Grid Happiness", "titleSlug": "maximize-grid-happiness", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5665, "totalSubmissionRaw": 14279}, "1660": {"acRate": 74.40009012730482, "difficulty": "Medium", "likes": 267, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1660", "paidOnly": true, "title": "Correct a Binary Tree", "titleSlug": "correct-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19812, "totalSubmissionRaw": 26629}, "1661": {"acRate": 67.81485850890581, "difficulty": "Easy", "likes": 1369, "dislikes": 137, "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": 305232, "totalSubmissionRaw": 450097}, "1662": {"acRate": 85.55115076927254, "difficulty": "Easy", "likes": 2985, "dislikes": 200, "categoryTitle": "Algorithms", "frontendQuestionId": "1662", "paidOnly": false, "title": "Check If Two String Arrays are Equivalent", "titleSlug": "check-if-two-string-arrays-are-equivalent", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 504114, "totalSubmissionRaw": 589253}, "1663": {"acRate": 66.85506180621213, "difficulty": "Medium", "likes": 1873, "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": 95459, "totalSubmissionRaw": 142785}, "1664": {"acRate": 63.63897809519244, "difficulty": "Medium", "likes": 1313, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1664", "paidOnly": false, "title": "Ways to Make a Fair Array", "titleSlug": "ways-to-make-a-fair-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39831, "totalSubmissionRaw": 62589}, "1665": {"acRate": 58.26903831875262, "difficulty": "Hard", "likes": 577, "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": 18050, "totalSubmissionRaw": 30977}, "1666": {"acRate": 73.87644671576732, "difficulty": "Medium", "likes": 64, "dislikes": 189, "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": 4915, "totalSubmissionRaw": 6653}, "1667": {"acRate": 61.44833172926756, "difficulty": "Easy", "likes": 873, "dislikes": 107, "categoryTitle": "Database", "frontendQuestionId": "1667", "paidOnly": false, "title": "Fix Names in a Table", "titleSlug": "fix-names-in-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241975, "totalSubmissionRaw": 393785}, "1668": {"acRate": 38.853679270711666, "difficulty": "Easy", "likes": 700, "dislikes": 266, "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": 56217, "totalSubmissionRaw": 144689}, "1669": {"acRate": 81.68928235604565, "difficulty": "Medium", "likes": 2083, "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": 219794, "totalSubmissionRaw": 269061}, "1670": {"acRate": 56.4614423001797, "difficulty": "Medium", "likes": 747, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1670", "paidOnly": false, "title": "Design Front Middle Back Queue", "titleSlug": "design-front-middle-back-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28906, "totalSubmissionRaw": 51196}, "1671": {"acRate": 41.92598822539949, "difficulty": "Hard", "likes": 1588, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "1671", "paidOnly": false, "title": "Minimum Number of Removals to Make Mountain Array", "titleSlug": "minimum-number-of-removals-to-make-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31904, "totalSubmissionRaw": 76096}, "1672": {"acRate": 88.15428855575644, "difficulty": "Easy", "likes": 4359, "dislikes": 366, "categoryTitle": "Algorithms", "frontendQuestionId": "1672", "paidOnly": false, "title": "Richest Customer Wealth", "titleSlug": "richest-customer-wealth", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 914769, "totalSubmissionRaw": 1037691}, "1673": {"acRate": 50.604170878497115, "difficulty": "Medium", "likes": 2039, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1673", "paidOnly": false, "title": "Find the Most Competitive Subsequence", "titleSlug": "find-the-most-competitive-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65080, "totalSubmissionRaw": 128606}, "1674": {"acRate": 39.97208409665882, "difficulty": "Medium", "likes": 664, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1674", "paidOnly": false, "title": "Minimum Moves to Make Array Complementary", "titleSlug": "minimum-moves-to-make-array-complementary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9164, "totalSubmissionRaw": 22926}, "1675": {"acRate": 54.03890687498934, "difficulty": "Hard", "likes": 3034, "dislikes": 170, "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": 94975, "totalSubmissionRaw": 175753}, "1676": {"acRate": 78.58264145677806, "difficulty": "Medium", "likes": 473, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1676", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree IV", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iv", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45053, "totalSubmissionRaw": 57332}, "1677": {"acRate": 38.164591825493005, "difficulty": "Easy", "likes": 37, "dislikes": 134, "categoryTitle": "Database", "frontendQuestionId": "1677", "paidOnly": true, "title": "Product's Worth Over Invoices", "titleSlug": "products-worth-over-invoices", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17321, "totalSubmissionRaw": 45385}, "1678": {"acRate": 87.35247607157719, "difficulty": "Easy", "likes": 1571, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1678", "paidOnly": false, "title": "Goal Parser Interpretation", "titleSlug": "goal-parser-interpretation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 262382, "totalSubmissionRaw": 300371}, "1679": {"acRate": 55.134194484711195, "difficulty": "Medium", "likes": 3147, "dislikes": 89, "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": 324429, "totalSubmissionRaw": 588436}, "1680": {"acRate": 57.115831814467974, "difficulty": "Medium", "likes": 1420, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "1680", "paidOnly": false, "title": "Concatenation of Consecutive Binary Numbers", "titleSlug": "concatenation-of-consecutive-binary-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90877, "totalSubmissionRaw": 159110}, "1681": {"acRate": 38.89642082429501, "difficulty": "Hard", "likes": 276, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1681", "paidOnly": false, "title": "Minimum Incompatibility", "titleSlug": "minimum-incompatibility", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8607, "totalSubmissionRaw": 22128}, "1682": {"acRate": 50.09472259810555, "difficulty": "Medium", "likes": 149, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1682", "paidOnly": true, "title": "Longest Palindromic Subsequence II", "titleSlug": "longest-palindromic-subsequence-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5553, "totalSubmissionRaw": 11085}, "1683": {"acRate": 85.33205509367401, "difficulty": "Easy", "likes": 980, "dislikes": 363, "categoryTitle": "Database", "frontendQuestionId": "1683", "paidOnly": false, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 589241, "totalSubmissionRaw": 690527}, "1684": {"acRate": 83.4613477031139, "difficulty": "Easy", "likes": 1720, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1684", "paidOnly": false, "title": "Count the Number of Consistent Strings", "titleSlug": "count-the-number-of-consistent-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 186789, "totalSubmissionRaw": 223803}, "1685": {"acRate": 68.41520063253608, "difficulty": "Medium", "likes": 2063, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1685", "paidOnly": false, "title": "Sum of Absolute Differences in a Sorted Array", "titleSlug": "sum-of-absolute-differences-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110756, "totalSubmissionRaw": 161887}, "1686": {"acRate": 57.349107117826804, "difficulty": "Medium", "likes": 832, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1686", "paidOnly": false, "title": "Stone Game VI", "titleSlug": "stone-game-vi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20457, "totalSubmissionRaw": 35671}, "1687": {"acRate": 39.017735334242836, "difficulty": "Hard", "likes": 374, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1687", "paidOnly": false, "title": "Delivering Boxes from Storage to Ports", "titleSlug": "delivering-boxes-from-storage-to-ports", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6578, "totalSubmissionRaw": 16859}, "1688": {"acRate": 85.72263938717455, "difficulty": "Easy", "likes": 1758, "dislikes": 238, "categoryTitle": "Algorithms", "frontendQuestionId": "1688", "paidOnly": false, "title": "Count of Matches in Tournament", "titleSlug": "count-of-matches-in-tournament", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249212, "totalSubmissionRaw": 290719}, "1689": {"acRate": 88.73356242113533, "difficulty": "Medium", "likes": 2415, "dislikes": 1491, "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": 223621, "totalSubmissionRaw": 252014}, "1690": {"acRate": 58.09305216850763, "difficulty": "Medium", "likes": 987, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "1690", "paidOnly": false, "title": "Stone Game VII", "titleSlug": "stone-game-vii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36447, "totalSubmissionRaw": 62739}, "1691": {"acRate": 57.934235976789175, "difficulty": "Hard", "likes": 1154, "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": 29952, "totalSubmissionRaw": 51700}, "1692": {"acRate": 62.580491295015506, "difficulty": "Hard", "likes": 73, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "1692", "paidOnly": true, "title": "Count Ways to Distribute Candies", "titleSlug": "count-ways-to-distribute-candies", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2624, "totalSubmissionRaw": 4193}, "1693": {"acRate": 86.56958035720184, "difficulty": "Easy", "likes": 552, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1693", "paidOnly": false, "title": "Daily Leads and Partners", "titleSlug": "daily-leads-and-partners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131016, "totalSubmissionRaw": 151342}, "1694": {"acRate": 65.96079481728242, "difficulty": "Easy", "likes": 349, "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": 39403, "totalSubmissionRaw": 59737}, "1695": {"acRate": 58.40933286018453, "difficulty": "Medium", "likes": 2799, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1695", "paidOnly": false, "title": "Maximum Erasure Value", "titleSlug": "maximum-erasure-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131678, "totalSubmissionRaw": 225440}, "1696": {"acRate": 45.66327600231448, "difficulty": "Medium", "likes": 3411, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "1696", "paidOnly": false, "title": "Jump Game VI", "titleSlug": "jump-game-vi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108906, "totalSubmissionRaw": 238498}, "1697": {"acRate": 62.52876904813819, "difficulty": "Hard", "likes": 1962, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1697", "paidOnly": false, "title": "Checking Existence of Edge Length Limited Paths", "titleSlug": "checking-existence-of-edge-length-limited-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51620, "totalSubmissionRaw": 82554}, "1698": {"acRate": 64.19653644784535, "difficulty": "Medium", "likes": 194, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1698", "paidOnly": true, "title": "Number of Distinct Substrings in a String", "titleSlug": "number-of-distinct-substrings-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11158, "totalSubmissionRaw": 17381}, "1699": {"acRate": 81.19012075058107, "difficulty": "Medium", "likes": 292, "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": 42965, "totalSubmissionRaw": 52919}, "1700": {"acRate": 78.2977922690859, "difficulty": "Easy", "likes": 2398, "dislikes": 237, "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": 253825, "totalSubmissionRaw": 324179}, "1701": {"acRate": 73.05671405294707, "difficulty": "Medium", "likes": 1206, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "1701", "paidOnly": false, "title": "Average Waiting Time", "titleSlug": "average-waiting-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 195491, "totalSubmissionRaw": 267588}, "1702": {"acRate": 46.92459972910083, "difficulty": "Medium", "likes": 494, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1702", "paidOnly": false, "title": "Maximum Binary String After Change", "titleSlug": "maximum-binary-string-after-change", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13511, "totalSubmissionRaw": 28793}, "1703": {"acRate": 42.659823382896825, "difficulty": "Hard", "likes": 713, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1703", "paidOnly": false, "title": "Minimum Adjacent Swaps for K Consecutive Ones", "titleSlug": "minimum-adjacent-swaps-for-k-consecutive-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11304, "totalSubmissionRaw": 26498}, "1704": {"acRate": 78.65511538570486, "difficulty": "Easy", "likes": 2245, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "1704", "paidOnly": false, "title": "Determine if String Halves Are Alike", "titleSlug": "determine-if-string-halves-are-alike", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 360979, "totalSubmissionRaw": 458939}, "1705": {"acRate": 39.31663858255893, "difficulty": "Medium", "likes": 831, "dislikes": 186, "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": 23566, "totalSubmissionRaw": 59939}, "1706": {"acRate": 71.84588943578896, "difficulty": "Medium", "likes": 3089, "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": 141295, "totalSubmissionRaw": 196664}, "1707": {"acRate": 51.211509853070034, "difficulty": "Hard", "likes": 1220, "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": 25130, "totalSubmissionRaw": 49071}, "1708": {"acRate": 64.9268219832736, "difficulty": "Easy", "likes": 103, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1708", "paidOnly": true, "title": "Largest Subarray Length K", "titleSlug": "largest-subarray-length-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8695, "totalSubmissionRaw": 13392}, "1709": {"acRate": 70.47837869683045, "difficulty": "Medium", "likes": 209, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "1709", "paidOnly": true, "title": "Biggest Window Between Visits", "titleSlug": "biggest-window-between-visits", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23926, "totalSubmissionRaw": 33948}, "1710": {"acRate": 73.73484898740536, "difficulty": "Easy", "likes": 3827, "dislikes": 222, "categoryTitle": "Algorithms", "frontendQuestionId": "1710", "paidOnly": false, "title": "Maximum Units on a Truck", "titleSlug": "maximum-units-on-a-truck", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 311219, "totalSubmissionRaw": 422078}, "1711": {"acRate": 30.41429893461618, "difficulty": "Medium", "likes": 1044, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1711", "paidOnly": false, "title": "Count Good Meals", "titleSlug": "count-good-meals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39767, "totalSubmissionRaw": 130751}, "1712": {"acRate": 33.002540489044144, "difficulty": "Medium", "likes": 1403, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1712", "paidOnly": false, "title": "Ways to Split Array Into Three Subarrays", "titleSlug": "ways-to-split-array-into-three-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33256, "totalSubmissionRaw": 100768}, "1713": {"acRate": 47.718741534770324, "difficulty": "Hard", "likes": 717, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1713", "paidOnly": false, "title": "Minimum Operations to Make a Subsequence", "titleSlug": "minimum-operations-to-make-a-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12331, "totalSubmissionRaw": 25841}, "1714": {"acRate": 49.61294862772696, "difficulty": "Hard", "likes": 31, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1714", "paidOnly": true, "title": "Sum Of Special Evenly-Spaced Elements In Array", "titleSlug": "sum-of-special-evenly-spaced-elements-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1410, "totalSubmissionRaw": 2842}, "1715": {"acRate": 75.54604060425287, "difficulty": "Medium", "likes": 82, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1715", "paidOnly": true, "title": "Count Apples and Oranges", "titleSlug": "count-apples-and-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15703, "totalSubmissionRaw": 20786}, "1716": {"acRate": 78.34437726723095, "difficulty": "Easy", "likes": 1433, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1716", "paidOnly": false, "title": "Calculate Money in Leetcode Bank", "titleSlug": "calculate-money-in-leetcode-bank", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161977, "totalSubmissionRaw": 206750}, "1717": {"acRate": 63.071878586317546, "difficulty": "Medium", "likes": 1399, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "1717", "paidOnly": false, "title": "Maximum Score From Removing Substrings", "titleSlug": "maximum-score-from-removing-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134649, "totalSubmissionRaw": 213484}, "1718": {"acRate": 53.80504813158493, "difficulty": "Medium", "likes": 564, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1718", "paidOnly": false, "title": "Construct the Lexicographically Largest Valid Sequence", "titleSlug": "construct-the-lexicographically-largest-valid-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14197, "totalSubmissionRaw": 26386}, "1719": {"acRate": 44.567734465457356, "difficulty": "Hard", "likes": 218, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "1719", "paidOnly": false, "title": "Number Of Ways To Reconstruct A Tree", "titleSlug": "number-of-ways-to-reconstruct-a-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4619, "totalSubmissionRaw": 10364}, "1720": {"acRate": 86.4991396028516, "difficulty": "Easy", "likes": 1592, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "1720", "paidOnly": false, "title": "Decode XORed Array", "titleSlug": "decode-xored-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 158341, "totalSubmissionRaw": 183055}, "1721": {"acRate": 68.02357874314502, "difficulty": "Medium", "likes": 5352, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "1721", "paidOnly": false, "title": "Swapping Nodes in a Linked List", "titleSlug": "swapping-nodes-in-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 347810, "totalSubmissionRaw": 511308}, "1722": {"acRate": 48.85286915788353, "difficulty": "Medium", "likes": 838, "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": 18355, "totalSubmissionRaw": 37572}, "1723": {"acRate": 42.48810025908297, "difficulty": "Hard", "likes": 1045, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1723", "paidOnly": false, "title": "Find Minimum Time to Finish All Jobs", "titleSlug": "find-minimum-time-to-finish-all-jobs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28207, "totalSubmissionRaw": 66388}, "1724": {"acRate": 51.421319796954315, "difficulty": "Hard", "likes": 105, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1724", "paidOnly": true, "title": "Checking Existence of Edge Length Limited Paths II", "titleSlug": "checking-existence-of-edge-length-limited-paths-ii", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3039, "totalSubmissionRaw": 5910}, "1725": {"acRate": 78.7818849978383, "difficulty": "Easy", "likes": 589, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1725", "paidOnly": false, "title": "Number Of Rectangles That Can Form The Largest Square", "titleSlug": "number-of-rectangles-that-can-form-the-largest-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72889, "totalSubmissionRaw": 92520}, "1726": {"acRate": 61.17810860019278, "difficulty": "Medium", "likes": 626, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1726", "paidOnly": false, "title": "Tuple with Same Product", "titleSlug": "tuple-with-same-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28561, "totalSubmissionRaw": 46685}, "1727": {"acRate": 75.3825564627403, "difficulty": "Medium", "likes": 1912, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "1727", "paidOnly": false, "title": "Largest Submatrix With Rearrangements", "titleSlug": "largest-submatrix-with-rearrangements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72662, "totalSubmissionRaw": 96391}, "1728": {"acRate": 39.97485514376298, "difficulty": "Hard", "likes": 270, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1728", "paidOnly": false, "title": "Cat and Mouse II", "titleSlug": "cat-and-mouse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7313, "totalSubmissionRaw": 18294}, "1729": {"acRate": 69.13957661964243, "difficulty": "Easy", "likes": 574, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1729", "paidOnly": false, "title": "Find Followers Count", "titleSlug": "find-followers-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 213047, "totalSubmissionRaw": 308140}, "1730": {"acRate": 54.98839325974048, "difficulty": "Medium", "likes": 674, "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": 65853, "totalSubmissionRaw": 119758}, "1731": {"acRate": 48.72761545711593, "difficulty": "Easy", "likes": 532, "dislikes": 72, "categoryTitle": "Database", "frontendQuestionId": "1731", "paidOnly": false, "title": "The Number of Employees Which Report to Each Employee", "titleSlug": "the-number-of-employees-which-report-to-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148379, "totalSubmissionRaw": 304507}, "1732": {"acRate": 83.39032759366079, "difficulty": "Easy", "likes": 2885, "dislikes": 343, "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": 428204, "totalSubmissionRaw": 513492}, "1733": {"acRate": 42.68027512757932, "difficulty": "Medium", "likes": 215, "dislikes": 397, "categoryTitle": "Algorithms", "frontendQuestionId": "1733", "paidOnly": false, "title": "Minimum Number of People to Teach", "titleSlug": "minimum-number-of-people-to-teach", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9618, "totalSubmissionRaw": 22535}, "1734": {"acRate": 64.85892116182572, "difficulty": "Medium", "likes": 763, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1734", "paidOnly": false, "title": "Decode XORed Permutation", "titleSlug": "decode-xored-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15631, "totalSubmissionRaw": 24100}, "1735": {"acRate": 51.81211455605306, "difficulty": "Hard", "likes": 290, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1735", "paidOnly": false, "title": "Count Ways to Make Array With Product", "titleSlug": "count-ways-to-make-array-with-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6133, "totalSubmissionRaw": 11837}, "1736": {"acRate": 42.77718519538015, "difficulty": "Easy", "likes": 367, "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": 37296, "totalSubmissionRaw": 87187}, "1737": {"acRate": 36.74036806566927, "difficulty": "Medium", "likes": 323, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "1737", "paidOnly": false, "title": "Change Minimum Characters to Satisfy One of Three Conditions", "titleSlug": "change-minimum-characters-to-satisfy-one-of-three-conditions", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13875, "totalSubmissionRaw": 37765}, "1738": {"acRate": 61.826774219832146, "difficulty": "Medium", "likes": 507, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1738", "paidOnly": false, "title": "Find Kth Largest XOR Coordinate Value", "titleSlug": "find-kth-largest-xor-coordinate-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22764, "totalSubmissionRaw": 36819}, "1739": {"acRate": 51.85570586194936, "difficulty": "Hard", "likes": 306, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1739", "paidOnly": false, "title": "Building Boxes", "titleSlug": "building-boxes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7475, "totalSubmissionRaw": 14415}, "1740": {"acRate": 73.56359934660638, "difficulty": "Medium", "likes": 460, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1740", "paidOnly": true, "title": "Find Distance in a Binary Tree", "titleSlug": "find-distance-in-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31074, "totalSubmissionRaw": 42241}, "1741": {"acRate": 86.84271668949324, "difficulty": "Easy", "likes": 713, "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": 142032, "totalSubmissionRaw": 163551}, "1742": {"acRate": 73.54670586663103, "difficulty": "Easy", "likes": 605, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "1742", "paidOnly": false, "title": "Maximum Number of Balls in a Box", "titleSlug": "maximum-number-of-balls-in-a-box", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66040, "totalSubmissionRaw": 89794}, "1743": {"acRate": 74.75789851768964, "difficulty": "Medium", "likes": 1949, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1743", "paidOnly": false, "title": "Restore the Array From Adjacent Pairs", "titleSlug": "restore-the-array-from-adjacent-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108230, "totalSubmissionRaw": 144774}, "1744": {"acRate": 34.289669057505975, "difficulty": "Medium", "likes": 131, "dislikes": 328, "categoryTitle": "Algorithms", "frontendQuestionId": "1744", "paidOnly": false, "title": "Can You Eat Your Favorite Candy on Your Favorite Day?", "titleSlug": "can-you-eat-your-favorite-candy-on-your-favorite-day", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10900, "totalSubmissionRaw": 31788}, "1745": {"acRate": 44.35084927526205, "difficulty": "Hard", "likes": 914, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1745", "paidOnly": false, "title": "Palindrome Partitioning IV", "titleSlug": "palindrome-partitioning-iv", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25641, "totalSubmissionRaw": 57814}, "1746": {"acRate": 62.33371598352353, "difficulty": "Medium", "likes": 275, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1746", "paidOnly": true, "title": "Maximum Subarray Sum After One Operation", "titleSlug": "maximum-subarray-sum-after-one-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9231, "totalSubmissionRaw": 14809}, "1747": {"acRate": 63.45584045584045, "difficulty": "Medium", "likes": 185, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1747", "paidOnly": true, "title": "Leetflex Banned Accounts", "titleSlug": "leetflex-banned-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22273, "totalSubmissionRaw": 35100}, "1748": {"acRate": 78.00973735344846, "difficulty": "Easy", "likes": 1546, "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": 178654, "totalSubmissionRaw": 229015}, "1749": {"acRate": 60.28244252279904, "difficulty": "Medium", "likes": 1272, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1749", "paidOnly": false, "title": "Maximum Absolute Sum of Any Subarray", "titleSlug": "maximum-absolute-sum-of-any-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40851, "totalSubmissionRaw": 67766}, "1750": {"acRate": 55.92068506648518, "difficulty": "Medium", "likes": 1214, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1750", "paidOnly": false, "title": "Minimum Length of String After Deleting Similar Ends", "titleSlug": "minimum-length-of-string-after-deleting-similar-ends", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165150, "totalSubmissionRaw": 295329}, "1751": {"acRate": 61.52198256974536, "difficulty": "Hard", "likes": 2073, "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": 75816, "totalSubmissionRaw": 123234}, "1752": {"acRate": 51.3115687419737, "difficulty": "Easy", "likes": 3179, "dislikes": 174, "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": 278489, "totalSubmissionRaw": 542741}, "1753": {"acRate": 67.4185902228727, "difficulty": "Medium", "likes": 944, "dislikes": 56, "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": 42380, "totalSubmissionRaw": 62861}, "1754": {"acRate": 48.52363217350151, "difficulty": "Medium", "likes": 545, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1754", "paidOnly": false, "title": "Largest Merge Of Two Strings", "titleSlug": "largest-merge-of-two-strings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23582, "totalSubmissionRaw": 48599}, "1755": {"acRate": 39.65431886179212, "difficulty": "Hard", "likes": 894, "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": 18423, "totalSubmissionRaw": 46459}, "1756": {"acRate": 75.76383509768483, "difficulty": "Medium", "likes": 288, "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": 17606, "totalSubmissionRaw": 23238}, "1757": {"acRate": 89.22399669591272, "difficulty": "Easy", "likes": 2366, "dislikes": 106, "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": 1170897, "totalSubmissionRaw": 1312312}, "1758": {"acRate": 63.7534542314335, "difficulty": "Easy", "likes": 1424, "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": 147653, "totalSubmissionRaw": 231599}, "1759": {"acRate": 57.65101254750712, "difficulty": "Medium", "likes": 1481, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1759", "paidOnly": false, "title": "Count Number of Homogenous Substrings", "titleSlug": "count-number-of-homogenous-substrings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112706, "totalSubmissionRaw": 195497}, "1760": {"acRate": 60.30902440844965, "difficulty": "Medium", "likes": 1989, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1760", "paidOnly": false, "title": "Minimum Limit of Balls in a Bag", "titleSlug": "minimum-limit-of-balls-in-a-bag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40398, "totalSubmissionRaw": 66985}, "1761": {"acRate": 42.47741141108516, "difficulty": "Hard", "likes": 322, "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": 23459, "totalSubmissionRaw": 55227}, "1762": {"acRate": 79.8501658146129, "difficulty": "Medium", "likes": 1211, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1762", "paidOnly": true, "title": "Buildings With an Ocean View", "titleSlug": "buildings-with-an-ocean-view", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 225848, "totalSubmissionRaw": 282841}, "1763": {"acRate": 60.69782194967224, "difficulty": "Easy", "likes": 1337, "dislikes": 884, "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": 57408, "totalSubmissionRaw": 94580}, "1764": {"acRate": 53.65451301215366, "difficulty": "Medium", "likes": 330, "dislikes": 42, "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": 15937, "totalSubmissionRaw": 29703}, "1765": {"acRate": 62.80078808137605, "difficulty": "Medium", "likes": 826, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1765", "paidOnly": false, "title": "Map of Highest Peak", "titleSlug": "map-of-highest-peak", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28369, "totalSubmissionRaw": 45173}, "1766": {"acRate": 41.19578152570889, "difficulty": "Hard", "likes": 401, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1766", "paidOnly": false, "title": "Tree of Coprimes", "titleSlug": "tree-of-coprimes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10039, "totalSubmissionRaw": 24369}, "1767": {"acRate": 77.30126136696978, "difficulty": "Hard", "likes": 172, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1767", "paidOnly": true, "title": "Find the Subtasks That Did Not Execute", "titleSlug": "find-the-subtasks-that-did-not-execute", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13176, "totalSubmissionRaw": 17045}, "1768": {"acRate": 80.41449110247105, "difficulty": "Easy", "likes": 3880, "dislikes": 97, "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": 969765, "totalSubmissionRaw": 1205958}, "1769": {"acRate": 85.94332218770816, "difficulty": "Medium", "likes": 2248, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1769", "paidOnly": false, "title": "Minimum Number of Operations to Move All Balls to Each Box", "titleSlug": "minimum-number-of-operations-to-move-all-balls-to-each-box", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130315, "totalSubmissionRaw": 151629}, "1770": {"acRate": 40.60582698917477, "difficulty": "Hard", "likes": 2519, "dislikes": 511, "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": 113769, "totalSubmissionRaw": 280179}, "1771": {"acRate": 36.45717198101487, "difficulty": "Hard", "likes": 539, "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": 11445, "totalSubmissionRaw": 31393}, "1772": {"acRate": 65.80823667127807, "difficulty": "Medium", "likes": 89, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1772", "paidOnly": true, "title": "Sort Features by Popularity", "titleSlug": "sort-features-by-popularity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6184, "totalSubmissionRaw": 9397}, "1773": {"acRate": 85.03246658281903, "difficulty": "Easy", "likes": 1885, "dislikes": 226, "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": 232571, "totalSubmissionRaw": 273507}, "1774": {"acRate": 47.59891549101604, "difficulty": "Medium", "likes": 705, "dislikes": 87, "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": 31074, "totalSubmissionRaw": 65283}, "1775": {"acRate": 53.742254153569824, "difficulty": "Medium", "likes": 919, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1775", "paidOnly": false, "title": "Equal Sum Arrays With Minimum Number of Operations", "titleSlug": "equal-sum-arrays-with-minimum-number-of-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29921, "totalSubmissionRaw": 55675}, "1776": {"acRate": 55.38962402856543, "difficulty": "Hard", "likes": 891, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1776", "paidOnly": false, "title": "Car Fleet II", "titleSlug": "car-fleet-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26371, "totalSubmissionRaw": 47610}, "1777": {"acRate": 82.23420162115369, "difficulty": "Easy", "likes": 134, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1777", "paidOnly": true, "title": "Product's Price for Each Store", "titleSlug": "products-price-for-each-store", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20899, "totalSubmissionRaw": 25414}, "1778": {"acRate": 40.09445939769438, "difficulty": "Medium", "likes": 166, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1778", "paidOnly": true, "title": "Shortest Path in a Hidden Grid", "titleSlug": "shortest-path-in-a-hidden-grid", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7894, "totalSubmissionRaw": 19690}, "1779": {"acRate": 68.64228642757467, "difficulty": "Easy", "likes": 844, "dislikes": 186, "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": 116580, "totalSubmissionRaw": 169837}, "1780": {"acRate": 67.9294077081015, "difficulty": "Medium", "likes": 973, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1780", "paidOnly": false, "title": "Check if Number is a Sum of Powers of Three", "titleSlug": "check-if-number-is-a-sum-of-powers-of-three", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43341, "totalSubmissionRaw": 63803}, "1781": {"acRate": 66.93836956639244, "difficulty": "Medium", "likes": 1110, "dislikes": 176, "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": 61920, "totalSubmissionRaw": 92503}, "1782": {"acRate": 40.28980487241658, "difficulty": "Hard", "likes": 314, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "1782", "paidOnly": false, "title": "Count Pairs Of Nodes", "titleSlug": "count-pairs-of-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6979, "totalSubmissionRaw": 17322}, "1783": {"acRate": 83.59392703376388, "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": 25823, "totalSubmissionRaw": 30891}, "1784": {"acRate": 39.16340829768809, "difficulty": "Easy", "likes": 336, "dislikes": 965, "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": 44772, "totalSubmissionRaw": 114321}, "1785": {"acRate": 43.59871855719032, "difficulty": "Medium", "likes": 264, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1785", "paidOnly": false, "title": "Minimum Elements to Add to Form a Given Sum", "titleSlug": "minimum-elements-to-add-to-form-a-given-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22047, "totalSubmissionRaw": 50568}, "1786": {"acRate": 39.22035971335831, "difficulty": "Medium", "likes": 1093, "dislikes": 210, "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": 25011, "totalSubmissionRaw": 63771}, "1787": {"acRate": 39.76160694577294, "difficulty": "Hard", "likes": 401, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1787", "paidOnly": false, "title": "Make the XOR of All Segments Equal to Zero", "titleSlug": "make-the-xor-of-all-segments-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5404, "totalSubmissionRaw": 13591}, "1788": {"acRate": 67.02973211657344, "difficulty": "Hard", "likes": 75, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1788", "paidOnly": true, "title": "Maximize the Beauty of the Garden", "titleSlug": "maximize-the-beauty-of-the-garden", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2277, "totalSubmissionRaw": 3397}, "1789": {"acRate": 64.56904235941558, "difficulty": "Easy", "likes": 505, "dislikes": 219, "categoryTitle": "Database", "frontendQuestionId": "1789", "paidOnly": false, "title": "Primary Department for Each Employee", "titleSlug": "primary-department-for-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133280, "totalSubmissionRaw": 206414}, "1790": {"acRate": 45.74388642704743, "difficulty": "Easy", "likes": 1091, "dislikes": 58, "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": 111486, "totalSubmissionRaw": 243718}, "1791": {"acRate": 86.67917830614131, "difficulty": "Easy", "likes": 1794, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1791", "paidOnly": false, "title": "Find Center of Star Graph", "titleSlug": "find-center-of-star-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 340385, "totalSubmissionRaw": 392695}, "1792": {"acRate": 54.043568364740466, "difficulty": "Medium", "likes": 726, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1792", "paidOnly": false, "title": "Maximum Average Pass Ratio", "titleSlug": "maximum-average-pass-ratio", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22427, "totalSubmissionRaw": 41498}, "1793": {"acRate": 64.31057426553383, "difficulty": "Hard", "likes": 1853, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1793", "paidOnly": false, "title": "Maximum Score of a Good Subarray", "titleSlug": "maximum-score-of-a-good-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75390, "totalSubmissionRaw": 117228}, "1794": {"acRate": 65.26143790849673, "difficulty": "Medium", "likes": 44, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1794", "paidOnly": true, "title": "Count Pairs of Equal Substrings With Minimum Difference", "titleSlug": "count-pairs-of-equal-substrings-with-minimum-difference", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1997, "totalSubmissionRaw": 3060}, "1795": {"acRate": 85.29056111628142, "difficulty": "Easy", "likes": 855, "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": 134719, "totalSubmissionRaw": 157953}, "1796": {"acRate": 50.55675150901187, "difficulty": "Easy", "likes": 527, "dislikes": 130, "categoryTitle": "Algorithms", "frontendQuestionId": "1796", "paidOnly": false, "title": "Second Largest Digit in a String", "titleSlug": "second-largest-digit-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59887, "totalSubmissionRaw": 118455}, "1797": {"acRate": 57.59522971796819, "difficulty": "Medium", "likes": 374, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1797", "paidOnly": false, "title": "Design Authentication Manager", "titleSlug": "design-authentication-manager", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31102, "totalSubmissionRaw": 54001}, "1798": {"acRate": 60.99450884685784, "difficulty": "Medium", "likes": 813, "dislikes": 58, "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": 19994, "totalSubmissionRaw": 32780}, "1799": {"acRate": 57.76627775686865, "difficulty": "Hard", "likes": 1630, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1799", "paidOnly": false, "title": "Maximize Score After N Operations", "titleSlug": "maximize-score-after-n-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61394, "totalSubmissionRaw": 106280}, "1800": {"acRate": 62.01026835335839, "difficulty": "Easy", "likes": 721, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1800", "paidOnly": false, "title": "Maximum Ascending Subarray Sum", "titleSlug": "maximum-ascending-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58577, "totalSubmissionRaw": 94464}, "1801": {"acRate": 49.851604526061955, "difficulty": "Medium", "likes": 291, "dislikes": 236, "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": 21500, "totalSubmissionRaw": 43128}, "1802": {"acRate": 39.22123590205412, "difficulty": "Medium", "likes": 2543, "dislikes": 446, "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": 73168, "totalSubmissionRaw": 186552}, "1803": {"acRate": 48.09028658381943, "difficulty": "Hard", "likes": 527, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1803", "paidOnly": false, "title": "Count Pairs With XOR in a Range", "titleSlug": "count-pairs-with-xor-in-a-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9481, "totalSubmissionRaw": 19715}, "1804": {"acRate": 61.503117820807354, "difficulty": "Medium", "likes": 319, "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": 18740, "totalSubmissionRaw": 30470}, "1805": {"acRate": 38.06707637194651, "difficulty": "Easy", "likes": 612, "dislikes": 100, "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": 49306, "totalSubmissionRaw": 129524}, "1806": {"acRate": 72.79309174554093, "difficulty": "Medium", "likes": 317, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "1806", "paidOnly": false, "title": "Minimum Number of Operations to Reinitialize a Permutation", "titleSlug": "minimum-number-of-operations-to-reinitialize-a-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19304, "totalSubmissionRaw": 26519}, "1807": {"acRate": 67.02551151442513, "difficulty": "Medium", "likes": 482, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1807", "paidOnly": false, "title": "Evaluate the Bracket Pairs of a String", "titleSlug": "evaluate-the-bracket-pairs-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31317, "totalSubmissionRaw": 46724}, "1808": {"acRate": 33.1529030765672, "difficulty": "Hard", "likes": 224, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "1808", "paidOnly": false, "title": "Maximize Number of Nice Divisors", "titleSlug": "maximize-number-of-nice-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7166, "totalSubmissionRaw": 21615}, "1809": {"acRate": 58.57548612628359, "difficulty": "Easy", "likes": 89, "dislikes": 61, "categoryTitle": "Database", "frontendQuestionId": "1809", "paidOnly": true, "title": "Ad-Free Sessions", "titleSlug": "ad-free-sessions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16086, "totalSubmissionRaw": 27462}, "1810": {"acRate": 56.71796645339789, "difficulty": "Medium", "likes": 86, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1810", "paidOnly": true, "title": "Minimum Path Cost in a Hidden Grid", "titleSlug": "minimum-path-cost-in-a-hidden-grid", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3280, "totalSubmissionRaw": 5783}, "1811": {"acRate": 60.97144630664184, "difficulty": "Medium", "likes": 197, "dislikes": 26, "categoryTitle": "Database", "frontendQuestionId": "1811", "paidOnly": true, "title": "Find Interview Candidates", "titleSlug": "find-interview-candidates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15716, "totalSubmissionRaw": 25776}, "1812": {"acRate": 78.61018536370396, "difficulty": "Easy", "likes": 811, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1812", "paidOnly": false, "title": "Determine Color of a Chessboard Square", "titleSlug": "determine-color-of-a-chessboard-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85623, "totalSubmissionRaw": 108921}, "1813": {"acRate": 33.558276294225394, "difficulty": "Medium", "likes": 403, "dislikes": 68, "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": 17405, "totalSubmissionRaw": 51865}, "1814": {"acRate": 48.74241915235957, "difficulty": "Medium", "likes": 1822, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1814", "paidOnly": false, "title": "Count Nice Pairs in an Array", "titleSlug": "count-nice-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110269, "totalSubmissionRaw": 226228}, "1815": {"acRate": 39.984453480028705, "difficulty": "Hard", "likes": 341, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1815", "paidOnly": false, "title": "Maximum Number of Groups Getting Fresh Donuts", "titleSlug": "maximum-number-of-groups-getting-fresh-donuts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6687, "totalSubmissionRaw": 16724}, "1816": {"acRate": 85.42609477702618, "difficulty": "Easy", "likes": 1138, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1816", "paidOnly": false, "title": "Truncate Sentence", "titleSlug": "truncate-sentence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 178573, "totalSubmissionRaw": 209038}, "1817": {"acRate": 80.5135849312284, "difficulty": "Medium", "likes": 827, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "1817", "paidOnly": false, "title": "Finding the Users Active Minutes", "titleSlug": "finding-the-users-active-minutes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59415, "totalSubmissionRaw": 73795}, "1818": {"acRate": 30.74766691025841, "difficulty": "Medium", "likes": 1021, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1818", "paidOnly": false, "title": "Minimum Absolute Sum Difference", "titleSlug": "minimum-absolute-sum-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25666, "totalSubmissionRaw": 83473}, "1819": {"acRate": 40.9395092507545, "difficulty": "Hard", "likes": 412, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1819", "paidOnly": false, "title": "Number of Different Subsequences GCDs", "titleSlug": "number-of-different-subsequences-gcds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9360, "totalSubmissionRaw": 22863}, "1820": {"acRate": 50.17334712000486, "difficulty": "Medium", "likes": 214, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1820", "paidOnly": true, "title": "Maximum Number of Accepted Invitations", "titleSlug": "maximum-number-of-accepted-invitations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8249, "totalSubmissionRaw": 16441}, "1821": {"acRate": 87.81164395436734, "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": 25324, "totalSubmissionRaw": 28839}, "1822": {"acRate": 65.30821911352484, "difficulty": "Easy", "likes": 2158, "dislikes": 217, "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": 346449, "totalSubmissionRaw": 530483}, "1823": {"acRate": 81.72718139047723, "difficulty": "Medium", "likes": 3764, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "1823", "paidOnly": false, "title": "Find the Winner of the Circular Game", "titleSlug": "find-the-winner-of-the-circular-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 287145, "totalSubmissionRaw": 351346}, "1824": {"acRate": 50.18362226277372, "difficulty": "Medium", "likes": 1189, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1824", "paidOnly": false, "title": "Minimum Sideway Jumps", "titleSlug": "minimum-sideway-jumps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44001, "totalSubmissionRaw": 87680}, "1825": {"acRate": 37.22874287655206, "difficulty": "Hard", "likes": 449, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1825", "paidOnly": false, "title": "Finding MK Average", "titleSlug": "finding-mk-average", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19728, "totalSubmissionRaw": 52987}, "1826": {"acRate": 50.02061005770816, "difficulty": "Easy", "likes": 67, "dislikes": 75, "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": 4854, "totalSubmissionRaw": 9704}, "1827": {"acRate": 80.0410475069208, "difficulty": "Easy", "likes": 1232, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1827", "paidOnly": false, "title": "Minimum Operations to Make the Array Increasing", "titleSlug": "minimum-operations-to-make-the-array-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 100617, "totalSubmissionRaw": 125707}, "1828": {"acRate": 86.35881510317, "difficulty": "Medium", "likes": 1142, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1828", "paidOnly": false, "title": "Queries on Number of Points Inside a Circle", "titleSlug": "queries-on-number-of-points-inside-a-circle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78976, "totalSubmissionRaw": 91451}, "1829": {"acRate": 77.15749039692702, "difficulty": "Medium", "likes": 773, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1829", "paidOnly": false, "title": "Maximum XOR for Each Query", "titleSlug": "maximum-xor-for-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30130, "totalSubmissionRaw": 39050}, "1830": {"acRate": 50.13447432762837, "difficulty": "Hard", "likes": 179, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1830", "paidOnly": false, "title": "Minimum Number of Operations to Make String Sorted", "titleSlug": "minimum-number-of-operations-to-make-string-sorted", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4101, "totalSubmissionRaw": 8180}, "1831": {"acRate": 81.75759582746916, "difficulty": "Medium", "likes": 87, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "1831", "paidOnly": true, "title": "Maximum Transaction Each Day", "titleSlug": "maximum-transaction-each-day", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19750, "totalSubmissionRaw": 24157}, "1832": {"acRate": 83.32815605636303, "difficulty": "Easy", "likes": 2761, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1832", "paidOnly": false, "title": "Check if the Sentence Is Pangram", "titleSlug": "check-if-the-sentence-is-pangram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 356770, "totalSubmissionRaw": 428151}, "1833": {"acRate": 73.84319799964148, "difficulty": "Medium", "likes": 2173, "dislikes": 671, "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": 160654, "totalSubmissionRaw": 217561}, "1834": {"acRate": 45.64618776257227, "difficulty": "Medium", "likes": 3165, "dislikes": 267, "categoryTitle": "Algorithms", "frontendQuestionId": "1834", "paidOnly": false, "title": "Single-Threaded CPU", "titleSlug": "single-threaded-cpu", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109737, "totalSubmissionRaw": 240409}, "1835": {"acRate": 61.550565877867214, "difficulty": "Hard", "likes": 601, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1835", "paidOnly": false, "title": "Find XOR Sum of All Pairs Bitwise AND", "titleSlug": "find-xor-sum-of-all-pairs-bitwise-and", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20340, "totalSubmissionRaw": 33046}, "1836": {"acRate": 74.58483136449237, "difficulty": "Medium", "likes": 398, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1836", "paidOnly": true, "title": "Remove Duplicates From an Unsorted Linked List", "titleSlug": "remove-duplicates-from-an-unsorted-linked-list", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34852, "totalSubmissionRaw": 46728}, "1837": {"acRate": 77.53388754658258, "difficulty": "Easy", "likes": 510, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1837", "paidOnly": false, "title": "Sum of Digits in Base K", "titleSlug": "sum-of-digits-in-base-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56799, "totalSubmissionRaw": 73257}, "1838": {"acRate": 44.28761774019577, "difficulty": "Medium", "likes": 4629, "dislikes": 210, "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": 153562, "totalSubmissionRaw": 346738}, "1839": {"acRate": 49.51998523031478, "difficulty": "Medium", "likes": 755, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1839", "paidOnly": false, "title": "Longest Substring Of All Vowels in Order", "titleSlug": "longest-substring-of-all-vowels-in-order", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32187, "totalSubmissionRaw": 64998}, "1840": {"acRate": 36.31326010200078, "difficulty": "Hard", "likes": 375, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1840", "paidOnly": false, "title": "Maximum Building Height", "titleSlug": "maximum-building-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7405, "totalSubmissionRaw": 20392}, "1841": {"acRate": 53.48918624552669, "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": 13751, "totalSubmissionRaw": 25708}, "1842": {"acRate": 53.29032258064517, "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": 5782, "totalSubmissionRaw": 10850}, "1843": {"acRate": 44.90155399851255, "difficulty": "Medium", "likes": 92, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1843", "paidOnly": true, "title": "Suspicious Bank Accounts", "titleSlug": "suspicious-bank-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11471, "totalSubmissionRaw": 25547}, "1844": {"acRate": 81.46354199490425, "difficulty": "Easy", "likes": 833, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1844", "paidOnly": false, "title": "Replace All Digits with Characters", "titleSlug": "replace-all-digits-with-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90484, "totalSubmissionRaw": 111073}, "1845": {"acRate": 69.37602170746082, "difficulty": "Medium", "likes": 1414, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1845", "paidOnly": false, "title": "Seat Reservation Manager", "titleSlug": "seat-reservation-manager", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124767, "totalSubmissionRaw": 179843}, "1846": {"acRate": 65.86836470190465, "difficulty": "Medium", "likes": 1077, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1846", "paidOnly": false, "title": "Maximum Element After Decreasing and Rearranging", "titleSlug": "maximum-element-after-decreasing-and-rearranging", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105201, "totalSubmissionRaw": 159714}, "1847": {"acRate": 38.22165688728407, "difficulty": "Hard", "likes": 510, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1847", "paidOnly": false, "title": "Closest Room", "titleSlug": "closest-room", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9315, "totalSubmissionRaw": 24371}, "1848": {"acRate": 54.491292392300636, "difficulty": "Easy", "likes": 363, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1848", "paidOnly": false, "title": "Minimum Distance to the Target Element", "titleSlug": "minimum-distance-to-the-target-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46371, "totalSubmissionRaw": 85098}, "1849": {"acRate": 35.879657302251445, "difficulty": "Medium", "likes": 525, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1849", "paidOnly": false, "title": "Splitting a String Into Descending Consecutive Values", "titleSlug": "splitting-a-string-into-descending-consecutive-values", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27012, "totalSubmissionRaw": 75285}, "1850": {"acRate": 71.32633740894066, "difficulty": "Medium", "likes": 774, "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": 22226, "totalSubmissionRaw": 31161}, "1851": {"acRate": 50.098887515451175, "difficulty": "Hard", "likes": 954, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1851", "paidOnly": false, "title": "Minimum Interval to Include Each Query", "titleSlug": "minimum-interval-to-include-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36477, "totalSubmissionRaw": 72809}, "1852": {"acRate": 71.41363247456982, "difficulty": "Medium", "likes": 134, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1852", "paidOnly": true, "title": "Distinct Numbers in Each Subarray", "titleSlug": "distinct-numbers-in-each-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7512, "totalSubmissionRaw": 10519}, "1853": {"acRate": 85.74835632332088, "difficulty": "Easy", "likes": 63, "dislikes": 42, "categoryTitle": "Database", "frontendQuestionId": "1853", "paidOnly": true, "title": "Convert Date Format", "titleSlug": "convert-date-format", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13303, "totalSubmissionRaw": 15514}, "1854": {"acRate": 61.06411454256205, "difficulty": "Easy", "likes": 1305, "dislikes": 230, "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": 72546, "totalSubmissionRaw": 118803}, "1855": {"acRate": 53.488812446744724, "difficulty": "Medium", "likes": 1194, "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": 50847, "totalSubmissionRaw": 95061}, "1856": {"acRate": 38.11441525536738, "difficulty": "Medium", "likes": 1429, "dislikes": 121, "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": 28582, "totalSubmissionRaw": 74990}, "1857": {"acRate": 49.92400476186911, "difficulty": "Hard", "likes": 2122, "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": 66679, "totalSubmissionRaw": 133561}, "1858": {"acRate": 68.57515204170286, "difficulty": "Medium", "likes": 179, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1858", "paidOnly": true, "title": "Longest Word With All Prefixes", "titleSlug": "longest-word-with-all-prefixes", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7893, "totalSubmissionRaw": 11510}, "1859": {"acRate": 83.26325809213579, "difficulty": "Easy", "likes": 2192, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1859", "paidOnly": false, "title": "Sorting the Sentence", "titleSlug": "sorting-the-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 174071, "totalSubmissionRaw": 209061}, "1860": {"acRate": 72.18879816645179, "difficulty": "Medium", "likes": 222, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1860", "paidOnly": false, "title": "Incremental Memory Leak", "titleSlug": "incremental-memory-leak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20158, "totalSubmissionRaw": 27924}, "1861": {"acRate": 67.72953132412795, "difficulty": "Medium", "likes": 981, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1861", "paidOnly": false, "title": "Rotating the Box", "titleSlug": "rotating-the-box", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54250, "totalSubmissionRaw": 80098}, "1862": {"acRate": 28.88664463214592, "difficulty": "Hard", "likes": 442, "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": 9439, "totalSubmissionRaw": 32676}, "1863": {"acRate": 87.79456105623339, "difficulty": "Easy", "likes": 2152, "dislikes": 247, "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": 181402, "totalSubmissionRaw": 206621}, "1864": {"acRate": 43.411351300473754, "difficulty": "Medium", "likes": 582, "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": 27673, "totalSubmissionRaw": 63746}, "1865": {"acRate": 50.94269509094465, "difficulty": "Medium", "likes": 612, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "1865", "paidOnly": false, "title": "Finding Pairs With a Certain Sum", "titleSlug": "finding-pairs-with-a-certain-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26047, "totalSubmissionRaw": 51130}, "1866": {"acRate": 57.66330691698084, "difficulty": "Hard", "likes": 709, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1866", "paidOnly": false, "title": "Number of Ways to Rearrange Sticks With K Sticks Visible", "titleSlug": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14989, "totalSubmissionRaw": 25994}, "1867": {"acRate": 71.0371650821089, "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": 16438, "totalSubmissionRaw": 23140}, "1868": {"acRate": 58.681929892640014, "difficulty": "Medium", "likes": 368, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1868", "paidOnly": true, "title": "Product of Two Run-Length Encoded Arrays", "titleSlug": "product-of-two-run-length-encoded-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45366, "totalSubmissionRaw": 77309}, "1869": {"acRate": 61.19904017107831, "difficulty": "Easy", "likes": 515, "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": 49223, "totalSubmissionRaw": 80431}, "1870": {"acRate": 46.851592347965806, "difficulty": "Medium", "likes": 2309, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "1870", "paidOnly": false, "title": "Minimum Speed to Arrive on Time", "titleSlug": "minimum-speed-to-arrive-on-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102642, "totalSubmissionRaw": 219079}, "1871": {"acRate": 24.906895502659378, "difficulty": "Medium", "likes": 1666, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1871", "paidOnly": false, "title": "Jump Game VII", "titleSlug": "jump-game-vii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47484, "totalSubmissionRaw": 190646}, "1872": {"acRate": 53.05322738652444, "difficulty": "Hard", "likes": 444, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "1872", "paidOnly": false, "title": "Stone Game VIII", "titleSlug": "stone-game-viii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9748, "totalSubmissionRaw": 18374}, "1873": {"acRate": 57.56128748208448, "difficulty": "Easy", "likes": 1077, "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": 245786, "totalSubmissionRaw": 427000}, "1874": {"acRate": 89.39959523274116, "difficulty": "Medium", "likes": 244, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1874", "paidOnly": true, "title": "Minimize Product Sum of Two Arrays", "titleSlug": "minimize-product-sum-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19878, "totalSubmissionRaw": 22235}, "1875": {"acRate": 67.63050866343528, "difficulty": "Medium", "likes": 73, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "1875", "paidOnly": true, "title": "Group Employees of the Same Salary", "titleSlug": "group-employees-of-the-same-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12139, "totalSubmissionRaw": 17949}, "1876": {"acRate": 73.82974950375544, "difficulty": "Easy", "likes": 1502, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1876", "paidOnly": false, "title": "Substrings of Size Three with Distinct Characters", "titleSlug": "substrings-of-size-three-with-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 129064, "totalSubmissionRaw": 174813}, "1877": {"acRate": 81.44278900481504, "difficulty": "Medium", "likes": 1945, "dislikes": 437, "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": 179460, "totalSubmissionRaw": 220351}, "1878": {"acRate": 47.99190010124874, "difficulty": "Medium", "likes": 207, "dislikes": 518, "categoryTitle": "Algorithms", "frontendQuestionId": "1878", "paidOnly": false, "title": "Get Biggest Three Rhombus Sums in a Grid", "titleSlug": "get-biggest-three-rhombus-sums-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15642, "totalSubmissionRaw": 32593}, "1879": {"acRate": 47.708211429685974, "difficulty": "Hard", "likes": 675, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1879", "paidOnly": false, "title": "Minimum XOR Sum of Two Arrays", "titleSlug": "minimum-xor-sum-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14676, "totalSubmissionRaw": 30762}, "1880": {"acRate": 74.24634310678346, "difficulty": "Easy", "likes": 573, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1880", "paidOnly": false, "title": "Check if Word Equals Summation of Two Words", "titleSlug": "check-if-word-equals-summation-of-two-words", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68320, "totalSubmissionRaw": 92018}, "1881": {"acRate": 38.03046281587484, "difficulty": "Medium", "likes": 380, "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": 28489, "totalSubmissionRaw": 74911}, "1882": {"acRate": 40.32592489050415, "difficulty": "Medium", "likes": 924, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1882", "paidOnly": false, "title": "Process Tasks Using Servers", "titleSlug": "process-tasks-using-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34619, "totalSubmissionRaw": 85848}, "1883": {"acRate": 37.895582329317264, "difficulty": "Hard", "likes": 335, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1883", "paidOnly": false, "title": "Minimum Skips to Arrive at Meeting On Time", "titleSlug": "minimum-skips-to-arrive-at-meeting-on-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7077, "totalSubmissionRaw": 18675}, "1884": {"acRate": 73.01652408297198, "difficulty": "Medium", "likes": 1454, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "1884", "paidOnly": false, "title": "Egg Drop With 2 Eggs and N Floors", "titleSlug": "egg-drop-with-2-eggs-and-n-floors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49844, "totalSubmissionRaw": 68264}, "1885": {"acRate": 60.87791650189255, "difficulty": "Medium", "likes": 237, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1885", "paidOnly": true, "title": "Count Pairs in Two Arrays", "titleSlug": "count-pairs-in-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10776, "totalSubmissionRaw": 17701}, "1886": {"acRate": 57.127930256115754, "difficulty": "Easy", "likes": 1434, "dislikes": 121, "categoryTitle": "Algorithms", "frontendQuestionId": "1886", "paidOnly": false, "title": "Determine Whether Matrix Can Be Obtained By Rotation", "titleSlug": "determine-whether-matrix-can-be-obtained-by-rotation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71623, "totalSubmissionRaw": 125373}, "1887": {"acRate": 72.89381778077325, "difficulty": "Medium", "likes": 1225, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1887", "paidOnly": false, "title": "Reduction Operations to Make the Array Elements Equal", "titleSlug": "reduction-operations-to-make-the-array-elements-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95176, "totalSubmissionRaw": 130568}, "1888": {"acRate": 39.99115776262871, "difficulty": "Medium", "likes": 1205, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1888", "paidOnly": false, "title": "Minimum Number of Flips to Make the Binary String Alternating", "titleSlug": "minimum-number-of-flips-to-make-the-binary-string-alternating", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28040, "totalSubmissionRaw": 70117}, "1889": {"acRate": 31.878948141618924, "difficulty": "Hard", "likes": 402, "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": 13020, "totalSubmissionRaw": 40842}, "1890": {"acRate": 77.29632808450249, "difficulty": "Easy", "likes": 408, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1890", "paidOnly": false, "title": "The Latest Login in 2020", "titleSlug": "the-latest-login-in-2020", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90960, "totalSubmissionRaw": 117677}, "1891": {"acRate": 49.66918751211945, "difficulty": "Medium", "likes": 571, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1891", "paidOnly": true, "title": "Cutting Ribbons", "titleSlug": "cutting-ribbons", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64036, "totalSubmissionRaw": 128925}, "1892": {"acRate": 43.608570052961, "difficulty": "Hard", "likes": 85, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1892", "paidOnly": true, "title": "Page Recommendations II", "titleSlug": "page-recommendations-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7246, "totalSubmissionRaw": 16615}, "1893": {"acRate": 50.03758866020941, "difficulty": "Easy", "likes": 598, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1893", "paidOnly": false, "title": "Check if All the Integers in a Range Are Covered", "titleSlug": "check-if-all-the-integers-in-a-range-are-covered", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45926, "totalSubmissionRaw": 91783}, "1894": {"acRate": 45.741808021884246, "difficulty": "Medium", "likes": 591, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1894", "paidOnly": false, "title": "Find the Student that Will Replace the Chalk", "titleSlug": "find-the-student-that-will-replace-the-chalk", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39128, "totalSubmissionRaw": 85541}, "1895": {"acRate": 52.547152366863905, "difficulty": "Medium", "likes": 294, "dislikes": 260, "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": 11367, "totalSubmissionRaw": 21632}, "1896": {"acRate": 54.007558973022284, "difficulty": "Hard", "likes": 237, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1896", "paidOnly": false, "title": "Minimum Cost to Change the Final Value of Expression", "titleSlug": "minimum-cost-to-change-the-final-value-of-expression", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4144, "totalSubmissionRaw": 7673}, "1897": {"acRate": 67.2136317590168, "difficulty": "Easy", "likes": 1099, "dislikes": 77, "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": 140662, "totalSubmissionRaw": 209276}, "1898": {"acRate": 43.93107070362958, "difficulty": "Medium", "likes": 974, "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": 30949, "totalSubmissionRaw": 70449}, "1899": {"acRate": 66.2596289851533, "difficulty": "Medium", "likes": 802, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1899", "paidOnly": false, "title": "Merge Triplets to Form Target Triplet", "titleSlug": "merge-triplets-to-form-target-triplet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65113, "totalSubmissionRaw": 98270}, "1900": {"acRate": 50.95658572479764, "difficulty": "Hard", "likes": 229, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1900", "paidOnly": false, "title": "The Earliest and Latest Rounds Where Players Compete", "titleSlug": "the-earliest-and-latest-rounds-where-players-compete", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5540, "totalSubmissionRaw": 10872}, "1901": {"acRate": 51.92507328793508, "difficulty": "Medium", "likes": 2078, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1901", "paidOnly": false, "title": "Find a Peak Element II", "titleSlug": "find-a-peak-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79530, "totalSubmissionRaw": 153163}, "1902": {"acRate": 44.17954926429503, "difficulty": "Medium", "likes": 101, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1902", "paidOnly": true, "title": "Depth of BST Given Insertion Order", "titleSlug": "depth-of-bst-given-insertion-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2372, "totalSubmissionRaw": 5369}, "1903": {"acRate": 63.578904352169275, "difficulty": "Easy", "likes": 2054, "dislikes": 123, "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": 280046, "totalSubmissionRaw": 440470}, "1904": {"acRate": 43.91746894257083, "difficulty": "Medium", "likes": 213, "dislikes": 260, "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": 22307, "totalSubmissionRaw": 50793}, "1905": {"acRate": 67.49452257120657, "difficulty": "Medium", "likes": 2082, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1905", "paidOnly": false, "title": "Count Sub Islands", "titleSlug": "count-sub-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96420, "totalSubmissionRaw": 142856}, "1906": {"acRate": 44.49892135712885, "difficulty": "Medium", "likes": 532, "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": 11345, "totalSubmissionRaw": 25495}, "1907": {"acRate": 59.97650630521421, "difficulty": "Medium", "likes": 443, "dislikes": 85, "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": 111812, "totalSubmissionRaw": 186429}, "1908": {"acRate": 63.1078814980436, "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": 4516, "totalSubmissionRaw": 7156}, "1909": {"acRate": 27.644137423613806, "difficulty": "Easy", "likes": 1243, "dislikes": 335, "categoryTitle": "Algorithms", "frontendQuestionId": "1909", "paidOnly": false, "title": "Remove One Element to Make the Array Strictly Increasing", "titleSlug": "remove-one-element-to-make-the-array-strictly-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 67627, "totalSubmissionRaw": 244642}, "1910": {"acRate": 77.70556810045713, "difficulty": "Medium", "likes": 1786, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1910", "paidOnly": false, "title": "Remove All Occurrences of a Substring", "titleSlug": "remove-all-occurrences-of-a-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 126981, "totalSubmissionRaw": 163413}, "1911": {"acRate": 59.04877609791217, "difficulty": "Medium", "likes": 1236, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1911", "paidOnly": false, "title": "Maximum Alternating Subsequence Sum", "titleSlug": "maximum-alternating-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39367, "totalSubmissionRaw": 66670}, "1912": {"acRate": 36.510605978408286, "difficulty": "Hard", "likes": 241, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1912", "paidOnly": false, "title": "Design Movie Rental System", "titleSlug": "design-movie-rental-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6730, "totalSubmissionRaw": 18433}, "1913": {"acRate": 82.85545637112492, "difficulty": "Easy", "likes": 1515, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1913", "paidOnly": false, "title": "Maximum Product Difference Between Two Pairs", "titleSlug": "maximum-product-difference-between-two-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251260, "totalSubmissionRaw": 303251}, "1914": {"acRate": 49.68782719975181, "difficulty": "Medium", "likes": 239, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1914", "paidOnly": false, "title": "Cyclically Rotating a Grid", "titleSlug": "cyclically-rotating-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12813, "totalSubmissionRaw": 25787}, "1915": {"acRate": 66.976920961977, "difficulty": "Medium", "likes": 1722, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "1915", "paidOnly": false, "title": "Number of Wonderful Substrings", "titleSlug": "number-of-wonderful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82825, "totalSubmissionRaw": 123662}, "1916": {"acRate": 49.04808002581478, "difficulty": "Hard", "likes": 486, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1916", "paidOnly": false, "title": "Count Ways to Build Rooms in an Ant Colony", "titleSlug": "count-ways-to-build-rooms-in-an-ant-colony", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7600, "totalSubmissionRaw": 15495}, "1917": {"acRate": 26.961026147015293, "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": 6558, "totalSubmissionRaw": 24324}, "1918": {"acRate": 52.48585530275671, "difficulty": "Medium", "likes": 205, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1918", "paidOnly": true, "title": "Kth Smallest Subarray Sum", "titleSlug": "kth-smallest-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4360, "totalSubmissionRaw": 8307}, "1919": {"acRate": 41.59180340040092, "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": 5602, "totalSubmissionRaw": 13469}, "1920": {"acRate": 89.95241587223988, "difficulty": "Easy", "likes": 3363, "dislikes": 398, "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": 551993, "totalSubmissionRaw": 613650}, "1921": {"acRate": 50.89637913069366, "difficulty": "Medium", "likes": 1504, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "1921", "paidOnly": false, "title": "Eliminate Maximum Number of Monsters", "titleSlug": "eliminate-maximum-number-of-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109415, "totalSubmissionRaw": 214976}, "1922": {"acRate": 46.10128253245156, "difficulty": "Medium", "likes": 1424, "dislikes": 435, "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": 71243, "totalSubmissionRaw": 154537}, "1923": {"acRate": 28.324086830249094, "difficulty": "Hard", "likes": 477, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1923", "paidOnly": false, "title": "Longest Common Subpath", "titleSlug": "longest-common-subpath", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7607, "totalSubmissionRaw": 26857}, "1924": {"acRate": 50.664800559832045, "difficulty": "Hard", "likes": 13, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1924", "paidOnly": true, "title": "Erect the Fence II", "titleSlug": "erect-the-fence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 724, "totalSubmissionRaw": 1429}, "1925": {"acRate": 67.93122508945974, "difficulty": "Easy", "likes": 425, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1925", "paidOnly": false, "title": "Count Square Sum Triples", "titleSlug": "count-square-sum-triples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46700, "totalSubmissionRaw": 68746}, "1926": {"acRate": 46.77830049985298, "difficulty": "Medium", "likes": 2313, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1926", "paidOnly": false, "title": "Nearest Exit from Entrance in Maze", "titleSlug": "nearest-exit-from-entrance-in-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159091, "totalSubmissionRaw": 340095}, "1927": {"acRate": 47.834575082672615, "difficulty": "Medium", "likes": 497, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1927", "paidOnly": false, "title": "Sum Game", "titleSlug": "sum-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12006, "totalSubmissionRaw": 25099}, "1928": {"acRate": 38.47377702806318, "difficulty": "Hard", "likes": 784, "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": 20071, "totalSubmissionRaw": 52168}, "1929": {"acRate": 90.02382214543289, "difficulty": "Easy", "likes": 3343, "dislikes": 392, "categoryTitle": "Algorithms", "frontendQuestionId": "1929", "paidOnly": false, "title": "Concatenation of Array", "titleSlug": "concatenation-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 825329, "totalSubmissionRaw": 916781}, "1930": {"acRate": 66.09424870913281, "difficulty": "Medium", "likes": 1725, "dislikes": 74, "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": 107266, "totalSubmissionRaw": 162290}, "1931": {"acRate": 57.74435181829165, "difficulty": "Hard", "likes": 479, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1931", "paidOnly": false, "title": "Painting a Grid With Three Different Colors", "titleSlug": "painting-a-grid-with-three-different-colors", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9559, "totalSubmissionRaw": 16554}, "1932": {"acRate": 36.29408922531809, "difficulty": "Hard", "likes": 574, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1932", "paidOnly": false, "title": "Merge BSTs to Create Single BST", "titleSlug": "merge-bsts-to-create-single-bst", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9014, "totalSubmissionRaw": 24834}, "1933": {"acRate": 50.680317930755756, "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": 3762, "totalSubmissionRaw": 7423}, "1934": {"acRate": 58.858362885164674, "difficulty": "Medium", "likes": 879, "dislikes": 80, "categoryTitle": "Database", "frontendQuestionId": "1934", "paidOnly": false, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 225226, "totalSubmissionRaw": 382654}, "1935": {"acRate": 73.46666193870193, "difficulty": "Easy", "likes": 592, "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": 62155, "totalSubmissionRaw": 84603}, "1936": {"acRate": 42.871320860922246, "difficulty": "Medium", "likes": 374, "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": 28942, "totalSubmissionRaw": 67509}, "1937": {"acRate": 35.626818012168464, "difficulty": "Medium", "likes": 2335, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "1937", "paidOnly": false, "title": "Maximum Number of Points with Cost", "titleSlug": "maximum-number-of-points-with-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60137, "totalSubmissionRaw": 168797}, "1938": {"acRate": 42.83533094129323, "difficulty": "Hard", "likes": 383, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1938", "paidOnly": false, "title": "Maximum Genetic Difference Query", "titleSlug": "maximum-genetic-difference-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5611, "totalSubmissionRaw": 13099}, "1939": {"acRate": 56.354655470486534, "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": 11409, "totalSubmissionRaw": 20245}, "1940": {"acRate": 81.24322370798699, "difficulty": "Medium", "likes": 185, "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": 13488, "totalSubmissionRaw": 16602}, "1941": {"acRate": 77.7540976065991, "difficulty": "Easy", "likes": 887, "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": 101424, "totalSubmissionRaw": 130442}, "1942": {"acRate": 42.306300219578695, "difficulty": "Medium", "likes": 578, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1942", "paidOnly": false, "title": "The Number of the Smallest Unoccupied Chair", "titleSlug": "the-number-of-the-smallest-unoccupied-chair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17533, "totalSubmissionRaw": 41443}, "1943": {"acRate": 50.032453896376616, "difficulty": "Medium", "likes": 477, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1943", "paidOnly": false, "title": "Describe the Painting", "titleSlug": "describe-the-painting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13104, "totalSubmissionRaw": 26191}, "1944": {"acRate": 69.8267244251916, "difficulty": "Hard", "likes": 1755, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1944", "paidOnly": false, "title": "Number of Visible People in a Queue", "titleSlug": "number-of-visible-people-in-a-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58673, "totalSubmissionRaw": 84027}, "1945": {"acRate": 62.86865116706066, "difficulty": "Easy", "likes": 607, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1945", "paidOnly": false, "title": "Sum of Digits of String After Convert", "titleSlug": "sum-of-digits-of-string-after-convert", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54785, "totalSubmissionRaw": 87142}, "1946": {"acRate": 36.00513541178716, "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": 20753, "totalSubmissionRaw": 57639}, "1947": {"acRate": 62.273184865077226, "difficulty": "Medium", "likes": 780, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1947", "paidOnly": false, "title": "Maximum Compatibility Score Sum", "titleSlug": "maximum-compatibility-score-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25362, "totalSubmissionRaw": 40727}, "1948": {"acRate": 55.54451139963968, "difficulty": "Hard", "likes": 319, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1948", "paidOnly": false, "title": "Delete Duplicate Folders in System", "titleSlug": "delete-duplicate-folders-in-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8941, "totalSubmissionRaw": 16097}, "1949": {"acRate": 54.47995402908544, "difficulty": "Medium", "likes": 146, "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": 12325, "totalSubmissionRaw": 22623}, "1950": {"acRate": 49.73562458691342, "difficulty": "Medium", "likes": 139, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1950", "paidOnly": true, "title": "Maximum of Minimum Values in All Subarrays", "titleSlug": "maximum-of-minimum-values-in-all-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3010, "totalSubmissionRaw": 6052}, "1951": {"acRate": 68.8106654192492, "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": 11768, "totalSubmissionRaw": 17102}, "1952": {"acRate": 61.01571521815534, "difficulty": "Easy", "likes": 529, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "1952", "paidOnly": false, "title": "Three Divisors", "titleSlug": "three-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72914, "totalSubmissionRaw": 119499}, "1953": {"acRate": 40.753291201436774, "difficulty": "Medium", "likes": 646, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1953", "paidOnly": false, "title": "Maximum Number of Weeks for Which You Can Work", "titleSlug": "maximum-number-of-weeks-for-which-you-can-work", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24053, "totalSubmissionRaw": 59021}, "1954": {"acRate": 54.49835734142027, "difficulty": "Medium", "likes": 382, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1954", "paidOnly": false, "title": "Minimum Garden Perimeter to Collect Enough Apples", "titleSlug": "minimum-garden-perimeter-to-collect-enough-apples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17252, "totalSubmissionRaw": 31656}, "1955": {"acRate": 51.29520279298306, "difficulty": "Hard", "likes": 519, "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": 11901, "totalSubmissionRaw": 23201}, "1956": {"acRate": 47.242557345046365, "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": 968, "totalSubmissionRaw": 2049}, "1957": {"acRate": 58.41261665252697, "difficulty": "Easy", "likes": 439, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1957", "paidOnly": false, "title": "Delete Characters to Make Fancy String", "titleSlug": "delete-characters-to-make-fancy-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38555, "totalSubmissionRaw": 66006}, "1958": {"acRate": 48.53382264723526, "difficulty": "Medium", "likes": 159, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "1958", "paidOnly": false, "title": "Check if Move is Legal", "titleSlug": "check-if-move-is-legal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13754, "totalSubmissionRaw": 28339}, "1959": {"acRate": 43.02825087178451, "difficulty": "Medium", "likes": 564, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1959", "paidOnly": false, "title": "Minimum Total Space Wasted With K Resizing Operations", "titleSlug": "minimum-total-space-wasted-with-k-resizing-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8514, "totalSubmissionRaw": 19787}, "1960": {"acRate": 30.729865771812083, "difficulty": "Hard", "likes": 244, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1960", "paidOnly": false, "title": "Maximum Product of the Length of Two Palindromic Substrings", "titleSlug": "maximum-product-of-the-length-of-two-palindromic-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3663, "totalSubmissionRaw": 11920}, "1961": {"acRate": 52.775838665891015, "difficulty": "Easy", "likes": 484, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "1961", "paidOnly": false, "title": "Check If String Is a Prefix of Array", "titleSlug": "check-if-string-is-a-prefix-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54433, "totalSubmissionRaw": 103140}, "1962": {"acRate": 62.542940726623854, "difficulty": "Medium", "likes": 1814, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1962", "paidOnly": false, "title": "Remove Stones to Minimize the Total", "titleSlug": "remove-stones-to-minimize-the-total", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 103047, "totalSubmissionRaw": 164762}, "1963": {"acRate": 71.95149935289636, "difficulty": "Medium", "likes": 1802, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1963", "paidOnly": false, "title": "Minimum Number of Swaps to Make the String Balanced", "titleSlug": "minimum-number-of-swaps-to-make-the-string-balanced", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78389, "totalSubmissionRaw": 108947}, "1964": {"acRate": 62.90858785175018, "difficulty": "Hard", "likes": 1791, "dislikes": 71, "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": 58661, "totalSubmissionRaw": 93248}, "1965": {"acRate": 72.339593114241, "difficulty": "Easy", "likes": 696, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "1965", "paidOnly": false, "title": "Employees With Missing Information", "titleSlug": "employees-with-missing-information", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125730, "totalSubmissionRaw": 173806}, "1966": {"acRate": 64.06748746010031, "difficulty": "Medium", "likes": 72, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1966", "paidOnly": true, "title": "Binary Searchable Numbers in an Unsorted Array", "titleSlug": "binary-searchable-numbers-in-an-unsorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2810, "totalSubmissionRaw": 4386}, "1967": {"acRate": 81.04907873623638, "difficulty": "Easy", "likes": 693, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1967", "paidOnly": false, "title": "Number of Strings That Appear as Substrings in Word", "titleSlug": "number-of-strings-that-appear-as-substrings-in-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73240, "totalSubmissionRaw": 90365}, "1968": {"acRate": 50.27699355457306, "difficulty": "Medium", "likes": 620, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1968", "paidOnly": false, "title": "Array With Elements Not Equal to Average of Neighbors", "titleSlug": "array-with-elements-not-equal-to-average-of-neighbors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37754, "totalSubmissionRaw": 75092}, "1969": {"acRate": 35.63489900366433, "difficulty": "Medium", "likes": 242, "dislikes": 367, "categoryTitle": "Algorithms", "frontendQuestionId": "1969", "paidOnly": false, "title": "Minimum Non-Zero Product of the Array Elements", "titleSlug": "minimum-non-zero-product-of-the-array-elements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11767, "totalSubmissionRaw": 33021}, "1970": {"acRate": 61.96851504269239, "difficulty": "Hard", "likes": 1895, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1970", "paidOnly": false, "title": "Last Day Where You Can Still Cross", "titleSlug": "last-day-where-you-can-still-cross", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57117, "totalSubmissionRaw": 92171}, "1971": {"acRate": 54.06549496128722, "difficulty": "Easy", "likes": 3874, "dislikes": 223, "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": 455695, "totalSubmissionRaw": 842860}, "1972": {"acRate": 50.35656655041383, "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": 9674, "totalSubmissionRaw": 19211}, "1973": {"acRate": 76.98512585812357, "difficulty": "Medium", "likes": 175, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1973", "paidOnly": true, "title": "Count Nodes Equal to Sum of Descendants", "titleSlug": "count-nodes-equal-to-sum-of-descendants", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13457, "totalSubmissionRaw": 17480}, "1974": {"acRate": 75.47541860231945, "difficulty": "Easy", "likes": 692, "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": 45166, "totalSubmissionRaw": 59842}, "1975": {"acRate": 49.760362353189024, "difficulty": "Medium", "likes": 554, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1975", "paidOnly": false, "title": "Maximum Matrix Sum", "titleSlug": "maximum-matrix-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18896, "totalSubmissionRaw": 37974}, "1976": {"acRate": 27.574520466833913, "difficulty": "Medium", "likes": 2779, "dislikes": 130, "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": 70785, "totalSubmissionRaw": 256706}, "1977": {"acRate": 20.849495733126457, "difficulty": "Hard", "likes": 515, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1977", "paidOnly": false, "title": "Number of Ways to Separate Numbers", "titleSlug": "number-of-ways-to-separate-numbers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6450, "totalSubmissionRaw": 30936}, "1978": {"acRate": 48.363645790512585, "difficulty": "Easy", "likes": 359, "dislikes": 34, "categoryTitle": "Database", "frontendQuestionId": "1978", "paidOnly": false, "title": "Employees Whose Manager Left the Company", "titleSlug": "employees-whose-manager-left-the-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130590, "totalSubmissionRaw": 270017}, "1979": {"acRate": 77.9957541777802, "difficulty": "Easy", "likes": 1120, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1979", "paidOnly": false, "title": "Find Greatest Common Divisor of Array", "titleSlug": "find-greatest-common-divisor-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 143286, "totalSubmissionRaw": 183710}, "1980": {"acRate": 74.66588091680173, "difficulty": "Medium", "likes": 1988, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "1980", "paidOnly": false, "title": "Find Unique Binary String", "titleSlug": "find-unique-binary-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141904, "totalSubmissionRaw": 190052}, "1981": {"acRate": 35.016648168701444, "difficulty": "Medium", "likes": 943, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "1981", "paidOnly": false, "title": "Minimize the Difference Between Target and Chosen Elements", "titleSlug": "minimize-the-difference-between-target-and-chosen-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29026, "totalSubmissionRaw": 82892}, "1982": {"acRate": 48.80020641610046, "difficulty": "Hard", "likes": 583, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1982", "paidOnly": false, "title": "Find Array Given Subset Sums", "titleSlug": "find-array-given-subset-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5674, "totalSubmissionRaw": 11627}, "1983": {"acRate": 53.3452807646356, "difficulty": "Medium", "likes": 94, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "1983", "paidOnly": true, "title": "Widest Pair of Indices With Equal Range Sum", "titleSlug": "widest-pair-of-indices-with-equal-range-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2679, "totalSubmissionRaw": 5022}, "1984": {"acRate": 57.11534483619478, "difficulty": "Easy", "likes": 996, "dislikes": 280, "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": 80074, "totalSubmissionRaw": 140197}, "1985": {"acRate": 45.66571329288177, "difficulty": "Medium", "likes": 1243, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "1985", "paidOnly": false, "title": "Find the Kth Largest Integer in the Array", "titleSlug": "find-the-kth-largest-integer-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68336, "totalSubmissionRaw": 149644}, "1986": {"acRate": 33.244473100147545, "difficulty": "Medium", "likes": 1115, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1986", "paidOnly": false, "title": "Minimum Number of Work Sessions to Finish the Tasks", "titleSlug": "minimum-number-of-work-sessions-to-finish-the-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26812, "totalSubmissionRaw": 80651}, "1987": {"acRate": 52.292345276872965, "difficulty": "Hard", "likes": 698, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1987", "paidOnly": false, "title": "Number of Unique Good Subsequences", "titleSlug": "number-of-unique-good-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12842, "totalSubmissionRaw": 24559}, "1988": {"acRate": 67.07094495142773, "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": 11391, "totalSubmissionRaw": 16984}, "1989": {"acRate": 51.295947219604145, "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": 2177, "totalSubmissionRaw": 4244}, "1990": {"acRate": 49.37428126902523, "difficulty": "Medium", "likes": 24, "dislikes": 191, "categoryTitle": "Database", "frontendQuestionId": "1990", "paidOnly": true, "title": "Count the Number of Experiments", "titleSlug": "count-the-number-of-experiments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7299, "totalSubmissionRaw": 14783}, "1991": {"acRate": 67.55125849838414, "difficulty": "Easy", "likes": 1370, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1991", "paidOnly": false, "title": "Find the Middle Index in Array", "titleSlug": "find-the-middle-index-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 100750, "totalSubmissionRaw": 149146}, "1992": {"acRate": 75.79552550040644, "difficulty": "Medium", "likes": 1370, "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": 128672, "totalSubmissionRaw": 169762}, "1993": {"acRate": 45.988307349665924, "difficulty": "Medium", "likes": 461, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1993", "paidOnly": false, "title": "Operations on Tree", "titleSlug": "operations-on-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16519, "totalSubmissionRaw": 35920}, "1994": {"acRate": 34.820300588107166, "difficulty": "Hard", "likes": 471, "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": 7993, "totalSubmissionRaw": 22955}, "1995": {"acRate": 61.61642411642412, "difficulty": "Easy", "likes": 636, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "1995", "paidOnly": false, "title": "Count Special Quadruplets", "titleSlug": "count-special-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42677, "totalSubmissionRaw": 69263}, "1996": {"acRate": 43.99151922057599, "difficulty": "Medium", "likes": 3012, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1996", "paidOnly": false, "title": "The Number of Weak Characters in the Game", "titleSlug": "the-number-of-weak-characters-in-the-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104574, "totalSubmissionRaw": 237714}, "1997": {"acRate": 37.601642062051, "difficulty": "Medium", "likes": 489, "dislikes": 95, "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": 9526, "totalSubmissionRaw": 25334}, "1998": {"acRate": 46.100359817173974, "difficulty": "Hard", "likes": 494, "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": 9481, "totalSubmissionRaw": 20566}, "1999": {"acRate": 49.14724275156338, "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": 1729, "totalSubmissionRaw": 3518}, "2000": {"acRate": 86.27221052429778, "difficulty": "Easy", "likes": 1324, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2000", "paidOnly": false, "title": "Reverse Prefix of Word", "titleSlug": "reverse-prefix-of-word", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 270007, "totalSubmissionRaw": 312971}, "2001": {"acRate": 50.037692719225724, "difficulty": "Medium", "likes": 528, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2001", "paidOnly": false, "title": "Number of Pairs of Interchangeable Rectangles", "titleSlug": "number-of-pairs-of-interchangeable-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41151, "totalSubmissionRaw": 82242}, "2002": {"acRate": 60.17777420263042, "difficulty": "Medium", "likes": 940, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "2002", "paidOnly": false, "title": "Maximum Product of the Length of Two Palindromic Subsequences", "titleSlug": "maximum-product-of-the-length-of-two-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29924, "totalSubmissionRaw": 49726}, "2003": {"acRate": 46.69324449784283, "difficulty": "Hard", "likes": 449, "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": 8550, "totalSubmissionRaw": 18311}, "2004": {"acRate": 43.39451848126728, "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": 8629, "totalSubmissionRaw": 19885}, "2005": {"acRate": 59.16515426497278, "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": 652, "totalSubmissionRaw": 1102}, "2006": {"acRate": 84.07441231899742, "difficulty": "Easy", "likes": 1629, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2006", "paidOnly": false, "title": "Count Number of Pairs With Absolute Difference K", "titleSlug": "count-number-of-pairs-with-absolute-difference-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 159260, "totalSubmissionRaw": 189428}, "2007": {"acRate": 40.499245865648064, "difficulty": "Medium", "likes": 2443, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "2007", "paidOnly": false, "title": "Find Original Array From Doubled Array", "titleSlug": "find-original-array-from-doubled-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136137, "totalSubmissionRaw": 336147}, "2008": {"acRate": 44.255026163591296, "difficulty": "Medium", "likes": 1274, "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": 32138, "totalSubmissionRaw": 72620}, "2009": {"acRate": 52.65964538061591, "difficulty": "Hard", "likes": 1874, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2009", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Continuous", "titleSlug": "minimum-number-of-operations-to-make-array-continuous", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75050, "totalSubmissionRaw": 142519}, "2010": {"acRate": 62.40708351552252, "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": 5708, "totalSubmissionRaw": 9147}, "2011": {"acRate": 89.30490705664698, "difficulty": "Easy", "likes": 1606, "dislikes": 184, "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": 405479, "totalSubmissionRaw": 454039}, "2012": {"acRate": 48.28100138970011, "difficulty": "Medium", "likes": 605, "dislikes": 63, "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": 23972, "totalSubmissionRaw": 49651}, "2013": {"acRate": 51.19137034414186, "difficulty": "Medium", "likes": 881, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "2013", "paidOnly": false, "title": "Detect Squares", "titleSlug": "detect-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71563, "totalSubmissionRaw": 139796}, "2014": {"acRate": 55.72196104768301, "difficulty": "Hard", "likes": 458, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2014", "paidOnly": false, "title": "Longest Subsequence Repeated k Times", "titleSlug": "longest-subsequence-repeated-k-times", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8297, "totalSubmissionRaw": 14890}, "2015": {"acRate": 59.269662921348306, "difficulty": "Medium", "likes": 54, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2015", "paidOnly": true, "title": "Average Height of Buildings in Each Segment", "titleSlug": "average-height-of-buildings-in-each-segment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2110, "totalSubmissionRaw": 3560}, "2016": {"acRate": 56.53512818180637, "difficulty": "Easy", "likes": 1008, "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": 87020, "totalSubmissionRaw": 153922}, "2017": {"acRate": 46.04208600182982, "difficulty": "Medium", "likes": 913, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2017", "paidOnly": false, "title": "Grid Game", "titleSlug": "grid-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25162, "totalSubmissionRaw": 54650}, "2018": {"acRate": 49.70457732717199, "difficulty": "Medium", "likes": 292, "dislikes": 294, "categoryTitle": "Algorithms", "frontendQuestionId": "2018", "paidOnly": false, "title": "Check if Word Can Be Placed In Crossword", "titleSlug": "check-if-word-can-be-placed-in-crossword", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21620, "totalSubmissionRaw": 43497}, "2019": {"acRate": 33.64048897944063, "difficulty": "Hard", "likes": 270, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2019", "paidOnly": false, "title": "The Score of Students Solving Math Expression", "titleSlug": "the-score-of-students-solving-math-expression", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7265, "totalSubmissionRaw": 21596}, "2020": {"acRate": 71.94998310239946, "difficulty": "Medium", "likes": 27, "dislikes": 213, "categoryTitle": "Database", "frontendQuestionId": "2020", "paidOnly": true, "title": "Number of Accounts That Did Not Stream", "titleSlug": "number-of-accounts-that-did-not-stream", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10645, "totalSubmissionRaw": 14795}, "2021": {"acRate": 61.664796490870145, "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": 6045, "totalSubmissionRaw": 9803}, "2022": {"acRate": 61.93537376265786, "difficulty": "Easy", "likes": 781, "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": 87096, "totalSubmissionRaw": 140624}, "2023": {"acRate": 74.98052061634361, "difficulty": "Medium", "likes": 702, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2023", "paidOnly": false, "title": "Number of Pairs of Strings With Concatenation Equal to Target", "titleSlug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47153, "totalSubmissionRaw": 62887}, "2024": {"acRate": 67.35380342539732, "difficulty": "Medium", "likes": 2871, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2024", "paidOnly": false, "title": "Maximize the Confusion of an Exam", "titleSlug": "maximize-the-confusion-of-an-exam", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109130, "totalSubmissionRaw": 162025}, "2025": {"acRate": 34.29332445480273, "difficulty": "Hard", "likes": 475, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2025", "paidOnly": false, "title": "Maximum Number of Ways to Partition an Array", "titleSlug": "maximum-number-of-ways-to-partition-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10300, "totalSubmissionRaw": 30035}, "2026": {"acRate": 84.29999320051677, "difficulty": "Easy", "likes": 52, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "2026", "paidOnly": true, "title": "Low-Quality Problems", "titleSlug": "low-quality-problems", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12398, "totalSubmissionRaw": 14707}, "2027": {"acRate": 55.2216431293432, "difficulty": "Easy", "likes": 478, "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": 39411, "totalSubmissionRaw": 71372}, "2028": {"acRate": 46.79445291512379, "difficulty": "Medium", "likes": 487, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2028", "paidOnly": false, "title": "Find Missing Observations", "titleSlug": "find-missing-observations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32225, "totalSubmissionRaw": 68865}, "2029": {"acRate": 28.450760876851916, "difficulty": "Medium", "likes": 236, "dislikes": 271, "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": 8488, "totalSubmissionRaw": 29834}, "2030": {"acRate": 39.28076837167746, "difficulty": "Hard", "likes": 483, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2030", "paidOnly": false, "title": "Smallest K-Length Subsequence With Occurrences of a Letter", "titleSlug": "smallest-k-length-subsequence-with-occurrences-of-a-letter", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8793, "totalSubmissionRaw": 22385}, "2031": {"acRate": 51.97159883352352, "difficulty": "Medium", "likes": 170, "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": 4099, "totalSubmissionRaw": 7887}, "2032": {"acRate": 75.40971589540595, "difficulty": "Easy", "likes": 754, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2032", "paidOnly": false, "title": "Two Out of Three", "titleSlug": "two-out-of-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72009, "totalSubmissionRaw": 95491}, "2033": {"acRate": 53.38859537256331, "difficulty": "Medium", "likes": 548, "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": 23444, "totalSubmissionRaw": 43912}, "2034": {"acRate": 48.669630133781396, "difficulty": "Medium", "likes": 1162, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2034", "paidOnly": false, "title": "Stock Price Fluctuation ", "titleSlug": "stock-price-fluctuation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68648, "totalSubmissionRaw": 141050}, "2035": {"acRate": 20.494397829472945, "difficulty": "Hard", "likes": 3057, "dislikes": 197, "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": 28553, "totalSubmissionRaw": 139320}, "2036": {"acRate": 40.19157088122605, "difficulty": "Medium", "likes": 98, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2036", "paidOnly": true, "title": "Maximum Alternating Subarray Sum", "titleSlug": "maximum-alternating-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3147, "totalSubmissionRaw": 7830}, "2037": {"acRate": 87.65843845763382, "difficulty": "Easy", "likes": 1325, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "2037", "paidOnly": false, "title": "Minimum Number of Moves to Seat Everyone", "titleSlug": "minimum-number-of-moves-to-seat-everyone", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233131, "totalSubmissionRaw": 265954}, "2038": {"acRate": 62.79265270209643, "difficulty": "Medium", "likes": 1570, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2038", "paidOnly": false, "title": "Remove Colored Pieces if Both Neighbors are the Same Color", "titleSlug": "remove-colored-pieces-if-both-neighbors-are-the-same-color", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144160, "totalSubmissionRaw": 229581}, "2039": {"acRate": 52.25104659940979, "difficulty": "Medium", "likes": 665, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2039", "paidOnly": false, "title": "The Time When the Network Becomes Idle", "titleSlug": "the-time-when-the-network-becomes-idle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15227, "totalSubmissionRaw": 29142}, "2040": {"acRate": 29.012783222936473, "difficulty": "Hard", "likes": 685, "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": 11870, "totalSubmissionRaw": 40913}, "2041": {"acRate": 78.16015883520848, "difficulty": "Medium", "likes": 53, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2041", "paidOnly": true, "title": "Accepted Candidates From the Interviews", "titleSlug": "accepted-candidates-from-the-interviews", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10629, "totalSubmissionRaw": 13599}, "2042": {"acRate": 69.95850622406638, "difficulty": "Easy", "likes": 614, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2042", "paidOnly": false, "title": "Check if Numbers Are Ascending in a Sentence", "titleSlug": "check-if-numbers-are-ascending-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60696, "totalSubmissionRaw": 86760}, "2043": {"acRate": 63.90024441416304, "difficulty": "Medium", "likes": 260, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "2043", "paidOnly": false, "title": "Simple Bank System", "titleSlug": "simple-bank-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29539, "totalSubmissionRaw": 46228}, "2044": {"acRate": 77.85316082886294, "difficulty": "Medium", "likes": 621, "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": 29606, "totalSubmissionRaw": 38028}, "2045": {"acRate": 63.21583350714965, "difficulty": "Hard", "likes": 1189, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2045", "paidOnly": false, "title": "Second Minimum Time to Reach Destination", "titleSlug": "second-minimum-time-to-reach-destination", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81831, "totalSubmissionRaw": 129447}, "2046": {"acRate": 67.1141460386436, "difficulty": "Medium", "likes": 166, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2046", "paidOnly": true, "title": "Sort Linked List Already Sorted Using Absolute Values", "titleSlug": "sort-linked-list-already-sorted-using-absolute-values", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8649, "totalSubmissionRaw": 12885}, "2047": {"acRate": 29.144926705273015, "difficulty": "Easy", "likes": 298, "dislikes": 803, "categoryTitle": "Algorithms", "frontendQuestionId": "2047", "paidOnly": false, "title": "Number of Valid Words in a Sentence", "titleSlug": "number-of-valid-words-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30499, "totalSubmissionRaw": 104646}, "2048": {"acRate": 48.663213885778276, "difficulty": "Medium", "likes": 197, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "2048", "paidOnly": false, "title": "Next Greater Numerically Balanced Number", "titleSlug": "next-greater-numerically-balanced-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13906, "totalSubmissionRaw": 28576}, "2049": {"acRate": 49.935509297409624, "difficulty": "Medium", "likes": 1071, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2049", "paidOnly": false, "title": "Count Nodes With the Highest Score", "titleSlug": "count-nodes-with-the-highest-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27875, "totalSubmissionRaw": 55822}, "2050": {"acRate": 67.14762481943315, "difficulty": "Hard", "likes": 1525, "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": 80882, "totalSubmissionRaw": 120454}, "2051": {"acRate": 70.06183442116112, "difficulty": "Medium", "likes": 57, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2051", "paidOnly": true, "title": "The Category of Each Member in the Store", "titleSlug": "the-category-of-each-member-in-the-store", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8158, "totalSubmissionRaw": 11644}, "2052": {"acRate": 49.44148936170213, "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": 1858, "totalSubmissionRaw": 3754}, "2053": {"acRate": 82.13558733454259, "difficulty": "Easy", "likes": 1222, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2053", "paidOnly": false, "title": "Kth Distinct String in an Array", "titleSlug": "kth-distinct-string-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 222323, "totalSubmissionRaw": 270676}, "2054": {"acRate": 46.65683148527102, "difficulty": "Medium", "likes": 831, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2054", "paidOnly": false, "title": "Two Best Non-Overlapping Events", "titleSlug": "two-best-non-overlapping-events", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19607, "totalSubmissionRaw": 42025}, "2055": {"acRate": 45.09815064378379, "difficulty": "Medium", "likes": 1215, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2055", "paidOnly": false, "title": "Plates Between Candles", "titleSlug": "plates-between-candles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55551, "totalSubmissionRaw": 123178}, "2056": {"acRate": 52.62635042841177, "difficulty": "Hard", "likes": 59, "dislikes": 290, "categoryTitle": "Algorithms", "frontendQuestionId": "2056", "paidOnly": false, "title": "Number of Valid Move Combinations On Chessboard", "titleSlug": "number-of-valid-move-combinations-on-chessboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4238, "totalSubmissionRaw": 8053}, "2057": {"acRate": 73.06020551456656, "difficulty": "Easy", "likes": 418, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "2057", "paidOnly": false, "title": "Smallest Index With Equal Value", "titleSlug": "smallest-index-with-equal-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65554, "totalSubmissionRaw": 89726}, "2058": {"acRate": 69.7168000448824, "difficulty": "Medium", "likes": 1243, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2058", "paidOnly": false, "title": "Find the Minimum and Maximum Number of Nodes Between Critical Points", "titleSlug": "find-the-minimum-and-maximum-number-of-nodes-between-critical-points", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173970, "totalSubmissionRaw": 249539}, "2059": {"acRate": 49.49188752237427, "difficulty": "Medium", "likes": 635, "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": 17143, "totalSubmissionRaw": 34638}, "2060": {"acRate": 43.815573663794225, "difficulty": "Hard", "likes": 310, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2060", "paidOnly": false, "title": "Check if an Original String Exists Given Two Encoded Strings", "titleSlug": "check-if-an-original-string-exists-given-two-encoded-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16830, "totalSubmissionRaw": 38411}, "2061": {"acRate": 62.539118065433854, "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": 8793, "totalSubmissionRaw": 14060}, "2062": {"acRate": 68.04760373110325, "difficulty": "Easy", "likes": 946, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "2062", "paidOnly": false, "title": "Count Vowel Substrings of a String", "titleSlug": "count-vowel-substrings-of-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42312, "totalSubmissionRaw": 62180}, "2063": {"acRate": 54.01353704734376, "difficulty": "Medium", "likes": 833, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2063", "paidOnly": false, "title": "Vowels of All Substrings", "titleSlug": "vowels-of-all-substrings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30085, "totalSubmissionRaw": 55699}, "2064": {"acRate": 53.32891026704263, "difficulty": "Medium", "likes": 1067, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2064", "paidOnly": false, "title": "Minimized Maximum of Products Distributed to Any Store", "titleSlug": "minimized-maximum-of-products-distributed-to-any-store", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32152, "totalSubmissionRaw": 60290}, "2065": {"acRate": 58.76631888009227, "difficulty": "Hard", "likes": 639, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2065", "paidOnly": false, "title": "Maximum Path Quality of a Graph", "titleSlug": "maximum-path-quality-of-a-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22417, "totalSubmissionRaw": 38146}, "2066": {"acRate": 82.06535506206197, "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": 9719, "totalSubmissionRaw": 11843}, "2067": {"acRate": 46.88209606986899, "difficulty": "Medium", "likes": 103, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2067", "paidOnly": true, "title": "Number of Equal Count Substrings", "titleSlug": "number-of-equal-count-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2684, "totalSubmissionRaw": 5725}, "2068": {"acRate": 63.85804558790341, "difficulty": "Easy", "likes": 526, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2068", "paidOnly": false, "title": "Check Whether Two Strings are Almost Equivalent", "titleSlug": "check-whether-two-strings-are-almost-equivalent", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56591, "totalSubmissionRaw": 88620}, "2069": {"acRate": 26.320700226596173, "difficulty": "Medium", "likes": 166, "dislikes": 307, "categoryTitle": "Algorithms", "frontendQuestionId": "2069", "paidOnly": false, "title": "Walking Robot Simulation II", "titleSlug": "walking-robot-simulation-ii", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11848, "totalSubmissionRaw": 45014}, "2070": {"acRate": 49.92712411763025, "difficulty": "Medium", "likes": 588, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2070", "paidOnly": false, "title": "Most Beautiful Item for Each Query", "titleSlug": "most-beautiful-item-for-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17470, "totalSubmissionRaw": 34991}, "2071": {"acRate": 33.657246972241076, "difficulty": "Hard", "likes": 534, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2071", "paidOnly": false, "title": "Maximum Number of Tasks You Can Assign", "titleSlug": "maximum-number-of-tasks-you-can-assign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9421, "totalSubmissionRaw": 27991}, "2072": {"acRate": 74.0354535974974, "difficulty": "Easy", "likes": 66, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2072", "paidOnly": true, "title": "The Winner University", "titleSlug": "the-winner-university", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11360, "totalSubmissionRaw": 15344}, "2073": {"acRate": 69.91029447163605, "difficulty": "Easy", "likes": 1650, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "2073", "paidOnly": false, "title": "Time Needed to Buy Tickets", "titleSlug": "time-needed-to-buy-tickets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217823, "totalSubmissionRaw": 311575}, "2074": {"acRate": 58.25457171378204, "difficulty": "Medium", "likes": 717, "dislikes": 338, "categoryTitle": "Algorithms", "frontendQuestionId": "2074", "paidOnly": false, "title": "Reverse Nodes in Even Length Groups", "titleSlug": "reverse-nodes-in-even-length-groups", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27428, "totalSubmissionRaw": 47083}, "2075": {"acRate": 49.01128481209235, "difficulty": "Medium", "likes": 247, "dislikes": 61, "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": 14202, "totalSubmissionRaw": 28977}, "2076": {"acRate": 55.329311211664155, "difficulty": "Hard", "likes": 614, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2076", "paidOnly": false, "title": "Process Restricted Friend Requests", "titleSlug": "process-restricted-friend-requests", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17608, "totalSubmissionRaw": 31824}, "2077": {"acRate": 55.34894952909926, "difficulty": "Medium", "likes": 129, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2077", "paidOnly": true, "title": "Paths in Maze That Lead to Same Room", "titleSlug": "paths-in-maze-that-lead-to-same-room", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4584, "totalSubmissionRaw": 8282}, "2078": {"acRate": 66.07172251616696, "difficulty": "Easy", "likes": 899, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2078", "paidOnly": false, "title": "Two Furthest Houses With Different Colors", "titleSlug": "two-furthest-houses-with-different-colors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56194, "totalSubmissionRaw": 85050}, "2079": {"acRate": 79.76230382447052, "difficulty": "Medium", "likes": 906, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2079", "paidOnly": false, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52347, "totalSubmissionRaw": 65629}, "2080": {"acRate": 40.30279588904852, "difficulty": "Medium", "likes": 657, "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": 21882, "totalSubmissionRaw": 54294}, "2081": {"acRate": 42.390990470690156, "difficulty": "Hard", "likes": 124, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "2081", "paidOnly": false, "title": "Sum of k-Mirror Numbers", "titleSlug": "sum-of-k-mirror-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7340, "totalSubmissionRaw": 17315}, "2082": {"acRate": 77.25656954918442, "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": 23255, "totalSubmissionRaw": 30101}, "2083": {"acRate": 74.29003724394786, "difficulty": "Medium", "likes": 133, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2083", "paidOnly": true, "title": "Substrings That Begin and End With the Same Letter", "titleSlug": "substrings-that-begin-and-end-with-the-same-letter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12766, "totalSubmissionRaw": 17184}, "2084": {"acRate": 87.0730722648365, "difficulty": "Medium", "likes": 84, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2084", "paidOnly": true, "title": "Drop Type 1 Orders for Customers With Type 0 Orders", "titleSlug": "drop-type-1-orders-for-customers-with-type-0-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10784, "totalSubmissionRaw": 12385}, "2085": {"acRate": 71.00372110285285, "difficulty": "Easy", "likes": 808, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2085", "paidOnly": false, "title": "Count Common Words With One Occurrence", "titleSlug": "count-common-words-with-one-occurrence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72700, "totalSubmissionRaw": 102389}, "2086": {"acRate": 46.797785485017556, "difficulty": "Medium", "likes": 537, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2086", "paidOnly": false, "title": "Minimum Number of Food Buckets to Feed the Hamsters", "titleSlug": "minimum-number-of-food-buckets-to-feed-the-hamsters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21724, "totalSubmissionRaw": 46421}, "2087": {"acRate": 51.03112626484821, "difficulty": "Medium", "likes": 673, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "2087", "paidOnly": false, "title": "Minimum Cost Homecoming of a Robot in a Grid", "titleSlug": "minimum-cost-homecoming-of-a-robot-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18559, "totalSubmissionRaw": 36368}, "2088": {"acRate": 64.93616466909849, "difficulty": "Hard", "likes": 368, "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": 9969, "totalSubmissionRaw": 15352}, "2089": {"acRate": 76.51185734643914, "difficulty": "Easy", "likes": 1793, "dislikes": 92, "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": 188451, "totalSubmissionRaw": 246303}, "2090": {"acRate": 46.03993596400138, "difficulty": "Medium", "likes": 1888, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2090", "paidOnly": false, "title": "K Radius Subarray Averages", "titleSlug": "k-radius-subarray-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127689, "totalSubmissionRaw": 277341}, "2091": {"acRate": 54.97043606799704, "difficulty": "Medium", "likes": 957, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2091", "paidOnly": false, "title": "Removing Minimum and Maximum From Array", "titleSlug": "removing-minimum-and-maximum-from-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44625, "totalSubmissionRaw": 81180}, "2092": {"acRate": 45.54838828922076, "difficulty": "Hard", "likes": 1579, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2092", "paidOnly": false, "title": "Find All People With Secret", "titleSlug": "find-all-people-with-secret", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98574, "totalSubmissionRaw": 216416}, "2093": {"acRate": 59.8169364126811, "difficulty": "Medium", "likes": 227, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2093", "paidOnly": true, "title": "Minimum Cost to Reach City With Discounts", "titleSlug": "minimum-cost-to-reach-city-with-discounts", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9868, "totalSubmissionRaw": 16497}, "2094": {"acRate": 60.86205936403631, "difficulty": "Easy", "likes": 695, "dislikes": 261, "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": 32787, "totalSubmissionRaw": 53871}, "2095": {"acRate": 59.41809864660027, "difficulty": "Medium", "likes": 4190, "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": 461367, "totalSubmissionRaw": 776481}, "2096": {"acRate": 56.37512672823895, "difficulty": "Medium", "likes": 3081, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2096", "paidOnly": false, "title": "Step-By-Step Directions From a Binary Tree Node to Another", "titleSlug": "step-by-step-directions-from-a-binary-tree-node-to-another", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 202407, "totalSubmissionRaw": 359036}, "2097": {"acRate": 44.04582802916329, "difficulty": "Hard", "likes": 506, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2097", "paidOnly": false, "title": "Valid Arrangement of Pairs", "titleSlug": "valid-arrangement-of-pairs", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Eulerian Circuit", "id": "VG9waWNUYWdOb2RlOjYxMDc0", "slug": "eulerian-circuit"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11418, "totalSubmissionRaw": 25923}, "2098": {"acRate": 36.59473505818552, "difficulty": "Medium", "likes": 84, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2098", "paidOnly": true, "title": "Subsequence of Size K With the Largest Even Sum", "titleSlug": "subsequence-of-size-k-with-the-largest-even-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3239, "totalSubmissionRaw": 8851}, "2099": {"acRate": 43.84576204670892, "difficulty": "Easy", "likes": 1253, "dislikes": 131, "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": 52510, "totalSubmissionRaw": 119760}, "2100": {"acRate": 49.5186445613205, "difficulty": "Medium", "likes": 887, "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": 27210, "totalSubmissionRaw": 54949}, "2101": {"acRate": 48.72195339091994, "difficulty": "Medium", "likes": 3066, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2101", "paidOnly": false, "title": "Detonate the Maximum Bombs", "titleSlug": "detonate-the-maximum-bombs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126966, "totalSubmissionRaw": 260593}, "2102": {"acRate": 64.56435019945413, "difficulty": "Hard", "likes": 378, "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": 15376, "totalSubmissionRaw": 23815}, "2103": {"acRate": 80.87747379132702, "difficulty": "Easy", "likes": 959, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2103", "paidOnly": false, "title": "Rings and Rods", "titleSlug": "rings-and-rods", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76299, "totalSubmissionRaw": 94339}, "2104": {"acRate": 61.00772147216571, "difficulty": "Medium", "likes": 2388, "dislikes": 116, "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": 105558, "totalSubmissionRaw": 173024}, "2105": {"acRate": 48.35436420237162, "difficulty": "Medium", "likes": 275, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2105", "paidOnly": false, "title": "Watering Plants II", "titleSlug": "watering-plants-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20348, "totalSubmissionRaw": 42081}, "2106": {"acRate": 36.32288452168264, "difficulty": "Hard", "likes": 552, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2106", "paidOnly": false, "title": "Maximum Fruits Harvested After at Most K Steps", "titleSlug": "maximum-fruits-harvested-after-at-most-k-steps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11182, "totalSubmissionRaw": 30785}, "2107": {"acRate": 55.41442761765185, "difficulty": "Medium", "likes": 77, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2107", "paidOnly": true, "title": "Number of Unique Flavors After Sharing K Candies", "titleSlug": "number-of-unique-flavors-after-sharing-k-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3403, "totalSubmissionRaw": 6141}, "2108": {"acRate": 83.87230933513179, "difficulty": "Easy", "likes": 1531, "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": 298468, "totalSubmissionRaw": 355860}, "2109": {"acRate": 59.15854874587711, "difficulty": "Medium", "likes": 559, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2109", "paidOnly": false, "title": "Adding Spaces to a String", "titleSlug": "adding-spaces-to-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46275, "totalSubmissionRaw": 78222}, "2110": {"acRate": 59.110405832168055, "difficulty": "Medium", "likes": 713, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2110", "paidOnly": false, "title": "Number of Smooth Descent Periods of a Stock", "titleSlug": "number-of-smooth-descent-periods-of-a-stock", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37622, "totalSubmissionRaw": 63647}, "2111": {"acRate": 38.75610919060675, "difficulty": "Hard", "likes": 697, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2111", "paidOnly": false, "title": "Minimum Operations to Make the Array K-Increasing", "titleSlug": "minimum-operations-to-make-the-array-k-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13005, "totalSubmissionRaw": 33556}, "2112": {"acRate": 70.1904609475032, "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": 8771, "totalSubmissionRaw": 12496}, "2113": {"acRate": 73.70803470388533, "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": 1954, "totalSubmissionRaw": 2651}, "2114": {"acRate": 86.56234497274387, "difficulty": "Easy", "likes": 1741, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2114", "paidOnly": false, "title": "Maximum Number of Words Found in Sentences", "titleSlug": "maximum-number-of-words-found-in-sentences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 301868, "totalSubmissionRaw": 348729}, "2115": {"acRate": 50.166029566336, "difficulty": "Medium", "likes": 1874, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "2115", "paidOnly": false, "title": "Find All Possible Recipes from Given Supplies", "titleSlug": "find-all-possible-recipes-from-given-supplies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95933, "totalSubmissionRaw": 191231}, "2116": {"acRate": 31.981146746737167, "difficulty": "Medium", "likes": 1153, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2116", "paidOnly": false, "title": "Check if a Parentheses String Can Be Valid", "titleSlug": "check-if-a-parentheses-string-can-be-valid", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26734, "totalSubmissionRaw": 83593}, "2117": {"acRate": 26.08695652173913, "difficulty": "Hard", "likes": 89, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "2117", "paidOnly": false, "title": "Abbreviating the Product of a Range", "titleSlug": "abbreviating-the-product-of-a-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3534, "totalSubmissionRaw": 13547}, "2118": {"acRate": 55.56020066889632, "difficulty": "Hard", "likes": 23, "dislikes": 37, "categoryTitle": "Database", "frontendQuestionId": "2118", "paidOnly": true, "title": "Build the Equation", "titleSlug": "build-the-equation", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2658, "totalSubmissionRaw": 4784}, "2119": {"acRate": 80.14798584483223, "difficulty": "Easy", "likes": 680, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2119", "paidOnly": false, "title": "A Number After a Double Reversal", "titleSlug": "a-number-after-a-double-reversal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92179, "totalSubmissionRaw": 115011}, "2120": {"acRate": 82.71419313026571, "difficulty": "Medium", "likes": 538, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2120", "paidOnly": false, "title": "Execution of All Suffix Instructions Staying in a Grid", "titleSlug": "execution-of-all-suffix-instructions-staying-in-a-grid", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31907, "totalSubmissionRaw": 38575}, "2121": {"acRate": 44.46697441649769, "difficulty": "Medium", "likes": 904, "dislikes": 38, "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": 20614, "totalSubmissionRaw": 46358}, "2122": {"acRate": 39.44600533102802, "difficulty": "Hard", "likes": 372, "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": 10951, "totalSubmissionRaw": 27762}, "2123": {"acRate": 40.6764574988874, "difficulty": "Hard", "likes": 52, "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": 914, "totalSubmissionRaw": 2247}, "2124": {"acRate": 72.08935721812433, "difficulty": "Easy", "likes": 737, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2124", "paidOnly": false, "title": "Check if All A's Appears Before All B's", "titleSlug": "check-if-all-as-appears-before-all-bs", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85516, "totalSubmissionRaw": 118625}, "2125": {"acRate": 85.60041057892444, "difficulty": "Medium", "likes": 1851, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "2125", "paidOnly": false, "title": "Number of Laser Beams in a Bank", "titleSlug": "number-of-laser-beams-in-a-bank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210155, "totalSubmissionRaw": 245507}, "2126": {"acRate": 51.68072362791835, "difficulty": "Medium", "likes": 555, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "2126", "paidOnly": false, "title": "Destroying Asteroids", "titleSlug": "destroying-asteroids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46508, "totalSubmissionRaw": 89991}, "2127": {"acRate": 37.3078843699717, "difficulty": "Hard", "likes": 1031, "dislikes": 36, "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": 13448, "totalSubmissionRaw": 36046}, "2128": {"acRate": 76.20425648270519, "difficulty": "Medium", "likes": 475, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "2128", "paidOnly": true, "title": "Remove All Ones With Row and Column Flips", "titleSlug": "remove-all-ones-with-row-and-column-flips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33443, "totalSubmissionRaw": 43886}, "2129": {"acRate": 64.65114899339477, "difficulty": "Easy", "likes": 732, "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": 65383, "totalSubmissionRaw": 101132}, "2130": {"acRate": 80.95288442476706, "difficulty": "Medium", "likes": 3524, "dislikes": 100, "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": 306263, "totalSubmissionRaw": 378323}, "2131": {"acRate": 48.05246246185559, "difficulty": "Medium", "likes": 2431, "dislikes": 60, "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": 118886, "totalSubmissionRaw": 247411}, "2132": {"acRate": 32.360097323600975, "difficulty": "Hard", "likes": 386, "dislikes": 43, "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": 7315, "totalSubmissionRaw": 22605}, "2133": {"acRate": 51.821059635586444, "difficulty": "Easy", "likes": 968, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2133", "paidOnly": false, "title": "Check if Every Row and Column Contains All Numbers", "titleSlug": "check-if-every-row-and-column-contains-all-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77103, "totalSubmissionRaw": 148787}, "2134": {"acRate": 65.53586106787456, "difficulty": "Medium", "likes": 1925, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2134", "paidOnly": false, "title": "Minimum Swaps to Group All 1's Together II", "titleSlug": "minimum-swaps-to-group-all-1s-together-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149891, "totalSubmissionRaw": 228716}, "2135": {"acRate": 43.09245222851816, "difficulty": "Medium", "likes": 693, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "2135", "paidOnly": false, "title": "Count Words Obtained After Adding a Letter", "titleSlug": "count-words-obtained-after-adding-a-letter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35135, "totalSubmissionRaw": 81534}, "2136": {"acRate": 71.78361426891415, "difficulty": "Hard", "likes": 1585, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2136", "paidOnly": false, "title": "Earliest Possible Day of Full Bloom", "titleSlug": "earliest-possible-day-of-full-bloom", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54936, "totalSubmissionRaw": 76530}, "2137": {"acRate": 67.60000000000001, "difficulty": "Medium", "likes": 100, "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": 2535, "totalSubmissionRaw": 3750}, "2138": {"acRate": 66.84144991698948, "difficulty": "Easy", "likes": 464, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2138", "paidOnly": false, "title": "Divide a String Into Groups of Size k", "titleSlug": "divide-a-string-into-groups-of-size-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48311, "totalSubmissionRaw": 72278}, "2139": {"acRate": 50.92528507403416, "difficulty": "Medium", "likes": 989, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2139", "paidOnly": false, "title": "Minimum Moves to Reach Target Score", "titleSlug": "minimum-moves-to-reach-target-score", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44883, "totalSubmissionRaw": 88135}, "2140": {"acRate": 55.04482942627844, "difficulty": "Medium", "likes": 2334, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2140", "paidOnly": false, "title": "Solving Questions With Brainpower", "titleSlug": "solving-questions-with-brainpower", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104185, "totalSubmissionRaw": 189273}, "2141": {"acRate": 49.96141721941289, "difficulty": "Hard", "likes": 2002, "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": 60861, "totalSubmissionRaw": 121816}, "2142": {"acRate": 48.43824828393551, "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": 9103, "totalSubmissionRaw": 18793}, "2143": {"acRate": 51.80608365019012, "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": 1090, "totalSubmissionRaw": 2104}, "2144": {"acRate": 61.37274549098196, "difficulty": "Easy", "likes": 591, "dislikes": 19, "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": 51450, "totalSubmissionRaw": 83832}, "2145": {"acRate": 38.489477398198495, "difficulty": "Medium", "likes": 519, "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": 18544, "totalSubmissionRaw": 48180}, "2146": {"acRate": 43.32149537777536, "difficulty": "Medium", "likes": 501, "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": 15980, "totalSubmissionRaw": 36887}, "2147": {"acRate": 49.35427498241569, "difficulty": "Hard", "likes": 1054, "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": 68063, "totalSubmissionRaw": 137907}, "2148": {"acRate": 59.38680848511506, "difficulty": "Easy", "likes": 645, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2148", "paidOnly": false, "title": "Count Elements With Strictly Smaller and Greater Elements ", "titleSlug": "count-elements-with-strictly-smaller-and-greater-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59407, "totalSubmissionRaw": 100034}, "2149": {"acRate": 84.01861399057016, "difficulty": "Medium", "likes": 3264, "dislikes": 184, "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": 396666, "totalSubmissionRaw": 472117}, "2150": {"acRate": 60.789686131565425, "difficulty": "Medium", "likes": 645, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "2150", "paidOnly": false, "title": "Find All Lonely Numbers in the Array", "titleSlug": "find-all-lonely-numbers-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49697, "totalSubmissionRaw": 81753}, "2151": {"acRate": 50.14050136803964, "difficulty": "Hard", "likes": 504, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2151", "paidOnly": false, "title": "Maximum Good People Based on Statements", "titleSlug": "maximum-good-people-based-on-statements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13561, "totalSubmissionRaw": 27046}, "2152": {"acRate": 43.41515474919957, "difficulty": "Medium", "likes": 71, "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": 2034, "totalSubmissionRaw": 4685}, "2153": {"acRate": 40.106100795755964, "difficulty": "Hard", "likes": 77, "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": 3024, "totalSubmissionRaw": 7540}, "2154": {"acRate": 71.3627405947636, "difficulty": "Easy", "likes": 710, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2154", "paidOnly": false, "title": "Keep Multiplying Found Values by Two", "titleSlug": "keep-multiplying-found-values-by-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96323, "totalSubmissionRaw": 134977}, "2155": {"acRate": 64.32220455749868, "difficulty": "Medium", "likes": 503, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2155", "paidOnly": false, "title": "All Divisions With the Highest Score of a Binary Array", "titleSlug": "all-divisions-with-the-highest-score-of-a-binary-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30344, "totalSubmissionRaw": 47175}, "2156": {"acRate": 23.6418404735062, "difficulty": "Hard", "likes": 424, "dislikes": 383, "categoryTitle": "Algorithms", "frontendQuestionId": "2156", "paidOnly": false, "title": "Find Substring With Given Hash Value", "titleSlug": "find-substring-with-given-hash-value", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13421, "totalSubmissionRaw": 56768}, "2157": {"acRate": 26.108293800098153, "difficulty": "Hard", "likes": 472, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2157", "paidOnly": false, "title": "Groups of Strings", "titleSlug": "groups-of-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9576, "totalSubmissionRaw": 36678}, "2158": {"acRate": 55.29687815072134, "difficulty": "Hard", "likes": 421, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2158", "paidOnly": true, "title": "Amount of New Area Painted Each Day", "titleSlug": "amount-of-new-area-painted-each-day", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30165, "totalSubmissionRaw": 54551}, "2159": {"acRate": 60.35138424094919, "difficulty": "Medium", "likes": 72, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2159", "paidOnly": true, "title": "Order Two Columns Independently", "titleSlug": "order-two-columns-independently", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7935, "totalSubmissionRaw": 13148}, "2160": {"acRate": 86.23807714353798, "difficulty": "Easy", "likes": 1397, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "2160", "paidOnly": false, "title": "Minimum Sum of Four Digit Number After Splitting Digits", "titleSlug": "minimum-sum-of-four-digit-number-after-splitting-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 133901, "totalSubmissionRaw": 155269}, "2161": {"acRate": 85.09132006269257, "difficulty": "Medium", "likes": 1101, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2161", "paidOnly": false, "title": "Partition Array According to Given Pivot", "titleSlug": "partition-array-according-to-given-pivot", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79808, "totalSubmissionRaw": 93791}, "2162": {"acRate": 41.15230563828695, "difficulty": "Medium", "likes": 207, "dislikes": 622, "categoryTitle": "Algorithms", "frontendQuestionId": "2162", "paidOnly": false, "title": "Minimum Cost to Set Cooking Time", "titleSlug": "minimum-cost-to-set-cooking-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16028, "totalSubmissionRaw": 38948}, "2163": {"acRate": 48.18691242532302, "difficulty": "Hard", "likes": 669, "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": 10405, "totalSubmissionRaw": 21593}, "2164": {"acRate": 62.61788887480129, "difficulty": "Easy", "likes": 731, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2164", "paidOnly": false, "title": "Sort Even and Odd Indices Independently", "titleSlug": "sort-even-and-odd-indices-independently", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64204, "totalSubmissionRaw": 102533}, "2165": {"acRate": 52.22391754951635, "difficulty": "Medium", "likes": 634, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2165", "paidOnly": false, "title": "Smallest Value of the Rearranged Number", "titleSlug": "smallest-value-of-the-rearranged-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36281, "totalSubmissionRaw": 69472}, "2166": {"acRate": 32.536842401871, "difficulty": "Medium", "likes": 587, "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": 23094, "totalSubmissionRaw": 70978}, "2167": {"acRate": 41.508203137740956, "difficulty": "Hard", "likes": 669, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2167", "paidOnly": false, "title": "Minimum Time to Remove All Cars Containing Illegal Goods", "titleSlug": "minimum-time-to-remove-all-cars-containing-illegal-goods", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12726, "totalSubmissionRaw": 30659}, "2168": {"acRate": 60.0805549339897, "difficulty": "Medium", "likes": 73, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2168", "paidOnly": true, "title": "Unique Substrings With Equal Digit Frequency", "titleSlug": "unique-substrings-with-equal-digit-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2685, "totalSubmissionRaw": 4469}, "2169": {"acRate": 74.50433493597558, "difficulty": "Easy", "likes": 603, "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": 76396, "totalSubmissionRaw": 102539}, "2170": {"acRate": 33.353005399982294, "difficulty": "Medium", "likes": 579, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "2170", "paidOnly": false, "title": "Minimum Operations to Make the Array Alternating", "titleSlug": "minimum-operations-to-make-the-array-alternating", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22606, "totalSubmissionRaw": 67778}, "2171": {"acRate": 42.895886220652464, "difficulty": "Medium", "likes": 868, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2171", "paidOnly": false, "title": "Removing Minimum Number of Magic Beans", "titleSlug": "removing-minimum-number-of-magic-beans", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27205, "totalSubmissionRaw": 63421}, "2172": {"acRate": 49.21627890630491, "difficulty": "Hard", "likes": 513, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2172", "paidOnly": false, "title": "Maximum AND Sum of Array", "titleSlug": "maximum-and-sum-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14004, "totalSubmissionRaw": 28454}, "2173": {"acRate": 52.77027027027027, "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": 4686, "totalSubmissionRaw": 8880}, "2174": {"acRate": 67.26517486265577, "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": 5020, "totalSubmissionRaw": 7463}, "2175": {"acRate": 60.40965207631874, "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": 6459, "totalSubmissionRaw": 10692}, "2176": {"acRate": 79.6041934743793, "difficulty": "Easy", "likes": 639, "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": 79804, "totalSubmissionRaw": 100251}, "2177": {"acRate": 64.55378587625961, "difficulty": "Medium", "likes": 671, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "2177", "paidOnly": false, "title": "Find Three Consecutive Integers That Sum to a Given Number", "titleSlug": "find-three-consecutive-integers-that-sum-to-a-given-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48110, "totalSubmissionRaw": 74527}, "2178": {"acRate": 59.265433905595785, "difficulty": "Medium", "likes": 783, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "2178", "paidOnly": false, "title": "Maximum Split of Positive Even Integers", "titleSlug": "maximum-split-of-positive-even-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46569, "totalSubmissionRaw": 78577}, "2179": {"acRate": 41.405475104146, "difficulty": "Hard", "likes": 618, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2179", "paidOnly": false, "title": "Count Good Triplets in an Array", "titleSlug": "count-good-triplets-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8349, "totalSubmissionRaw": 20164}, "2180": {"acRate": 67.2300539572181, "difficulty": "Easy", "likes": 618, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2180", "paidOnly": false, "title": "Count Integers With Even Digit Sum", "titleSlug": "count-integers-with-even-digit-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63047, "totalSubmissionRaw": 93778}, "2181": {"acRate": 89.8560346287008, "difficulty": "Medium", "likes": 2289, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2181", "paidOnly": false, "title": "Merge Nodes in Between Zeros", "titleSlug": "merge-nodes-in-between-zeros", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 270692, "totalSubmissionRaw": 301251}, "2182": {"acRate": 54.351529694061185, "difficulty": "Medium", "likes": 658, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2182", "paidOnly": false, "title": "Construct String With Repeat Limit", "titleSlug": "construct-string-with-repeat-limit", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22651, "totalSubmissionRaw": 41675}, "2183": {"acRate": 29.563364913313823, "difficulty": "Hard", "likes": 841, "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": 17069, "totalSubmissionRaw": 57737}, "2184": {"acRate": 49.0170380078637, "difficulty": "Medium", "likes": 177, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2184", "paidOnly": true, "title": "Number of Ways to Build Sturdy Brick Wall", "titleSlug": "number-of-ways-to-build-sturdy-brick-wall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8228, "totalSubmissionRaw": 16786}, "2185": {"acRate": 78.23357514749088, "difficulty": "Easy", "likes": 693, "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": 99323, "totalSubmissionRaw": 126957}, "2186": {"acRate": 72.71713810316139, "difficulty": "Medium", "likes": 572, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2186", "paidOnly": false, "title": "Minimum Number of Steps to Make Two Strings Anagram II", "titleSlug": "minimum-number-of-steps-to-make-two-strings-anagram-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43703, "totalSubmissionRaw": 60100}, "2187": {"acRate": 38.78892503817807, "difficulty": "Medium", "likes": 2799, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "2187", "paidOnly": false, "title": "Minimum Time to Complete Trips", "titleSlug": "minimum-time-to-complete-trips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116840, "totalSubmissionRaw": 301220}, "2188": {"acRate": 41.79561180847735, "difficulty": "Hard", "likes": 564, "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": 12020, "totalSubmissionRaw": 28759}, "2189": {"acRate": 63.189143341815104, "difficulty": "Medium", "likes": 66, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2189", "paidOnly": true, "title": "Number of Ways to Build House of Cards", "titleSlug": "number-of-ways-to-build-house-of-cards", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2235, "totalSubmissionRaw": 3537}, "2190": {"acRate": 59.03994228989916, "difficulty": "Easy", "likes": 370, "dislikes": 234, "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": 37648, "totalSubmissionRaw": 63767}, "2191": {"acRate": 60.27976212738901, "difficulty": "Medium", "likes": 918, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2191", "paidOnly": false, "title": "Sort the Jumbled Numbers", "titleSlug": "sort-the-jumbled-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145053, "totalSubmissionRaw": 240633}, "2192": {"acRate": 62.19328378308141, "difficulty": "Medium", "likes": 1602, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2192", "paidOnly": false, "title": "All Ancestors of a Node in a Directed Acyclic Graph", "titleSlug": "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131624, "totalSubmissionRaw": 211637}, "2193": {"acRate": 51.15850391169221, "difficulty": "Hard", "likes": 973, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2193", "paidOnly": false, "title": "Minimum Number of Moves to Make Palindrome", "titleSlug": "minimum-number-of-moves-to-make-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23868, "totalSubmissionRaw": 46655}, "2194": {"acRate": 84.16749773871095, "difficulty": "Easy", "likes": 605, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "2194", "paidOnly": false, "title": "Cells in a Range on an Excel Sheet", "titleSlug": "cells-in-a-range-on-an-excel-sheet", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72581, "totalSubmissionRaw": 86234}, "2195": {"acRate": 25.475196673235374, "difficulty": "Medium", "likes": 749, "dislikes": 308, "categoryTitle": "Algorithms", "frontendQuestionId": "2195", "paidOnly": false, "title": "Append K Integers With Minimal Sum", "titleSlug": "append-k-integers-with-minimal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32836, "totalSubmissionRaw": 128894}, "2196": {"acRate": 81.82576434587159, "difficulty": "Medium", "likes": 1562, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2196", "paidOnly": false, "title": "Create Binary Tree From Descriptions", "titleSlug": "create-binary-tree-from-descriptions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151079, "totalSubmissionRaw": 184635}, "2197": {"acRate": 39.17809698671563, "difficulty": "Hard", "likes": 424, "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": 14510, "totalSubmissionRaw": 37036}, "2198": {"acRate": 54.71789883268483, "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": 1125, "totalSubmissionRaw": 2056}, "2199": {"acRate": 49.069270674397316, "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": 3216, "totalSubmissionRaw": 6554}, "2200": {"acRate": 66.0610299619376, "difficulty": "Easy", "likes": 414, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2200", "paidOnly": false, "title": "Find All K-Distant Indices in an Array", "titleSlug": "find-all-k-distant-indices-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40613, "totalSubmissionRaw": 61478}, "2201": {"acRate": 56.54661921708185, "difficulty": "Medium", "likes": 213, "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": 19862, "totalSubmissionRaw": 35125}, "2202": {"acRate": 23.01985650449997, "difficulty": "Medium", "likes": 615, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "2202", "paidOnly": false, "title": "Maximize the Topmost Element After K Moves", "titleSlug": "maximize-the-topmost-element-after-k-moves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29261, "totalSubmissionRaw": 127112}, "2203": {"acRate": 37.041880835791844, "difficulty": "Hard", "likes": 673, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2203", "paidOnly": false, "title": "Minimum Weighted Subgraph With the Required Paths", "titleSlug": "minimum-weighted-subgraph-with-the-required-paths", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12179, "totalSubmissionRaw": 32879}, "2204": {"acRate": 68.60348627529554, "difficulty": "Hard", "likes": 112, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2204", "paidOnly": true, "title": "Distance to a Cycle in Undirected Graph", "titleSlug": "distance-to-a-cycle-in-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3424, "totalSubmissionRaw": 4991}, "2205": {"acRate": 50.02381330369901, "difficulty": "Easy", "likes": 27, "dislikes": 76, "categoryTitle": "Database", "frontendQuestionId": "2205", "paidOnly": true, "title": "The Number of Users That Are Eligible for Discount", "titleSlug": "the-number-of-users-that-are-eligible-for-discount", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6302, "totalSubmissionRaw": 12598}, "2206": {"acRate": 73.72815141911526, "difficulty": "Easy", "likes": 716, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2206", "paidOnly": false, "title": "Divide Array Into Equal Pairs", "titleSlug": "divide-array-into-equal-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83982, "totalSubmissionRaw": 113908}, "2207": {"acRate": 34.776311838782036, "difficulty": "Medium", "likes": 500, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2207", "paidOnly": false, "title": "Maximize Number of Subsequences in a String", "titleSlug": "maximize-number-of-subsequences-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19690, "totalSubmissionRaw": 56619}, "2208": {"acRate": 46.83478544817657, "difficulty": "Medium", "likes": 592, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2208", "paidOnly": false, "title": "Minimum Operations to Halve Array Sum", "titleSlug": "minimum-operations-to-halve-array-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31554, "totalSubmissionRaw": 67373}, "2209": {"acRate": 36.78804026050918, "difficulty": "Hard", "likes": 500, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2209", "paidOnly": false, "title": "Minimum White Tiles After Covering With Carpets", "titleSlug": "minimum-white-tiles-after-covering-with-carpets", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12427, "totalSubmissionRaw": 33780}, "2210": {"acRate": 61.03137516688919, "difficulty": "Easy", "likes": 688, "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": 51198, "totalSubmissionRaw": 83888}, "2211": {"acRate": 43.891751409014674, "difficulty": "Medium", "likes": 666, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "2211", "paidOnly": false, "title": "Count Collisions on a Road", "titleSlug": "count-collisions-on-a-road", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29048, "totalSubmissionRaw": 66181}, "2212": {"acRate": 50.183899958422614, "difficulty": "Medium", "likes": 494, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2212", "paidOnly": false, "title": "Maximum Points in an Archery Competition", "titleSlug": "maximum-points-in-an-archery-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15691, "totalSubmissionRaw": 31267}, "2213": {"acRate": 32.25073509756749, "difficulty": "Hard", "likes": 296, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2213", "paidOnly": false, "title": "Longest Substring of One Repeating Character", "titleSlug": "longest-substring-of-one-repeating-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4826, "totalSubmissionRaw": 14964}, "2214": {"acRate": 57.690468307398, "difficulty": "Medium", "likes": 313, "dislikes": 233, "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": 31364, "totalSubmissionRaw": 54366}, "2215": {"acRate": 79.22838000872757, "difficulty": "Easy", "likes": 2334, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2215", "paidOnly": false, "title": "Find the Difference of Two Arrays", "titleSlug": "find-the-difference-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 370368, "totalSubmissionRaw": 467462}, "2216": {"acRate": 48.5242891081605, "difficulty": "Medium", "likes": 792, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2216", "paidOnly": false, "title": "Minimum Deletions to Make Array Beautiful", "titleSlug": "minimum-deletions-to-make-array-beautiful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33293, "totalSubmissionRaw": 68611}, "2217": {"acRate": 37.11714066354117, "difficulty": "Medium", "likes": 618, "dislikes": 288, "categoryTitle": "Algorithms", "frontendQuestionId": "2217", "paidOnly": false, "title": "Find Palindrome With Fixed Length", "titleSlug": "find-palindrome-with-fixed-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22722, "totalSubmissionRaw": 61217}, "2218": {"acRate": 60.53944622109949, "difficulty": "Hard", "likes": 2307, "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": 67582, "totalSubmissionRaw": 111633}, "2219": {"acRate": 62.02586833309112, "difficulty": "Medium", "likes": 66, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2219", "paidOnly": true, "title": "Maximum Sum Score of Array", "titleSlug": "maximum-sum-score-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4268, "totalSubmissionRaw": 6881}, "2220": {"acRate": 85.23296159658261, "difficulty": "Easy", "likes": 928, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2220", "paidOnly": false, "title": "Minimum Bit Flips to Convert Number", "titleSlug": "minimum-bit-flips-to-convert-number", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 100961, "totalSubmissionRaw": 118453}, "2221": {"acRate": 78.80724174653886, "difficulty": "Medium", "likes": 1092, "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": 81400, "totalSubmissionRaw": 103290}, "2222": {"acRate": 50.67630089266275, "difficulty": "Medium", "likes": 975, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2222", "paidOnly": false, "title": "Number of Ways to Select Buildings", "titleSlug": "number-of-ways-to-select-buildings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37241, "totalSubmissionRaw": 73488}, "2223": {"acRate": 40.37305600610629, "difficulty": "Hard", "likes": 264, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2223", "paidOnly": false, "title": "Sum of Scores of Built Strings", "titleSlug": "sum-of-scores-of-built-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8463, "totalSubmissionRaw": 20962}, "2224": {"acRate": 65.24041387705417, "difficulty": "Easy", "likes": 453, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2224", "paidOnly": false, "title": "Minimum Number of Operations to Convert Time", "titleSlug": "minimum-number-of-operations-to-convert-time", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42876, "totalSubmissionRaw": 65720}, "2225": {"acRate": 73.21476831873066, "difficulty": "Medium", "likes": 2146, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "2225", "paidOnly": false, "title": "Find Players With Zero or One Losses", "titleSlug": "find-players-with-zero-or-one-losses", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251943, "totalSubmissionRaw": 344115}, "2226": {"acRate": 38.24939520563009, "difficulty": "Medium", "likes": 1115, "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": 43480, "totalSubmissionRaw": 113675}, "2227": {"acRate": 40.523968784838345, "difficulty": "Hard", "likes": 332, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "2227", "paidOnly": false, "title": "Encrypt and Decrypt Strings", "titleSlug": "encrypt-and-decrypt-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13086, "totalSubmissionRaw": 32292}, "2228": {"acRate": 44.843169957497174, "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": 8335, "totalSubmissionRaw": 18587}, "2229": {"acRate": 61.2108773730118, "difficulty": "Easy", "likes": 81, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2229", "paidOnly": true, "title": "Check if an Array Is Consecutive", "titleSlug": "check-if-an-array-is-consecutive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5965, "totalSubmissionRaw": 9745}, "2230": {"acRate": 49.94494402642687, "difficulty": "Easy", "likes": 20, "dislikes": 44, "categoryTitle": "Database", "frontendQuestionId": "2230", "paidOnly": true, "title": "The Users That Are Eligible for Discount", "titleSlug": "the-users-that-are-eligible-for-discount", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5443, "totalSubmissionRaw": 10898}, "2231": {"acRate": 61.93294428539969, "difficulty": "Easy", "likes": 615, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "2231", "paidOnly": false, "title": "Largest Number After Digit Swaps by Parity", "titleSlug": "largest-number-after-digit-swaps-by-parity", "topicTags": [{"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44998, "totalSubmissionRaw": 72656}, "2232": {"acRate": 67.48601566245804, "difficulty": "Medium", "likes": 205, "dislikes": 333, "categoryTitle": "Algorithms", "frontendQuestionId": "2232", "paidOnly": false, "title": "Minimize Result by Adding Parentheses to Expression", "titleSlug": "minimize-result-by-adding-parentheses-to-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21113, "totalSubmissionRaw": 31285}, "2233": {"acRate": 41.68779744432092, "difficulty": "Medium", "likes": 736, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2233", "paidOnly": false, "title": "Maximum Product After K Increments", "titleSlug": "maximum-product-after-k-increments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33374, "totalSubmissionRaw": 80057}, "2234": {"acRate": 29.538720269079842, "difficulty": "Hard", "likes": 432, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2234", "paidOnly": false, "title": "Maximum Total Beauty of the Gardens", "titleSlug": "maximum-total-beauty-of-the-gardens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7377, "totalSubmissionRaw": 24974}, "2235": {"acRate": 87.88919256929955, "difficulty": "Easy", "likes": 1629, "dislikes": 3114, "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": 538305, "totalSubmissionRaw": 612482}, "2236": {"acRate": 84.55704612600896, "difficulty": "Easy", "likes": 1266, "dislikes": 1530, "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": 239259, "totalSubmissionRaw": 282957}, "2237": {"acRate": 63.569730586370845, "difficulty": "Medium", "likes": 77, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2237", "paidOnly": true, "title": "Count Positions on Street With Required Brightness", "titleSlug": "count-positions-on-street-with-required-brightness", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3209, "totalSubmissionRaw": 5048}, "2238": {"acRate": 71.38292206639446, "difficulty": "Medium", "likes": 67, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2238", "paidOnly": true, "title": "Number of Times a Driver Was a Passenger", "titleSlug": "number-of-times-a-driver-was-a-passenger", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8042, "totalSubmissionRaw": 11266}, "2239": {"acRate": 45.51186328189812, "difficulty": "Easy", "likes": 576, "dislikes": 38, "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": 76804, "totalSubmissionRaw": 168755}, "2240": {"acRate": 57.17159811412779, "difficulty": "Medium", "likes": 447, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2240", "paidOnly": false, "title": "Number of Ways to Buy Pens and Pencils", "titleSlug": "number-of-ways-to-buy-pens-and-pencils", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28133, "totalSubmissionRaw": 49208}, "2241": {"acRate": 42.019205323050166, "difficulty": "Medium", "likes": 262, "dislikes": 345, "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": 22228, "totalSubmissionRaw": 52901}, "2242": {"acRate": 38.66977241965438, "difficulty": "Hard", "likes": 520, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2242", "paidOnly": false, "title": "Maximum Score of a Node Sequence", "titleSlug": "maximum-score-of-a-node-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12285, "totalSubmissionRaw": 31769}, "2243": {"acRate": 66.1644150052466, "difficulty": "Easy", "likes": 545, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2243", "paidOnly": false, "title": "Calculate Digit Sum of a String", "titleSlug": "calculate-digit-sum-of-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40355, "totalSubmissionRaw": 60992}, "2244": {"acRate": 62.896203952445205, "difficulty": "Medium", "likes": 2771, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2244", "paidOnly": false, "title": "Minimum Rounds to Complete All Tasks", "titleSlug": "minimum-rounds-to-complete-all-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152417, "totalSubmissionRaw": 242331}, "2245": {"acRate": 36.29438232280483, "difficulty": "Medium", "likes": 186, "dislikes": 400, "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": 8147, "totalSubmissionRaw": 22447}, "2246": {"acRate": 54.42235310391019, "difficulty": "Hard", "likes": 2370, "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": 74754, "totalSubmissionRaw": 137359}, "2247": {"acRate": 49.94493392070485, "difficulty": "Hard", "likes": 59, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2247", "paidOnly": true, "title": "Maximum Cost of Trip With K Highways", "titleSlug": "maximum-cost-of-trip-with-k-highways", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1814, "totalSubmissionRaw": 3632}, "2248": {"acRate": 68.21720311387402, "difficulty": "Easy", "likes": 714, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2248", "paidOnly": false, "title": "Intersection of Multiple Arrays", "titleSlug": "intersection-of-multiple-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85263, "totalSubmissionRaw": 124987}, "2249": {"acRate": 53.18696733331917, "difficulty": "Medium", "likes": 234, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "2249", "paidOnly": false, "title": "Count Lattice Points Inside a Circle", "titleSlug": "count-lattice-points-inside-a-circle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25025, "totalSubmissionRaw": 47051}, "2250": {"acRate": 35.20975185744738, "difficulty": "Medium", "likes": 504, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "2250", "paidOnly": false, "title": "Count Number of Rectangles Containing Each Point", "titleSlug": "count-number-of-rectangles-containing-each-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17013, "totalSubmissionRaw": 48319}, "2251": {"acRate": 56.69265621525461, "difficulty": "Hard", "likes": 1651, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2251", "paidOnly": false, "title": "Number of Flowers in Full Bloom", "titleSlug": "number-of-flowers-in-full-bloom", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81583, "totalSubmissionRaw": 143904}, "2252": {"acRate": 55.71630204657727, "difficulty": "Hard", "likes": 30, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2252", "paidOnly": true, "title": "Dynamic Pivoting of a Table", "titleSlug": "dynamic-pivoting-of-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1579, "totalSubmissionRaw": 2834}, "2253": {"acRate": 66.57342657342657, "difficulty": "Hard", "likes": 16, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "2253", "paidOnly": true, "title": "Dynamic Unpivoting of a Table", "titleSlug": "dynamic-unpivoting-of-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 952, "totalSubmissionRaw": 1430}, "2254": {"acRate": 64.26592797783933, "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": 3480, "totalSubmissionRaw": 5415}, "2255": {"acRate": 72.64451524806555, "difficulty": "Easy", "likes": 539, "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": 63840, "totalSubmissionRaw": 87880}, "2256": {"acRate": 43.21027899115834, "difficulty": "Medium", "likes": 1507, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "2256", "paidOnly": false, "title": "Minimum Average Difference", "titleSlug": "minimum-average-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86160, "totalSubmissionRaw": 199397}, "2257": {"acRate": 52.582494190549966, "difficulty": "Medium", "likes": 419, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2257", "paidOnly": false, "title": "Count Unguarded Cells in the Grid", "titleSlug": "count-unguarded-cells-in-the-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16971, "totalSubmissionRaw": 32275}, "2258": {"acRate": 35.08954538496862, "difficulty": "Hard", "likes": 731, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2258", "paidOnly": false, "title": "Escape the Spreading Fire", "titleSlug": "escape-the-spreading-fire", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11462, "totalSubmissionRaw": 32665}, "2259": {"acRate": 45.703766227713594, "difficulty": "Easy", "likes": 825, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2259", "paidOnly": false, "title": "Remove Digit From Number to Maximize Result", "titleSlug": "remove-digit-from-number-to-maximize-result", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88259, "totalSubmissionRaw": 193111}, "2260": {"acRate": 51.48278917409515, "difficulty": "Medium", "likes": 954, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2260", "paidOnly": false, "title": "Minimum Consecutive Cards to Pick Up", "titleSlug": "minimum-consecutive-cards-to-pick-up", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76695, "totalSubmissionRaw": 148973}, "2261": {"acRate": 51.96359723841118, "difficulty": "Medium", "likes": 666, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2261", "paidOnly": false, "title": "K Divisible Elements Subarrays", "titleSlug": "k-divisible-elements-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34773, "totalSubmissionRaw": 66918}, "2262": {"acRate": 55.6938516177381, "difficulty": "Hard", "likes": 1110, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2262", "paidOnly": false, "title": "Total Appeal of A String", "titleSlug": "total-appeal-of-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34186, "totalSubmissionRaw": 61382}, "2263": {"acRate": 65.91952967113724, "difficulty": "Hard", "likes": 83, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2263", "paidOnly": true, "title": "Make Array Non-decreasing or Non-increasing", "titleSlug": "make-array-non-decreasing-or-non-increasing", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3588, "totalSubmissionRaw": 5443}, "2264": {"acRate": 68.99697599346963, "difficulty": "Easy", "likes": 996, "dislikes": 47, "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": 148763, "totalSubmissionRaw": 215608}, "2265": {"acRate": 86.3302286004717, "difficulty": "Medium", "likes": 2188, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2265", "paidOnly": false, "title": "Count Nodes Equal to Average of Subtree", "titleSlug": "count-nodes-equal-to-average-of-subtree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151172, "totalSubmissionRaw": 175109}, "2266": {"acRate": 47.85074080848729, "difficulty": "Medium", "likes": 872, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2266", "paidOnly": false, "title": "Count Number of Texts", "titleSlug": "count-number-of-texts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20928, "totalSubmissionRaw": 43732}, "2267": {"acRate": 38.87881609251727, "difficulty": "Hard", "likes": 515, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2267", "paidOnly": false, "title": " Check if There Is a Valid Parentheses String Path", "titleSlug": "check-if-there-is-a-valid-parentheses-string-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15868, "totalSubmissionRaw": 40814}, "2268": {"acRate": 71.32186239648712, "difficulty": "Medium", "likes": 244, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2268", "paidOnly": true, "title": "Minimum Number of Keypresses", "titleSlug": "minimum-number-of-keypresses", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29885, "totalSubmissionRaw": 41902}, "2269": {"acRate": 60.135638402132585, "difficulty": "Easy", "likes": 655, "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": 61360, "totalSubmissionRaw": 102036}, "2270": {"acRate": 47.99181061487515, "difficulty": "Medium", "likes": 567, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2270", "paidOnly": false, "title": "Number of Ways to Split Array", "titleSlug": "number-of-ways-to-split-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42897, "totalSubmissionRaw": 89380}, "2271": {"acRate": 33.80839751753694, "difficulty": "Medium", "likes": 774, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2271", "paidOnly": false, "title": "Maximum White Tiles Covered by a Carpet", "titleSlug": "maximum-white-tiles-covered-by-a-carpet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16724, "totalSubmissionRaw": 49467}, "2272": {"acRate": 46.24139507367968, "difficulty": "Hard", "likes": 1850, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "2272", "paidOnly": false, "title": "Substring With Largest Variance", "titleSlug": "substring-with-largest-variance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68785, "totalSubmissionRaw": 148752}, "2273": {"acRate": 58.388551701096944, "difficulty": "Easy", "likes": 671, "dislikes": 184, "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": 62916, "totalSubmissionRaw": 107754}, "2274": {"acRate": 51.79289809623364, "difficulty": "Medium", "likes": 406, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2274", "paidOnly": false, "title": "Maximum Consecutive Floors Without Special Floors", "titleSlug": "maximum-consecutive-floors-without-special-floors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32701, "totalSubmissionRaw": 63138}, "2275": {"acRate": 72.97142559725187, "difficulty": "Medium", "likes": 563, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2275", "paidOnly": false, "title": "Largest Combination With Bitwise AND Greater Than Zero", "titleSlug": "largest-combination-with-bitwise-and-greater-than-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28040, "totalSubmissionRaw": 38426}, "2276": {"acRate": 35.299490067737274, "difficulty": "Hard", "likes": 575, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2276", "paidOnly": false, "title": "Count Integers in Intervals", "titleSlug": "count-integers-in-intervals", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18552, "totalSubmissionRaw": 52556}, "2277": {"acRate": 62.59128682951398, "difficulty": "Hard", "likes": 134, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2277", "paidOnly": true, "title": "Closest Node to Path in Tree", "titleSlug": "closest-node-to-path-in-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4971, "totalSubmissionRaw": 7942}, "2278": {"acRate": 74.11642310571808, "difficulty": "Easy", "likes": 518, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2278", "paidOnly": false, "title": "Percentage of Letter in String", "titleSlug": "percentage-of-letter-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76227, "totalSubmissionRaw": 102848}, "2279": {"acRate": 67.50639098800461, "difficulty": "Medium", "likes": 1668, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "2279", "paidOnly": false, "title": "Maximum Bags With Full Capacity of Rocks", "titleSlug": "maximum-bags-with-full-capacity-of-rocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96121, "totalSubmissionRaw": 142388}, "2280": {"acRate": 25.334673290606396, "difficulty": "Medium", "likes": 341, "dislikes": 523, "categoryTitle": "Algorithms", "frontendQuestionId": "2280", "paidOnly": false, "title": "Minimum Lines to Represent a Line Chart", "titleSlug": "minimum-lines-to-represent-a-line-chart", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26722, "totalSubmissionRaw": 105476}, "2281": {"acRate": 27.878703574906105, "difficulty": "Hard", "likes": 1181, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2281", "paidOnly": false, "title": "Sum of Total Strength of Wizards", "titleSlug": "sum-of-total-strength-of-wizards", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20042, "totalSubmissionRaw": 71890}, "2282": {"acRate": 48.29575249082328, "difficulty": "Medium", "likes": 63, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2282", "paidOnly": true, "title": "Number of People That Can Be Seen in a Grid", "titleSlug": "number-of-people-that-can-be-seen-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1842, "totalSubmissionRaw": 3814}, "2283": {"acRate": 72.35705922529027, "difficulty": "Easy", "likes": 598, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2283", "paidOnly": false, "title": "Check if Number Has Equal Digit Count and Digit Value", "titleSlug": "check-if-number-has-equal-digit-count-and-digit-value", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59327, "totalSubmissionRaw": 81992}, "2284": {"acRate": 57.021059054403935, "difficulty": "Medium", "likes": 432, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2284", "paidOnly": false, "title": "Sender With Largest Word Count", "titleSlug": "sender-with-largest-word-count", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34577, "totalSubmissionRaw": 60639}, "2285": {"acRate": 69.36982333918779, "difficulty": "Medium", "likes": 1262, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "2285", "paidOnly": false, "title": "Maximum Total Importance of Roads", "titleSlug": "maximum-total-importance-of-roads", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141793, "totalSubmissionRaw": 204401}, "2286": {"acRate": 17.86203051345735, "difficulty": "Hard", "likes": 331, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2286", "paidOnly": false, "title": "Booking Concert Tickets in Groups", "titleSlug": "booking-concert-tickets-in-groups", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7048, "totalSubmissionRaw": 39458}, "2287": {"acRate": 59.275979557069846, "difficulty": "Easy", "likes": 471, "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": 41754, "totalSubmissionRaw": 70439}, "2288": {"acRate": 31.12450307649457, "difficulty": "Medium", "likes": 199, "dislikes": 1101, "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": 24584, "totalSubmissionRaw": 78986}, "2289": {"acRate": 22.024788855983328, "difficulty": "Medium", "likes": 1330, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2289", "paidOnly": false, "title": "Steps to Make Array Non-decreasing", "titleSlug": "steps-to-make-array-non-decreasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22088, "totalSubmissionRaw": 100287}, "2290": {"acRate": 54.59511568123393, "difficulty": "Hard", "likes": 950, "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": 27184, "totalSubmissionRaw": 49792}, "2291": {"acRate": 45.336435912352144, "difficulty": "Medium", "likes": 158, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2291", "paidOnly": true, "title": "Maximum Profit From Trading Stocks", "titleSlug": "maximum-profit-from-trading-stocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9352, "totalSubmissionRaw": 20628}, "2292": {"acRate": 39.37202038467861, "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": 7185, "totalSubmissionRaw": 18249}, "2293": {"acRate": 63.16745090016367, "difficulty": "Easy", "likes": 534, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2293", "paidOnly": false, "title": "Min Max Game", "titleSlug": "min-max-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49402, "totalSubmissionRaw": 78208}, "2294": {"acRate": 73.98677293539087, "difficulty": "Medium", "likes": 766, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2294", "paidOnly": false, "title": "Partition Array Such That Maximum Difference Is K", "titleSlug": "partition-array-such-that-maximum-difference-is-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43629, "totalSubmissionRaw": 58969}, "2295": {"acRate": 57.95032145876873, "difficulty": "Medium", "likes": 632, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2295", "paidOnly": false, "title": "Replace Elements in an Array", "titleSlug": "replace-elements-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36325, "totalSubmissionRaw": 62683}, "2296": {"acRate": 45.23937312151138, "difficulty": "Hard", "likes": 571, "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": 25287, "totalSubmissionRaw": 55896}, "2297": {"acRate": 45.47922888949226, "difficulty": "Medium", "likes": 145, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2297", "paidOnly": true, "title": "Jump Game VIII", "titleSlug": "jump-game-viii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5025, "totalSubmissionRaw": 11049}, "2298": {"acRate": 81.51410698327588, "difficulty": "Medium", "likes": 47, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2298", "paidOnly": true, "title": "Tasks Count in the Weekend", "titleSlug": "tasks-count-in-the-weekend", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6385, "totalSubmissionRaw": 7833}, "2299": {"acRate": 54.839450126246525, "difficulty": "Easy", "likes": 347, "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": 43004, "totalSubmissionRaw": 78418}, "2300": {"acRate": 43.45871014588422, "difficulty": "Medium", "likes": 2570, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2300", "paidOnly": false, "title": "Successful Pairs of Spells and Potions", "titleSlug": "successful-pairs-of-spells-and-potions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164588, "totalSubmissionRaw": 378721}, "2301": {"acRate": 41.029636765455884, "difficulty": "Hard", "likes": 379, "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": 14481, "totalSubmissionRaw": 35294}, "2302": {"acRate": 54.875862925695216, "difficulty": "Hard", "likes": 1038, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2302", "paidOnly": false, "title": "Count Subarrays With Score Less Than K", "titleSlug": "count-subarrays-with-score-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30922, "totalSubmissionRaw": 56349}, "2303": {"acRate": 65.79557676794838, "difficulty": "Easy", "likes": 262, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "2303", "paidOnly": false, "title": "Calculate Amount Paid in Taxes", "titleSlug": "calculate-amount-paid-in-taxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39151, "totalSubmissionRaw": 59504}, "2304": {"acRate": 66.81205055104039, "difficulty": "Medium", "likes": 886, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2304", "paidOnly": false, "title": "Minimum Path Cost in a Grid", "titleSlug": "minimum-path-cost-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31403, "totalSubmissionRaw": 47002}, "2305": {"acRate": 69.21632138123623, "difficulty": "Medium", "likes": 2562, "dislikes": 116, "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": 97658, "totalSubmissionRaw": 141091}, "2306": {"acRate": 46.39658848614073, "difficulty": "Hard", "likes": 1944, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2306", "paidOnly": false, "title": "Naming a Company", "titleSlug": "naming-a-company", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60928, "totalSubmissionRaw": 131320}, "2307": {"acRate": 43.578217313126125, "difficulty": "Hard", "likes": 59, "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": 3393, "totalSubmissionRaw": 7786}, "2308": {"acRate": 69.13253566497929, "difficulty": "Medium", "likes": 78, "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": 6009, "totalSubmissionRaw": 8692}, "2309": {"acRate": 70.04431426515333, "difficulty": "Easy", "likes": 481, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2309", "paidOnly": false, "title": "Greatest English Letter in Upper and Lower Case", "titleSlug": "greatest-english-letter-in-upper-and-lower-case", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55480, "totalSubmissionRaw": 79207}, "2310": {"acRate": 26.787769604163543, "difficulty": "Medium", "likes": 405, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "2310", "paidOnly": false, "title": "Sum of Numbers With Units Digit K", "titleSlug": "sum-of-numbers-with-units-digit-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26765, "totalSubmissionRaw": 99915}, "2311": {"acRate": 37.97996520093923, "difficulty": "Medium", "likes": 684, "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": 22483, "totalSubmissionRaw": 59197}, "2312": {"acRate": 50.04319556222434, "difficulty": "Hard", "likes": 543, "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": 11006, "totalSubmissionRaw": 21993}, "2313": {"acRate": 58.734220402592975, "difficulty": "Hard", "likes": 99, "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": 3443, "totalSubmissionRaw": 5862}, "2314": {"acRate": 71.86993895602342, "difficulty": "Medium", "likes": 52, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2314", "paidOnly": true, "title": "The First Day of the Maximum Recorded Degree in Each City", "titleSlug": "the-first-day-of-the-maximum-recorded-degree-in-each-city", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5769, "totalSubmissionRaw": 8027}, "2315": {"acRate": 82.39973336295967, "difficulty": "Easy", "likes": 626, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2315", "paidOnly": false, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74168, "totalSubmissionRaw": 90010}, "2316": {"acRate": 49.20782357156126, "difficulty": "Medium", "likes": 2040, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2316", "paidOnly": false, "title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "titleSlug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92710, "totalSubmissionRaw": 188405}, "2317": {"acRate": 79.61480199091106, "difficulty": "Medium", "likes": 611, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "2317", "paidOnly": false, "title": "Maximum XOR After Operations ", "titleSlug": "maximum-xor-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25753, "totalSubmissionRaw": 32347}, "2318": {"acRate": 57.24727838258165, "difficulty": "Hard", "likes": 437, "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": 11043, "totalSubmissionRaw": 19290}, "2319": {"acRate": 65.17592020264456, "difficulty": "Easy", "likes": 489, "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": 53776, "totalSubmissionRaw": 82509}, "2320": {"acRate": 41.95704993737078, "difficulty": "Medium", "likes": 579, "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": 27802, "totalSubmissionRaw": 66263}, "2321": {"acRate": 56.862110558677294, "difficulty": "Hard", "likes": 786, "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": 19328, "totalSubmissionRaw": 33991}, "2322": {"acRate": 52.42507194497087, "difficulty": "Hard", "likes": 453, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2322", "paidOnly": false, "title": "Minimum Score After Removals on a Tree", "titleSlug": "minimum-score-after-removals-on-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7469, "totalSubmissionRaw": 14247}, "2323": {"acRate": 65.84532231142198, "difficulty": "Medium", "likes": 61, "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": 8284, "totalSubmissionRaw": 12581}, "2324": {"acRate": 74.30480495234352, "difficulty": "Medium", "likes": 48, "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": 7562, "totalSubmissionRaw": 10177}, "2325": {"acRate": 84.56482569526048, "difficulty": "Easy", "likes": 993, "dislikes": 99, "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": 107947, "totalSubmissionRaw": 127650}, "2326": {"acRate": 75.57685119108302, "difficulty": "Medium", "likes": 764, "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": 44478, "totalSubmissionRaw": 58852}, "2327": {"acRate": 45.957216051460414, "difficulty": "Medium", "likes": 847, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2327", "paidOnly": false, "title": "Number of People Aware of a Secret", "titleSlug": "number-of-people-aware-of-a-secret", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24577, "totalSubmissionRaw": 53478}, "2328": {"acRate": 58.219091193559024, "difficulty": "Hard", "likes": 1977, "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": 68840, "totalSubmissionRaw": 118243}, "2329": {"acRate": 69.74459724950884, "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": 7455, "totalSubmissionRaw": 10689}, "2330": {"acRate": 76.04198081910852, "difficulty": "Medium", "likes": 102, "dislikes": 32, "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": 12607, "totalSubmissionRaw": 16579}, "2331": {"acRate": 82.82707330029871, "difficulty": "Easy", "likes": 1429, "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": 190218, "totalSubmissionRaw": 229657}, "2332": {"acRate": 27.37641328543407, "difficulty": "Medium", "likes": 461, "dislikes": 743, "categoryTitle": "Algorithms", "frontendQuestionId": "2332", "paidOnly": false, "title": "The Latest Time to Catch a Bus", "titleSlug": "the-latest-time-to-catch-a-bus", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24843, "totalSubmissionRaw": 90744}, "2333": {"acRate": 25.491712512962934, "difficulty": "Medium", "likes": 627, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2333", "paidOnly": false, "title": "Minimum Sum of Squared Difference", "titleSlug": "minimum-sum-of-squared-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14503, "totalSubmissionRaw": 56893}, "2334": {"acRate": 42.97013565984373, "difficulty": "Hard", "likes": 545, "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": 8964, "totalSubmissionRaw": 20861}, "2335": {"acRate": 57.87385723082753, "difficulty": "Easy", "likes": 691, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2335", "paidOnly": false, "title": "Minimum Amount of Time to Fill Cups", "titleSlug": "minimum-amount-of-time-to-fill-cups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48871, "totalSubmissionRaw": 84444}, "2336": {"acRate": 71.63262536472823, "difficulty": "Medium", "likes": 1668, "dislikes": 194, "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": 147790, "totalSubmissionRaw": 206317}, "2337": {"acRate": 47.63602457218078, "difficulty": "Medium", "likes": 656, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2337", "paidOnly": false, "title": "Move Pieces to Obtain a String", "titleSlug": "move-pieces-to-obtain-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26055, "totalSubmissionRaw": 54696}, "2338": {"acRate": 26.829995739241586, "difficulty": "Hard", "likes": 482, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2338", "paidOnly": false, "title": "Count the Number of Ideal Arrays", "titleSlug": "count-the-number-of-ideal-arrays", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6297, "totalSubmissionRaw": 23470}, "2339": {"acRate": 87.71305285868392, "difficulty": "Easy", "likes": 42, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2339", "paidOnly": true, "title": "All the Matches of the League", "titleSlug": "all-the-matches-of-the-league", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8131, "totalSubmissionRaw": 9270}, "2340": {"acRate": 72.4224004437562, "difficulty": "Medium", "likes": 175, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2340", "paidOnly": true, "title": "Minimum Adjacent Swaps to Make a Valid Array", "titleSlug": "minimum-adjacent-swaps-to-make-a-valid-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31334, "totalSubmissionRaw": 43266}, "2341": {"acRate": 75.33122961357431, "difficulty": "Easy", "likes": 675, "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": 70901, "totalSubmissionRaw": 94119}, "2342": {"acRate": 55.09182530795073, "difficulty": "Medium", "likes": 699, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2342", "paidOnly": false, "title": "Max Sum of a Pair With Equal Sum of Digits", "titleSlug": "max-sum-of-a-pair-with-equal-sum-of-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49197, "totalSubmissionRaw": 89300}, "2343": {"acRate": 44.19121084618981, "difficulty": "Medium", "likes": 311, "dislikes": 428, "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": 30248, "totalSubmissionRaw": 68448}, "2344": {"acRate": 56.2438233782662, "difficulty": "Hard", "likes": 546, "dislikes": 127, "categoryTitle": "Algorithms", "frontendQuestionId": "2344", "paidOnly": false, "title": "Minimum Deletions to Make Array Divisible", "titleSlug": "minimum-deletions-to-make-array-divisible", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28456, "totalSubmissionRaw": 50594}, "2345": {"acRate": 37.79135256910146, "difficulty": "Medium", "likes": 156, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2345", "paidOnly": true, "title": "Finding the Number of Visible Mountains", "titleSlug": "finding-the-number-of-visible-mountains", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8723, "totalSubmissionRaw": 23082}, "2346": {"acRate": 33.607118412046546, "difficulty": "Medium", "likes": 26, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "2346", "paidOnly": true, "title": "Compute the Rank as a Percentage", "titleSlug": "compute-the-rank-as-a-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4910, "totalSubmissionRaw": 14610}, "2347": {"acRate": 60.66414181414973, "difficulty": "Easy", "likes": 371, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2347", "paidOnly": false, "title": "Best Poker Hand", "titleSlug": "best-poker-hand", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42127, "totalSubmissionRaw": 69443}, "2348": {"acRate": 66.74885744350038, "difficulty": "Medium", "likes": 2258, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2348", "paidOnly": false, "title": "Number of Zero-Filled Subarrays", "titleSlug": "number-of-zero-filled-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127503, "totalSubmissionRaw": 191019}, "2349": {"acRate": 44.83714351250095, "difficulty": "Medium", "likes": 397, "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": 23457, "totalSubmissionRaw": 52316}, "2350": {"acRate": 68.55110951073502, "difficulty": "Hard", "likes": 639, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2350", "paidOnly": false, "title": "Shortest Impossible Sequence of Rolls", "titleSlug": "shortest-impossible-sequence-of-rolls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15230, "totalSubmissionRaw": 22217}, "2351": {"acRate": 73.62874548124384, "difficulty": "Easy", "likes": 1029, "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": 124853, "totalSubmissionRaw": 169571}, "2352": {"acRate": 70.42085616232163, "difficulty": "Medium", "likes": 2209, "dislikes": 155, "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": 233924, "totalSubmissionRaw": 332180}, "2353": {"acRate": 45.22314138087972, "difficulty": "Medium", "likes": 1488, "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": 84461, "totalSubmissionRaw": 186765}, "2354": {"acRate": 47.479267720231576, "difficulty": "Hard", "likes": 590, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2354", "paidOnly": false, "title": "Number of Excellent Pairs", "titleSlug": "number-of-excellent-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15172, "totalSubmissionRaw": 31955}, "2355": {"acRate": 40.326290067557856, "difficulty": "Hard", "likes": 283, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2355", "paidOnly": true, "title": "Maximum Number of Books You Can Take", "titleSlug": "maximum-number-of-books-you-can-take", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11222, "totalSubmissionRaw": 27828}, "2356": {"acRate": 88.51243027924029, "difficulty": "Easy", "likes": 449, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "2356", "paidOnly": false, "title": "Number of Unique Subjects Taught by Each Teacher", "titleSlug": "number-of-unique-subjects-taught-by-each-teacher", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 198201, "totalSubmissionRaw": 223925}, "2357": {"acRate": 72.44244231595441, "difficulty": "Easy", "likes": 1173, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2357", "paidOnly": false, "title": "Make Array Zero by Subtracting Equal Amounts", "titleSlug": "make-array-zero-by-subtracting-equal-amounts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 114659, "totalSubmissionRaw": 158276}, "2358": {"acRate": 68.07046860556069, "difficulty": "Medium", "likes": 669, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "2358", "paidOnly": false, "title": "Maximum Number of Groups Entering a Competition", "titleSlug": "maximum-number-of-groups-entering-a-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38291, "totalSubmissionRaw": 56252}, "2359": {"acRate": 45.48409754511839, "difficulty": "Medium", "likes": 1683, "dislikes": 403, "categoryTitle": "Algorithms", "frontendQuestionId": "2359", "paidOnly": false, "title": "Find Closest Node to Given Two Nodes", "titleSlug": "find-closest-node-to-given-two-nodes", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78354, "totalSubmissionRaw": 172267}, "2360": {"acRate": 49.815056783093134, "difficulty": "Hard", "likes": 2326, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2360", "paidOnly": false, "title": "Longest Cycle in a Graph", "titleSlug": "longest-cycle-in-a-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76631, "totalSubmissionRaw": 153831}, "2361": {"acRate": 78.67921816613969, "difficulty": "Hard", "likes": 183, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2361", "paidOnly": true, "title": "Minimum Costs Using the Train Line", "titleSlug": "minimum-costs-using-the-train-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10949, "totalSubmissionRaw": 13916}, "2362": {"acRate": 74.40921026055342, "difficulty": "Hard", "likes": 32, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2362", "paidOnly": true, "title": "Generate the Invoice", "titleSlug": "generate-the-invoice", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3684, "totalSubmissionRaw": 4951}, "2363": {"acRate": 75.64654620017942, "difficulty": "Easy", "likes": 557, "dislikes": 25, "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": 59027, "totalSubmissionRaw": 78030}, "2364": {"acRate": 41.7859282009456, "difficulty": "Medium", "likes": 983, "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": 32789, "totalSubmissionRaw": 78469}, "2365": {"acRate": 52.55022092974011, "difficulty": "Medium", "likes": 552, "dislikes": 58, "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": 37224, "totalSubmissionRaw": 70836}, "2366": {"acRate": 53.55098698734055, "difficulty": "Hard", "likes": 1998, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2366", "paidOnly": false, "title": "Minimum Replacements to Sort the Array", "titleSlug": "minimum-replacements-to-sort-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66709, "totalSubmissionRaw": 124571}, "2367": {"acRate": 84.35156769070143, "difficulty": "Easy", "likes": 1261, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2367", "paidOnly": false, "title": "Number of Arithmetic Triplets", "titleSlug": "number-of-arithmetic-triplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 133304, "totalSubmissionRaw": 158034}, "2368": {"acRate": 58.939628081602166, "difficulty": "Medium", "likes": 702, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2368", "paidOnly": false, "title": "Reachable Nodes With Restrictions", "titleSlug": "reachable-nodes-with-restrictions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56829, "totalSubmissionRaw": 96419}, "2369": {"acRate": 51.84632141100415, "difficulty": "Medium", "likes": 1991, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "2369", "paidOnly": false, "title": "Check if There is a Valid Partition For The Array", "titleSlug": "check-if-there-is-a-valid-partition-for-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88539, "totalSubmissionRaw": 170772}, "2370": {"acRate": 47.334357492163534, "difficulty": "Medium", "likes": 1451, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2370", "paidOnly": false, "title": "Longest Ideal Subsequence", "titleSlug": "longest-ideal-subsequence", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114312, "totalSubmissionRaw": 241499}, "2371": {"acRate": 66.30920464700625, "difficulty": "Hard", "likes": 99, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2371", "paidOnly": true, "title": "Minimize Maximum Value in a Grid", "titleSlug": "minimize-maximum-value-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2968, "totalSubmissionRaw": 4474}, "2372": {"acRate": 83.25026431052711, "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": 5512, "totalSubmissionRaw": 6621}, "2373": {"acRate": 88.02333320707139, "difficulty": "Easy", "likes": 1203, "dislikes": 157, "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": 162668, "totalSubmissionRaw": 184801}, "2374": {"acRate": 47.74768597874529, "difficulty": "Medium", "likes": 440, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2374", "paidOnly": false, "title": "Node With Highest Edge Score", "titleSlug": "node-with-highest-edge-score", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34820, "totalSubmissionRaw": 72925}, "2375": {"acRate": 76.21221522914635, "difficulty": "Medium", "likes": 937, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2375", "paidOnly": false, "title": "Construct Smallest Number From DI String", "titleSlug": "construct-smallest-number-from-di-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34390, "totalSubmissionRaw": 45124}, "2376": {"acRate": 38.79054635920008, "difficulty": "Hard", "likes": 570, "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": 12162, "totalSubmissionRaw": 31353}, "2377": {"acRate": 78.90922959572845, "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": 6207, "totalSubmissionRaw": 7866}, "2378": {"acRate": 58.362989323843415, "difficulty": "Medium", "likes": 53, "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": 1475, "totalSubmissionRaw": 2528}, "2379": {"acRate": 59.09143904946633, "difficulty": "Easy", "likes": 732, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2379", "paidOnly": false, "title": "Minimum Recolors to Get K Consecutive Black Blocks", "titleSlug": "minimum-recolors-to-get-k-consecutive-black-blocks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55751, "totalSubmissionRaw": 94347}, "2380": {"acRate": 50.59458115061168, "difficulty": "Medium", "likes": 500, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "2380", "paidOnly": false, "title": "Time Needed to Rearrange a Binary String", "titleSlug": "time-needed-to-rearrange-a-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32548, "totalSubmissionRaw": 64331}, "2381": {"acRate": 37.65849889995466, "difficulty": "Medium", "likes": 758, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2381", "paidOnly": false, "title": "Shifting Letters II", "titleSlug": "shifting-letters-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22423, "totalSubmissionRaw": 59543}, "2382": {"acRate": 49.16129032258065, "difficulty": "Hard", "likes": 460, "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": 9144, "totalSubmissionRaw": 18600}, "2383": {"acRate": 41.25625990890102, "difficulty": "Easy", "likes": 344, "dislikes": 277, "categoryTitle": "Algorithms", "frontendQuestionId": "2383", "paidOnly": false, "title": "Minimum Hours of Training to Win a Competition", "titleSlug": "minimum-hours-of-training-to-win-a-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32788, "totalSubmissionRaw": 79474}, "2384": {"acRate": 35.417107397221635, "difficulty": "Medium", "likes": 605, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "2384", "paidOnly": false, "title": "Largest Palindromic Number", "titleSlug": "largest-palindromic-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40179, "totalSubmissionRaw": 113447}, "2385": {"acRate": 62.72763323812877, "difficulty": "Medium", "likes": 2715, "dislikes": 66, "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": 140778, "totalSubmissionRaw": 224428}, "2386": {"acRate": 39.01322264538491, "difficulty": "Hard", "likes": 565, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2386", "paidOnly": false, "title": "Find the K-Sum of an Array", "titleSlug": "find-the-k-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9117, "totalSubmissionRaw": 23369}, "2387": {"acRate": 69.58943676500928, "difficulty": "Medium", "likes": 76, "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": 3373, "totalSubmissionRaw": 4847}, "2388": {"acRate": 50.72463768115942, "difficulty": "Medium", "likes": 84, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2388", "paidOnly": true, "title": "Change Null Values in a Table to the Previous Value", "titleSlug": "change-null-values-in-a-table-to-the-previous-value", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4445, "totalSubmissionRaw": 8763}, "2389": {"acRate": 71.8769096464426, "difficulty": "Easy", "likes": 1891, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "2389", "paidOnly": false, "title": "Longest Subsequence With Limited Sum", "titleSlug": "longest-subsequence-with-limited-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115269, "totalSubmissionRaw": 160370}, "2390": {"acRate": 75.91190961982234, "difficulty": "Medium", "likes": 2904, "dislikes": 207, "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": 340806, "totalSubmissionRaw": 448949}, "2391": {"acRate": 85.21849836086444, "difficulty": "Medium", "likes": 1525, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "2391", "paidOnly": false, "title": "Minimum Amount of Time to Collect Garbage", "titleSlug": "minimum-amount-of-time-to-collect-garbage", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133872, "totalSubmissionRaw": 157092}, "2392": {"acRate": 79.57658888655314, "difficulty": "Hard", "likes": 1341, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2392", "paidOnly": false, "title": "Build a Matrix With Conditions", "titleSlug": "build-a-matrix-with-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90851, "totalSubmissionRaw": 114168}, "2393": {"acRate": 74.81148002250984, "difficulty": "Medium", "likes": 132, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2393", "paidOnly": true, "title": "Count Strictly Increasing Subarrays", "titleSlug": "count-strictly-increasing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6647, "totalSubmissionRaw": 8885}, "2394": {"acRate": 40.49878015722418, "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": 4482, "totalSubmissionRaw": 11067}, "2395": {"acRate": 65.27234047909769, "difficulty": "Easy", "likes": 536, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2395", "paidOnly": false, "title": "Find Subarrays With Equal Sum", "titleSlug": "find-subarrays-with-equal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51852, "totalSubmissionRaw": 79440}, "2396": {"acRate": 87.71181193862098, "difficulty": "Medium", "likes": 617, "dislikes": 1566, "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": 92086, "totalSubmissionRaw": 104987}, "2397": {"acRate": 55.6502968159741, "difficulty": "Medium", "likes": 266, "dislikes": 410, "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": 15468, "totalSubmissionRaw": 27795}, "2398": {"acRate": 34.6523260831349, "difficulty": "Hard", "likes": 800, "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": 21683, "totalSubmissionRaw": 62573}, "2399": {"acRate": 70.6615247700979, "difficulty": "Easy", "likes": 485, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2399", "paidOnly": false, "title": "Check Distances Between Same Letters", "titleSlug": "check-distances-between-same-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50021, "totalSubmissionRaw": 70790}, "2400": {"acRate": 35.24518584863412, "difficulty": "Medium", "likes": 792, "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": 31480, "totalSubmissionRaw": 89310}, "2401": {"acRate": 51.46684159941418, "difficulty": "Medium", "likes": 1302, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2401", "paidOnly": false, "title": "Longest Nice Subarray", "titleSlug": "longest-nice-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33735, "totalSubmissionRaw": 65548}, "2402": {"acRate": 44.22938349193614, "difficulty": "Hard", "likes": 1712, "dislikes": 109, "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": 119077, "totalSubmissionRaw": 269226}, "2403": {"acRate": 55.793814432989684, "difficulty": "Hard", "likes": 47, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2403", "paidOnly": true, "title": "Minimum Time to Kill All Monsters", "titleSlug": "minimum-time-to-kill-all-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1353, "totalSubmissionRaw": 2425}, "2404": {"acRate": 50.71062288576243, "difficulty": "Easy", "likes": 970, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2404", "paidOnly": false, "title": "Most Frequent Even Element", "titleSlug": "most-frequent-even-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 84848, "totalSubmissionRaw": 167318}, "2405": {"acRate": 77.98068273643446, "difficulty": "Medium", "likes": 2627, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2405", "paidOnly": false, "title": "Optimal Partition of String", "titleSlug": "optimal-partition-of-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 204587, "totalSubmissionRaw": 262356}, "2406": {"acRate": 47.30845814215219, "difficulty": "Medium", "likes": 782, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2406", "paidOnly": false, "title": "Divide Intervals Into Minimum Number of Groups", "titleSlug": "divide-intervals-into-minimum-number-of-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27323, "totalSubmissionRaw": 57755}, "2407": {"acRate": 24.17002509314881, "difficulty": "Hard", "likes": 879, "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": 15893, "totalSubmissionRaw": 65755}, "2408": {"acRate": 78.38652086587815, "difficulty": "Medium", "likes": 51, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2408", "paidOnly": true, "title": "Design SQL", "titleSlug": "design-sql", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7025, "totalSubmissionRaw": 8962}, "2409": {"acRate": 45.236666344013166, "difficulty": "Easy", "likes": 253, "dislikes": 583, "categoryTitle": "Algorithms", "frontendQuestionId": "2409", "paidOnly": false, "title": "Count Days Spent Together", "titleSlug": "count-days-spent-together", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23367, "totalSubmissionRaw": 51655}, "2410": {"acRate": 63.36459454380841, "difficulty": "Medium", "likes": 500, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2410", "paidOnly": false, "title": "Maximum Matching of Players With Trainers", "titleSlug": "maximum-matching-of-players-with-trainers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37093, "totalSubmissionRaw": 58539}, "2411": {"acRate": 44.33107721318652, "difficulty": "Medium", "likes": 563, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2411", "paidOnly": false, "title": "Smallest Subarrays With Maximum Bitwise OR", "titleSlug": "smallest-subarrays-with-maximum-bitwise-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13165, "totalSubmissionRaw": 29697}, "2412": {"acRate": 40.475036354823075, "difficulty": "Hard", "likes": 399, "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": 10855, "totalSubmissionRaw": 26819}, "2413": {"acRate": 87.87489538934625, "difficulty": "Easy", "likes": 896, "dislikes": 105, "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": 180604, "totalSubmissionRaw": 205524}, "2414": {"acRate": 58.54111835950655, "difficulty": "Medium", "likes": 505, "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": 46933, "totalSubmissionRaw": 80171}, "2415": {"acRate": 78.03138373751783, "difficulty": "Medium", "likes": 1121, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2415", "paidOnly": false, "title": "Reverse Odd Levels of Binary Tree", "titleSlug": "reverse-odd-levels-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54153, "totalSubmissionRaw": 69399}, "2416": {"acRate": 46.29481099177012, "difficulty": "Hard", "likes": 669, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2416", "paidOnly": false, "title": "Sum of Prefix Scores of Strings", "titleSlug": "sum-of-prefix-scores-of-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26551, "totalSubmissionRaw": 57352}, "2417": {"acRate": 45.12694512694513, "difficulty": "Medium", "likes": 28, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2417", "paidOnly": true, "title": "Closest Fair Integer", "titleSlug": "closest-fair-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1102, "totalSubmissionRaw": 2442}, "2418": {"acRate": 85.02454665573173, "difficulty": "Easy", "likes": 1710, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2418", "paidOnly": false, "title": "Sort the People", "titleSlug": "sort-the-people", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 298579, "totalSubmissionRaw": 351168}, "2419": {"acRate": 49.626839645672035, "difficulty": "Medium", "likes": 461, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2419", "paidOnly": false, "title": "Longest Subarray With Maximum Bitwise AND", "titleSlug": "longest-subarray-with-maximum-bitwise-and", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28460, "totalSubmissionRaw": 57348}, "2420": {"acRate": 38.86482569841397, "difficulty": "Medium", "likes": 623, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2420", "paidOnly": false, "title": "Find All Good Indices", "titleSlug": "find-all-good-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24137, "totalSubmissionRaw": 62105}, "2421": {"acRate": 56.3393222742662, "difficulty": "Hard", "likes": 2236, "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": 56412, "totalSubmissionRaw": 100129}, "2422": {"acRate": 69.2161467069216, "difficulty": "Medium", "likes": 134, "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": 12380, "totalSubmissionRaw": 17886}, "2423": {"acRate": 17.375040309577557, "difficulty": "Easy", "likes": 671, "dislikes": 1215, "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": 48490, "totalSubmissionRaw": 279066}, "2424": {"acRate": 55.531195997008076, "difficulty": "Medium", "likes": 359, "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": 21530, "totalSubmissionRaw": 38771}, "2425": {"acRate": 58.13385580827442, "difficulty": "Medium", "likes": 404, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2425", "paidOnly": false, "title": "Bitwise XOR of All Pairings", "titleSlug": "bitwise-xor-of-all-pairings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20473, "totalSubmissionRaw": 35217}, "2426": {"acRate": 44.22398012552301, "difficulty": "Hard", "likes": 530, "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": 13529, "totalSubmissionRaw": 30592}, "2427": {"acRate": 79.0794469018843, "difficulty": "Easy", "likes": 573, "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": 90818, "totalSubmissionRaw": 114844}, "2428": {"acRate": 74.93790409738155, "difficulty": "Medium", "likes": 451, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2428", "paidOnly": false, "title": "Maximum Sum of an Hourglass", "titleSlug": "maximum-sum-of-an-hourglass", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39523, "totalSubmissionRaw": 52741}, "2429": {"acRate": 44.28279785146572, "difficulty": "Medium", "likes": 480, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2429", "paidOnly": false, "title": "Minimize XOR", "titleSlug": "minimize-xor", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22342, "totalSubmissionRaw": 50453}, "2430": {"acRate": 33.54583046175051, "difficulty": "Hard", "likes": 482, "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": 13629, "totalSubmissionRaw": 40628}, "2431": {"acRate": 64.09320606400898, "difficulty": "Medium", "likes": 46, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2431", "paidOnly": true, "title": "Maximize Total Tastiness of Purchased Fruits", "titleSlug": "maximize-total-tastiness-of-purchased-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2283, "totalSubmissionRaw": 3562}, "2432": {"acRate": 50.23169470148936, "difficulty": "Easy", "likes": 274, "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": 35447, "totalSubmissionRaw": 70567}, "2433": {"acRate": 88.07864507827829, "difficulty": "Medium", "likes": 1387, "dislikes": 82, "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": 151283, "totalSubmissionRaw": 171759}, "2434": {"acRate": 40.0398740818468, "difficulty": "Medium", "likes": 650, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "2434", "paidOnly": false, "title": "Using a Robot to Print the Lexicographically Smallest String", "titleSlug": "using-a-robot-to-print-the-lexicographically-smallest-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19079, "totalSubmissionRaw": 47650}, "2435": {"acRate": 42.96539576529302, "difficulty": "Hard", "likes": 897, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2435", "paidOnly": false, "title": "Paths in Matrix Whose Sum Is Divisible by K", "titleSlug": "paths-in-matrix-whose-sum-is-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23417, "totalSubmissionRaw": 54502}, "2436": {"acRate": 71.16150781489426, "difficulty": "Medium", "likes": 40, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2436", "paidOnly": true, "title": "Minimum Split Into Subarrays With GCD Greater Than One", "titleSlug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2322, "totalSubmissionRaw": 3263}, "2437": {"acRate": 46.80409356725146, "difficulty": "Easy", "likes": 286, "dislikes": 236, "categoryTitle": "Algorithms", "frontendQuestionId": "2437", "paidOnly": false, "title": "Number of Valid Clock Times", "titleSlug": "number-of-valid-clock-times", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32014, "totalSubmissionRaw": 68400}, "2438": {"acRate": 40.48931011681728, "difficulty": "Medium", "likes": 293, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2438", "paidOnly": false, "title": "Range Product Queries of Powers", "titleSlug": "range-product-queries-of-powers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16533, "totalSubmissionRaw": 40833}, "2439": {"acRate": 46.47708667445252, "difficulty": "Medium", "likes": 2417, "dislikes": 618, "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": 83174, "totalSubmissionRaw": 178957}, "2440": {"acRate": 53.00693909020817, "difficulty": "Hard", "likes": 388, "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": 6875, "totalSubmissionRaw": 12970}, "2441": {"acRate": 75.07869586842519, "difficulty": "Easy", "likes": 995, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2441", "paidOnly": false, "title": "Largest Positive Integer That Exists With Its Negative", "titleSlug": "largest-positive-integer-that-exists-with-its-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 224914, "totalSubmissionRaw": 299571}, "2442": {"acRate": 79.6962859059584, "difficulty": "Medium", "likes": 629, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2442", "paidOnly": false, "title": "Count Number of Distinct Integers After Reverse Operations", "titleSlug": "count-number-of-distinct-integers-after-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65339, "totalSubmissionRaw": 81985}, "2443": {"acRate": 47.45327436153517, "difficulty": "Medium", "likes": 254, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "2443", "paidOnly": false, "title": "Sum of Number and Its Reverse", "titleSlug": "sum-of-number-and-its-reverse", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36586, "totalSubmissionRaw": 77099}, "2444": {"acRate": 67.90653470538113, "difficulty": "Hard", "likes": 3148, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2444", "paidOnly": false, "title": "Count Subarrays With Fixed Bounds", "titleSlug": "count-subarrays-with-fixed-bounds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145047, "totalSubmissionRaw": 213597}, "2445": {"acRate": 68.70431893687707, "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": 2068, "totalSubmissionRaw": 3010}, "2446": {"acRate": 51.04187559893918, "difficulty": "Easy", "likes": 456, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2446", "paidOnly": false, "title": "Determine if Two Events Have Conflict", "titleSlug": "determine-if-two-events-have-conflict", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45806, "totalSubmissionRaw": 89742}, "2447": {"acRate": 50.229048261704264, "difficulty": "Medium", "likes": 443, "dislikes": 67, "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": 26425, "totalSubmissionRaw": 52609}, "2448": {"acRate": 45.934535169497344, "difficulty": "Hard", "likes": 2383, "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": 66911, "totalSubmissionRaw": 145666}, "2449": {"acRate": 61.956782137894685, "difficulty": "Hard", "likes": 425, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2449", "paidOnly": false, "title": "Minimum Number of Operations to Make Arrays Similar", "titleSlug": "minimum-number-of-operations-to-make-arrays-similar", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12931, "totalSubmissionRaw": 20871}, "2450": {"acRate": 63.491048593350385, "difficulty": "Medium", "likes": 37, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2450", "paidOnly": true, "title": "Number of Distinct Binary Strings After Applying Operations", "titleSlug": "number-of-distinct-binary-strings-after-applying-operations", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 993, "totalSubmissionRaw": 1564}, "2451": {"acRate": 59.23119425369011, "difficulty": "Easy", "likes": 394, "dislikes": 110, "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": 30016, "totalSubmissionRaw": 50676}, "2452": {"acRate": 60.80144621874059, "difficulty": "Medium", "likes": 297, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2452", "paidOnly": false, "title": "Words Within Two Edits of Dictionary", "titleSlug": "words-within-two-edits-of-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22198, "totalSubmissionRaw": 36509}, "2453": {"acRate": 39.44228389605799, "difficulty": "Medium", "likes": 565, "dislikes": 23, "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": 17850, "totalSubmissionRaw": 45256}, "2454": {"acRate": 38.85171987491819, "difficulty": "Hard", "likes": 663, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2454", "paidOnly": false, "title": "Next Greater Element IV", "titleSlug": "next-greater-element-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10685, "totalSubmissionRaw": 27502}, "2455": {"acRate": 60.555526979064865, "difficulty": "Easy", "likes": 333, "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": 58863, "totalSubmissionRaw": 97205}, "2456": {"acRate": 43.87682070526336, "difficulty": "Medium", "likes": 270, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "2456", "paidOnly": false, "title": "Most Popular Video Creator", "titleSlug": "most-popular-video-creator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22683, "totalSubmissionRaw": 51695}, "2457": {"acRate": 37.63058374209009, "difficulty": "Medium", "likes": 523, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2457", "paidOnly": false, "title": "Minimum Addition to Make Integer Beautiful", "titleSlug": "minimum-addition-to-make-integer-beautiful", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20100, "totalSubmissionRaw": 53414}, "2458": {"acRate": 40.993269900208865, "difficulty": "Hard", "likes": 841, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2458", "paidOnly": false, "title": "Height of Binary Tree After Subtree Removal Queries", "titleSlug": "height-of-binary-tree-after-subtree-removal-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26496, "totalSubmissionRaw": 64635}, "2459": {"acRate": 46.10194902548726, "difficulty": "Hard", "likes": 54, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2459", "paidOnly": true, "title": "Sort Array by Moving Items to Empty Space", "titleSlug": "sort-array-by-moving-items-to-empty-space", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1845, "totalSubmissionRaw": 4002}, "2460": {"acRate": 67.72119950964738, "difficulty": "Easy", "likes": 549, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2460", "paidOnly": false, "title": "Apply Operations to an Array", "titleSlug": "apply-operations-to-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65739, "totalSubmissionRaw": 97073}, "2461": {"acRate": 34.16777808159553, "difficulty": "Medium", "likes": 1309, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2461", "paidOnly": false, "title": "Maximum Sum of Distinct Subarrays With Length K", "titleSlug": "maximum-sum-of-distinct-subarrays-with-length-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61229, "totalSubmissionRaw": 179201}, "2462": {"acRate": 42.868951697073435, "difficulty": "Medium", "likes": 1888, "dislikes": 586, "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": 102684, "totalSubmissionRaw": 239530}, "2463": {"acRate": 40.87570214604638, "difficulty": "Hard", "likes": 465, "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": 8514, "totalSubmissionRaw": 20829}, "2464": {"acRate": 54.384328358208954, "difficulty": "Medium", "likes": 29, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2464", "paidOnly": true, "title": "Minimum Subarrays in a Valid Split", "titleSlug": "minimum-subarrays-in-a-valid-split", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1166, "totalSubmissionRaw": 2144}, "2465": {"acRate": 58.07900852052672, "difficulty": "Easy", "likes": 370, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2465", "paidOnly": false, "title": "Number of Distinct Averages", "titleSlug": "number-of-distinct-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44986, "totalSubmissionRaw": 77456}, "2466": {"acRate": 54.437690611859665, "difficulty": "Medium", "likes": 1703, "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": 77289, "totalSubmissionRaw": 141977}, "2467": {"acRate": 49.430506678775494, "difficulty": "Medium", "likes": 699, "dislikes": 68, "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": 13063, "totalSubmissionRaw": 26427}, "2468": {"acRate": 44.64024655260974, "difficulty": "Hard", "likes": 158, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "2468", "paidOnly": false, "title": "Split Message Based on Limit", "titleSlug": "split-message-based-on-limit", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11298, "totalSubmissionRaw": 25309}, "2469": {"acRate": 89.63273352392697, "difficulty": "Easy", "likes": 615, "dislikes": 336, "categoryTitle": "Algorithms", "frontendQuestionId": "2469", "paidOnly": false, "title": "Convert the Temperature", "titleSlug": "convert-the-temperature", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 191873, "totalSubmissionRaw": 214066}, "2470": {"acRate": 38.95751835838309, "difficulty": "Medium", "likes": 355, "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": 22706, "totalSubmissionRaw": 58284}, "2471": {"acRate": 62.02687915602817, "difficulty": "Medium", "likes": 641, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2471", "paidOnly": false, "title": "Minimum Number of Operations to Sort a Binary Tree by Level", "titleSlug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22107, "totalSubmissionRaw": 35641}, "2472": {"acRate": 40.41695198965229, "difficulty": "Hard", "likes": 459, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2472", "paidOnly": false, "title": "Maximum Number of Non-overlapping Palindrome Substrings", "titleSlug": "maximum-number-of-non-overlapping-palindrome-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15936, "totalSubmissionRaw": 39429}, "2473": {"acRate": 67.73875943551035, "difficulty": "Medium", "likes": 110, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2473", "paidOnly": true, "title": "Minimum Cost to Buy Apples", "titleSlug": "minimum-cost-to-buy-apples", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6192, "totalSubmissionRaw": 9141}, "2474": {"acRate": 44.651226909291424, "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": 3239, "totalSubmissionRaw": 7254}, "2475": {"acRate": 71.53809295639674, "difficulty": "Easy", "likes": 402, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2475", "paidOnly": false, "title": "Number of Unequal Triplets in Array", "titleSlug": "number-of-unequal-triplets-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43297, "totalSubmissionRaw": 60523}, "2476": {"acRate": 41.56857929727928, "difficulty": "Medium", "likes": 441, "dislikes": 116, "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": 23697, "totalSubmissionRaw": 57007}, "2477": {"acRate": 64.46363486510742, "difficulty": "Medium", "likes": 2188, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2477", "paidOnly": false, "title": "Minimum Fuel Cost to Report to the Capital", "titleSlug": "minimum-fuel-cost-to-report-to-the-capital", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70393, "totalSubmissionRaw": 109198}, "2478": {"acRate": 31.0633177921492, "difficulty": "Hard", "likes": 346, "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": 10326, "totalSubmissionRaw": 33244}, "2479": {"acRate": 49.47916666666667, "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": 665, "totalSubmissionRaw": 1344}, "2480": {"acRate": 76.35549660089538, "difficulty": "Easy", "likes": 27, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2480", "paidOnly": true, "title": "Form a Chemical Bond", "titleSlug": "form-a-chemical-bond", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4605, "totalSubmissionRaw": 6031}, "2481": {"acRate": 53.45018450184502, "difficulty": "Easy", "likes": 221, "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": 34764, "totalSubmissionRaw": 65040}, "2482": {"acRate": 84.44236611347688, "difficulty": "Medium", "likes": 1172, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2482", "paidOnly": false, "title": "Difference Between Ones and Zeros in Row and Column", "titleSlug": "difference-between-ones-and-zeros-in-row-and-column", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127307, "totalSubmissionRaw": 150762}, "2483": {"acRate": 67.35536415816725, "difficulty": "Medium", "likes": 1926, "dislikes": 101, "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": 107842, "totalSubmissionRaw": 160109}, "2484": {"acRate": 38.263922686504905, "difficulty": "Hard", "likes": 495, "dislikes": 27, "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": 11007, "totalSubmissionRaw": 28766}, "2485": {"acRate": 83.91425874836649, "difficulty": "Easy", "likes": 1279, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2485", "paidOnly": false, "title": "Find the Pivot Integer", "titleSlug": "find-the-pivot-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231165, "totalSubmissionRaw": 275478}, "2486": {"acRate": 73.0156636694415, "difficulty": "Medium", "likes": 1096, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2486", "paidOnly": false, "title": "Append Characters to String to Make Subsequence", "titleSlug": "append-characters-to-string-to-make-subsequence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188230, "totalSubmissionRaw": 257794}, "2487": {"acRate": 74.34309352684247, "difficulty": "Medium", "likes": 2076, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2487", "paidOnly": false, "title": "Remove Nodes From Linked List", "titleSlug": "remove-nodes-from-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193013, "totalSubmissionRaw": 259625}, "2488": {"acRate": 44.39767416972853, "difficulty": "Hard", "likes": 571, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2488", "paidOnly": false, "title": "Count Subarrays With Median K", "titleSlug": "count-subarrays-with-median-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12446, "totalSubmissionRaw": 28033}, "2489": {"acRate": 58.23598130841121, "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": 995, "totalSubmissionRaw": 1710}, "2490": {"acRate": 62.757618392368464, "difficulty": "Easy", "likes": 364, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2490", "paidOnly": false, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40591, "totalSubmissionRaw": 64679}, "2491": {"acRate": 60.06979787698125, "difficulty": "Medium", "likes": 483, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2491", "paidOnly": false, "title": "Divide Players Into Teams of Equal Skill", "titleSlug": "divide-players-into-teams-of-equal-skill", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37179, "totalSubmissionRaw": 61893}, "2492": {"acRate": 57.429040674957946, "difficulty": "Medium", "likes": 1772, "dislikes": 303, "categoryTitle": "Algorithms", "frontendQuestionId": "2492", "paidOnly": false, "title": "Minimum Score of a Path Between Two Cities", "titleSlug": "minimum-score-of-a-path-between-two-cities", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86719, "totalSubmissionRaw": 151002}, "2493": {"acRate": 38.79865583870065, "difficulty": "Hard", "likes": 411, "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": 8313, "totalSubmissionRaw": 21426}, "2494": {"acRate": 31.557377049180328, "difficulty": "Hard", "likes": 47, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2494", "paidOnly": true, "title": "Merge Overlapping Events in the Same Hall", "titleSlug": "merge-overlapping-events-in-the-same-hall", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1848, "totalSubmissionRaw": 5856}, "2495": {"acRate": 63.81944444444444, "difficulty": "Medium", "likes": 45, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2495", "paidOnly": true, "title": "Number of Subarrays Having Even Product", "titleSlug": "number-of-subarrays-having-even-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1838, "totalSubmissionRaw": 2880}, "2496": {"acRate": 72.37431006942798, "difficulty": "Easy", "likes": 395, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2496", "paidOnly": false, "title": "Maximum Value of a String in an Array", "titleSlug": "maximum-value-of-a-string-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45763, "totalSubmissionRaw": 63231}, "2497": {"acRate": 39.50485009661928, "difficulty": "Medium", "likes": 396, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2497", "paidOnly": false, "title": "Maximum Star Sum of a Graph", "titleSlug": "maximum-star-sum-of-a-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20648, "totalSubmissionRaw": 52267}, "2498": {"acRate": 61.68611533908338, "difficulty": "Medium", "likes": 701, "dislikes": 104, "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": 21884, "totalSubmissionRaw": 35476}, "2499": {"acRate": 43.030817076618604, "difficulty": "Hard", "likes": 227, "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": 4566, "totalSubmissionRaw": 10611}, "2500": {"acRate": 78.29902765500695, "difficulty": "Easy", "likes": 636, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2500", "paidOnly": false, "title": "Delete Greatest Value in Each Row", "titleSlug": "delete-greatest-value-in-each-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62005, "totalSubmissionRaw": 79190}, "2501": {"acRate": 39.85605241014545, "difficulty": "Medium", "likes": 458, "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": 26525, "totalSubmissionRaw": 66552}, "2502": {"acRate": 53.275573795409635, "difficulty": "Medium", "likes": 287, "dislikes": 84, "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": 17525, "totalSubmissionRaw": 32895}, "2503": {"acRate": 37.61453396524487, "difficulty": "Hard", "likes": 470, "dislikes": 19, "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": 9524, "totalSubmissionRaw": 25320}, "2504": {"acRate": 75.85731518180252, "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": 4402, "totalSubmissionRaw": 5803}, "2505": {"acRate": 66.88288920056101, "difficulty": "Medium", "likes": 53, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2505", "paidOnly": true, "title": "Bitwise OR of All Subsequence Sums", "titleSlug": "bitwise-or-of-all-subsequence-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3815, "totalSubmissionRaw": 5704}, "2506": {"acRate": 70.44759775516722, "difficulty": "Easy", "likes": 498, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2506", "paidOnly": false, "title": "Count Pairs Of Similar Strings", "titleSlug": "count-pairs-of-similar-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46320, "totalSubmissionRaw": 65751}, "2507": {"acRate": 48.65566238407215, "difficulty": "Medium", "likes": 388, "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": 22874, "totalSubmissionRaw": 47012}, "2508": {"acRate": 32.38141335914811, "difficulty": "Hard", "likes": 329, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2508", "paidOnly": false, "title": "Add Edges to Make Degrees of All Nodes Even", "titleSlug": "add-edges-to-make-degrees-of-all-nodes-even", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13380, "totalSubmissionRaw": 41320}, "2509": {"acRate": 56.38356396259151, "difficulty": "Hard", "likes": 349, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2509", "paidOnly": false, "title": "Cycle Length Queries in a Tree", "titleSlug": "cycle-length-queries-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13324, "totalSubmissionRaw": 23631}, "2510": {"acRate": 50.37980339588919, "difficulty": "Medium", "likes": 93, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2510", "paidOnly": true, "title": "Check if There is a Path With Equal Number of 0's And 1's", "titleSlug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4510, "totalSubmissionRaw": 8952}, "2511": {"acRate": 38.4890993138086, "difficulty": "Easy", "likes": 275, "dislikes": 275, "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": 24063, "totalSubmissionRaw": 62519}, "2512": {"acRate": 45.18271706441074, "difficulty": "Medium", "likes": 328, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2512", "paidOnly": false, "title": "Reward Top K Students", "titleSlug": "reward-top-k-students", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20883, "totalSubmissionRaw": 46219}, "2513": {"acRate": 30.552601156069365, "difficulty": "Medium", "likes": 477, "dislikes": 94, "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": 13214, "totalSubmissionRaw": 43250}, "2514": {"acRate": 33.52776219854178, "difficulty": "Hard", "likes": 412, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2514", "paidOnly": false, "title": "Count Anagrams", "titleSlug": "count-anagrams", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11956, "totalSubmissionRaw": 35660}, "2515": {"acRate": 49.45737704918033, "difficulty": "Easy", "likes": 345, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2515", "paidOnly": false, "title": "Shortest Distance to Target String in a Circular Array", "titleSlug": "shortest-distance-to-target-string-in-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30169, "totalSubmissionRaw": 61000}, "2516": {"acRate": 34.412905098592134, "difficulty": "Medium", "likes": 706, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2516", "paidOnly": false, "title": "Take K of Each Character From Left and Right", "titleSlug": "take-k-of-each-character-from-left-and-right", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16597, "totalSubmissionRaw": 48229}, "2517": {"acRate": 63.92127220397128, "difficulty": "Medium", "likes": 899, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "2517", "paidOnly": false, "title": "Maximum Tastiness of Candy Basket", "titleSlug": "maximum-tastiness-of-candy-basket", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21986, "totalSubmissionRaw": 34392}, "2518": {"acRate": 31.471543567292752, "difficulty": "Hard", "likes": 434, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2518", "paidOnly": false, "title": "Number of Great Partitions", "titleSlug": "number-of-great-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8914, "totalSubmissionRaw": 28324}, "2519": {"acRate": 53.57971014492754, "difficulty": "Hard", "likes": 102, "dislikes": 19, "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": 7394, "totalSubmissionRaw": 13800}, "2520": {"acRate": 84.72638934592827, "difficulty": "Easy", "likes": 503, "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": 87541, "totalSubmissionRaw": 103322}, "2521": {"acRate": 51.415624847190756, "difficulty": "Medium", "likes": 464, "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": 31544, "totalSubmissionRaw": 61351}, "2522": {"acRate": 46.30994728496121, "difficulty": "Medium", "likes": 370, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2522", "paidOnly": false, "title": "Partition String Into Substrings With Values at Most K", "titleSlug": "partition-string-into-substrings-with-values-at-most-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21611, "totalSubmissionRaw": 46666}, "2523": {"acRate": 37.578838668679005, "difficulty": "Medium", "likes": 364, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2523", "paidOnly": false, "title": "Closest Prime Numbers in Range", "titleSlug": "closest-prime-numbers-in-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23654, "totalSubmissionRaw": 62945}, "2524": {"acRate": 39.847068819031435, "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": 938, "totalSubmissionRaw": 2354}, "2525": {"acRate": 35.78489018847535, "difficulty": "Easy", "likes": 196, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2525", "paidOnly": false, "title": "Categorize Box According to Criteria", "titleSlug": "categorize-box-according-to-criteria", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33777, "totalSubmissionRaw": 94389}, "2526": {"acRate": 49.41363806669165, "difficulty": "Medium", "likes": 309, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2526", "paidOnly": false, "title": "Find Consecutive Integers from a Data Stream", "titleSlug": "find-consecutive-integers-from-a-data-stream", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26377, "totalSubmissionRaw": 53380}, "2527": {"acRate": 68.7491446558095, "difficulty": "Medium", "likes": 359, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2527", "paidOnly": false, "title": "Find Xor-Beauty of Array", "titleSlug": "find-xor-beauty-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20094, "totalSubmissionRaw": 29228}, "2528": {"acRate": 32.58076358296623, "difficulty": "Hard", "likes": 458, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2528", "paidOnly": false, "title": "Maximize the Minimum Powered City", "titleSlug": "maximize-the-minimum-powered-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7100, "totalSubmissionRaw": 21792}, "2529": {"acRate": 71.0028160702029, "difficulty": "Easy", "likes": 902, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2529", "paidOnly": false, "title": "Maximum Count of Positive Integer and Negative Integer", "titleSlug": "maximum-count-of-positive-integer-and-negative-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 110687, "totalSubmissionRaw": 155891}, "2530": {"acRate": 46.059446070704794, "difficulty": "Medium", "likes": 390, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2530", "paidOnly": false, "title": "Maximal Score After Applying K Operations", "titleSlug": "maximal-score-after-applying-k-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28636, "totalSubmissionRaw": 62171}, "2531": {"acRate": 26.41412600216384, "difficulty": "Medium", "likes": 563, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2531", "paidOnly": false, "title": "Make Number of Distinct Characters Equal", "titleSlug": "make-number-of-distinct-characters-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19043, "totalSubmissionRaw": 72094}, "2532": {"acRate": 43.82130291075808, "difficulty": "Hard", "likes": 111, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "2532", "paidOnly": false, "title": "Time to Cross a Bridge", "titleSlug": "time-to-cross-a-bridge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4110, "totalSubmissionRaw": 9379}, "2533": {"acRate": 51.902173913043484, "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": 5539, "totalSubmissionRaw": 10672}, "2534": {"acRate": 49.48164002407866, "difficulty": "Hard", "likes": 82, "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": 7398, "totalSubmissionRaw": 14951}, "2535": {"acRate": 84.45364559746393, "difficulty": "Easy", "likes": 695, "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": 130540, "totalSubmissionRaw": 154570}, "2536": {"acRate": 49.80800489999764, "difficulty": "Medium", "likes": 460, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2536", "paidOnly": false, "title": "Increment Submatrices by One", "titleSlug": "increment-submatrices-by-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21143, "totalSubmissionRaw": 42449}, "2537": {"acRate": 51.09131078686057, "difficulty": "Medium", "likes": 848, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2537", "paidOnly": false, "title": "Count the Number of Good Subarrays", "titleSlug": "count-the-number-of-good-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21044, "totalSubmissionRaw": 41189}, "2538": {"acRate": 32.08376103469514, "difficulty": "Hard", "likes": 431, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2538", "paidOnly": false, "title": "Difference Between Maximum and Minimum Price Sum", "titleSlug": "difference-between-maximum-and-minimum-price-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7814, "totalSubmissionRaw": 24355}, "2539": {"acRate": 52.758298270219726, "difficulty": "Medium", "likes": 28, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2539", "paidOnly": true, "title": "Count the Number of Good Subsequences", "titleSlug": "count-the-number-of-good-subsequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2257, "totalSubmissionRaw": 4278}, "2540": {"acRate": 58.747273811968824, "difficulty": "Easy", "likes": 1117, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2540", "paidOnly": false, "title": "Minimum Common Value", "titleSlug": "minimum-common-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 240274, "totalSubmissionRaw": 408996}, "2541": {"acRate": 31.58486693191244, "difficulty": "Medium", "likes": 413, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2541", "paidOnly": false, "title": "Minimum Operations to Make Array Equal II", "titleSlug": "minimum-operations-to-make-array-equal-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22466, "totalSubmissionRaw": 71129}, "2542": {"acRate": 53.77088346412589, "difficulty": "Medium", "likes": 2742, "dislikes": 163, "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": 94077, "totalSubmissionRaw": 174959}, "2543": {"acRate": 42.54605473325525, "difficulty": "Hard", "likes": 244, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2543", "paidOnly": false, "title": "Check if Point Is Reachable", "titleSlug": "check-if-point-is-reachable", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7991, "totalSubmissionRaw": 18782}, "2544": {"acRate": 68.25728181867862, "difficulty": "Easy", "likes": 392, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2544", "paidOnly": false, "title": "Alternating Digit Sum", "titleSlug": "alternating-digit-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62452, "totalSubmissionRaw": 91495}, "2545": {"acRate": 85.52806387540612, "difficulty": "Medium", "likes": 660, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2545", "paidOnly": false, "title": "Sort the Students by Their Kth Score", "titleSlug": "sort-the-students-by-their-kth-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65021, "totalSubmissionRaw": 76023}, "2546": {"acRate": 41.16743471582181, "difficulty": "Medium", "likes": 250, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2546", "paidOnly": false, "title": "Apply Bitwise Operations to Make Strings Equal", "titleSlug": "apply-bitwise-operations-to-make-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19028, "totalSubmissionRaw": 46221}, "2547": {"acRate": 40.6644364214501, "difficulty": "Hard", "likes": 430, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2547", "paidOnly": false, "title": "Minimum Cost to Split an Array", "titleSlug": "minimum-cost-to-split-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12277, "totalSubmissionRaw": 30191}, "2548": {"acRate": 65.78947368421053, "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": 1350, "totalSubmissionRaw": 2052}, "2549": {"acRate": 60.40325917892664, "difficulty": "Easy", "likes": 264, "dislikes": 266, "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": 42330, "totalSubmissionRaw": 70079}, "2550": {"acRate": 27.687065558130026, "difficulty": "Medium", "likes": 239, "dislikes": 514, "categoryTitle": "Algorithms", "frontendQuestionId": "2550", "paidOnly": false, "title": "Count Collisions of Monkeys on a Polygon", "titleSlug": "count-collisions-of-monkeys-on-a-polygon", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20314, "totalSubmissionRaw": 73370}, "2551": {"acRate": 66.56531493059114, "difficulty": "Hard", "likes": 2037, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2551", "paidOnly": false, "title": "Put Marbles in Bags", "titleSlug": "put-marbles-in-bags", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58453, "totalSubmissionRaw": 87813}, "2552": {"acRate": 33.4150297350874, "difficulty": "Hard", "likes": 374, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2552", "paidOnly": false, "title": "Count Increasing Quadruplets", "titleSlug": "count-increasing-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9271, "totalSubmissionRaw": 27745}, "2553": {"acRate": 79.4679546481358, "difficulty": "Easy", "likes": 486, "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": 73875, "totalSubmissionRaw": 92962}, "2554": {"acRate": 54.12286889053279, "difficulty": "Medium", "likes": 332, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2554", "paidOnly": false, "title": "Maximum Number of Integers to Choose From a Range I", "titleSlug": "maximum-number-of-integers-to-choose-from-a-range-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31460, "totalSubmissionRaw": 58127}, "2555": {"acRate": 33.306665813306026, "difficulty": "Medium", "likes": 544, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2555", "paidOnly": false, "title": "Maximize Win From Two Segments", "titleSlug": "maximize-win-from-two-segments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10408, "totalSubmissionRaw": 31249}, "2556": {"acRate": 27.27818345503651, "difficulty": "Medium", "likes": 572, "dislikes": 27, "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": 13635, "totalSubmissionRaw": 49985}, "2557": {"acRate": 40.44829342842588, "difficulty": "Medium", "likes": 33, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2557", "paidOnly": true, "title": "Maximum Number of Integers to Choose From a Range II", "titleSlug": "maximum-number-of-integers-to-choose-from-a-range-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1588, "totalSubmissionRaw": 3926}, "2558": {"acRate": 66.97900062374384, "difficulty": "Easy", "likes": 379, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2558", "paidOnly": false, "title": "Take Gifts From the Richest Pile", "titleSlug": "take-gifts-from-the-richest-pile", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48322, "totalSubmissionRaw": 72145}, "2559": {"acRate": 52.2566241051, "difficulty": "Medium", "likes": 443, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2559", "paidOnly": false, "title": "Count Vowel Strings in Ranges", "titleSlug": "count-vowel-strings-in-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28321, "totalSubmissionRaw": 54196}, "2560": {"acRate": 43.69244726695396, "difficulty": "Medium", "likes": 908, "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": 19264, "totalSubmissionRaw": 44090}, "2561": {"acRate": 34.096577525287515, "difficulty": "Hard", "likes": 378, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2561", "paidOnly": false, "title": "Rearranging Fruits", "titleSlug": "rearranging-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9843, "totalSubmissionRaw": 28868}, "2562": {"acRate": 69.9058502329116, "difficulty": "Easy", "likes": 355, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2562", "paidOnly": false, "title": "Find the Array Concatenation Value", "titleSlug": "find-the-array-concatenation-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49673, "totalSubmissionRaw": 71057}, "2563": {"acRate": 32.983381558395, "difficulty": "Medium", "likes": 798, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2563", "paidOnly": false, "title": "Count the Number of Fair Pairs", "titleSlug": "count-the-number-of-fair-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25762, "totalSubmissionRaw": 78106}, "2564": {"acRate": 33.57957112109054, "difficulty": "Medium", "likes": 368, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2564", "paidOnly": false, "title": "Substring XOR Queries", "titleSlug": "substring-xor-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12637, "totalSubmissionRaw": 37633}, "2565": {"acRate": 31.63185378590078, "difficulty": "Hard", "likes": 375, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2565", "paidOnly": false, "title": "Subsequence With the Minimum Score", "titleSlug": "subsequence-with-the-minimum-score", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7269, "totalSubmissionRaw": 22980}, "2566": {"acRate": 59.92503182611155, "difficulty": "Easy", "likes": 227, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2566", "paidOnly": false, "title": "Maximum Difference by Remapping a Digit", "titleSlug": "maximum-difference-by-remapping-a-digit", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25419, "totalSubmissionRaw": 42418}, "2567": {"acRate": 47.96366177498253, "difficulty": "Medium", "likes": 240, "dislikes": 222, "categoryTitle": "Algorithms", "frontendQuestionId": "2567", "paidOnly": false, "title": "Minimum Score by Changing Two Elements", "titleSlug": "minimum-score-by-changing-two-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17159, "totalSubmissionRaw": 35775}, "2568": {"acRate": 57.62624590827172, "difficulty": "Medium", "likes": 350, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2568", "paidOnly": false, "title": "Minimum Impossible OR", "titleSlug": "minimum-impossible-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15668, "totalSubmissionRaw": 27189}, "2569": {"acRate": 28.30311204355862, "difficulty": "Hard", "likes": 175, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2569", "paidOnly": false, "title": "Handling Sum Queries After Update", "titleSlug": "handling-sum-queries-after-update", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5666, "totalSubmissionRaw": 20019}, "2570": {"acRate": 73.69272972005929, "difficulty": "Easy", "likes": 333, "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": 43251, "totalSubmissionRaw": 58691}, "2571": {"acRate": 55.3743710037456, "difficulty": "Medium", "likes": 532, "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": 29272, "totalSubmissionRaw": 52862}, "2572": {"acRate": 23.158837338754566, "difficulty": "Medium", "likes": 457, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "2572", "paidOnly": false, "title": "Count the Number of Square-Free Subsets", "titleSlug": "count-the-number-of-square-free-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9569, "totalSubmissionRaw": 41319}, "2573": {"acRate": 31.361857720187313, "difficulty": "Hard", "likes": 186, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2573", "paidOnly": false, "title": "Find the String with LCP", "titleSlug": "find-the-string-with-lcp", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4889, "totalSubmissionRaw": 15589}, "2574": {"acRate": 86.84121294322806, "difficulty": "Easy", "likes": 1047, "dislikes": 98, "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": 143419, "totalSubmissionRaw": 165151}, "2575": {"acRate": 32.918104146889256, "difficulty": "Medium", "likes": 525, "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": 28434, "totalSubmissionRaw": 86378}, "2576": {"acRate": 38.69399428026692, "difficulty": "Medium", "likes": 555, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2576", "paidOnly": false, "title": "Find the Maximum Number of Marked Indices", "titleSlug": "find-the-maximum-number-of-marked-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20295, "totalSubmissionRaw": 52450}, "2577": {"acRate": 35.61846190949926, "difficulty": "Hard", "likes": 541, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2577", "paidOnly": false, "title": "Minimum Time to Visit a Cell In a Grid", "titleSlug": "minimum-time-to-visit-a-cell-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11815, "totalSubmissionRaw": 33171}, "2578": {"acRate": 70.83276410546654, "difficulty": "Easy", "likes": 370, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2578", "paidOnly": false, "title": "Split With Minimum Sum", "titleSlug": "split-with-minimum-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36293, "totalSubmissionRaw": 51237}, "2579": {"acRate": 57.76855895196506, "difficulty": "Medium", "likes": 290, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2579", "paidOnly": false, "title": "Count Total Number of Colored Cells", "titleSlug": "count-total-number-of-colored-cells", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26458, "totalSubmissionRaw": 45800}, "2580": {"acRate": 36.24324445039975, "difficulty": "Medium", "likes": 313, "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": 16229, "totalSubmissionRaw": 44776}, "2581": {"acRate": 45.73017049666419, "difficulty": "Hard", "likes": 297, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2581", "paidOnly": false, "title": "Count Number of Possible Root Nodes", "titleSlug": "count-number-of-possible-root-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6169, "totalSubmissionRaw": 13490}, "2582": {"acRate": 56.979766329033986, "difficulty": "Easy", "likes": 1005, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2582", "paidOnly": false, "title": "Pass the Pillow", "titleSlug": "pass-the-pillow", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187664, "totalSubmissionRaw": 329350}, "2583": {"acRate": 47.69078725353131, "difficulty": "Medium", "likes": 551, "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": 39570, "totalSubmissionRaw": 82972}, "2584": {"acRate": 23.11864805060019, "difficulty": "Hard", "likes": 303, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "2584", "paidOnly": false, "title": "Split the Array to Make Coprime Products", "titleSlug": "split-the-array-to-make-coprime-products", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11806, "totalSubmissionRaw": 51067}, "2585": {"acRate": 57.482737403432004, "difficulty": "Hard", "likes": 470, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2585", "paidOnly": false, "title": "Number of Ways to Earn Points", "titleSlug": "number-of-ways-to-earn-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16816, "totalSubmissionRaw": 29254}, "2586": {"acRate": 74.16310968298883, "difficulty": "Easy", "likes": 338, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2586", "paidOnly": false, "title": "Count the Number of Vowel Strings in Range", "titleSlug": "count-the-number-of-vowel-strings-in-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61855, "totalSubmissionRaw": 83404}, "2587": {"acRate": 41.09236246956669, "difficulty": "Medium", "likes": 288, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2587", "paidOnly": false, "title": "Rearrange Array to Maximize Prefix Score", "titleSlug": "rearrange-array-to-maximize-prefix-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29199, "totalSubmissionRaw": 71057}, "2588": {"acRate": 50.617872054249446, "difficulty": "Medium", "likes": 498, "dislikes": 21, "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": 18064, "totalSubmissionRaw": 35687}, "2589": {"acRate": 39.357887874837026, "difficulty": "Hard", "likes": 424, "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": 9660, "totalSubmissionRaw": 24544}, "2590": {"acRate": 58.81660288489844, "difficulty": "Medium", "likes": 38, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2590", "paidOnly": true, "title": "Design a Todo List", "titleSlug": "design-a-todo-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1998, "totalSubmissionRaw": 3397}, "2591": {"acRate": 19.167798493641193, "difficulty": "Easy", "likes": 297, "dislikes": 833, "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": 31048, "totalSubmissionRaw": 161980}, "2592": {"acRate": 58.014342705167174, "difficulty": "Medium", "likes": 435, "dislikes": 15, "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": 24431, "totalSubmissionRaw": 42112}, "2593": {"acRate": 52.64557670772676, "difficulty": "Medium", "likes": 362, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2593", "paidOnly": false, "title": "Find Score of an Array After Marking All Elements", "titleSlug": "find-score-of-an-array-after-marking-all-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18805, "totalSubmissionRaw": 35720}, "2594": {"acRate": 44.780421206988095, "difficulty": "Medium", "likes": 577, "dislikes": 28, "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": 17712, "totalSubmissionRaw": 39553}, "2595": {"acRate": 73.39998756064186, "difficulty": "Easy", "likes": 319, "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": 47205, "totalSubmissionRaw": 64312}, "2596": {"acRate": 57.04101927886415, "difficulty": "Medium", "likes": 387, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2596", "paidOnly": false, "title": "Check Knight Tour Configuration", "titleSlug": "check-knight-tour-configuration", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28966, "totalSubmissionRaw": 50780}, "2597": {"acRate": 51.166172331144026, "difficulty": "Medium", "likes": 1189, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "2597", "paidOnly": false, "title": "The Number of Beautiful Subsets", "titleSlug": "the-number-of-beautiful-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115063, "totalSubmissionRaw": 224881}, "2598": {"acRate": 39.31394406161329, "difficulty": "Medium", "likes": 346, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2598", "paidOnly": false, "title": "Smallest Missing Non-negative Integer After Operations", "titleSlug": "smallest-missing-non-negative-integer-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15518, "totalSubmissionRaw": 39472}, "2599": {"acRate": 51.12083105522143, "difficulty": "Medium", "likes": 45, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2599", "paidOnly": true, "title": "Make the Prefix Sum Non-negative", "titleSlug": "make-the-prefix-sum-non-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1870, "totalSubmissionRaw": 3658}, "2600": {"acRate": 61.8230352753103, "difficulty": "Easy", "likes": 278, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2600", "paidOnly": false, "title": "K Items With the Maximum Sum", "titleSlug": "k-items-with-the-maximum-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40993, "totalSubmissionRaw": 66307}, "2601": {"acRate": 37.82550033730605, "difficulty": "Medium", "likes": 378, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2601", "paidOnly": false, "title": "Prime Subtraction Operation", "titleSlug": "prime-subtraction-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16821, "totalSubmissionRaw": 44470}, "2602": {"acRate": 35.6120495175264, "difficulty": "Medium", "likes": 707, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2602", "paidOnly": false, "title": "Minimum Operations to Make All Array Elements Equal", "titleSlug": "minimum-operations-to-make-all-array-elements-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18784, "totalSubmissionRaw": 52748}, "2603": {"acRate": 37.34999504115839, "difficulty": "Hard", "likes": 431, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2603", "paidOnly": false, "title": "Collect Coins in a Tree", "titleSlug": "collect-coins-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7532, "totalSubmissionRaw": 20166}, "2604": {"acRate": 41.0453216374269, "difficulty": "Hard", "likes": 40, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2604", "paidOnly": true, "title": "Minimum Time to Eat All Grains", "titleSlug": "minimum-time-to-eat-all-grains", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1123, "totalSubmissionRaw": 2736}, "2605": {"acRate": 54.070433835749895, "difficulty": "Easy", "likes": 295, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2605", "paidOnly": false, "title": "Form Smallest Number From Two Digit Arrays", "titleSlug": "form-smallest-number-from-two-digit-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37739, "totalSubmissionRaw": 69796}, "2606": {"acRate": 56.862925271645494, "difficulty": "Medium", "likes": 357, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2606", "paidOnly": false, "title": "Find the Substring With Maximum Cost", "titleSlug": "find-the-substring-with-maximum-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24753, "totalSubmissionRaw": 43531}, "2607": {"acRate": 36.95583095011122, "difficulty": "Medium", "likes": 459, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2607", "paidOnly": false, "title": "Make K-Subarray Sums Equal", "titleSlug": "make-k-subarray-sums-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10467, "totalSubmissionRaw": 28323}, "2608": {"acRate": 36.48121283942545, "difficulty": "Hard", "likes": 505, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2608", "paidOnly": false, "title": "Shortest Cycle in a Graph", "titleSlug": "shortest-cycle-in-a-graph", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17855, "totalSubmissionRaw": 48943}, "2609": {"acRate": 46.462431855890024, "difficulty": "Easy", "likes": 363, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2609", "paidOnly": false, "title": "Find the Longest Balanced Substring of a Binary String", "titleSlug": "find-the-longest-balanced-substring-of-a-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31364, "totalSubmissionRaw": 67504}, "2610": {"acRate": 87.17915087286701, "difficulty": "Medium", "likes": 1601, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2610", "paidOnly": false, "title": "Convert an Array Into a 2D Array With Conditions", "titleSlug": "convert-an-array-into-a-2d-array-with-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199404, "totalSubmissionRaw": 228729}, "2611": {"acRate": 45.953812304014136, "difficulty": "Medium", "likes": 614, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2611", "paidOnly": false, "title": "Mice and Cheese", "titleSlug": "mice-and-cheese", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26525, "totalSubmissionRaw": 57721}, "2612": {"acRate": 16.57882447127894, "difficulty": "Hard", "likes": 240, "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": 4970, "totalSubmissionRaw": 29978}, "2613": {"acRate": 43.152866242038215, "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": 542, "totalSubmissionRaw": 1256}, "2614": {"acRate": 34.074266384648865, "difficulty": "Easy", "likes": 344, "dislikes": 39, "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": 44624, "totalSubmissionRaw": 130961}, "2615": {"acRate": 31.0892366283266, "difficulty": "Medium", "likes": 730, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "2615", "paidOnly": false, "title": "Sum of Distances", "titleSlug": "sum-of-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20245, "totalSubmissionRaw": 65119}, "2616": {"acRate": 43.92481148666555, "difficulty": "Medium", "likes": 2308, "dislikes": 246, "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": 72931, "totalSubmissionRaw": 166036}, "2617": {"acRate": 24.905649588289116, "difficulty": "Hard", "likes": 377, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2617", "paidOnly": false, "title": "Minimum Number of Visited Cells in a Grid", "titleSlug": "minimum-number-of-visited-cells-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8711, "totalSubmissionRaw": 34976}, "2618": {"acRate": 27.615231890433105, "difficulty": "Medium", "likes": 265, "dislikes": 99, "categoryTitle": "JavaScript", "frontendQuestionId": "2618", "paidOnly": false, "title": "Check if Object Instance of Class", "titleSlug": "check-if-object-instance-of-class", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23228, "totalSubmissionRaw": 84113}, "2619": {"acRate": 73.49938027503984, "difficulty": "Easy", "likes": 498, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2619", "paidOnly": false, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136983, "totalSubmissionRaw": 186373}, "2620": {"acRate": 81.12161539716736, "difficulty": "Easy", "likes": 1259, "dislikes": 103, "categoryTitle": "JavaScript", "frontendQuestionId": "2620", "paidOnly": false, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 392739, "totalSubmissionRaw": 484137}, "2621": {"acRate": 86.89683286296645, "difficulty": "Easy", "likes": 583, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2621", "paidOnly": false, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138557, "totalSubmissionRaw": 159450}, "2622": {"acRate": 74.3410956162007, "difficulty": "Medium", "likes": 424, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2622", "paidOnly": false, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44566, "totalSubmissionRaw": 59948}, "2623": {"acRate": 62.57162460363084, "difficulty": "Medium", "likes": 589, "dislikes": 84, "categoryTitle": "JavaScript", "frontendQuestionId": "2623", "paidOnly": false, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 101229, "totalSubmissionRaw": 161781}, "2624": {"acRate": 65.41330018645121, "difficulty": "Medium", "likes": 99, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2624", "paidOnly": false, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10525, "totalSubmissionRaw": 16090}, "2625": {"acRate": 63.55131780156517, "difficulty": "Medium", "likes": 332, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2625", "paidOnly": false, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42389, "totalSubmissionRaw": 66701}, "2626": {"acRate": 84.70706429780034, "difficulty": "Easy", "likes": 579, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2626", "paidOnly": false, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160191, "totalSubmissionRaw": 189113}, "2627": {"acRate": 90.84916560907696, "difficulty": "Medium", "likes": 392, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2627", "paidOnly": false, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47962, "totalSubmissionRaw": 52793}, "2628": {"acRate": 38.7236393774749, "difficulty": "Medium", "likes": 213, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2628", "paidOnly": true, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12615, "totalSubmissionRaw": 32577}, "2629": {"acRate": 86.21575670804198, "difficulty": "Easy", "likes": 654, "dislikes": 48, "categoryTitle": "JavaScript", "frontendQuestionId": "2629", "paidOnly": false, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134887, "totalSubmissionRaw": 156453}, "2630": {"acRate": 30.8666472133061, "difficulty": "Hard", "likes": 116, "dislikes": 41, "categoryTitle": "JavaScript", "frontendQuestionId": "2630", "paidOnly": false, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5289, "totalSubmissionRaw": 17135}, "2631": {"acRate": 80.81118828325532, "difficulty": "Medium", "likes": 301, "dislikes": 17, "categoryTitle": "JavaScript", "frontendQuestionId": "2631", "paidOnly": false, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42817, "totalSubmissionRaw": 52984}, "2632": {"acRate": 89.43027672273467, "difficulty": "Medium", "likes": 342, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2632", "paidOnly": true, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16482, "totalSubmissionRaw": 18430}, "2633": {"acRate": 77.55614266842801, "difficulty": "Medium", "likes": 203, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2633", "paidOnly": true, "title": "Convert Object to JSON String", "titleSlug": "convert-object-to-json-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11742, "totalSubmissionRaw": 15140}, "2634": {"acRate": 84.73291121095738, "difficulty": "Easy", "likes": 627, "dislikes": 76, "categoryTitle": "JavaScript", "frontendQuestionId": "2634", "paidOnly": false, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 171423, "totalSubmissionRaw": 202310}, "2635": {"acRate": 85.75835779257953, "difficulty": "Easy", "likes": 722, "dislikes": 70, "categoryTitle": "JavaScript", "frontendQuestionId": "2635", "paidOnly": false, "title": "Apply Transform Over Each Element in Array", "titleSlug": "apply-transform-over-each-element-in-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188749, "totalSubmissionRaw": 220094}, "2636": {"acRate": 79.97169143665958, "difficulty": "Medium", "likes": 285, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2636", "paidOnly": true, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12430, "totalSubmissionRaw": 15543}, "2637": {"acRate": 81.62182530710679, "difficulty": "Medium", "likes": 475, "dislikes": 69, "categoryTitle": "JavaScript", "frontendQuestionId": "2637", "paidOnly": false, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54152, "totalSubmissionRaw": 66345}, "2638": {"acRate": 47.06924754634678, "difficulty": "Medium", "likes": 82, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2638", "paidOnly": true, "title": "Count the Number of K-Free Subsets", "titleSlug": "count-the-number-of-k-free-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3453, "totalSubmissionRaw": 7336}, "2639": {"acRate": 67.72369953416148, "difficulty": "Easy", "likes": 167, "dislikes": 43, "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": 27913, "totalSubmissionRaw": 41216}, "2640": {"acRate": 70.7194710315809, "difficulty": "Medium", "likes": 288, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2640", "paidOnly": false, "title": "Find the Score of All Prefixes of an Array", "titleSlug": "find-the-score-of-all-prefixes-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30587, "totalSubmissionRaw": 43252}, "2641": {"acRate": 67.67125048194319, "difficulty": "Medium", "likes": 579, "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": 21062, "totalSubmissionRaw": 31124}, "2642": {"acRate": 70.60919540229885, "difficulty": "Hard", "likes": 805, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2642", "paidOnly": false, "title": "Design Graph With Shortest Path Calculator", "titleSlug": "design-graph-with-shortest-path-calculator", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67572, "totalSubmissionRaw": 95699}, "2643": {"acRate": 75.37513429276413, "difficulty": "Easy", "likes": 448, "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": 63845, "totalSubmissionRaw": 84703}, "2644": {"acRate": 49.33852140077821, "difficulty": "Easy", "likes": 231, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2644", "paidOnly": false, "title": "Find the Maximum Divisibility Score", "titleSlug": "find-the-maximum-divisibility-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31700, "totalSubmissionRaw": 64250}, "2645": {"acRate": 50.56881051175657, "difficulty": "Medium", "likes": 539, "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": 29249, "totalSubmissionRaw": 57840}, "2646": {"acRate": 45.69373634377276, "difficulty": "Hard", "likes": 472, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2646", "paidOnly": false, "title": "Minimize the Total Price of the Trips", "titleSlug": "minimize-the-total-price-of-the-trips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10038, "totalSubmissionRaw": 21968}, "2647": {"acRate": 66.45435244161358, "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": 313, "totalSubmissionRaw": 471}, "2648": {"acRate": 83.12954154142469, "difficulty": "Easy", "likes": 244, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2648", "paidOnly": false, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28484, "totalSubmissionRaw": 34265}, "2649": {"acRate": 79.05698952210581, "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": 12374, "totalSubmissionRaw": 15652}, "2650": {"acRate": 51.95283714075166, "difficulty": "Hard", "likes": 63, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2650", "paidOnly": false, "title": "Design Cancellable Function", "titleSlug": "design-cancellable-function", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2115, "totalSubmissionRaw": 4071}, "2651": {"acRate": 78.49432642737689, "difficulty": "Easy", "likes": 227, "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": 56793, "totalSubmissionRaw": 72353}, "2652": {"acRate": 85.61776284871225, "difficulty": "Easy", "likes": 487, "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": 111131, "totalSubmissionRaw": 129799}, "2653": {"acRate": 33.361633960752904, "difficulty": "Medium", "likes": 618, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2653", "paidOnly": false, "title": "Sliding Subarray Beauty", "titleSlug": "sliding-subarray-beauty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20826, "totalSubmissionRaw": 62425}, "2654": {"acRate": 35.31754813011728, "difficulty": "Medium", "likes": 380, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2654", "paidOnly": false, "title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "titleSlug": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12768, "totalSubmissionRaw": 36152}, "2655": {"acRate": 52.043269230769226, "difficulty": "Medium", "likes": 26, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2655", "paidOnly": true, "title": "Find Maximal Uncovered Ranges", "titleSlug": "find-maximal-uncovered-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1299, "totalSubmissionRaw": 2496}, "2656": {"acRate": 82.28002213613725, "difficulty": "Easy", "likes": 368, "dislikes": 48, "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": 74340, "totalSubmissionRaw": 90350}, "2657": {"acRate": 81.42256561754347, "difficulty": "Medium", "likes": 477, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2657", "paidOnly": false, "title": "Find the Prefix Common Array of Two Arrays", "titleSlug": "find-the-prefix-common-array-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42996, "totalSubmissionRaw": 52806}, "2658": {"acRate": 59.984322508398655, "difficulty": "Medium", "likes": 432, "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": 26782, "totalSubmissionRaw": 44649}, "2659": {"acRate": 25.52140377041922, "difficulty": "Hard", "likes": 537, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2659", "paidOnly": false, "title": "Make Array Empty", "titleSlug": "make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10952, "totalSubmissionRaw": 42913}, "2660": {"acRate": 34.154459411695406, "difficulty": "Easy", "likes": 272, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "2660", "paidOnly": false, "title": "Determine the Winner of a Bowling Game", "titleSlug": "determine-the-winner-of-a-bowling-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34787, "totalSubmissionRaw": 101852}, "2661": {"acRate": 50.55000846166864, "difficulty": "Medium", "likes": 428, "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": 23896, "totalSubmissionRaw": 47272}, "2662": {"acRate": 39.12133891213389, "difficulty": "Medium", "likes": 607, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2662", "paidOnly": false, "title": "Minimum Cost of a Path With Special Roads", "titleSlug": "minimum-cost-of-a-path-with-special-roads", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13277, "totalSubmissionRaw": 33938}, "2663": {"acRate": 37.56378009342436, "difficulty": "Hard", "likes": 191, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2663", "paidOnly": false, "title": "Lexicographically Smallest Beautiful String", "titleSlug": "lexicographically-smallest-beautiful-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5227, "totalSubmissionRaw": 13915}, "2664": {"acRate": 66.42100414555505, "difficulty": "Medium", "likes": 35, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2664", "paidOnly": true, "title": "The Knight\u2019s Tour", "titleSlug": "the-knights-tour", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1442, "totalSubmissionRaw": 2171}, "2665": {"acRate": 80.1428908148795, "difficulty": "Easy", "likes": 718, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2665", "paidOnly": false, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 207406, "totalSubmissionRaw": 258796}, "2666": {"acRate": 86.19387022044282, "difficulty": "Easy", "likes": 469, "dislikes": 54, "categoryTitle": "JavaScript", "frontendQuestionId": "2666", "paidOnly": false, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 106783, "totalSubmissionRaw": 123887}, "2667": {"acRate": 81.30077442693684, "difficulty": "Easy", "likes": 1260, "dislikes": 173, "categoryTitle": "JavaScript", "frontendQuestionId": "2667", "paidOnly": false, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 445436, "totalSubmissionRaw": 547886}, "2668": {"acRate": 71.94596711041503, "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": 3675, "totalSubmissionRaw": 5108}, "2669": {"acRate": 72.25108225108225, "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": 3338, "totalSubmissionRaw": 4620}, "2670": {"acRate": 77.77266819954013, "difficulty": "Easy", "likes": 329, "dislikes": 31, "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": 38898, "totalSubmissionRaw": 50015}, "2671": {"acRate": 29.897186147186144, "difficulty": "Medium", "likes": 321, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2671", "paidOnly": false, "title": "Frequency Tracker", "titleSlug": "frequency-tracker", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22100, "totalSubmissionRaw": 73920}, "2672": {"acRate": 54.78921859200112, "difficulty": "Medium", "likes": 345, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2672", "paidOnly": false, "title": "Number of Adjacent Elements With the Same Color", "titleSlug": "number-of-adjacent-elements-with-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15713, "totalSubmissionRaw": 28679}, "2673": {"acRate": 59.13662884346923, "difficulty": "Medium", "likes": 593, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2673", "paidOnly": false, "title": "Make Costs of Paths Equal in a Binary Tree", "titleSlug": "make-costs-of-paths-equal-in-a-binary-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16521, "totalSubmissionRaw": 27937}, "2674": {"acRate": 74.19683834778175, "difficulty": "Medium", "likes": 39, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2674", "paidOnly": true, "title": "Split a Circular Linked List", "titleSlug": "split-a-circular-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1455, "totalSubmissionRaw": 1961}, "2675": {"acRate": 69.13667372382969, "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": 5878, "totalSubmissionRaw": 8502}, "2676": {"acRate": 82.83502402562733, "difficulty": "Medium", "likes": 162, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2676", "paidOnly": true, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9309, "totalSubmissionRaw": 11238}, "2677": {"acRate": 83.38324760612939, "difficulty": "Easy", "likes": 333, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2677", "paidOnly": false, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62088, "totalSubmissionRaw": 74461}, "2678": {"acRate": 81.84696893344048, "difficulty": "Easy", "likes": 691, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2678", "paidOnly": false, "title": "Number of Senior Citizens", "titleSlug": "number-of-senior-citizens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 240368, "totalSubmissionRaw": 293681}, "2679": {"acRate": 60.05893198697293, "difficulty": "Medium", "likes": 346, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2679", "paidOnly": false, "title": "Sum in a Matrix", "titleSlug": "sum-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34854, "totalSubmissionRaw": 58033}, "2680": {"acRate": 40.90895676553047, "difficulty": "Medium", "likes": 388, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2680", "paidOnly": false, "title": "Maximum OR", "titleSlug": "maximum-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13862, "totalSubmissionRaw": 33885}, "2681": {"acRate": 30.795027268723956, "difficulty": "Hard", "likes": 313, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2681", "paidOnly": false, "title": "Power of Heroes", "titleSlug": "power-of-heroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9091, "totalSubmissionRaw": 29521}, "2682": {"acRate": 49.09521182897102, "difficulty": "Easy", "likes": 247, "dislikes": 37, "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": 27592, "totalSubmissionRaw": 56201}, "2683": {"acRate": 61.952786702053366, "difficulty": "Medium", "likes": 270, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2683", "paidOnly": false, "title": "Neighboring Bitwise XOR", "titleSlug": "neighboring-bitwise-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22176, "totalSubmissionRaw": 35795}, "2684": {"acRate": 45.93561330128508, "difficulty": "Medium", "likes": 432, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2684", "paidOnly": false, "title": "Maximum Number of Moves in a Grid", "titleSlug": "maximum-number-of-moves-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24271, "totalSubmissionRaw": 52837}, "2685": {"acRate": 65.88377890090791, "difficulty": "Medium", "likes": 659, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2685", "paidOnly": false, "title": "Count the Number of Complete Components", "titleSlug": "count-the-number-of-complete-components", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28809, "totalSubmissionRaw": 43727}, "2686": {"acRate": 67.27536833367918, "difficulty": "Medium", "likes": 14, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2686", "paidOnly": true, "title": "Immediate Food Delivery III", "titleSlug": "immediate-food-delivery-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3242, "totalSubmissionRaw": 4819}, "2687": {"acRate": 80.34226525557307, "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": 3568, "totalSubmissionRaw": 4441}, "2688": {"acRate": 42.21085759244689, "difficulty": "Medium", "likes": 20, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2688", "paidOnly": true, "title": "Find Active Users", "titleSlug": "find-active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3219, "totalSubmissionRaw": 7626}, "2689": {"acRate": 74.08503767491926, "difficulty": "Easy", "likes": 34, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2689", "paidOnly": true, "title": "Extract Kth Character From The Rope Tree", "titleSlug": "extract-kth-character-from-the-rope-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2753, "totalSubmissionRaw": 3716}, "2690": {"acRate": 92.9384965831435, "difficulty": "Easy", "likes": 27, "dislikes": 6, "categoryTitle": "JavaScript", "frontendQuestionId": "2690", "paidOnly": true, "title": "Infinite Method Object", "titleSlug": "infinite-method-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1224, "totalSubmissionRaw": 1317}, "2691": {"acRate": 37.64940239043825, "difficulty": "Hard", "likes": 11, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2691", "paidOnly": true, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 189, "totalSubmissionRaw": 502}, "2692": {"acRate": 62.824675324675326, "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": 387, "totalSubmissionRaw": 616}, "2693": {"acRate": 79.96226711736499, "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": 10172, "totalSubmissionRaw": 12721}, "2694": {"acRate": 74.33212672390582, "difficulty": "Medium", "likes": 238, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2694", "paidOnly": false, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24847, "totalSubmissionRaw": 33427}, "2695": {"acRate": 88.0737861459995, "difficulty": "Easy", "likes": 225, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2695", "paidOnly": false, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39198, "totalSubmissionRaw": 44506}, "2696": {"acRate": 69.81484445867349, "difficulty": "Easy", "likes": 408, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2696", "paidOnly": false, "title": "Minimum String Length After Removing Substrings", "titleSlug": "minimum-string-length-after-removing-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52336, "totalSubmissionRaw": 74964}, "2697": {"acRate": 81.9481367827791, "difficulty": "Easy", "likes": 348, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2697", "paidOnly": false, "title": "Lexicographically Smallest Palindrome", "titleSlug": "lexicographically-smallest-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53944, "totalSubmissionRaw": 65827}, "2698": {"acRate": 62.6749757304356, "difficulty": "Medium", "likes": 476, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2698", "paidOnly": false, "title": "Find the Punishment Number of an Integer", "titleSlug": "find-the-punishment-number-of-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20014, "totalSubmissionRaw": 31933}, "2699": {"acRate": 24.571066484694875, "difficulty": "Hard", "likes": 274, "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": 5041, "totalSubmissionRaw": 20516}, "2700": {"acRate": 76.41133263378805, "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": 7282, "totalSubmissionRaw": 9530}, "2701": {"acRate": 32.517899761336515, "difficulty": "Hard", "likes": 44, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2701", "paidOnly": true, "title": "Consecutive Transactions with Increasing Amounts", "titleSlug": "consecutive-transactions-with-increasing-amounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2725, "totalSubmissionRaw": 8380}, "2702": {"acRate": 46.47253077154008, "difficulty": "Hard", "likes": 38, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2702", "paidOnly": true, "title": "Minimum Operations to Make Numbers Non-positive", "titleSlug": "minimum-operations-to-make-numbers-non-positive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1548, "totalSubmissionRaw": 3331}, "2703": {"acRate": 94.28669050262968, "difficulty": "Easy", "likes": 308, "dislikes": 153, "categoryTitle": "JavaScript", "frontendQuestionId": "2703", "paidOnly": false, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154534, "totalSubmissionRaw": 163898}, "2704": {"acRate": 62.36663233070014, "difficulty": "Easy", "likes": 637, "dislikes": 151, "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": 181027, "totalSubmissionRaw": 290264}, "2705": {"acRate": 65.06728749077281, "difficulty": "Medium", "likes": 172, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2705", "paidOnly": false, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22918, "totalSubmissionRaw": 35222}, "2706": {"acRate": 69.16377425190635, "difficulty": "Easy", "likes": 982, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2706", "paidOnly": false, "title": "Buy Two Chocolates", "titleSlug": "buy-two-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 183127, "totalSubmissionRaw": 264773}, "2707": {"acRate": 52.52406895135475, "difficulty": "Medium", "likes": 2079, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2707", "paidOnly": false, "title": "Extra Characters in a String", "titleSlug": "extra-characters-in-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86962, "totalSubmissionRaw": 165566}, "2708": {"acRate": 24.22777787232594, "difficulty": "Medium", "likes": 355, "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": 28472, "totalSubmissionRaw": 117518}, "2709": {"acRate": 42.462814300523135, "difficulty": "Hard", "likes": 811, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2709", "paidOnly": false, "title": "Greatest Common Divisor Traversal", "titleSlug": "greatest-common-divisor-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70456, "totalSubmissionRaw": 165924}, "2710": {"acRate": 78.80090767944584, "difficulty": "Easy", "likes": 314, "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": 65980, "totalSubmissionRaw": 83730}, "2711": {"acRate": 71.15600448933782, "difficulty": "Medium", "likes": 124, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "2711", "paidOnly": false, "title": "Difference of Number of Distinct Values on Diagonals", "titleSlug": "difference-of-number-of-distinct-values-on-diagonals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19654, "totalSubmissionRaw": 27621}, "2712": {"acRate": 54.49050846463046, "difficulty": "Medium", "likes": 528, "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": 18572, "totalSubmissionRaw": 34083}, "2713": {"acRate": 30.647836595422017, "difficulty": "Hard", "likes": 576, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2713", "paidOnly": false, "title": "Maximum Strictly Increasing Cells in a Matrix", "titleSlug": "maximum-strictly-increasing-cells-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12934, "totalSubmissionRaw": 42202}, "2714": {"acRate": 61.504424778761056, "difficulty": "Hard", "likes": 30, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2714", "paidOnly": true, "title": "Find Shortest Path with K Hops", "titleSlug": "find-shortest-path-with-k-hops", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 973, "totalSubmissionRaw": 1582}, "2715": {"acRate": 88.71609273658939, "difficulty": "Easy", "likes": 227, "dislikes": 287, "categoryTitle": "JavaScript", "frontendQuestionId": "2715", "paidOnly": false, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49516, "totalSubmissionRaw": 55814}, "2716": {"acRate": 76.30634656267348, "difficulty": "Easy", "likes": 324, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "2716", "paidOnly": false, "title": "Minimize String Length", "titleSlug": "minimize-string-length", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56353, "totalSubmissionRaw": 73851}, "2717": {"acRate": 63.93917155903457, "difficulty": "Easy", "likes": 207, "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": 31366, "totalSubmissionRaw": 49056}, "2718": {"acRate": 30.913927138595383, "difficulty": "Medium", "likes": 688, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2718", "paidOnly": false, "title": "Sum of Matrix After Queries", "titleSlug": "sum-of-matrix-after-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21036, "totalSubmissionRaw": 68047}, "2719": {"acRate": 34.61405656527608, "difficulty": "Hard", "likes": 524, "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": 11027, "totalSubmissionRaw": 31857}, "2720": {"acRate": 51.06142088876309, "difficulty": "Hard", "likes": 13, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2720", "paidOnly": true, "title": "Popularity Percentage", "titleSlug": "popularity-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1804, "totalSubmissionRaw": 3533}, "2721": {"acRate": 75.06365791553253, "difficulty": "Medium", "likes": 186, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2721", "paidOnly": false, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25647, "totalSubmissionRaw": 34166}, "2722": {"acRate": 54.57720220447807, "difficulty": "Medium", "likes": 164, "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": 30005, "totalSubmissionRaw": 54978}, "2723": {"acRate": 91.36253160108933, "difficulty": "Easy", "likes": 266, "dislikes": 26, "categoryTitle": "JavaScript", "frontendQuestionId": "2723", "paidOnly": false, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 93600, "totalSubmissionRaw": 102449}, "2724": {"acRate": 82.48651125971294, "difficulty": "Easy", "likes": 168, "dislikes": 37, "categoryTitle": "JavaScript", "frontendQuestionId": "2724", "paidOnly": false, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39596, "totalSubmissionRaw": 48003}, "2725": {"acRate": 80.62072972810516, "difficulty": "Easy", "likes": 158, "dislikes": 84, "categoryTitle": "JavaScript", "frontendQuestionId": "2725", "paidOnly": false, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40237, "totalSubmissionRaw": 49909}, "2726": {"acRate": 75.35038687116227, "difficulty": "Easy", "likes": 109, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2726", "paidOnly": false, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27365, "totalSubmissionRaw": 36317}, "2727": {"acRate": 80.17283632142397, "difficulty": "Easy", "likes": 173, "dislikes": 10, "categoryTitle": "JavaScript", "frontendQuestionId": "2727", "paidOnly": false, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62158, "totalSubmissionRaw": 77530}, "2728": {"acRate": 85.10204081632654, "difficulty": "Easy", "likes": 50, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2728", "paidOnly": true, "title": "Count Houses in a Circular Street", "titleSlug": "count-houses-in-a-circular-street", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2085, "totalSubmissionRaw": 2450}, "2729": {"acRate": 52.16584732399592, "difficulty": "Easy", "likes": 230, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2729", "paidOnly": false, "title": "Check if The Number is Fascinating", "titleSlug": "check-if-the-number-is-fascinating", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44992, "totalSubmissionRaw": 86248}, "2730": {"acRate": 36.93830563691324, "difficulty": "Medium", "likes": 286, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "2730", "paidOnly": false, "title": "Find the Longest Semi-Repetitive Substring", "titleSlug": "find-the-longest-semi-repetitive-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23584, "totalSubmissionRaw": 63847}, "2731": {"acRate": 27.941358918158887, "difficulty": "Medium", "likes": 484, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "2731", "paidOnly": false, "title": "Movement of Robots", "titleSlug": "movement-of-robots", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13513, "totalSubmissionRaw": 48362}, "2732": {"acRate": 45.730892570817744, "difficulty": "Hard", "likes": 208, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2732", "paidOnly": false, "title": "Find a Good Subset of the Matrix", "titleSlug": "find-a-good-subset-of-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6845, "totalSubmissionRaw": 14968}, "2733": {"acRate": 76.5664303681683, "difficulty": "Easy", "likes": 345, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2733", "paidOnly": false, "title": "Neither Minimum nor Maximum", "titleSlug": "neither-minimum-nor-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93751, "totalSubmissionRaw": 122444}, "2734": {"acRate": 31.00025276316092, "difficulty": "Medium", "likes": 240, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "2734", "paidOnly": false, "title": "Lexicographically Smallest String After Substring Operation", "titleSlug": "lexicographically-smallest-string-after-substring-operation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26982, "totalSubmissionRaw": 87038}, "2735": {"acRate": 33.2454343984066, "difficulty": "Medium", "likes": 287, "dislikes": 537, "categoryTitle": "Algorithms", "frontendQuestionId": "2735", "paidOnly": false, "title": "Collecting Chocolates", "titleSlug": "collecting-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11851, "totalSubmissionRaw": 35647}, "2736": {"acRate": 29.11491493581046, "difficulty": "Hard", "likes": 329, "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": 5579, "totalSubmissionRaw": 19162}, "2737": {"acRate": 57.32569888851465, "difficulty": "Medium", "likes": 34, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2737", "paidOnly": true, "title": "Find the Closest Marked Node", "titleSlug": "find-the-closest-marked-node", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1702, "totalSubmissionRaw": 2969}, "2738": {"acRate": 55.652965956962305, "difficulty": "Medium", "likes": 20, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "2738", "paidOnly": true, "title": "Count Occurrences in Text", "titleSlug": "count-occurrences-in-text", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4888, "totalSubmissionRaw": 8783}, "2739": {"acRate": 39.28684127485011, "difficulty": "Easy", "likes": 282, "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": 43575, "totalSubmissionRaw": 110915}, "2740": {"acRate": 65.3837875912266, "difficulty": "Medium", "likes": 283, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2740", "paidOnly": false, "title": "Find the Value of the Partition", "titleSlug": "find-the-value-of-the-partition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33417, "totalSubmissionRaw": 51109}, "2741": {"acRate": 28.468766174304257, "difficulty": "Medium", "likes": 556, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2741", "paidOnly": false, "title": "Special Permutations", "titleSlug": "special-permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14301, "totalSubmissionRaw": 50234}, "2742": {"acRate": 50.863657119463376, "difficulty": "Hard", "likes": 1366, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2742", "paidOnly": false, "title": "Painting the Walls", "titleSlug": "painting-the-walls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64606, "totalSubmissionRaw": 127018}, "2743": {"acRate": 76.67832167832168, "difficulty": "Medium", "likes": 83, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2743", "paidOnly": true, "title": "Count Substrings Without Repeating Character", "titleSlug": "count-substrings-without-repeating-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6579, "totalSubmissionRaw": 8580}, "2744": {"acRate": 81.48271118910971, "difficulty": "Easy", "likes": 351, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2744", "paidOnly": false, "title": "Find Maximum Number of String Pairs", "titleSlug": "find-maximum-number-of-string-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68716, "totalSubmissionRaw": 84332}, "2745": {"acRate": 53.9459810203585, "difficulty": "Medium", "likes": 307, "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": 19953, "totalSubmissionRaw": 36987}, "2746": {"acRate": 26.879917451309172, "difficulty": "Medium", "likes": 358, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2746", "paidOnly": false, "title": "Decremental String Concatenation", "titleSlug": "decremental-string-concatenation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8336, "totalSubmissionRaw": 31012}, "2747": {"acRate": 32.35008930849707, "difficulty": "Medium", "likes": 338, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2747", "paidOnly": false, "title": "Count Zero Request Servers", "titleSlug": "count-zero-request-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6339, "totalSubmissionRaw": 19595}, "2748": {"acRate": 50.261719873454126, "difficulty": "Easy", "likes": 206, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2748", "paidOnly": false, "title": "Number of Beautiful Pairs", "titleSlug": "number-of-beautiful-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34952, "totalSubmissionRaw": 69540}, "2749": {"acRate": 29.846587351283656, "difficulty": "Medium", "likes": 283, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "2749", "paidOnly": false, "title": "Minimum Operations to Make the Integer Zero", "titleSlug": "minimum-operations-to-make-the-integer-zero", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9533, "totalSubmissionRaw": 31940}, "2750": {"acRate": 34.109848484848484, "difficulty": "Medium", "likes": 436, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2750", "paidOnly": false, "title": "Ways to Split Array Into Good Subarrays", "titleSlug": "ways-to-split-array-into-good-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21612, "totalSubmissionRaw": 63360}, "2751": {"acRate": 57.132304403860054, "difficulty": "Hard", "likes": 1115, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "2751", "paidOnly": false, "title": "Robot Collisions", "titleSlug": "robot-collisions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109053, "totalSubmissionRaw": 190878}, "2752": {"acRate": 37.752808988764045, "difficulty": "Hard", "likes": 12, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "2752", "paidOnly": true, "title": "Customers with Maximum Number of Transactions on Consecutive Days", "titleSlug": "customers-with-maximum-number-of-transactions-on-consecutive-days", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1512, "totalSubmissionRaw": 4005}, "2753": {"acRate": 67.41245136186771, "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": 693, "totalSubmissionRaw": 1028}, "2754": {"acRate": 86.59942363112391, "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": 601, "totalSubmissionRaw": 694}, "2755": {"acRate": 64.81958762886599, "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": 503, "totalSubmissionRaw": 776}, "2756": {"acRate": 62.913907284768214, "difficulty": "Hard", "likes": 14, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2756", "paidOnly": true, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 285, "totalSubmissionRaw": 453}, "2757": {"acRate": 71.1645101663586, "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": 385, "totalSubmissionRaw": 541}, "2758": {"acRate": 83.59020852221215, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2758", "paidOnly": true, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 922, "totalSubmissionRaw": 1103}, "2759": {"acRate": 60.9254498714653, "difficulty": "Hard", "likes": 16, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2759", "paidOnly": true, "title": "Convert JSON String to Object", "titleSlug": "convert-json-string-to-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 474, "totalSubmissionRaw": 778}, "2760": {"acRate": 29.68508939105182, "difficulty": "Easy", "likes": 291, "dislikes": 268, "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": 35981, "totalSubmissionRaw": 121209}, "2761": {"acRate": 34.29649397257753, "difficulty": "Medium", "likes": 360, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2761", "paidOnly": false, "title": "Prime Pairs With Target Sum", "titleSlug": "prime-pairs-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29816, "totalSubmissionRaw": 86936}, "2762": {"acRate": 41.21959758634183, "difficulty": "Medium", "likes": 697, "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": 20015, "totalSubmissionRaw": 48557}, "2763": {"acRate": 46.589532347952506, "difficulty": "Hard", "likes": 304, "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": 7691, "totalSubmissionRaw": 16508}, "2764": {"acRate": 66.04679064187162, "difficulty": "Medium", "likes": 31, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2764", "paidOnly": true, "title": "Is Array a Preorder of Some \u200cBinary Tree", "titleSlug": "is-array-a-preorder-of-some-binary-tree", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1101, "totalSubmissionRaw": 1667}, "2765": {"acRate": 34.10915257018611, "difficulty": "Easy", "likes": 212, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "2765", "paidOnly": false, "title": "Longest Alternating Subarray", "titleSlug": "longest-alternating-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24943, "totalSubmissionRaw": 73127}, "2766": {"acRate": 51.83181957342586, "difficulty": "Medium", "likes": 195, "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": 20316, "totalSubmissionRaw": 39196}, "2767": {"acRate": 53.44020290043572, "difficulty": "Medium", "likes": 351, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2767", "paidOnly": false, "title": "Partition String Into Minimum Beautiful Substrings", "titleSlug": "partition-string-into-minimum-beautiful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16435, "totalSubmissionRaw": 30754}, "2768": {"acRate": 36.3512159577375, "difficulty": "Medium", "likes": 226, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2768", "paidOnly": false, "title": "Number of Black Blocks", "titleSlug": "number-of-black-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7982, "totalSubmissionRaw": 21958}, "2769": {"acRate": 90.60374257710912, "difficulty": "Easy", "likes": 345, "dislikes": 503, "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": 106954, "totalSubmissionRaw": 118046}, "2770": {"acRate": 31.230139154974818, "difficulty": "Medium", "likes": 421, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2770", "paidOnly": false, "title": "Maximum Number of Jumps to Reach the Last Index", "titleSlug": "maximum-number-of-jumps-to-reach-the-last-index", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27223, "totalSubmissionRaw": 87169}, "2771": {"acRate": 29.524880113847, "difficulty": "Medium", "likes": 587, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2771", "paidOnly": false, "title": "Longest Non-decreasing Subarray From Two Arrays", "titleSlug": "longest-non-decreasing-subarray-from-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24689, "totalSubmissionRaw": 83620}, "2772": {"acRate": 33.28477227419108, "difficulty": "Medium", "likes": 384, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2772", "paidOnly": false, "title": "Apply Operations to Make All Array Elements Equal to Zero", "titleSlug": "apply-operations-to-make-all-array-elements-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13023, "totalSubmissionRaw": 39126}, "2773": {"acRate": 74.70472440944881, "difficulty": "Medium", "likes": 10, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2773", "paidOnly": true, "title": "Height of Special Binary Tree", "titleSlug": "height-of-special-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 759, "totalSubmissionRaw": 1016}, "2774": {"acRate": 81.49271844660194, "difficulty": "Easy", "likes": 21, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2774", "paidOnly": true, "title": "Array Upper Bound", "titleSlug": "array-upper-bound", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1343, "totalSubmissionRaw": 1648}, "2775": {"acRate": 68.3622828784119, "difficulty": "Medium", "likes": 15, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2775", "paidOnly": true, "title": "Undefined to Null", "titleSlug": "undefined-to-null", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 551, "totalSubmissionRaw": 806}, "2776": {"acRate": 91.6030534351145, "difficulty": "Medium", "likes": 17, "dislikes": 8, "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": 720, "totalSubmissionRaw": 786}, "2777": {"acRate": 80.55555555555556, "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": 377, "totalSubmissionRaw": 468}, "2778": {"acRate": 81.50775283499189, "difficulty": "Easy", "likes": 274, "dislikes": 105, "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": 70439, "totalSubmissionRaw": 86420}, "2779": {"acRate": 38.38313991942757, "difficulty": "Medium", "likes": 609, "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": 25534, "totalSubmissionRaw": 66524}, "2780": {"acRate": 62.2194152785453, "difficulty": "Medium", "likes": 333, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2780", "paidOnly": false, "title": "Minimum Index of a Valid Split", "titleSlug": "minimum-index-of-a-valid-split", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23644, "totalSubmissionRaw": 38001}, "2781": {"acRate": 37.839933133865514, "difficulty": "Hard", "likes": 552, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2781", "paidOnly": false, "title": "Length of the Longest Valid Substring", "titleSlug": "length-of-the-longest-valid-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31238, "totalSubmissionRaw": 82553}, "2782": {"acRate": 83.27566320645904, "difficulty": "Medium", "likes": 32, "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": 2166, "totalSubmissionRaw": 2601}, "2783": {"acRate": 37.52220248667851, "difficulty": "Medium", "likes": 17, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2783", "paidOnly": true, "title": "Flight Occupancy and Waitlist Analysis", "titleSlug": "flight-occupancy-and-waitlist-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2533, "totalSubmissionRaw": 6754}, "2784": {"acRate": 49.311324879755134, "difficulty": "Easy", "likes": 269, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2784", "paidOnly": false, "title": "Check if Array is Good", "titleSlug": "check-if-array-is-good", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49621, "totalSubmissionRaw": 100628}, "2785": {"acRate": 81.3406876755981, "difficulty": "Medium", "likes": 989, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2785", "paidOnly": false, "title": "Sort Vowels in a String", "titleSlug": "sort-vowels-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133755, "totalSubmissionRaw": 164438}, "2786": {"acRate": 36.11617584765273, "difficulty": "Medium", "likes": 475, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2786", "paidOnly": false, "title": "Visit Array Positions to Maximize Score", "titleSlug": "visit-array-positions-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19610, "totalSubmissionRaw": 54297}, "2787": {"acRate": 33.86429085673146, "difficulty": "Medium", "likes": 401, "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": 18815, "totalSubmissionRaw": 55560}, "2788": {"acRate": 74.32818907835096, "difficulty": "Easy", "likes": 309, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2788", "paidOnly": false, "title": "Split Strings by Separator", "titleSlug": "split-strings-by-separator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55098, "totalSubmissionRaw": 74128}, "2789": {"acRate": 47.20074667496306, "difficulty": "Medium", "likes": 464, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2789", "paidOnly": false, "title": "Largest Element in an Array after Merge Operations", "titleSlug": "largest-element-in-an-array-after-merge-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30343, "totalSubmissionRaw": 64285}, "2790": {"acRate": 20.07025352358511, "difficulty": "Hard", "likes": 400, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2790", "paidOnly": false, "title": "Maximum Number of Groups With Increasing Length", "titleSlug": "maximum-number-of-groups-with-increasing-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9199, "totalSubmissionRaw": 45834}, "2791": {"acRate": 48.05320977505418, "difficulty": "Hard", "likes": 379, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2791", "paidOnly": false, "title": "Count Paths That Can Form a Palindrome in a Tree", "titleSlug": "count-paths-that-can-form-a-palindrome-in-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6430, "totalSubmissionRaw": 13381}, "2792": {"acRate": 58.449158741770304, "difficulty": "Hard", "likes": 19, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2792", "paidOnly": true, "title": "Count Nodes That Are Great Enough", "titleSlug": "count-nodes-that-are-great-enough", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 799, "totalSubmissionRaw": 1367}, "2793": {"acRate": 74.73370259906264, "difficulty": "Hard", "likes": 10, "dislikes": 20, "categoryTitle": "Database", "frontendQuestionId": "2793", "paidOnly": true, "title": "Status of Flight Tickets", "titleSlug": "status-of-flight-tickets", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1754, "totalSubmissionRaw": 2347}, "2794": {"acRate": 63.75321336760925, "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": 992, "totalSubmissionRaw": 1556}, "2795": {"acRate": 87.78979907264298, "difficulty": "Medium", "likes": 13, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2795", "paidOnly": true, "title": "Parallel Execution of Promises for Individual Results Retrieval", "titleSlug": "parallel-execution-of-promises-for-individual-results-retrieval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 568, "totalSubmissionRaw": 647}, "2796": {"acRate": 92.80780170662332, "difficulty": "Easy", "likes": 25, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2796", "paidOnly": true, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2284, "totalSubmissionRaw": 2461}, "2797": {"acRate": 90.39704524469067, "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": 979, "totalSubmissionRaw": 1083}, "2798": {"acRate": 87.73666439418746, "difficulty": "Easy", "likes": 495, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2798", "paidOnly": false, "title": "Number of Employees Who Met the Target", "titleSlug": "number-of-employees-who-met-the-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 163442, "totalSubmissionRaw": 186287}, "2799": {"acRate": 65.1295578466537, "difficulty": "Medium", "likes": 557, "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": 40493, "totalSubmissionRaw": 62173}, "2800": {"acRate": 30.519340904204373, "difficulty": "Medium", "likes": 322, "dislikes": 262, "categoryTitle": "Algorithms", "frontendQuestionId": "2800", "paidOnly": false, "title": "Shortest String That Contains Three Strings", "titleSlug": "shortest-string-that-contains-three-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15614, "totalSubmissionRaw": 51161}, "2801": {"acRate": 27.94469650959237, "difficulty": "Hard", "likes": 330, "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": 7822, "totalSubmissionRaw": 27991}, "2802": {"acRate": 77.26681127982647, "difficulty": "Medium", "likes": 58, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2802", "paidOnly": true, "title": "Find The K-th Lucky Number", "titleSlug": "find-the-k-th-lucky-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5343, "totalSubmissionRaw": 6915}, "2803": {"acRate": 86.07467204843591, "difficulty": "Easy", "likes": 18, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2803", "paidOnly": true, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 853, "totalSubmissionRaw": 991}, "2804": {"acRate": 88.96982310093652, "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": 855, "totalSubmissionRaw": 961}, "2805": {"acRate": 81.48893360160966, "difficulty": "Medium", "likes": 16, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2805", "paidOnly": true, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 405, "totalSubmissionRaw": 497}, "2806": {"acRate": 52.7330638245743, "difficulty": "Easy", "likes": 252, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2806", "paidOnly": false, "title": "Account Balance After Rounded Purchase", "titleSlug": "account-balance-after-rounded-purchase", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43046, "totalSubmissionRaw": 81630}, "2807": {"acRate": 88.78401708236791, "difficulty": "Medium", "likes": 537, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2807", "paidOnly": false, "title": "Insert Greatest Common Divisors in Linked List", "titleSlug": "insert-greatest-common-divisors-in-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78168, "totalSubmissionRaw": 88043}, "2808": {"acRate": 26.84013575841963, "difficulty": "Medium", "likes": 513, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2808", "paidOnly": false, "title": "Minimum Seconds to Equalize a Circular Array", "titleSlug": "minimum-seconds-to-equalize-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15421, "totalSubmissionRaw": 57455}, "2809": {"acRate": 26.206573398487183, "difficulty": "Hard", "likes": 230, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2809", "paidOnly": false, "title": "Minimum Time to Make Array Sum At Most x", "titleSlug": "minimum-time-to-make-array-sum-at-most-x", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3915, "totalSubmissionRaw": 14939}, "2810": {"acRate": 83.83622256613728, "difficulty": "Easy", "likes": 425, "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": 80715, "totalSubmissionRaw": 96277}, "2811": {"acRate": 33.74498908284331, "difficulty": "Medium", "likes": 497, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2811", "paidOnly": false, "title": "Check if it is Possible to Split Array", "titleSlug": "check-if-it-is-possible-to-split-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29210, "totalSubmissionRaw": 86561}, "2812": {"acRate": 49.025339081064025, "difficulty": "Medium", "likes": 1567, "dislikes": 292, "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": 93255, "totalSubmissionRaw": 190219}, "2813": {"acRate": 32.988535031847135, "difficulty": "Hard", "likes": 304, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2813", "paidOnly": false, "title": "Maximum Elegance of a K-Length Subsequence", "titleSlug": "maximum-elegance-of-a-k-length-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6474, "totalSubmissionRaw": 19625}, "2814": {"acRate": 63.980028530670474, "difficulty": "Hard", "likes": 20, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2814", "paidOnly": true, "title": "Minimum Time Takes to Reach Destination Without Drowning", "titleSlug": "minimum-time-takes-to-reach-destination-without-drowning", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 897, "totalSubmissionRaw": 1402}, "2815": {"acRate": 58.13764874352118, "difficulty": "Easy", "likes": 375, "dislikes": 121, "categoryTitle": "Algorithms", "frontendQuestionId": "2815", "paidOnly": false, "title": "Max Pair Sum in an Array", "titleSlug": "max-pair-sum-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45877, "totalSubmissionRaw": 78911}, "2816": {"acRate": 61.5499622544236, "difficulty": "Medium", "likes": 1134, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2816", "paidOnly": false, "title": "Double a Number Represented as a Linked List", "titleSlug": "double-a-number-represented-as-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167142, "totalSubmissionRaw": 271555}, "2817": {"acRate": 33.932927226954334, "difficulty": "Medium", "likes": 670, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2817", "paidOnly": false, "title": "Minimum Absolute Difference Between Elements With Constraint", "titleSlug": "minimum-absolute-difference-between-elements-with-constraint", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26014, "totalSubmissionRaw": 76663}, "2818": {"acRate": 32.59132420091324, "difficulty": "Hard", "likes": 325, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2818", "paidOnly": false, "title": "Apply Operations to Maximize Score", "titleSlug": "apply-operations-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6852, "totalSubmissionRaw": 21024}, "2819": {"acRate": 51.96629213483146, "difficulty": "Hard", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2819", "paidOnly": true, "title": "Minimum Relative Loss After Buying Chocolates", "titleSlug": "minimum-relative-loss-after-buying-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 370, "totalSubmissionRaw": 712}, "2820": {"acRate": 66.08695652173913, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2820", "paidOnly": true, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2128, "totalSubmissionRaw": 3220}, "2821": {"acRate": 65.7488986784141, "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": 597, "totalSubmissionRaw": 908}, "2822": {"acRate": 58.033033033033036, "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": 773, "totalSubmissionRaw": 1332}, "2823": {"acRate": 52.47813411078717, "difficulty": "Medium", "likes": 14, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2823", "paidOnly": true, "title": "Deep Object Filter", "titleSlug": "deep-object-filter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 360, "totalSubmissionRaw": 686}, "2824": {"acRate": 87.34890994895291, "difficulty": "Easy", "likes": 591, "dislikes": 65, "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": 158623, "totalSubmissionRaw": 181597}, "2825": {"acRate": 49.40708114518041, "difficulty": "Medium", "likes": 319, "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": 34998, "totalSubmissionRaw": 70836}, "2826": {"acRate": 42.18544730262322, "difficulty": "Medium", "likes": 492, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "2826", "paidOnly": false, "title": "Sorting Three Groups", "titleSlug": "sorting-three-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19909, "totalSubmissionRaw": 47194}, "2827": {"acRate": 18.069505628976994, "difficulty": "Hard", "likes": 349, "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": 9229, "totalSubmissionRaw": 51075}, "2828": {"acRate": 83.07376724449101, "difficulty": "Easy", "likes": 316, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2828", "paidOnly": false, "title": "Check if a String Is an Acronym of Words", "titleSlug": "check-if-a-string-is-an-acronym-of-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 94361, "totalSubmissionRaw": 113587}, "2829": {"acRate": 61.38197062035439, "difficulty": "Medium", "likes": 327, "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": 34849, "totalSubmissionRaw": 56774}, "2830": {"acRate": 36.440890194834466, "difficulty": "Medium", "likes": 662, "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": 21827, "totalSubmissionRaw": 59897}, "2831": {"acRate": 35.83708154811641, "difficulty": "Medium", "likes": 667, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2831", "paidOnly": false, "title": "Find the Longest Equal Subarray", "titleSlug": "find-the-longest-equal-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20158, "totalSubmissionRaw": 56249}, "2832": {"acRate": 74.26303854875283, "difficulty": "Medium", "likes": 37, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2832", "paidOnly": true, "title": "Maximal Range That Each Element Is Maximum in It", "titleSlug": "maximal-range-that-each-element-is-maximum-in-it", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1310, "totalSubmissionRaw": 1764}, "2833": {"acRate": 64.85123686885801, "difficulty": "Easy", "likes": 238, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2833", "paidOnly": false, "title": "Furthest Point From Origin", "titleSlug": "furthest-point-from-origin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47844, "totalSubmissionRaw": 73775}, "2834": {"acRate": 38.2089664983822, "difficulty": "Medium", "likes": 294, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2834", "paidOnly": false, "title": "Find the Minimum Possible Sum of a Beautiful Array", "titleSlug": "find-the-minimum-possible-sum-of-a-beautiful-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30349, "totalSubmissionRaw": 79429}, "2835": {"acRate": 32.4292165823846, "difficulty": "Hard", "likes": 520, "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": 11992, "totalSubmissionRaw": 36979}, "2836": {"acRate": 31.129276814556, "difficulty": "Hard", "likes": 289, "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": 4722, "totalSubmissionRaw": 15169}, "2837": {"acRate": 74.98619547211486, "difficulty": "Easy", "likes": 14, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2837", "paidOnly": true, "title": "Total Traveled Distance", "titleSlug": "total-traveled-distance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2716, "totalSubmissionRaw": 3622}, "2838": {"acRate": 68.82480957562568, "difficulty": "Medium", "likes": 30, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2838", "paidOnly": true, "title": "Maximum Coins Heroes Can Collect", "titleSlug": "maximum-coins-heroes-can-collect", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1265, "totalSubmissionRaw": 1838}, "2839": {"acRate": 47.15891371330913, "difficulty": "Easy", "likes": 181, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2839", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations I", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37804, "totalSubmissionRaw": 80163}, "2840": {"acRate": 55.84678682567198, "difficulty": "Medium", "likes": 253, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2840", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations II", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26739, "totalSubmissionRaw": 47880}, "2841": {"acRate": 38.10388500625629, "difficulty": "Medium", "likes": 271, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2841", "paidOnly": false, "title": "Maximum Sum of Almost Unique Subarray", "titleSlug": "maximum-sum-of-almost-unique-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24971, "totalSubmissionRaw": 65534}, "2842": {"acRate": 29.429122147395475, "difficulty": "Hard", "likes": 333, "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": 12367, "totalSubmissionRaw": 42023}, "2843": {"acRate": 74.42872512967097, "difficulty": "Easy", "likes": 252, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2843", "paidOnly": false, "title": "  Count Symmetric Integers", "titleSlug": "count-symmetric-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46347, "totalSubmissionRaw": 62271}, "2844": {"acRate": 38.223761116290085, "difficulty": "Medium", "likes": 345, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2844", "paidOnly": false, "title": "Minimum Operations to Make a Special Number", "titleSlug": "minimum-operations-to-make-a-special-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25832, "totalSubmissionRaw": 67581}, "2845": {"acRate": 35.46311423903481, "difficulty": "Medium", "likes": 495, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2845", "paidOnly": false, "title": "Count of Interesting Subarrays", "titleSlug": "count-of-interesting-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14109, "totalSubmissionRaw": 39785}, "2846": {"acRate": 44.55558081382132, "difficulty": "Hard", "likes": 297, "dislikes": 7, "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": 5880, "totalSubmissionRaw": 13197}, "2847": {"acRate": 43.186180422264876, "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": 900, "totalSubmissionRaw": 2084}, "2848": {"acRate": 75.29729895830133, "difficulty": "Easy", "likes": 272, "dislikes": 24, "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": 49008, "totalSubmissionRaw": 65086}, "2849": {"acRate": 35.67045911146023, "difficulty": "Medium", "likes": 817, "dislikes": 755, "categoryTitle": "Algorithms", "frontendQuestionId": "2849", "paidOnly": false, "title": "Determine if a Cell Is Reachable at a Given Time", "titleSlug": "determine-if-a-cell-is-reachable-at-a-given-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98540, "totalSubmissionRaw": 276251}, "2850": {"acRate": 44.470092332396625, "difficulty": "Medium", "likes": 501, "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": 22155, "totalSubmissionRaw": 49820}, "2851": {"acRate": 29.417454058477794, "difficulty": "Hard", "likes": 163, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2851", "paidOnly": false, "title": "String Transformation", "titleSlug": "string-transformation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3954, "totalSubmissionRaw": 13441}, "2852": {"acRate": 64.73859844271412, "difficulty": "Medium", "likes": 28, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2852", "paidOnly": true, "title": "Sum of Remoteness of All Cells", "titleSlug": "sum-of-remoteness-of-all-cells", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1126, "totalSubmissionRaw": 1760}, "2853": {"acRate": 73.62609786700125, "difficulty": "Easy", "likes": 15, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2853", "paidOnly": true, "title": "Highest Salaries Difference", "titleSlug": "highest-salaries-difference", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2934, "totalSubmissionRaw": 3985}, "2854": {"acRate": 67.09580838323353, "difficulty": "Medium", "likes": 16, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2854", "paidOnly": true, "title": "Rolling Average Steps", "titleSlug": "rolling-average-steps", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2241, "totalSubmissionRaw": 3340}, "2855": {"acRate": 57.9780152254805, "difficulty": "Easy", "likes": 214, "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": 33967, "totalSubmissionRaw": 58586}, "2856": {"acRate": 22.55198988146013, "difficulty": "Medium", "likes": 367, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2856", "paidOnly": false, "title": "Minimum Array Length After Pair Removals", "titleSlug": "minimum-array-length-after-pair-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23001, "totalSubmissionRaw": 101991}, "2857": {"acRate": 32.155667144906744, "difficulty": "Medium", "likes": 265, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2857", "paidOnly": false, "title": "Count Pairs of Points With Distance k", "titleSlug": "count-pairs-of-points-with-distance-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10758, "totalSubmissionRaw": 33456}, "2858": {"acRate": 58.68127178319937, "difficulty": "Hard", "likes": 295, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2858", "paidOnly": false, "title": "Minimum Edge Reversals So Every Node Is Reachable", "titleSlug": "minimum-edge-reversals-so-every-node-is-reachable", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8250, "totalSubmissionRaw": 14059}, "2859": {"acRate": 86.66105848359607, "difficulty": "Easy", "likes": 264, "dislikes": 41, "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": 71082, "totalSubmissionRaw": 82023}, "2860": {"acRate": 52.18573973328198, "difficulty": "Medium", "likes": 163, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "2860", "paidOnly": false, "title": "Happy Students", "titleSlug": "happy-students", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21679, "totalSubmissionRaw": 41542}, "2861": {"acRate": 38.47813028995795, "difficulty": "Medium", "likes": 270, "dislikes": 45, "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": 14093, "totalSubmissionRaw": 36626}, "2862": {"acRate": 44.120386540924436, "difficulty": "Hard", "likes": 206, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2862", "paidOnly": false, "title": "Maximum Element-Sum of a Complete Subset of Indices", "titleSlug": "maximum-element-sum-of-a-complete-subset-of-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7579, "totalSubmissionRaw": 17178}, "2863": {"acRate": 70.8921845574388, "difficulty": "Medium", "likes": 120, "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": 12046, "totalSubmissionRaw": 16992}, "2864": {"acRate": 83.14724968781346, "difficulty": "Easy", "likes": 762, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2864", "paidOnly": false, "title": "Maximum Odd Binary Number", "titleSlug": "maximum-odd-binary-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 203083, "totalSubmissionRaw": 244245}, "2865": {"acRate": 43.57632979199885, "difficulty": "Medium", "likes": 282, "dislikes": 48, "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": 24323, "totalSubmissionRaw": 55817}, "2866": {"acRate": 34.82123856139604, "difficulty": "Medium", "likes": 402, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2866", "paidOnly": false, "title": "Beautiful Towers II", "titleSlug": "beautiful-towers-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13090, "totalSubmissionRaw": 37592}, "2867": {"acRate": 35.58100964030268, "difficulty": "Hard", "likes": 248, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2867", "paidOnly": false, "title": "Count Valid Paths in a Tree", "titleSlug": "count-valid-paths-in-a-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6865, "totalSubmissionRaw": 19294}, "2868": {"acRate": 59.580052493438316, "difficulty": "Hard", "likes": 10, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2868", "paidOnly": true, "title": "The Wording Game", "titleSlug": "the-wording-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 454, "totalSubmissionRaw": 762}, "2869": {"acRate": 60.37357570087212, "difficulty": "Easy", "likes": 168, "dislikes": 18, "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": 36136, "totalSubmissionRaw": 59854}, "2870": {"acRate": 61.99440302346477, "difficulty": "Medium", "likes": 1387, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2870", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Empty", "titleSlug": "minimum-number-of-operations-to-make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180767, "totalSubmissionRaw": 291586}, "2871": {"acRate": 43.982691051600256, "difficulty": "Medium", "likes": 221, "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": 16161, "totalSubmissionRaw": 36744}, "2872": {"acRate": 57.79386943975609, "difficulty": "Hard", "likes": 185, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2872", "paidOnly": false, "title": "Maximum Number of K-Divisible Components", "titleSlug": "maximum-number-of-k-divisible-components", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10615, "totalSubmissionRaw": 18367}, "2873": {"acRate": 45.74716538196251, "difficulty": "Easy", "likes": 163, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2873", "paidOnly": false, "title": "Maximum Value of an Ordered Triplet I", "titleSlug": "maximum-value-of-an-ordered-triplet-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37805, "totalSubmissionRaw": 82639}, "2874": {"acRate": 41.41179445840643, "difficulty": "Medium", "likes": 273, "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": 26200, "totalSubmissionRaw": 63267}, "2875": {"acRate": 30.832540437678404, "difficulty": "Medium", "likes": 369, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2875", "paidOnly": false, "title": "Minimum Size Subarray in Infinite Array", "titleSlug": "minimum-size-subarray-in-infinite-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19443, "totalSubmissionRaw": 63060}, "2876": {"acRate": 32.877370579190156, "difficulty": "Hard", "likes": 317, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2876", "paidOnly": false, "title": "Count Visited Nodes in a Directed Graph", "titleSlug": "count-visited-nodes-in-a-directed-graph", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10263, "totalSubmissionRaw": 31216}, "2877": {"acRate": 81.14827573434086, "difficulty": "Easy", "likes": 174, "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": 109537, "totalSubmissionRaw": 134984}, "2878": {"acRate": 84.90722019143617, "difficulty": "Easy", "likes": 91, "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": 85243, "totalSubmissionRaw": 100395}, "2879": {"acRate": 92.88918890850556, "difficulty": "Easy", "likes": 76, "dislikes": 19, "categoryTitle": "pandas", "frontendQuestionId": "2879", "paidOnly": false, "title": "Display the First Three Rows", "titleSlug": "display-the-first-three-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89443, "totalSubmissionRaw": 96290}, "2880": {"acRate": 79.19010250019647, "difficulty": "Easy", "likes": 76, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2880", "paidOnly": false, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70536, "totalSubmissionRaw": 89072}, "2881": {"acRate": 90.11139604618663, "difficulty": "Easy", "likes": 68, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2881", "paidOnly": false, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66413, "totalSubmissionRaw": 73701}, "2882": {"acRate": 85.31976324527213, "difficulty": "Easy", "likes": 80, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2882", "paidOnly": false, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59101, "totalSubmissionRaw": 69270}, "2883": {"acRate": 63.93772148957183, "difficulty": "Easy", "likes": 61, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2883", "paidOnly": false, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55027, "totalSubmissionRaw": 86064}, "2884": {"acRate": 91.90992493744787, "difficulty": "Easy", "likes": 61, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2884", "paidOnly": false, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60609, "totalSubmissionRaw": 65944}, "2885": {"acRate": 85.20960827306345, "difficulty": "Easy", "likes": 50, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2885", "paidOnly": false, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52075, "totalSubmissionRaw": 61114}, "2886": {"acRate": 87.11386155586793, "difficulty": "Easy", "likes": 56, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2886", "paidOnly": false, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50814, "totalSubmissionRaw": 58330}, "2887": {"acRate": 71.86367253116435, "difficulty": "Easy", "likes": 55, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2887", "paidOnly": false, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 48770, "totalSubmissionRaw": 67865}, "2888": {"acRate": 90.52229839564635, "difficulty": "Easy", "likes": 55, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2888", "paidOnly": false, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51231, "totalSubmissionRaw": 56595}, "2889": {"acRate": 81.88321474218347, "difficulty": "Easy", "likes": 80, "dislikes": 12, "categoryTitle": "pandas", "frontendQuestionId": "2889", "paidOnly": false, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42924, "totalSubmissionRaw": 52421}, "2890": {"acRate": 85.70218532949347, "difficulty": "Easy", "likes": 69, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2890", "paidOnly": false, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40472, "totalSubmissionRaw": 47224}, "2891": {"acRate": 75.97159202998618, "difficulty": "Easy", "likes": 63, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2891", "paidOnly": false, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42360, "totalSubmissionRaw": 55758}, "2892": {"acRate": 40.31936127744511, "difficulty": "Medium", "likes": 22, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2892", "paidOnly": true, "title": "Minimizing Array After Replacing Pairs With Their Product", "titleSlug": "minimizing-array-after-replacing-pairs-with-their-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 808, "totalSubmissionRaw": 2004}, "2893": {"acRate": 68.03170409511229, "difficulty": "Medium", "likes": 18, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2893", "paidOnly": true, "title": "Calculate Orders Within Each Interval", "titleSlug": "calculate-orders-within-each-interval", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2060, "totalSubmissionRaw": 3028}, "2894": {"acRate": 89.05438029379272, "difficulty": "Easy", "likes": 214, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2894", "paidOnly": false, "title": "Divisible and Non-divisible Sums Difference", "titleSlug": "divisible-and-non-divisible-sums-difference", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87055, "totalSubmissionRaw": 97755}, "2895": {"acRate": 69.20443937350898, "difficulty": "Medium", "likes": 253, "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": 33360, "totalSubmissionRaw": 48205}, "2896": {"acRate": 26.91887725608581, "difficulty": "Medium", "likes": 350, "dislikes": 67, "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": 12573, "totalSubmissionRaw": 46707}, "2897": {"acRate": 47.10835058661146, "difficulty": "Hard", "likes": 179, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2897", "paidOnly": false, "title": "Apply Operations on Array to Maximize Sum of Squares", "titleSlug": "apply-operations-on-array-to-maximize-sum-of-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6826, "totalSubmissionRaw": 14490}, "2898": {"acRate": 67.36174070716228, "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": 743, "totalSubmissionRaw": 1103}, "2899": {"acRate": 66.0750142541957, "difficulty": "Easy", "likes": 152, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "2899", "paidOnly": false, "title": "Last Visited Integers", "titleSlug": "last-visited-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26654, "totalSubmissionRaw": 40339}, "2900": {"acRate": 62.61787504692917, "difficulty": "Easy", "likes": 177, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2900", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence I", "titleSlug": "longest-unequal-adjacent-groups-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28354, "totalSubmissionRaw": 45281}, "2901": {"acRate": 27.32422271895956, "difficulty": "Medium", "likes": 192, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2901", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence II", "titleSlug": "longest-unequal-adjacent-groups-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10757, "totalSubmissionRaw": 39368}, "2902": {"acRate": 21.032707450030287, "difficulty": "Hard", "likes": 146, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2902", "paidOnly": false, "title": "Count of Sub-Multisets With Bounded Sum", "titleSlug": "count-of-sub-multisets-with-bounded-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4167, "totalSubmissionRaw": 19812}, "2903": {"acRate": 61.890604570076576, "difficulty": "Easy", "likes": 135, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2903", "paidOnly": false, "title": "Find Indices With Index and Value Difference I", "titleSlug": "find-indices-with-index-and-value-difference-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39761, "totalSubmissionRaw": 64244}, "2904": {"acRate": 39.1624099944612, "difficulty": "Medium", "likes": 178, "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": 25454, "totalSubmissionRaw": 64996}, "2905": {"acRate": 32.17251540316099, "difficulty": "Medium", "likes": 258, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2905", "paidOnly": false, "title": "Find Indices With Index and Value Difference II", "titleSlug": "find-indices-with-index-and-value-difference-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18015, "totalSubmissionRaw": 55995}, "2906": {"acRate": 30.907505705567097, "difficulty": "Medium", "likes": 220, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2906", "paidOnly": false, "title": "Construct Product Matrix", "titleSlug": "construct-product-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12053, "totalSubmissionRaw": 38997}, "2907": {"acRate": 56.46817248459959, "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": 1100, "totalSubmissionRaw": 1948}, "2908": {"acRate": 65.067497403946, "difficulty": "Easy", "likes": 154, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2908", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets I", "titleSlug": "minimum-sum-of-mountain-triplets-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34462, "totalSubmissionRaw": 52964}, "2909": {"acRate": 54.170292676224065, "difficulty": "Medium", "likes": 189, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2909", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets II", "titleSlug": "minimum-sum-of-mountain-triplets-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23654, "totalSubmissionRaw": 43666}, "2910": {"acRate": 25.03179144810046, "difficulty": "Medium", "likes": 368, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "2910", "paidOnly": false, "title": "Minimum Number of Groups to Create a Valid Assignment", "titleSlug": "minimum-number-of-groups-to-create-a-valid-assignment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12598, "totalSubmissionRaw": 50328}, "2911": {"acRate": 36.426019928558, "difficulty": "Hard", "likes": 121, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2911", "paidOnly": false, "title": "Minimum Changes to Make K Semi-palindromes", "titleSlug": "minimum-changes-to-make-k-semi-palindromes", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3875, "totalSubmissionRaw": 10638}, "2912": {"acRate": 63.086232980332824, "difficulty": "Hard", "likes": 15, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2912", "paidOnly": true, "title": "Number of Ways to Reach Destination in the Grid", "titleSlug": "number-of-ways-to-reach-destination-in-the-grid", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 834, "totalSubmissionRaw": 1322}, "2913": {"acRate": 82.80229664128534, "difficulty": "Easy", "likes": 145, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2913", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares I", "titleSlug": "subarrays-distinct-element-sum-of-squares-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33602, "totalSubmissionRaw": 40581}, "2914": {"acRate": 60.02079133064516, "difficulty": "Medium", "likes": 142, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2914", "paidOnly": false, "title": "Minimum Number of Changes to Make Binary String Beautiful", "titleSlug": "minimum-number-of-changes-to-make-binary-string-beautiful", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19053, "totalSubmissionRaw": 31744}, "2915": {"acRate": 35.76756017789468, "difficulty": "Medium", "likes": 219, "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": 20667, "totalSubmissionRaw": 57785}, "2916": {"acRate": 21.256629946960423, "difficulty": "Hard", "likes": 141, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2916", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares II", "titleSlug": "subarrays-distinct-element-sum-of-squares-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3126, "totalSubmissionRaw": 14706}, "2917": {"acRate": 74.69564718042953, "difficulty": "Easy", "likes": 219, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "2917", "paidOnly": false, "title": "Find the K-or of an Array", "titleSlug": "find-the-k-or-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26015, "totalSubmissionRaw": 34828}, "2918": {"acRate": 35.25023681717714, "difficulty": "Medium", "likes": 177, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2918", "paidOnly": false, "title": "Minimum Equal Sum of Two Arrays After Replacing Zeros", "titleSlug": "minimum-equal-sum-of-two-arrays-after-replacing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26793, "totalSubmissionRaw": 76008}, "2919": {"acRate": 34.34679334916865, "difficulty": "Medium", "likes": 312, "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": 13737, "totalSubmissionRaw": 39995}, "2920": {"acRate": 37.54670599803343, "difficulty": "Hard", "likes": 196, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2920", "paidOnly": false, "title": "Maximum Points After Collecting Coins From All Nodes", "titleSlug": "maximum-points-after-collecting-coins-from-all-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7637, "totalSubmissionRaw": 20340}, "2921": {"acRate": 49.21402660217654, "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": 407, "totalSubmissionRaw": 827}, "2922": {"acRate": 40.54919908466819, "difficulty": "Medium", "likes": 12, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2922", "paidOnly": true, "title": "Market Analysis III", "titleSlug": "market-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1772, "totalSubmissionRaw": 4370}, "2923": {"acRate": 73.47067645433737, "difficulty": "Easy", "likes": 138, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2923", "paidOnly": false, "title": "Find Champion I", "titleSlug": "find-champion-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37232, "totalSubmissionRaw": 50676}, "2924": {"acRate": 58.55736971594722, "difficulty": "Medium", "likes": 147, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2924", "paidOnly": false, "title": "Find Champion II", "titleSlug": "find-champion-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26181, "totalSubmissionRaw": 44710}, "2925": {"acRate": 49.552607219993824, "difficulty": "Medium", "likes": 318, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2925", "paidOnly": false, "title": "Maximum Score After Applying Operations on a Tree", "titleSlug": "maximum-score-after-applying-operations-on-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12848, "totalSubmissionRaw": 25928}, "2926": {"acRate": 24.039805208553886, "difficulty": "Hard", "likes": 192, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2926", "paidOnly": false, "title": "Maximum Balanced Subsequence Sum", "titleSlug": "maximum-balanced-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5677, "totalSubmissionRaw": 23615}, "2927": {"acRate": 44.340425531914896, "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": 521, "totalSubmissionRaw": 1175}, "2928": {"acRate": 75.86636231583316, "difficulty": "Easy", "likes": 102, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2928", "paidOnly": false, "title": "Distribute Candies Among Children I", "titleSlug": "distribute-candies-among-children-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25592, "totalSubmissionRaw": 33733}, "2929": {"acRate": 35.28515141928619, "difficulty": "Medium", "likes": 90, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "2929", "paidOnly": false, "title": "Distribute Candies Among Children II", "titleSlug": "distribute-candies-among-children-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12269, "totalSubmissionRaw": 34771}, "2930": {"acRate": 56.38259292837715, "difficulty": "Medium", "likes": 165, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2930", "paidOnly": false, "title": "Number of Strings Which Can Be Rearranged to Contain Substring", "titleSlug": "number-of-strings-which-can-be-rearranged-to-contain-substring", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6219, "totalSubmissionRaw": 11030}, "2931": {"acRate": 65.51532033426184, "difficulty": "Hard", "likes": 92, "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": 10584, "totalSubmissionRaw": 16155}, "2932": {"acRate": 76.25837070404408, "difficulty": "Easy", "likes": 139, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2932", "paidOnly": false, "title": "Maximum Strong Pair XOR I", "titleSlug": "maximum-strong-pair-xor-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37919, "totalSubmissionRaw": 49725}, "2933": {"acRate": 44.33582043279664, "difficulty": "Medium", "likes": 190, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2933", "paidOnly": false, "title": "High-Access Employees", "titleSlug": "high-access-employees", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21451, "totalSubmissionRaw": 48383}, "2934": {"acRate": 44.95858641634456, "difficulty": "Medium", "likes": 180, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2934", "paidOnly": false, "title": "Minimum Operations to Maximize Last Elements in Arrays", "titleSlug": "minimum-operations-to-maximize-last-elements-in-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12213, "totalSubmissionRaw": 27165}, "2935": {"acRate": 30.403401226023334, "difficulty": "Hard", "likes": 171, "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": 6150, "totalSubmissionRaw": 20228}, "2936": {"acRate": 66.50264950794852, "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": 1757, "totalSubmissionRaw": 2642}, "2937": {"acRate": 43.29226505033276, "difficulty": "Easy", "likes": 294, "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": 28427, "totalSubmissionRaw": 65663}, "2938": {"acRate": 53.42140319715808, "difficulty": "Medium", "likes": 186, "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": 24061, "totalSubmissionRaw": 45040}, "2939": {"acRate": 26.192624501557177, "difficulty": "Medium", "likes": 201, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2939", "paidOnly": false, "title": "Maximum Xor Product", "titleSlug": "maximum-xor-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8999, "totalSubmissionRaw": 34357}, "2940": {"acRate": 35.40375904618108, "difficulty": "Hard", "likes": 229, "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": 6800, "totalSubmissionRaw": 19207}, "2941": {"acRate": 47.704081632653065, "difficulty": "Hard", "likes": 13, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2941", "paidOnly": true, "title": "Maximum GCD-Sum of a Subarray", "titleSlug": "maximum-gcd-sum-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 374, "totalSubmissionRaw": 784}, "2942": {"acRate": 88.64460980259517, "difficulty": "Easy", "likes": 332, "dislikes": 26, "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": 144145, "totalSubmissionRaw": 162610}, "2943": {"acRate": 36.785532023475376, "difficulty": "Medium", "likes": 224, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "2943", "paidOnly": false, "title": "Maximize Area of Square Hole in Grid", "titleSlug": "maximize-area-of-square-hole-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11533, "totalSubmissionRaw": 31352}, "2944": {"acRate": 45.945468464754725, "difficulty": "Medium", "likes": 251, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2944", "paidOnly": false, "title": "Minimum Number of Coins for Fruits", "titleSlug": "minimum-number-of-coins-for-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15604, "totalSubmissionRaw": 33962}, "2945": {"acRate": 16.008880118401578, "difficulty": "Hard", "likes": 159, "dislikes": 20, "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": 3894, "totalSubmissionRaw": 24324}, "2946": {"acRate": 58.2249367509136, "difficulty": "Easy", "likes": 172, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2946", "paidOnly": false, "title": "Matrix Similarity After Cyclic Shifts", "titleSlug": "matrix-similarity-after-cyclic-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22784, "totalSubmissionRaw": 39131}, "2947": {"acRate": 62.01078395734885, "difficulty": "Medium", "likes": 135, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2947", "paidOnly": false, "title": "Count Beautiful Substrings I", "titleSlug": "count-beautiful-substrings-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20471, "totalSubmissionRaw": 33012}, "2948": {"acRate": 39.610592595900506, "difficulty": "Medium", "likes": 255, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2948", "paidOnly": false, "title": "Make Lexicographically Smallest Array by Swapping Elements", "titleSlug": "make-lexicographically-smallest-array-by-swapping-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8870, "totalSubmissionRaw": 22393}, "2949": {"acRate": 25.228253235677737, "difficulty": "Hard", "likes": 177, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2949", "paidOnly": false, "title": "Count Beautiful Substrings II", "titleSlug": "count-beautiful-substrings-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5029, "totalSubmissionRaw": 19934}, "2950": {"acRate": 76.29310344827587, "difficulty": "Medium", "likes": 22, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2950", "paidOnly": true, "title": "Number of Divisible Substrings", "titleSlug": "number-of-divisible-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1239, "totalSubmissionRaw": 1624}, "2951": {"acRate": 75.6871763583173, "difficulty": "Easy", "likes": 151, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2951", "paidOnly": false, "title": "Find the Peaks", "titleSlug": "find-the-peaks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48380, "totalSubmissionRaw": 63921}, "2952": {"acRate": 56.71632733561914, "difficulty": "Medium", "likes": 344, "dislikes": 53, "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": 18689, "totalSubmissionRaw": 32951}, "2953": {"acRate": 27.723171124718014, "difficulty": "Hard", "likes": 195, "dislikes": 34, "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": 6882, "totalSubmissionRaw": 24824}, "2954": {"acRate": 36.66164716784432, "difficulty": "Hard", "likes": 114, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2954", "paidOnly": false, "title": "Count the Number of Infection Sequences", "titleSlug": "count-the-number-of-infection-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3165, "totalSubmissionRaw": 8633}, "2955": {"acRate": 70.70854638422206, "difficulty": "Medium", "likes": 28, "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": 968, "totalSubmissionRaw": 1369}, "2956": {"acRate": 83.60079260975132, "difficulty": "Easy", "likes": 214, "dislikes": 85, "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": 59910, "totalSubmissionRaw": 71662}, "2957": {"acRate": 52.5838140522797, "difficulty": "Medium", "likes": 161, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2957", "paidOnly": false, "title": "Remove Adjacent Almost-Equal Characters", "titleSlug": "remove-adjacent-almost-equal-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21786, "totalSubmissionRaw": 41431}, "2958": {"acRate": 55.810018778096016, "difficulty": "Medium", "likes": 1025, "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": 147118, "totalSubmissionRaw": 263605}, "2959": {"acRate": 51.30000744989943, "difficulty": "Hard", "likes": 158, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2959", "paidOnly": false, "title": "Number of Possible Sets of Closing Branches", "titleSlug": "number-of-possible-sets-of-closing-branches", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6886, "totalSubmissionRaw": 13423}, "2960": {"acRate": 80.77318365088149, "difficulty": "Easy", "likes": 137, "dislikes": 11, "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": 40868, "totalSubmissionRaw": 50596}, "2961": {"acRate": 47.979070989558345, "difficulty": "Medium", "likes": 110, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2961", "paidOnly": false, "title": "Double Modular Exponentiation", "titleSlug": "double-modular-exponentiation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20999, "totalSubmissionRaw": 43767}, "2962": {"acRate": 58.9646493072597, "difficulty": "Medium", "likes": 1209, "dislikes": 57, "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": 130954, "totalSubmissionRaw": 222089}, "2963": {"acRate": 49.821573012323356, "difficulty": "Hard", "likes": 239, "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": 10471, "totalSubmissionRaw": 21017}, "2964": {"acRate": 66.85415829650462, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2964", "paidOnly": true, "title": "Number of Divisible Triplet Sums", "titleSlug": "number-of-divisible-triplet-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1664, "totalSubmissionRaw": 2489}, "2965": {"acRate": 75.86248601578328, "difficulty": "Easy", "likes": 194, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2965", "paidOnly": false, "title": "Find Missing and Repeated Values", "titleSlug": "find-missing-and-repeated-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50180, "totalSubmissionRaw": 66146}, "2966": {"acRate": 71.63000189645363, "difficulty": "Medium", "likes": 826, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "2966", "paidOnly": false, "title": "Divide Array Into Arrays With Max Difference", "titleSlug": "divide-array-into-arrays-with-max-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151082, "totalSubmissionRaw": 210920}, "2967": {"acRate": 22.14860061428029, "difficulty": "Medium", "likes": 222, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2967", "paidOnly": false, "title": "Minimum Cost to Make Array Equalindromic", "titleSlug": "minimum-cost-to-make-array-equalindromic", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12836, "totalSubmissionRaw": 57954}, "2968": {"acRate": 38.4883507613282, "difficulty": "Hard", "likes": 237, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2968", "paidOnly": false, "title": "Apply Operations to Maximize Frequency Score", "titleSlug": "apply-operations-to-maximize-frequency-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6294, "totalSubmissionRaw": 16353}, "2969": {"acRate": 53.896103896103895, "difficulty": "Hard", "likes": 18, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2969", "paidOnly": true, "title": "Minimum Number of Coins for Fruits II", "titleSlug": "minimum-number-of-coins-for-fruits-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 581, "totalSubmissionRaw": 1078}, "2970": {"acRate": 51.93034159410582, "difficulty": "Easy", "likes": 145, "dislikes": 91, "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": 19383, "totalSubmissionRaw": 37325}, "2971": {"acRate": 66.07403032092932, "difficulty": "Medium", "likes": 781, "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": 134236, "totalSubmissionRaw": 203160}, "2972": {"acRate": 39.885083627261345, "difficulty": "Hard", "likes": 191, "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": 7011, "totalSubmissionRaw": 17578}, "2973": {"acRate": 37.05743150996633, "difficulty": "Hard", "likes": 172, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2973", "paidOnly": false, "title": "Find Number of Coins to Place in Tree Nodes", "titleSlug": "find-number-of-coins-to-place-in-tree-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8143, "totalSubmissionRaw": 21974}, "2974": {"acRate": 85.9085761350767, "difficulty": "Easy", "likes": 225, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2974", "paidOnly": false, "title": "Minimum Number Game", "titleSlug": "minimum-number-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83441, "totalSubmissionRaw": 97126}, "2975": {"acRate": 22.853210857057586, "difficulty": "Medium", "likes": 135, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "2975", "paidOnly": false, "title": "Maximum Square Area by Removing Fences From a Field", "titleSlug": "maximum-square-area-by-removing-fences-from-a-field", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13783, "totalSubmissionRaw": 60311}, "2976": {"acRate": 58.675780236370926, "difficulty": "Medium", "likes": 854, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2976", "paidOnly": false, "title": "Minimum Cost to Convert String I", "titleSlug": "minimum-cost-to-convert-string-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99492, "totalSubmissionRaw": 169563}, "2977": {"acRate": 25.294053583097366, "difficulty": "Hard", "likes": 95, "dislikes": 72, "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": 4645, "totalSubmissionRaw": 18364}, "2978": {"acRate": 42.371202113606344, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2978", "paidOnly": true, "title": "Symmetric Coordinates", "titleSlug": "symmetric-coordinates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1283, "totalSubmissionRaw": 3028}, "2979": {"acRate": 77.23214285714286, "difficulty": "Medium", "likes": 15, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2979", "paidOnly": true, "title": "Most Expensive Item That Can Not Be Bought", "titleSlug": "most-expensive-item-that-can-not-be-bought", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1557, "totalSubmissionRaw": 2016}, "2980": {"acRate": 70.70020538228631, "difficulty": "Easy", "likes": 105, "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": 33391, "totalSubmissionRaw": 47229}, "2981": {"acRate": 42.953853797900756, "difficulty": "Medium", "likes": 162, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2981", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice I", "titleSlug": "find-longest-special-substring-that-occurs-thrice-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20748, "totalSubmissionRaw": 48302}, "2982": {"acRate": 34.03320409583458, "difficulty": "Medium", "likes": 248, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2982", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice II", "titleSlug": "find-longest-special-substring-that-occurs-thrice-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17112, "totalSubmissionRaw": 50289}, "2983": {"acRate": 25.895982663777296, "difficulty": "Hard", "likes": 85, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2983", "paidOnly": false, "title": "Palindrome Rearrangement Queries", "titleSlug": "palindrome-rearrangement-queries", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3107, "totalSubmissionRaw": 11998}, "2984": {"acRate": 61.368821292775664, "difficulty": "Medium", "likes": 8, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2984", "paidOnly": true, "title": "Find Peak Calling Hours for Each City", "titleSlug": "find-peak-calling-hours-for-each-city", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1614, "totalSubmissionRaw": 2630}, "2985": {"acRate": 87.1266302061422, "difficulty": "Easy", "likes": 7, "dislikes": 3, "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": 2071, "totalSubmissionRaw": 2377}, "2986": {"acRate": 52.0935960591133, "difficulty": "Medium", "likes": 7, "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": 1692, "totalSubmissionRaw": 3248}, "2987": {"acRate": 78.78563495001852, "difficulty": "Easy", "likes": 7, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2987", "paidOnly": true, "title": "Find Expensive Cities", "titleSlug": "find-expensive-cities", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2128, "totalSubmissionRaw": 2701}, "2988": {"acRate": 79.59016393442623, "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": 1942, "totalSubmissionRaw": 2440}, "2989": {"acRate": 89.0142964635064, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2989", "paidOnly": true, "title": "Class Performance", "titleSlug": "class-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2366, "totalSubmissionRaw": 2658}, "2990": {"acRate": 61.551064991807756, "difficulty": "Easy", "likes": 13, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2990", "paidOnly": true, "title": "Loan Types", "titleSlug": "loan-types", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2254, "totalSubmissionRaw": 3662}, "2991": {"acRate": 53.83609415867481, "difficulty": "Hard", "likes": 8, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2991", "paidOnly": true, "title": "Top Three Wineries ", "titleSlug": "top-three-wineries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1234, "totalSubmissionRaw": 2293}, "2992": {"acRate": 73.12086590499098, "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": 1216, "totalSubmissionRaw": 1663}, "2993": {"acRate": 80.69164265129683, "difficulty": "Medium", "likes": 9, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2993", "paidOnly": true, "title": "Friday Purchases I", "titleSlug": "friday-purchases-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1680, "totalSubmissionRaw": 2082}, "2994": {"acRate": 73.35984095427436, "difficulty": "Hard", "likes": 10, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2994", "paidOnly": true, "title": "Friday Purchases II ", "titleSlug": "friday-purchases-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1107, "totalSubmissionRaw": 1509}, "2995": {"acRate": 42.825768667642755, "difficulty": "Hard", "likes": 5, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2995", "paidOnly": true, "title": "Viewers Turned Streamers", "titleSlug": "viewers-turned-streamers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1170, "totalSubmissionRaw": 2732}, "2996": {"acRate": 32.59617451106813, "difficulty": "Easy", "likes": 106, "dislikes": 230, "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": 30334, "totalSubmissionRaw": 93057}, "2997": {"acRate": 86.41580671515709, "difficulty": "Medium", "likes": 565, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2997", "paidOnly": false, "title": "Minimum Number of Operations to Make Array XOR Equal to K", "titleSlug": "minimum-number-of-operations-to-make-array-xor-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108947, "totalSubmissionRaw": 126073}, "2998": {"acRate": 46.45928235609364, "difficulty": "Medium", "likes": 241, "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": 19071, "totalSubmissionRaw": 41049}, "2999": {"acRate": 26.237198924423595, "difficulty": "Hard", "likes": 105, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2999", "paidOnly": false, "title": "Count the Number of Powerful Integers", "titleSlug": "count-the-number-of-powerful-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4586, "totalSubmissionRaw": 17479}, "3000": {"acRate": 36.12195401222038, "difficulty": "Easy", "likes": 102, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3000", "paidOnly": false, "title": "Maximum Area of Longest Diagonal Rectangle", "titleSlug": "maximum-area-of-longest-diagonal-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34702, "totalSubmissionRaw": 96069}, "3001": {"acRate": 20.957975707527297, "difficulty": "Medium", "likes": 150, "dislikes": 194, "categoryTitle": "Algorithms", "frontendQuestionId": "3001", "paidOnly": false, "title": "Minimum Moves to Capture The Queen", "titleSlug": "minimum-moves-to-capture-the-queen", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17410, "totalSubmissionRaw": 83071}, "3002": {"acRate": 45.710201581142975, "difficulty": "Medium", "likes": 279, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3002", "paidOnly": false, "title": "Maximum Size of a Set After Removals", "titleSlug": "maximum-size-of-a-set-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15669, "totalSubmissionRaw": 34279}, "3003": {"acRate": 28.16452973066001, "difficulty": "Hard", "likes": 130, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3003", "paidOnly": false, "title": "Maximize the Number of Partitions After Operations", "titleSlug": "maximize-the-number-of-partitions-after-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3273, "totalSubmissionRaw": 11621}, "3004": {"acRate": 64.81288981288982, "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": 1247, "totalSubmissionRaw": 1924}, "3005": {"acRate": 78.77027417786073, "difficulty": "Easy", "likes": 633, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "3005", "paidOnly": false, "title": "Count Elements With Maximum Frequency", "titleSlug": "count-elements-with-maximum-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209755, "totalSubmissionRaw": 266287}, "3006": {"acRate": 36.42197751712059, "difficulty": "Medium", "likes": 150, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3006", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array I", "titleSlug": "find-beautiful-indices-in-the-given-array-i", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25369, "totalSubmissionRaw": 69652}, "3007": {"acRate": 36.44201276631021, "difficulty": "Medium", "likes": 285, "dislikes": 112, "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": 8792, "totalSubmissionRaw": 24126}, "3008": {"acRate": 24.544417752541797, "difficulty": "Hard", "likes": 158, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3008", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array II", "titleSlug": "find-beautiful-indices-in-the-given-array-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10115, "totalSubmissionRaw": 41211}, "3009": {"acRate": 45.946293203135035, "difficulty": "Hard", "likes": 28, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3009", "paidOnly": true, "title": "Maximum Number of Intersections on the Chart", "titleSlug": "maximum-number-of-intersections-on-the-chart", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3576, "totalSubmissionRaw": 7783}, "3010": {"acRate": 66.34019265332498, "difficulty": "Easy", "likes": 89, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3010", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost I", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32851, "totalSubmissionRaw": 49519}, "3011": {"acRate": 51.476964769647694, "difficulty": "Medium", "likes": 114, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3011", "paidOnly": false, "title": "Find if Array Can Be Sorted", "titleSlug": "find-if-array-can-be-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22794, "totalSubmissionRaw": 44280}, "3012": {"acRate": 35.294874765104126, "difficulty": "Medium", "likes": 161, "dislikes": 41, "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": 13711, "totalSubmissionRaw": 38847}, "3013": {"acRate": 31.97127605490595, "difficulty": "Hard", "likes": 114, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3013", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost II", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5031, "totalSubmissionRaw": 15736}, "3014": {"acRate": 66.33948806825757, "difficulty": "Easy", "likes": 155, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "3014", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word I", "titleSlug": "minimum-number-of-pushes-to-type-word-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39808, "totalSubmissionRaw": 60007}, "3015": {"acRate": 56.27535159141377, "difficulty": "Medium", "likes": 146, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "3015", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance I", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-i", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19007, "totalSubmissionRaw": 33775}, "3016": {"acRate": 80.70056235814552, "difficulty": "Medium", "likes": 715, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "3016", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word II", "titleSlug": "minimum-number-of-pushes-to-type-word-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167461, "totalSubmissionRaw": 207506}, "3017": {"acRate": 21.666299316729116, "difficulty": "Hard", "likes": 79, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "3017", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance II", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2949, "totalSubmissionRaw": 13611}, "3018": {"acRate": 43.78265412748171, "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": 419, "totalSubmissionRaw": 957}, "3019": {"acRate": 80.92072273175782, "difficulty": "Easy", "likes": 111, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3019", "paidOnly": false, "title": "Number of Changing Keys", "titleSlug": "number-of-changing-keys", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50026, "totalSubmissionRaw": 61821}, "3020": {"acRate": 24.71062152652584, "difficulty": "Medium", "likes": 170, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "3020", "paidOnly": false, "title": "Find the Maximum Number of Elements in Subset", "titleSlug": "find-the-maximum-number-of-elements-in-subset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19875, "totalSubmissionRaw": 80431}, "3021": {"acRate": 47.781661737026084, "difficulty": "Medium", "likes": 90, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "3021", "paidOnly": false, "title": "Alice and Bob Playing Flower Game", "titleSlug": "alice-and-bob-playing-flower-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19547, "totalSubmissionRaw": 40909}, "3022": {"acRate": 33.851487363006036, "difficulty": "Hard", "likes": 88, "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": 3027, "totalSubmissionRaw": 8942}, "3023": {"acRate": 59.365781710914455, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3023", "paidOnly": true, "title": "Find Pattern in Infinite Stream I", "titleSlug": "find-pattern-in-infinite-stream-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 805, "totalSubmissionRaw": 1356}, "3024": {"acRate": 38.249919929875425, "difficulty": "Easy", "likes": 90, "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": 45382, "totalSubmissionRaw": 118646}, "3025": {"acRate": 41.141231091807704, "difficulty": "Medium", "likes": 82, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "3025", "paidOnly": false, "title": "Find the Number of Ways to Place People I", "titleSlug": "find-the-number-of-ways-to-place-people-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13735, "totalSubmissionRaw": 33385}, "3026": {"acRate": 18.23515924628981, "difficulty": "Medium", "likes": 312, "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": 17497, "totalSubmissionRaw": 95952}, "3027": {"acRate": 47.80365966226856, "difficulty": "Hard", "likes": 91, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3027", "paidOnly": false, "title": "Find the Number of Ways to Place People II", "titleSlug": "find-the-number-of-ways-to-place-people-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8804, "totalSubmissionRaw": 18417}, "3028": {"acRate": 74.90879416282642, "difficulty": "Easy", "likes": 102, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3028", "paidOnly": false, "title": "Ant on the Boundary", "titleSlug": "ant-on-the-boundary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46815, "totalSubmissionRaw": 62496}, "3029": {"acRate": 40.83278063339413, "difficulty": "Medium", "likes": 139, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3029", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State I", "titleSlug": "minimum-time-to-revert-word-to-initial-state-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19701, "totalSubmissionRaw": 48248}, "3030": {"acRate": 44.161232957913455, "difficulty": "Medium", "likes": 76, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "3030", "paidOnly": false, "title": "Find the Grid of Region Average", "titleSlug": "find-the-grid-of-region-average", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9683, "totalSubmissionRaw": 21929}, "3031": {"acRate": 35.60359293258316, "difficulty": "Hard", "likes": 128, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3031", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State II", "titleSlug": "minimum-time-to-revert-word-to-initial-state-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10821, "totalSubmissionRaw": 30393}, "3032": {"acRate": 86.95456590193432, "difficulty": "Easy", "likes": 22, "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": 3866, "totalSubmissionRaw": 4446}, "3033": {"acRate": 68.50292091725521, "difficulty": "Easy", "likes": 108, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3033", "paidOnly": false, "title": "Modify the Matrix", "titleSlug": "modify-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39283, "totalSubmissionRaw": 57345}, "3034": {"acRate": 66.69531697661093, "difficulty": "Medium", "likes": 90, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3034", "paidOnly": false, "title": "Number of Subarrays That Match a Pattern I", "titleSlug": "number-of-subarrays-that-match-a-pattern-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25607, "totalSubmissionRaw": 38394}, "3035": {"acRate": 42.57223292339606, "difficulty": "Medium", "likes": 208, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3035", "paidOnly": false, "title": "Maximum Palindromes After Operations", "titleSlug": "maximum-palindromes-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14366, "totalSubmissionRaw": 33745}, "3036": {"acRate": 32.47753145596165, "difficulty": "Hard", "likes": 140, "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": 10841, "totalSubmissionRaw": 33380}, "3037": {"acRate": 72.05741626794259, "difficulty": "Hard", "likes": 4, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3037", "paidOnly": true, "title": "Find Pattern in Infinite Stream II", "titleSlug": "find-pattern-in-infinite-stream-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 753, "totalSubmissionRaw": 1045}, "3038": {"acRate": 52.07319172914677, "difficulty": "Easy", "likes": 73, "dislikes": 20, "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": 33268, "totalSubmissionRaw": 63887}, "3039": {"acRate": 56.736556650572126, "difficulty": "Medium", "likes": 127, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3039", "paidOnly": false, "title": "Apply Operations to Make String Empty", "titleSlug": "apply-operations-to-make-string-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25734, "totalSubmissionRaw": 45356}, "3040": {"acRate": 33.298172785736156, "difficulty": "Medium", "likes": 150, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3040", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score II", "titleSlug": "maximum-number-of-operations-with-the-same-score-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19572, "totalSubmissionRaw": 58778}, "3041": {"acRate": 32.158930178732156, "difficulty": "Hard", "likes": 149, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3041", "paidOnly": false, "title": "Maximize Consecutive Elements in an Array After Modification", "titleSlug": "maximize-consecutive-elements-in-an-array-after-modification", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7503, "totalSubmissionRaw": 23331}, "3042": {"acRate": 65.24269138297501, "difficulty": "Easy", "likes": 100, "dislikes": 3, "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": 37447, "totalSubmissionRaw": 57396}, "3043": {"acRate": 34.899429152096594, "difficulty": "Medium", "likes": 161, "dislikes": 13, "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": 23354, "totalSubmissionRaw": 66918}, "3044": {"acRate": 48.23998228912995, "difficulty": "Medium", "likes": 86, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "3044", "paidOnly": false, "title": "Most Frequent Prime", "titleSlug": "most-frequent-prime", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15253, "totalSubmissionRaw": 31619}, "3045": {"acRate": 24.82843727425957, "difficulty": "Hard", "likes": 153, "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": 8249, "totalSubmissionRaw": 33224}, "3046": {"acRate": 58.563799921153546, "difficulty": "Easy", "likes": 102, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3046", "paidOnly": false, "title": "Split the Array", "titleSlug": "split-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49022, "totalSubmissionRaw": 83707}, "3047": {"acRate": 45.29836617348012, "difficulty": "Medium", "likes": 101, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3047", "paidOnly": false, "title": "Find the Largest Area of Square Inside Two Rectangles", "titleSlug": "find-the-largest-area-of-square-inside-two-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19380, "totalSubmissionRaw": 42782}, "3048": {"acRate": 35.91623496356134, "difficulty": "Medium", "likes": 172, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "3048", "paidOnly": false, "title": "Earliest Second to Mark Indices I", "titleSlug": "earliest-second-to-mark-indices-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8180, "totalSubmissionRaw": 22777}, "3049": {"acRate": 22.70479883664566, "difficulty": "Hard", "likes": 73, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3049", "paidOnly": false, "title": "Earliest Second to Mark Indices II", "titleSlug": "earliest-second-to-mark-indices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2342, "totalSubmissionRaw": 10315}, "3050": {"acRate": 68.50351161534306, "difficulty": "Medium", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3050", "paidOnly": true, "title": "Pizza Toppings Cost Analysis", "titleSlug": "pizza-toppings-cost-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1268, "totalSubmissionRaw": 1851}, "3051": {"acRate": 74.09972299168976, "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": 2140, "totalSubmissionRaw": 2888}, "3052": {"acRate": 73.48336594911937, "difficulty": "Hard", "likes": 4, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "3052", "paidOnly": true, "title": "Maximize Items", "titleSlug": "maximize-items", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 751, "totalSubmissionRaw": 1022}, "3053": {"acRate": 50.48882681564246, "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": 1446, "totalSubmissionRaw": 2864}, "3054": {"acRate": 79.33374460209747, "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": 1286, "totalSubmissionRaw": 1621}, "3055": {"acRate": 60.34658511722731, "difficulty": "Medium", "likes": 5, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3055", "paidOnly": true, "title": "Top Percentile Fraud", "titleSlug": "top-percentile-fraud", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1184, "totalSubmissionRaw": 1962}, "3056": {"acRate": 59.22705314009662, "difficulty": "Medium", "likes": 2, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3056", "paidOnly": true, "title": "Snaps Analysis", "titleSlug": "snaps-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1226, "totalSubmissionRaw": 2070}, "3057": {"acRate": 68.60043509789703, "difficulty": "Hard", "likes": 5, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3057", "paidOnly": true, "title": "Employees Project Allocation", "titleSlug": "employees-project-allocation", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 946, "totalSubmissionRaw": 1379}, "3058": {"acRate": 52.25269343780607, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3058", "paidOnly": true, "title": "Friends With No Mutual Friends", "titleSlug": "friends-with-no-mutual-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1067, "totalSubmissionRaw": 2042}, "3059": {"acRate": 67.4037674037674, "difficulty": "Easy", "likes": 6, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "3059", "paidOnly": true, "title": "Find All Unique Email Domains", "titleSlug": "find-all-unique-email-domains", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1646, "totalSubmissionRaw": 2442}, "3060": {"acRate": 40.50925925925926, "difficulty": "Hard", "likes": 3, "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": 875, "totalSubmissionRaw": 2160}, "3061": {"acRate": 77.77777777777779, "difficulty": "Hard", "likes": 8, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3061", "paidOnly": true, "title": "Calculate Trapping Rain Water", "titleSlug": "calculate-trapping-rain-water", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 602, "totalSubmissionRaw": 774}, "3062": {"acRate": 80.55922917060269, "difficulty": "Easy", "likes": 26, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3062", "paidOnly": true, "title": "Winner of the Linked List Game", "titleSlug": "winner-of-the-linked-list-game", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8528, "totalSubmissionRaw": 10586}, "3063": {"acRate": 86.10688389580163, "difficulty": "Easy", "likes": 37, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3063", "paidOnly": true, "title": "Linked List Frequency", "titleSlug": "linked-list-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9619, "totalSubmissionRaw": 11171}, "3064": {"acRate": 91.20879120879121, "difficulty": "Medium", "likes": 9, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3064", "paidOnly": true, "title": "Guess the Number Using Bitwise Questions I", "titleSlug": "guess-the-number-using-bitwise-questions-i", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1079, "totalSubmissionRaw": 1183}, "3065": {"acRate": 86.17173394959197, "difficulty": "Easy", "likes": 82, "dislikes": 5, "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": 59661, "totalSubmissionRaw": 69235}, "3066": {"acRate": 27.688188039274024, "difficulty": "Medium", "likes": 84, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3066", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value II", "titleSlug": "minimum-operations-to-exceed-threshold-value-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27918, "totalSubmissionRaw": 100830}, "3067": {"acRate": 57.80873421382435, "difficulty": "Medium", "likes": 186, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3067", "paidOnly": false, "title": "Count Pairs of Connectable Servers in a Weighted Tree Network", "titleSlug": "count-pairs-of-connectable-servers-in-a-weighted-tree-network", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11993, "totalSubmissionRaw": 20746}, "3068": {"acRate": 66.94235279595112, "difficulty": "Hard", "likes": 624, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "3068", "paidOnly": false, "title": "Find the Maximum Sum of Node Values", "titleSlug": "find-the-maximum-sum-of-node-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70499, "totalSubmissionRaw": 105313}, "3069": {"acRate": 72.65931665358227, "difficulty": "Easy", "likes": 74, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3069", "paidOnly": false, "title": "Distribute Elements Into Two Arrays I", "titleSlug": "distribute-elements-into-two-arrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42574, "totalSubmissionRaw": 58594}, "3070": {"acRate": 59.48895826107064, "difficulty": "Medium", "likes": 135, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3070", "paidOnly": false, "title": "Count Submatrices with Top-Left Element and Sum Less Than k", "titleSlug": "count-submatrices-with-top-left-element-and-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25726, "totalSubmissionRaw": 43245}, "3071": {"acRate": 62.83319835205465, "difficulty": "Medium", "likes": 90, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3071", "paidOnly": false, "title": "Minimum Operations to Write the Letter Y on a Grid", "titleSlug": "minimum-operations-to-write-the-letter-y-on-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17844, "totalSubmissionRaw": 28399}, "3072": {"acRate": 27.63334520450374, "difficulty": "Hard", "likes": 129, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3072", "paidOnly": false, "title": "Distribute Elements Into Two Arrays II", "titleSlug": "distribute-elements-into-two-arrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10087, "totalSubmissionRaw": 36503}, "3073": {"acRate": 41.38381201044387, "difficulty": "Medium", "likes": 12, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3073", "paidOnly": true, "title": "Maximum Increasing Triplet Value", "titleSlug": "maximum-increasing-triplet-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 634, "totalSubmissionRaw": 1532}, "3074": {"acRate": 66.97445144028732, "difficulty": "Easy", "likes": 86, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3074", "paidOnly": false, "title": "Apple Redistribution into Boxes", "titleSlug": "apple-redistribution-into-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46059, "totalSubmissionRaw": 68771}, "3075": {"acRate": 55.04122515767232, "difficulty": "Medium", "likes": 640, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "3075", "paidOnly": false, "title": "Maximize Happiness of Selected Children", "titleSlug": "maximize-happiness-of-selected-children", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173234, "totalSubmissionRaw": 314735}, "3076": {"acRate": 45.686139846332146, "difficulty": "Medium", "likes": 126, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3076", "paidOnly": false, "title": "Shortest Uncommon Substring in an Array", "titleSlug": "shortest-uncommon-substring-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21287, "totalSubmissionRaw": 46594}, "3077": {"acRate": 27.8627849243963, "difficulty": "Hard", "likes": 129, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "3077", "paidOnly": false, "title": "Maximum Strength of K Disjoint Subarrays", "titleSlug": "maximum-strength-of-k-disjoint-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6173, "totalSubmissionRaw": 22155}, "3078": {"acRate": 67.41889985895627, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3078", "paidOnly": true, "title": "Match Alphanumerical Pattern in Matrix I", "titleSlug": "match-alphanumerical-pattern-in-matrix-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 478, "totalSubmissionRaw": 709}, "3079": {"acRate": 74.40358959428679, "difficulty": "Easy", "likes": 93, "dislikes": 12, "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": 43443, "totalSubmissionRaw": 58389}, "3080": {"acRate": 49.27400982625642, "difficulty": "Medium", "likes": 111, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3080", "paidOnly": false, "title": "Mark Elements on Array by Performing Queries", "titleSlug": "mark-elements-on-array-by-performing-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17952, "totalSubmissionRaw": 36433}, "3081": {"acRate": 27.270280900039328, "difficulty": "Medium", "likes": 160, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3081", "paidOnly": false, "title": "Replace Question Marks in String to Minimize Its Value", "titleSlug": "replace-question-marks-in-string-to-minimize-its-value", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13174, "totalSubmissionRaw": 48309}, "3082": {"acRate": 38.886134523219305, "difficulty": "Hard", "likes": 132, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3082", "paidOnly": false, "title": "Find the Sum of the Power of All Subsequences", "titleSlug": "find-the-sum-of-the-power-of-all-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7059, "totalSubmissionRaw": 18153}, "3083": {"acRate": 66.1320998737124, "difficulty": "Easy", "likes": 87, "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": 43464, "totalSubmissionRaw": 65723}, "3084": {"acRate": 48.806204488238, "difficulty": "Medium", "likes": 106, "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": 36059, "totalSubmissionRaw": 73882}, "3085": {"acRate": 43.948107226951635, "difficulty": "Medium", "likes": 191, "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": 19411, "totalSubmissionRaw": 44168}, "3086": {"acRate": 22.716441620333597, "difficulty": "Hard", "likes": 50, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "3086", "paidOnly": false, "title": "Minimum Moves to Pick K Ones", "titleSlug": "minimum-moves-to-pick-k-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2860, "totalSubmissionRaw": 12590}, "3087": {"acRate": 64.05405405405405, "difficulty": "Medium", "likes": 5, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "3087", "paidOnly": true, "title": "Find Trending Hashtags", "titleSlug": "find-trending-hashtags", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 948, "totalSubmissionRaw": 1480}, "3088": {"acRate": 54.23497267759563, "difficulty": "Hard", "likes": 8, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3088", "paidOnly": true, "title": "Make String Anti-palindrome", "titleSlug": "make-string-anti-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 396, "totalSubmissionRaw": 731}, "3089": {"acRate": 40.647118301314464, "difficulty": "Medium", "likes": 7, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "3089", "paidOnly": true, "title": "Find Bursty Behavior", "titleSlug": "find-bursty-behavior", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 804, "totalSubmissionRaw": 1978}, "3090": {"acRate": 63.62699049146523, "difficulty": "Easy", "likes": 165, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3090", "paidOnly": false, "title": "Maximum Length Substring With Two Occurrences", "titleSlug": "maximum-length-substring-with-two-occurrences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38878, "totalSubmissionRaw": 61103}, "3091": {"acRate": 44.53119895459, "difficulty": "Medium", "likes": 156, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3091", "paidOnly": false, "title": "Apply Operations to Make Sum of Array Greater Than or Equal to k", "titleSlug": "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27262, "totalSubmissionRaw": 61220}, "3092": {"acRate": 42.576371159433045, "difficulty": "Medium", "likes": 221, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3092", "paidOnly": false, "title": "Most Frequent IDs", "titleSlug": "most-frequent-ids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19345, "totalSubmissionRaw": 45436}, "3093": {"acRate": 40.86306979255726, "difficulty": "Hard", "likes": 124, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3093", "paidOnly": false, "title": "Longest Common Suffix Queries", "titleSlug": "longest-common-suffix-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9081, "totalSubmissionRaw": 22223}, "3094": {"acRate": 80.82408874801902, "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": 510, "totalSubmissionRaw": 631}, "3095": {"acRate": 40.950722200534514, "difficulty": "Easy", "likes": 84, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3095", "paidOnly": false, "title": "Shortest Subarray With OR at Least K I", "titleSlug": "shortest-subarray-with-or-at-least-k-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27274, "totalSubmissionRaw": 66602}, "3096": {"acRate": 40.556816689492145, "difficulty": "Medium", "likes": 78, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3096", "paidOnly": false, "title": "Minimum Levels to Gain More Points", "titleSlug": "minimum-levels-to-gain-more-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21618, "totalSubmissionRaw": 53303}, "3097": {"acRate": 30.18401538039, "difficulty": "Medium", "likes": 185, "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": 13188, "totalSubmissionRaw": 43692}, "3098": {"acRate": 24.366064906605448, "difficulty": "Hard", "likes": 121, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3098", "paidOnly": false, "title": "Find the Sum of Subsequence Powers", "titleSlug": "find-the-sum-of-subsequence-powers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4670, "totalSubmissionRaw": 19166}, "3099": {"acRate": 83.01098427740685, "difficulty": "Easy", "likes": 119, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3099", "paidOnly": false, "title": "Harshad Number", "titleSlug": "harshad-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57813, "totalSubmissionRaw": 69645}, "3100": {"acRate": 63.71861905291652, "difficulty": "Medium", "likes": 136, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3100", "paidOnly": false, "title": "Water Bottles II", "titleSlug": "water-bottles-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34366, "totalSubmissionRaw": 53934}, "3101": {"acRate": 57.10033799122232, "difficulty": "Medium", "likes": 203, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3101", "paidOnly": false, "title": "Count Alternating Subarrays", "titleSlug": "count-alternating-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33957, "totalSubmissionRaw": 59469}, "3102": {"acRate": 32.392267576363565, "difficulty": "Hard", "likes": 158, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3102", "paidOnly": false, "title": "Minimize Manhattan Distances", "titleSlug": "minimize-manhattan-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8261, "totalSubmissionRaw": 25502}, "3103": {"acRate": 65.80645161290323, "difficulty": "Hard", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3103", "paidOnly": true, "title": "Find Trending Hashtags II ", "titleSlug": "find-trending-hashtags-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 510, "totalSubmissionRaw": 775}, "3104": {"acRate": 57.29665071770334, "difficulty": "Hard", "likes": 8, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3104", "paidOnly": true, "title": "Find Longest Self-Contained Substring", "titleSlug": "find-longest-self-contained-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 479, "totalSubmissionRaw": 836}, "3105": {"acRate": 56.945599495282615, "difficulty": "Easy", "likes": 108, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3105", "paidOnly": false, "title": "Longest Strictly Increasing or Strictly Decreasing Subarray", "titleSlug": "longest-strictly-increasing-or-strictly-decreasing-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39715, "totalSubmissionRaw": 69742}, "3106": {"acRate": 63.44563552833078, "difficulty": "Medium", "likes": 143, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3106", "paidOnly": false, "title": "Lexicographically Smallest String After Operations With Constraint", "titleSlug": "lexicographically-smallest-string-after-operations-with-constraint", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24858, "totalSubmissionRaw": 39180}, "3107": {"acRate": 48.480215646436406, "difficulty": "Medium", "likes": 129, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "3107", "paidOnly": false, "title": "Minimum Operations to Make Median of Array Equal to K", "titleSlug": "minimum-operations-to-make-median-of-array-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24100, "totalSubmissionRaw": 49711}, "3108": {"acRate": 45.67634463520999, "difficulty": "Hard", "likes": 175, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3108", "paidOnly": false, "title": "Minimum Cost Walk in Weighted Graph", "titleSlug": "minimum-cost-walk-in-weighted-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11626, "totalSubmissionRaw": 25453}, "3109": {"acRate": 41.340782122905026, "difficulty": "Medium", "likes": 10, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3109", "paidOnly": true, "title": "Find the Index of Permutation", "titleSlug": "find-the-index-of-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 370, "totalSubmissionRaw": 895}, "3110": {"acRate": 93.32882487200503, "difficulty": "Easy", "likes": 563, "dislikes": 35, "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": 253929, "totalSubmissionRaw": 272080}, "3111": {"acRate": 63.74705420267086, "difficulty": "Medium", "likes": 87, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3111", "paidOnly": false, "title": "Minimum Rectangles to Cover Points", "titleSlug": "minimum-rectangles-to-cover-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25968, "totalSubmissionRaw": 40736}, "3112": {"acRate": 34.57896229089878, "difficulty": "Medium", "likes": 150, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3112", "paidOnly": false, "title": "Minimum Time to Visit Disappearing Nodes", "titleSlug": "minimum-time-to-visit-disappearing-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18294, "totalSubmissionRaw": 52905}, "3113": {"acRate": 29.75816240779358, "difficulty": "Hard", "likes": 199, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3113", "paidOnly": false, "title": "Find the Number of Subarrays Where Boundary Elements Are Maximum", "titleSlug": "find-the-number-of-subarrays-where-boundary-elements-are-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9561, "totalSubmissionRaw": 32129}, "3114": {"acRate": 35.538725964120744, "difficulty": "Easy", "likes": 91, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3114", "paidOnly": false, "title": "Latest Time You Can Obtain After Replacing Characters", "titleSlug": "latest-time-you-can-obtain-after-replacing-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33083, "totalSubmissionRaw": 93089}, "3115": {"acRate": 58.27405696689761, "difficulty": "Medium", "likes": 101, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3115", "paidOnly": false, "title": "Maximum Prime Difference", "titleSlug": "maximum-prime-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37849, "totalSubmissionRaw": 64950}, "3116": {"acRate": 16.37734920992765, "difficulty": "Hard", "likes": 209, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3116", "paidOnly": false, "title": "Kth Smallest Amount With Single Denomination Combination", "titleSlug": "kth-smallest-amount-with-single-denomination-combination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7991, "totalSubmissionRaw": 48793}, "3117": {"acRate": 27.54789502132004, "difficulty": "Hard", "likes": 107, "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": 4587, "totalSubmissionRaw": 16651}, "3118": {"acRate": 62.25000000000001, "difficulty": "Medium", "likes": 3, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3118", "paidOnly": true, "title": "Friday Purchase III ", "titleSlug": "friday-purchase-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 747, "totalSubmissionRaw": 1200}, "3119": {"acRate": 60.55806938159879, "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": 803, "totalSubmissionRaw": 1326}, "3120": {"acRate": 65.46106174867468, "difficulty": "Easy", "likes": 120, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3120", "paidOnly": false, "title": "Count the Number of Special Characters I", "titleSlug": "count-the-number-of-special-characters-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43836, "totalSubmissionRaw": 66965}, "3121": {"acRate": 41.37180777285213, "difficulty": "Medium", "likes": 139, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3121", "paidOnly": false, "title": "Count the Number of Special Characters II", "titleSlug": "count-the-number-of-special-characters-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30424, "totalSubmissionRaw": 73538}, "3122": {"acRate": 41.12173762747018, "difficulty": "Medium", "likes": 209, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3122", "paidOnly": false, "title": "Minimum Number of Operations to Satisfy Conditions", "titleSlug": "minimum-number-of-operations-to-satisfy-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14275, "totalSubmissionRaw": 34714}, "3123": {"acRate": 48.79481900840624, "difficulty": "Hard", "likes": 218, "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": 11377, "totalSubmissionRaw": 23316}, "3124": {"acRate": 71.78456591639872, "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": 893, "totalSubmissionRaw": 1244}, "3125": {"acRate": 68.84480746791132, "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": 589, "totalSubmissionRaw": 856}, "3126": {"acRate": 55.925925925925924, "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": 906, "totalSubmissionRaw": 1620}, "3127": {"acRate": 51.01920536530841, "difficulty": "Easy", "likes": 66, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3127", "paidOnly": false, "title": "Make a Square with the Same Color", "titleSlug": "make-a-square-with-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25104, "totalSubmissionRaw": 49205}, "3128": {"acRate": 47.425768138394005, "difficulty": "Medium", "likes": 100, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3128", "paidOnly": false, "title": "Right Triangles", "titleSlug": "right-triangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18368, "totalSubmissionRaw": 38730}, "3129": {"acRate": 26.927314732539543, "difficulty": "Medium", "likes": 112, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "3129", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays I", "titleSlug": "find-all-possible-stable-binary-arrays-i", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7576, "totalSubmissionRaw": 28135}, "3130": {"acRate": 28.09345255263917, "difficulty": "Hard", "likes": 58, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3130", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays II", "titleSlug": "find-all-possible-stable-binary-arrays-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2922, "totalSubmissionRaw": 10401}, "3131": {"acRate": 82.0819483706626, "difficulty": "Easy", "likes": 113, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3131", "paidOnly": false, "title": "Find the Integer Added to Array I", "titleSlug": "find-the-integer-added-to-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52844, "totalSubmissionRaw": 64380}, "3132": {"acRate": 31.05573498474029, "difficulty": "Medium", "likes": 148, "dislikes": 35, "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": 20961, "totalSubmissionRaw": 67497}, "3133": {"acRate": 37.844388110427055, "difficulty": "Medium", "likes": 194, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3133", "paidOnly": false, "title": "Minimum Array End", "titleSlug": "minimum-array-end", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13585, "totalSubmissionRaw": 35897}, "3134": {"acRate": 28.21067458121636, "difficulty": "Hard", "likes": 137, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3134", "paidOnly": false, "title": "Find the Median of the Uniqueness Array", "titleSlug": "find-the-median-of-the-uniqueness-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5608, "totalSubmissionRaw": 19879}, "3135": {"acRate": 56.49999999999999, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3135", "paidOnly": true, "title": "Equalize Strings by Adding or Removing Characters at Ends", "titleSlug": "equalize-strings-by-adding-or-removing-characters-at-ends", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 565, "totalSubmissionRaw": 1000}, "3136": {"acRate": 37.52067824648469, "difficulty": "Easy", "likes": 98, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "3136", "paidOnly": false, "title": "Valid Word", "titleSlug": "valid-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39919, "totalSubmissionRaw": 106392}, "3137": {"acRate": 62.51848721740968, "difficulty": "Medium", "likes": 111, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3137", "paidOnly": false, "title": "Minimum Number of Operations to Make Word K-Periodic", "titleSlug": "minimum-number-of-operations-to-make-word-k-periodic", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23672, "totalSubmissionRaw": 37864}, "3138": {"acRate": 41.99110377401752, "difficulty": "Medium", "likes": 165, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "3138", "paidOnly": false, "title": "Minimum Length of Anagram Concatenation", "titleSlug": "minimum-length-of-anagram-concatenation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27471, "totalSubmissionRaw": 65421}, "3139": {"acRate": 16.467913692019305, "difficulty": "Hard", "likes": 116, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3139", "paidOnly": false, "title": "Minimum Cost to Equalize Array", "titleSlug": "minimum-cost-to-equalize-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4129, "totalSubmissionRaw": 25073}, "3140": {"acRate": 63.891178895300904, "difficulty": "Medium", "likes": 3, "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": 775, "totalSubmissionRaw": 1213}, "3141": {"acRate": 72.23198594024605, "difficulty": "Hard", "likes": 11, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3141", "paidOnly": true, "title": "Maximum Hamming Distances", "titleSlug": "maximum-hamming-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 411, "totalSubmissionRaw": 569}, "3142": {"acRate": 42.97524071526823, "difficulty": "Easy", "likes": 61, "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": 31243, "totalSubmissionRaw": 72700}, "3143": {"acRate": 38.77319897381376, "difficulty": "Medium", "likes": 142, "dislikes": 19, "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": 16776, "totalSubmissionRaw": 43267}, "3144": {"acRate": 40.70637718809921, "difficulty": "Medium", "likes": 129, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "3144", "paidOnly": false, "title": "Minimum Substring Partition of Equal Character Frequency", "titleSlug": "minimum-substring-partition-of-equal-character-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13162, "totalSubmissionRaw": 32334}, "3145": {"acRate": 24.453748528064896, "difficulty": "Hard", "likes": 53, "dislikes": 13, "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": 1869, "totalSubmissionRaw": 7643}, "3146": {"acRate": 89.00809492126858, "difficulty": "Easy", "likes": 111, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3146", "paidOnly": false, "title": "Permutation Difference between Two Strings", "titleSlug": "permutation-difference-between-two-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64214, "totalSubmissionRaw": 72144}, "3147": {"acRate": 40.432446120083284, "difficulty": "Medium", "likes": 146, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3147", "paidOnly": false, "title": "Taking Maximum Energy From the Mystic Dungeon", "titleSlug": "taking-maximum-energy-from-the-mystic-dungeon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28741, "totalSubmissionRaw": 71084}, "3148": {"acRate": 47.78481012658228, "difficulty": "Medium", "likes": 218, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3148", "paidOnly": false, "title": "Maximum Difference Score in a Grid", "titleSlug": "maximum-difference-score-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17214, "totalSubmissionRaw": 36024}, "3149": {"acRate": 22.639718608676233, "difficulty": "Hard", "likes": 101, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3149", "paidOnly": false, "title": "Find the Minimum Cost Array Permutation", "titleSlug": "find-the-minimum-cost-array-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4055, "totalSubmissionRaw": 17911}, "3150": {"acRate": 87.12574850299401, "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": 1164, "totalSubmissionRaw": 1336}, "3151": {"acRate": 75.61079156395508, "difficulty": "Easy", "likes": 86, "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": 55211, "totalSubmissionRaw": 73020}, "3152": {"acRate": 29.870257326240996, "difficulty": "Medium", "likes": 175, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3152", "paidOnly": false, "title": "Special Array II", "titleSlug": "special-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30436, "totalSubmissionRaw": 101893}, "3153": {"acRate": 43.73714659132407, "difficulty": "Medium", "likes": 165, "dislikes": 16, "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": 22756, "totalSubmissionRaw": 52029}, "3154": {"acRate": 36.264070581076965, "difficulty": "Hard", "likes": 124, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3154", "paidOnly": false, "title": "Find Number of Ways to Reach the K-th Stair", "titleSlug": "find-number-of-ways-to-reach-the-k-th-stair", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10728, "totalSubmissionRaw": 29583}, "3155": {"acRate": 52.13235294117647, "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": 709, "totalSubmissionRaw": 1360}, "3156": {"acRate": 56.9060773480663, "difficulty": "Hard", "likes": 6, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3156", "paidOnly": true, "title": "Employee Task Duration and Concurrent Tasks", "titleSlug": "employee-task-duration-and-concurrent-tasks", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 412, "totalSubmissionRaw": 724}, "3157": {"acRate": 68.9700996677741, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3157", "paidOnly": true, "title": "Find the Level of Tree with Minimum Sum", "titleSlug": "find-the-level-of-tree-with-minimum-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1038, "totalSubmissionRaw": 1505}, "3158": {"acRate": 82.03453015269332, "difficulty": "Easy", "likes": 87, "dislikes": 7, "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": 43571, "totalSubmissionRaw": 53113}, "3159": {"acRate": 73.62725364153843, "difficulty": "Medium", "likes": 107, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3159", "paidOnly": false, "title": "Find Occurrences of an Element in an Array", "titleSlug": "find-occurrences-of-an-element-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34018, "totalSubmissionRaw": 46203}, "3160": {"acRate": 41.06295476115153, "difficulty": "Medium", "likes": 106, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3160", "paidOnly": false, "title": "Find the Number of Distinct Colors Among the Balls", "titleSlug": "find-the-number-of-distinct-colors-among-the-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23364, "totalSubmissionRaw": 56898}, "3161": {"acRate": 13.469972254542201, "difficulty": "Hard", "likes": 94, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3161", "paidOnly": false, "title": "Block Placement Queries", "titleSlug": "block-placement-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4515, "totalSubmissionRaw": 33519}, "3162": {"acRate": 86.64892921010163, "difficulty": "Easy", "likes": 93, "dislikes": 7, "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": 59598, "totalSubmissionRaw": 68781}, "3163": {"acRate": 55.80248329653313, "difficulty": "Medium", "likes": 104, "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": 38920, "totalSubmissionRaw": 69746}, "3164": {"acRate": 25.586042256039203, "difficulty": "Medium", "likes": 199, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "3164", "paidOnly": false, "title": "Find the Number of Good Pairs II", "titleSlug": "find-the-number-of-good-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24329, "totalSubmissionRaw": 95087}, "3165": {"acRate": 17.126618442647864, "difficulty": "Hard", "likes": 101, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3165", "paidOnly": false, "title": "Maximum Sum of Subsequence With Non-adjacent Elements", "titleSlug": "maximum-sum-of-subsequence-with-non-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5635, "totalSubmissionRaw": 32902}, "3166": {"acRate": 61.69858451290591, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3166", "paidOnly": true, "title": "Calculate Parking Fees and Duration", "titleSlug": "calculate-parking-fees-and-duration", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 741, "totalSubmissionRaw": 1201}, "3167": {"acRate": 79.57422324510932, "difficulty": "Medium", "likes": 9, "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": 1383, "totalSubmissionRaw": 1738}, "3168": {"acRate": 80.2884386552222, "difficulty": "Easy", "likes": 105, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3168", "paidOnly": false, "title": "Minimum Number of Chairs in a Waiting Room", "titleSlug": "minimum-number-of-chairs-in-a-waiting-room", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50605, "totalSubmissionRaw": 63029}, "3169": {"acRate": 33.57961481697429, "difficulty": "Medium", "likes": 189, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3169", "paidOnly": false, "title": "Count Days Without Meetings", "titleSlug": "count-days-without-meetings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36856, "totalSubmissionRaw": 109763}, "3170": {"acRate": 35.81922504781469, "difficulty": "Medium", "likes": 188, "dislikes": 24, "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": 25283, "totalSubmissionRaw": 70583}, "3171": {"acRate": 31.134047902606852, "difficulty": "Hard", "likes": 161, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3171", "paidOnly": false, "title": "Find Subarray With Bitwise OR Closest to K", "titleSlug": "find-subarray-with-bitwise-or-closest-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11764, "totalSubmissionRaw": 37785}, "3172": {"acRate": 73.10725552050474, "difficulty": "Easy", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3172", "paidOnly": true, "title": "Second Day Verification", "titleSlug": "second-day-verification", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 927, "totalSubmissionRaw": 1268}, "3173": {"acRate": 95.47169811320755, "difficulty": "Easy", "likes": 8, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3173", "paidOnly": true, "title": "Bitwise OR of Adjacent Elements", "titleSlug": "bitwise-or-of-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1771, "totalSubmissionRaw": 1855}, "3174": {"acRate": 72.3475643216632, "difficulty": "Easy", "likes": 69, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3174", "paidOnly": false, "title": "Clear Digits", "titleSlug": "clear-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46143, "totalSubmissionRaw": 63780}, "3175": {"acRate": 39.36596116479533, "difficulty": "Medium", "likes": 112, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3175", "paidOnly": false, "title": "Find The First Player to win K Games in a Row", "titleSlug": "find-the-first-player-to-win-k-games-in-a-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30187, "totalSubmissionRaw": 76683}, "3176": {"acRate": 30.199939787840684, "difficulty": "Medium", "likes": 123, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "3176", "paidOnly": false, "title": "Find the Maximum Length of a Good Subsequence I", "titleSlug": "find-the-maximum-length-of-a-good-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17053, "totalSubmissionRaw": 56467}, "3177": {"acRate": 23.836147877681423, "difficulty": "Hard", "likes": 96, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3177", "paidOnly": false, "title": "Find the Maximum Length of a Good Subsequence II", "titleSlug": "find-the-maximum-length-of-a-good-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6267, "totalSubmissionRaw": 26292}, "3178": {"acRate": 61.8619622925463, "difficulty": "Easy", "likes": 127, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3178", "paidOnly": false, "title": "Find the Child Who Has the Ball After K Seconds", "titleSlug": "find-the-child-who-has-the-ball-after-k-seconds", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44394, "totalSubmissionRaw": 71763}, "3179": {"acRate": 54.60795132571804, "difficulty": "Medium", "likes": 93, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3179", "paidOnly": false, "title": "Find the N-th Value After K Seconds", "titleSlug": "find-the-n-th-value-after-k-seconds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36618, "totalSubmissionRaw": 67054}, "3180": {"acRate": 29.247523811785943, "difficulty": "Medium", "likes": 160, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3180", "paidOnly": false, "title": "Maximum Total Reward Using Operations I", "titleSlug": "maximum-total-reward-using-operations-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24626, "totalSubmissionRaw": 84201}, "3181": {"acRate": 20.56260162601626, "difficulty": "Hard", "likes": 108, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "3181", "paidOnly": false, "title": "Maximum Total Reward Using Operations II", "titleSlug": "maximum-total-reward-using-operations-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6323, "totalSubmissionRaw": 30750}, "3182": {"acRate": 55.55555555555556, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3182", "paidOnly": true, "title": "Find Top Scoring Students", "titleSlug": "find-top-scoring-students", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 740, "totalSubmissionRaw": 1332}, "3183": {"acRate": 58.82352941176471, "difficulty": "Medium", "likes": 11, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3183", "paidOnly": true, "title": "The Number of Ways to Make the Sum", "titleSlug": "the-number-of-ways-to-make-the-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 700, "totalSubmissionRaw": 1190}, "3184": {"acRate": 79.13966695828823, "difficulty": "Easy", "likes": 95, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3184", "paidOnly": false, "title": "Count Pairs That Form a Complete Day I", "titleSlug": "count-pairs-that-form-a-complete-day-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53371, "totalSubmissionRaw": 67439}, "3185": {"acRate": 42.87708269222315, "difficulty": "Medium", "likes": 143, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3185", "paidOnly": false, "title": "Count Pairs That Form a Complete Day II", "titleSlug": "count-pairs-that-form-a-complete-day-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39013, "totalSubmissionRaw": 90988}, "3186": {"acRate": 25.933364290689575, "difficulty": "Medium", "likes": 217, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3186", "paidOnly": false, "title": "Maximum Total Damage With Spell Casting", "titleSlug": "maximum-total-damage-with-spell-casting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22339, "totalSubmissionRaw": 86140}, "3187": {"acRate": 26.69676214196762, "difficulty": "Hard", "likes": 107, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3187", "paidOnly": false, "title": "Peaks in Array", "titleSlug": "peaks-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8575, "totalSubmissionRaw": 32120}, "3188": {"acRate": 49.93662864385298, "difficulty": "Hard", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3188", "paidOnly": true, "title": "Find Top Scoring Students II", "titleSlug": "find-top-scoring-students-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 394, "totalSubmissionRaw": 789}, "3189": {"acRate": 74.1042345276873, "difficulty": "Medium", "likes": 16, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3189", "paidOnly": true, "title": "Minimum Moves to Get a Peaceful Board", "titleSlug": "minimum-moves-to-get-a-peaceful-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 455, "totalSubmissionRaw": 614}, "3190": {"acRate": 89.69485680011996, "difficulty": "Easy", "likes": 103, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3190", "paidOnly": false, "title": "Find Minimum Operations to Make All Elements Divisible by Three", "titleSlug": "find-minimum-operations-to-make-all-elements-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71780, "totalSubmissionRaw": 80026}, "3191": {"acRate": 70.73686684686803, "difficulty": "Medium", "likes": 135, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3191", "paidOnly": false, "title": "Minimum Operations to Make Binary Array Elements Equal to One I", "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42133, "totalSubmissionRaw": 59563}, "3192": {"acRate": 64.95611849921434, "difficulty": "Medium", "likes": 113, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3192", "paidOnly": false, "title": "Minimum Operations to Make Binary Array Elements Equal to One II", "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33898, "totalSubmissionRaw": 52186}, "3193": {"acRate": 33.25165139569572, "difficulty": "Hard", "likes": 87, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3193", "paidOnly": false, "title": "Count the Number of Inversions", "titleSlug": "count-the-number-of-inversions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6242, "totalSubmissionRaw": 18772}, "3194": {"acRate": 85.06451002923679, "difficulty": "Easy", "likes": 93, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3194", "paidOnly": false, "title": "Minimum Average of Smallest and Largest Elements", "titleSlug": "minimum-average-of-smallest-and-largest-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58481, "totalSubmissionRaw": 68749}, "3195": {"acRate": 74.01143946615825, "difficulty": "Medium", "likes": 97, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3195", "paidOnly": false, "title": "Find the Minimum Area to Cover All Ones I", "titleSlug": "find-the-minimum-area-to-cover-all-ones-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38819, "totalSubmissionRaw": 52450}, "3196": {"acRate": 28.30587009568722, "difficulty": "Medium", "likes": 155, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3196", "paidOnly": false, "title": "Maximize Total Cost of Alternating Subarrays", "titleSlug": "maximize-total-cost-of-alternating-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20648, "totalSubmissionRaw": 72946}, "3197": {"acRate": 36.6453729281768, "difficulty": "Hard", "likes": 64, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3197", "paidOnly": false, "title": "Find the Minimum Area to Cover All Ones II", "titleSlug": "find-the-minimum-area-to-cover-all-ones-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4245, "totalSubmissionRaw": 11584}, "3198": {"acRate": 81.02345415778251, "difficulty": "Easy", "likes": 4, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3198", "paidOnly": true, "title": "Find Cities in Each State", "titleSlug": "find-cities-in-each-state", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 760, "totalSubmissionRaw": 938}, "3199": {"acRate": 84.9478390461997, "difficulty": "Easy", "likes": 7, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3199", "paidOnly": true, "title": "Count Triplets with Even XOR Set Bits I", "titleSlug": "count-triplets-with-even-xor-set-bits-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 570, "totalSubmissionRaw": 671}, "3200": {"acRate": 42.24752120710731, "difficulty": "Easy", "likes": 118, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3200", "paidOnly": false, "title": "Maximum Height of a Triangle", "titleSlug": "maximum-height-of-a-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34215, "totalSubmissionRaw": 80987}, "3201": {"acRate": 37.31028151774785, "difficulty": "Medium", "likes": 120, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3201", "paidOnly": false, "title": "Find the Maximum Length of Valid Subsequence I", "titleSlug": "find-the-maximum-length-of-valid-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24386, "totalSubmissionRaw": 65360}, "3202": {"acRate": 38.830569999018934, "difficulty": "Medium", "likes": 171, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3202", "paidOnly": false, "title": "Find the Maximum Length of Valid Subsequence II", "titleSlug": "find-the-maximum-length-of-valid-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15831, "totalSubmissionRaw": 40771}, "3203": {"acRate": 35.48289695035155, "difficulty": "Hard", "likes": 124, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3203", "paidOnly": false, "title": "Find Minimum Diameter After Merging Two Trees", "titleSlug": "find-minimum-diameter-after-merging-two-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8226, "totalSubmissionRaw": 23183}, "3204": {"acRate": 95.66265060240964, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3204", "paidOnly": true, "title": "Bitwise User Permissions Analysis", "titleSlug": "bitwise-user-permissions-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 397, "totalSubmissionRaw": 415}, "3205": {"acRate": 80.22199798183652, "difficulty": "Medium", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3205", "paidOnly": true, "title": "Maximum Array Hopping Score I", "titleSlug": "maximum-array-hopping-score-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 795, "totalSubmissionRaw": 991}, "3206": {"acRate": 66.63651694005826, "difficulty": "Easy", "likes": 77, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3206", "paidOnly": false, "title": "Alternating Groups I", "titleSlug": "alternating-groups-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43467, "totalSubmissionRaw": 65230}, "3207": {"acRate": 31.59078928759691, "difficulty": "Medium", "likes": 89, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "3207", "paidOnly": false, "title": "Maximum Points After Enemy Battles", "titleSlug": "maximum-points-after-enemy-battles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24571, "totalSubmissionRaw": 77779}, "3208": {"acRate": 39.98072867427823, "difficulty": "Medium", "likes": 132, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3208", "paidOnly": false, "title": "Alternating Groups II", "titleSlug": "alternating-groups-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21991, "totalSubmissionRaw": 55004}, "3209": {"acRate": 33.97855769544106, "difficulty": "Hard", "likes": 133, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3209", "paidOnly": false, "title": "Number of Subarrays With AND Value of K", "titleSlug": "number-of-subarrays-with-and-value-of-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10427, "totalSubmissionRaw": 30687}, "3210": {"acRate": 69.36307519640853, "difficulty": "Easy", "likes": 71, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3210", "paidOnly": false, "title": "Find the Encrypted String", "titleSlug": "find-the-encrypted-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49441, "totalSubmissionRaw": 71279}, "3211": {"acRate": 86.23496029738469, "difficulty": "Medium", "likes": 122, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3211", "paidOnly": false, "title": "Generate Binary Strings Without Adjacent Zeros", "titleSlug": "generate-binary-strings-without-adjacent-zeros", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39205, "totalSubmissionRaw": 45463}, "3212": {"acRate": 51.597028566072225, "difficulty": "Medium", "likes": 127, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3212", "paidOnly": false, "title": "Count Submatrices With Equal Frequency of X and Y", "titleSlug": "count-submatrices-with-equal-frequency-of-x-and-y", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22018, "totalSubmissionRaw": 42673}, "3213": {"acRate": 20.526706231454007, "difficulty": "Hard", "likes": 135, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "3213", "paidOnly": false, "title": "Construct String with Minimum Cost", "titleSlug": "construct-string-with-minimum-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11068, "totalSubmissionRaw": 53919}, "3214": {"acRate": 57.22627737226277, "difficulty": "Hard", "likes": 1, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3214", "paidOnly": true, "title": "Year on Year Growth Rate", "titleSlug": "year-on-year-growth-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 392, "totalSubmissionRaw": 685}, "3215": {"acRate": 73.8562091503268, "difficulty": "Medium", "likes": 12, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3215", "paidOnly": true, "title": "Count Triplets with Even XOR Set Bits II", "titleSlug": "count-triplets-with-even-xor-set-bits-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 339, "totalSubmissionRaw": 459}, "3216": {"acRate": 53.218895002408786, "difficulty": "Easy", "likes": 70, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3216", "paidOnly": false, "title": "Lexicographically Smallest String After a Swap", "titleSlug": "lexicographically-smallest-string-after-a-swap", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41977, "totalSubmissionRaw": 78876}, "3217": {"acRate": 61.38239339752407, "difficulty": "Medium", "likes": 108, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3217", "paidOnly": false, "title": "Delete Nodes From Linked List Present in Array", "titleSlug": "delete-nodes-from-linked-list-present-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39270, "totalSubmissionRaw": 63976}, "3218": {"acRate": 57.68279759802189, "difficulty": "Medium", "likes": 145, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3218", "paidOnly": false, "title": "Minimum Cost for Cutting Cake I", "titleSlug": "minimum-cost-for-cutting-cake-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24495, "totalSubmissionRaw": 42465}, "3219": {"acRate": 55.8653160222571, "difficulty": "Hard", "likes": 92, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3219", "paidOnly": false, "title": "Minimum Cost for Cutting Cake II", "titleSlug": "minimum-cost-for-cutting-cake-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19578, "totalSubmissionRaw": 35045}, "3220": {"acRate": 71.74887892376681, "difficulty": "Medium", "likes": 17, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3220", "paidOnly": false, "title": "Odd and Even Transactions", "titleSlug": "odd-and-even-transactions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2560, "totalSubmissionRaw": 3568}, "3221": {"acRate": 68.58316221765914, "difficulty": "Medium", "likes": 12, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3221", "paidOnly": true, "title": "Maximum Array Hopping Score II", "titleSlug": "maximum-array-hopping-score-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 334, "totalSubmissionRaw": 487}, "3222": {"acRate": 50.63670194208629, "difficulty": "Easy", "likes": 75, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3222", "paidOnly": false, "title": "Find the Winning Player in Coin Game", "titleSlug": "find-the-winning-player-in-coin-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34834, "totalSubmissionRaw": 68792}, "3223": {"acRate": 54.34586827306022, "difficulty": "Medium", "likes": 83, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3223", "paidOnly": false, "title": "Minimum Length of String After Operations", "titleSlug": "minimum-length-of-string-after-operations", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27155, "totalSubmissionRaw": 49967}, "3224": {"acRate": 22.482955752554222, "difficulty": "Medium", "likes": 183, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3224", "paidOnly": false, "title": "Minimum Array Changes to Make Differences Equal", "titleSlug": "minimum-array-changes-to-make-differences-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11641, "totalSubmissionRaw": 51777}, "3225": {"acRate": 24.989630858564908, "difficulty": "Hard", "likes": 49, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3225", "paidOnly": false, "title": "Maximum Score From Grid Operations", "titleSlug": "maximum-score-from-grid-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1205, "totalSubmissionRaw": 4822}, "3226": {"acRate": 64.14781397200292, "difficulty": "Easy", "likes": 73, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3226", "paidOnly": false, "title": "Number of Bit Changes to Make Two Integers Equal", "titleSlug": "number-of-bit-changes-to-make-two-integers-equal", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38676, "totalSubmissionRaw": 60292}, "3227": {"acRate": 61.95964376682262, "difficulty": "Medium", "likes": 114, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3227", "paidOnly": false, "title": "Vowels Game in a String", "titleSlug": "vowels-game-in-a-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34299, "totalSubmissionRaw": 55357}, "3228": {"acRate": 53.413892175088726, "difficulty": "Medium", "likes": 139, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3228", "paidOnly": false, "title": "Maximum Number of Operations to Move Ones to the End", "titleSlug": "maximum-number-of-operations-to-move-ones-to-the-end", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25284, "totalSubmissionRaw": 47336}, "3229": {"acRate": 37.35926601256114, "difficulty": "Hard", "likes": 173, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3229", "paidOnly": false, "title": "Minimum Operations to Make Array Equal to Target", "titleSlug": "minimum-operations-to-make-array-equal-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12908, "totalSubmissionRaw": 34551}, "3230": {"acRate": 45.83333333333333, "difficulty": "Medium", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3230", "paidOnly": true, "title": "Customer Purchasing Behavior Analysis", "titleSlug": "customer-purchasing-behavior-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 396, "totalSubmissionRaw": 864}, "3231": {"acRate": 57.14285714285714, "difficulty": "Hard", "likes": 5, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3231", "paidOnly": true, "title": "Minimum Number of Increasing Subsequence to Be Removed", "titleSlug": "minimum-number-of-increasing-subsequence-to-be-removed", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 224, "totalSubmissionRaw": 392}, "3232": {"acRate": 83.06372430666215, "difficulty": "Easy", "likes": 76, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3232", "paidOnly": false, "title": "Find if Digit Game Can Be Won", "titleSlug": "find-if-digit-game-can-be-won", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51605, "totalSubmissionRaw": 62127}, "3233": {"acRate": 26.399163508038164, "difficulty": "Medium", "likes": 148, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3233", "paidOnly": false, "title": "Find the Count of Numbers Which Are Not Special", "titleSlug": "find-the-count-of-numbers-which-are-not-special", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30297, "totalSubmissionRaw": 114765}, "3234": {"acRate": 14.165634186040862, "difficulty": "Medium", "likes": 192, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3234", "paidOnly": false, "title": "Count the Number of Substrings With Dominant Ones", "titleSlug": "count-the-number-of-substrings-with-dominant-ones", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5831, "totalSubmissionRaw": 41163}, "3235": {"acRate": 29.76978710400326, "difficulty": "Hard", "likes": 87, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3235", "paidOnly": false, "title": "Check if the Rectangle Corner Is Reachable", "titleSlug": "check-if-the-rectangle-corner-is-reachable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5845, "totalSubmissionRaw": 19634}, "3236": {"acRate": 80.76923076923077, "difficulty": "Hard", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3236", "paidOnly": true, "title": "CEO Subordinate Hierarchy", "titleSlug": "ceo-subordinate-hierarchy", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 210, "totalSubmissionRaw": 260}, "3237": {"acRate": 82.53275109170306, "difficulty": "Medium", "likes": 11, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3237", "paidOnly": true, "title": "Alt and Tab Simulation", "titleSlug": "alt-and-tab-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 378, "totalSubmissionRaw": 458}, "3238": {"acRate": 60.715433222662526, "difficulty": "Easy", "likes": 48, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3238", "paidOnly": false, "title": "Find the Number of Winning Players", "titleSlug": "find-the-number-of-winning-players", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34014, "totalSubmissionRaw": 56022}, "3239": {"acRate": 77.93852690456342, "difficulty": "Medium", "likes": 44, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3239", "paidOnly": false, "title": "Minimum Number of Flips to Make Binary Grid Palindromic I", "titleSlug": "minimum-number-of-flips-to-make-binary-grid-palindromic-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28982, "totalSubmissionRaw": 37186}, "3240": {"acRate": 21.470324924956554, "difficulty": "Medium", "likes": 93, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "3240", "paidOnly": false, "title": "Minimum Number of Flips to Make Binary Grid Palindromic II", "titleSlug": "minimum-number-of-flips-to-make-binary-grid-palindromic-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8154, "totalSubmissionRaw": 37978}, "3241": {"acRate": 18.933615285854543, "difficulty": "Hard", "likes": 46, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3241", "paidOnly": false, "title": "Time Taken to Mark All Nodes", "titleSlug": "time-taken-to-mark-all-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2507, "totalSubmissionRaw": 13241}, "3242": {"acRate": 84.20991926182238, "difficulty": "Easy", "likes": 53, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3242", "paidOnly": false, "title": "Design Neighbor Sum Service", "titleSlug": "design-neighbor-sum-service", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29204, "totalSubmissionRaw": 34680}, "3243": {"acRate": 47.020809099134034, "difficulty": "Medium", "likes": 64, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3243", "paidOnly": false, "title": "Shortest Distance After Road Addition Queries I", "titleSlug": "shortest-distance-after-road-addition-queries-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21823, "totalSubmissionRaw": 46414}, "3244": {"acRate": 20.748927252769185, "difficulty": "Hard", "likes": 109, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3244", "paidOnly": false, "title": "Shortest Distance After Road Addition Queries II", "titleSlug": "shortest-distance-after-road-addition-queries-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8317, "totalSubmissionRaw": 40084}, "3245": {"acRate": 11.30187914019197, "difficulty": "Hard", "likes": 35, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3245", "paidOnly": false, "title": "Alternating Groups III", "titleSlug": "alternating-groups-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 836, "totalSubmissionRaw": 7397}, "3246": {"acRate": 91.74917491749174, "difficulty": "Easy", "likes": 4, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3246", "paidOnly": true, "title": "Premier League Table Ranking", "titleSlug": "premier-league-table-ranking", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 276, "totalSubmissionRaw": 301}, "3247": {"acRate": 65.64885496183206, "difficulty": "Medium", "likes": 1, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3247", "paidOnly": true, "title": "Number of Subsequences with Odd Sum", "titleSlug": "number-of-subsequences-with-odd-sum", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 172, "totalSubmissionRaw": 262}}
\ No newline at end of file