From 89209e6007a8231737eeb0b83b3aa454ed71d9e2 Mon Sep 17 00:00:00 2001
From: bunnyxt-ci <bunnyxt-ci@users.noreply.github.com>
Date: Wed, 4 Sep 2024 00:10:11 +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 d1c6d74..8492599 100644
--- a/problems_all.json
+++ b/problems_all.json
@@ -1 +1 @@
-{"1": {"acRate": 53.586461024827116, "difficulty": "Easy", "likes": 57845, "dislikes": 2037, "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": 14351668, "totalSubmissionRaw": 26782261}, "2": {"acRate": 43.92505624894107, "difficulty": "Medium", "likes": 31548, "dislikes": 6319, "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": 4912861, "totalSubmissionRaw": 11184648}, "3": {"acRate": 35.34369095362886, "difficulty": "Medium", "likes": 40077, "dislikes": 1920, "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": 6233204, "totalSubmissionRaw": 17635972}, "4": {"acRate": 41.259323515580995, "difficulty": "Hard", "likes": 28603, "dislikes": 3201, "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": 2819071, "totalSubmissionRaw": 6832573}, "5": {"acRate": 34.34705948437012, "difficulty": "Medium", "likes": 29575, "dislikes": 1807, "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": 3274375, "totalSubmissionRaw": 9533222}, "6": {"acRate": 49.11038632458756, "difficulty": "Medium", "likes": 7792, "dislikes": 14816, "categoryTitle": "Algorithms", "frontendQuestionId": "6", "paidOnly": false, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1452886, "totalSubmissionRaw": 2958411}, "7": {"acRate": 29.07312063271059, "difficulty": "Medium", "likes": 13255, "dislikes": 13588, "categoryTitle": "Algorithms", "frontendQuestionId": "7", "paidOnly": false, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3462059, "totalSubmissionRaw": 11908121}, "8": {"acRate": 17.82696466405005, "difficulty": "Medium", "likes": 4688, "dislikes": 13898, "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": 1658671, "totalSubmissionRaw": 9304332}, "9": {"acRate": 57.3632640370773, "difficulty": "Easy", "likes": 12885, "dislikes": 2752, "categoryTitle": "Algorithms", "frontendQuestionId": "9", "paidOnly": false, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 5129005, "totalSubmissionRaw": 8941275}, "10": {"acRate": 28.342941092557627, "difficulty": "Hard", "likes": 12238, "dislikes": 2183, "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": 1011308, "totalSubmissionRaw": 3568104}, "11": {"acRate": 56.038692531714574, "difficulty": "Medium", "likes": 29426, "dislikes": 1820, "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": 3264974, "totalSubmissionRaw": 5826301}, "12": {"acRate": 66.07682876803239, "difficulty": "Medium", "likes": 7269, "dislikes": 5573, "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": 1428764, "totalSubmissionRaw": 2162278}, "13": {"acRate": 62.46715628286531, "difficulty": "Easy", "likes": 14513, "dislikes": 968, "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": 3978396, "totalSubmissionRaw": 6368785}, "14": {"acRate": 43.656380961271964, "difficulty": "Easy", "likes": 17834, "dislikes": 4586, "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": 3666246, "totalSubmissionRaw": 8397974}, "15": {"acRate": 35.23309567460753, "difficulty": "Medium", "likes": 31200, "dislikes": 2908, "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": 3856447, "totalSubmissionRaw": 10945521}, "16": {"acRate": 46.02564431666495, "difficulty": "Medium", "likes": 10524, "dislikes": 572, "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": 1290940, "totalSubmissionRaw": 2804830}, "17": {"acRate": 61.55016526369612, "difficulty": "Medium", "likes": 18775, "dislikes": 1014, "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": 2175191, "totalSubmissionRaw": 3534023}, "18": {"acRate": 36.653185017662885, "difficulty": "Medium", "likes": 11432, "dislikes": 1409, "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": 1045357, "totalSubmissionRaw": 2852024}, "19": {"acRate": 46.52752022419714, "difficulty": "Medium", "likes": 19025, "dislikes": 818, "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": 2940604, "totalSubmissionRaw": 6320143}, "20": {"acRate": 40.94480384501459, "difficulty": "Easy", "likes": 24298, "dislikes": 1799, "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": 5014975, "totalSubmissionRaw": 12248143}, "21": {"acRate": 65.13433407691645, "difficulty": "Easy", "likes": 22004, "dislikes": 2148, "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": 4481080, "totalSubmissionRaw": 6879751}, "22": {"acRate": 75.39001561552567, "difficulty": "Medium", "likes": 21281, "dislikes": 970, "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": 1973129, "totalSubmissionRaw": 2617236}, "23": {"acRate": 53.95065940794945, "difficulty": "Hard", "likes": 19601, "dislikes": 722, "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": 2125106, "totalSubmissionRaw": 3938984}, "24": {"acRate": 65.1425963290456, "difficulty": "Medium", "likes": 12018, "dislikes": 452, "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": 1438655, "totalSubmissionRaw": 2208469}, "25": {"acRate": 60.1918972377674, "difficulty": "Hard", "likes": 13842, "dislikes": 716, "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": 1016087, "totalSubmissionRaw": 1688079}, "26": {"acRate": 57.38514303208966, "difficulty": "Easy", "likes": 14988, "dislikes": 18890, "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": 4888319, "totalSubmissionRaw": 8518455}, "27": {"acRate": 58.00540056798348, "difficulty": "Easy", "likes": 2778, "dislikes": 3855, "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": 3290054, "totalSubmissionRaw": 5671984}, "28": {"acRate": 43.29338653050539, "difficulty": "Easy", "likes": 5993, "dislikes": 431, "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": 2713727, "totalSubmissionRaw": 6268229}, "29": {"acRate": 17.727427839266515, "difficulty": "Medium", "likes": 5231, "dislikes": 14862, "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": 798454, "totalSubmissionRaw": 4504070}, "30": {"acRate": 32.56072972580098, "difficulty": "Hard", "likes": 1909, "dislikes": 277, "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": 483826, "totalSubmissionRaw": 1485913}, "31": {"acRate": 40.93947608645363, "difficulty": "Medium", "likes": 18600, "dislikes": 4728, "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": 1477734, "totalSubmissionRaw": 3609559}, "32": {"acRate": 34.6641372921769, "difficulty": "Hard", "likes": 12417, "dislikes": 412, "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": 781712, "totalSubmissionRaw": 2255103}, "33": {"acRate": 41.41570157666108, "difficulty": "Medium", "likes": 26517, "dislikes": 1600, "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": 2980362, "totalSubmissionRaw": 7196211}, "34": {"acRate": 45.080009538775734, "difficulty": "Medium", "likes": 20676, "dislikes": 533, "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": 2211752, "totalSubmissionRaw": 4906285}, "35": {"acRate": 46.98305723004091, "difficulty": "Easy", "likes": 16356, "dislikes": 757, "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": 3144078, "totalSubmissionRaw": 6691939}, "36": {"acRate": 60.470640298227515, "difficulty": "Medium", "likes": 10825, "dislikes": 1143, "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": 1650674, "totalSubmissionRaw": 2729717}, "37": {"acRate": 62.617028059353544, "difficulty": "Hard", "likes": 9617, "dislikes": 265, "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": 640332, "totalSubmissionRaw": 1022617}, "38": {"acRate": 56.24762123883878, "difficulty": "Medium", "likes": 4058, "dislikes": 8387, "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": 982770, "totalSubmissionRaw": 1747225}, "39": {"acRate": 72.58095050597609, "difficulty": "Medium", "likes": 19005, "dislikes": 429, "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": 2112458, "totalSubmissionRaw": 2910492}, "40": {"acRate": 56.34859017561455, "difficulty": "Medium", "likes": 11043, "dislikes": 322, "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": 1164159, "totalSubmissionRaw": 2065986}, "41": {"acRate": 39.89633159691249, "difficulty": "Hard", "likes": 16937, "dislikes": 1869, "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": 1281372, "totalSubmissionRaw": 3211762}, "42": {"acRate": 62.96576555987276, "difficulty": "Hard", "likes": 32334, "dislikes": 532, "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": 2303273, "totalSubmissionRaw": 3657977}, "43": {"acRate": 40.88960626459225, "difficulty": "Medium", "likes": 7111, "dislikes": 3377, "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": 842568, "totalSubmissionRaw": 2060595}, "44": {"acRate": 28.533248919922986, "difficulty": "Hard", "likes": 8328, "dislikes": 357, "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": 614742, "totalSubmissionRaw": 2154476}, "45": {"acRate": 40.686676728404144, "difficulty": "Medium", "likes": 14720, "dislikes": 593, "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": 1379980, "totalSubmissionRaw": 3391721}, "46": {"acRate": 79.13222111730906, "difficulty": "Medium", "likes": 19203, "dislikes": 330, "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": 2224942, "totalSubmissionRaw": 2811678}, "47": {"acRate": 59.935483870967744, "difficulty": "Medium", "likes": 8560, "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": 977306, "totalSubmissionRaw": 1630596}, "48": {"acRate": 75.69900410193664, "difficulty": "Medium", "likes": 17772, "dislikes": 825, "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": 1886956, "totalSubmissionRaw": 2492713}, "49": {"acRate": 69.2919677159035, "difficulty": "Medium", "likes": 19426, "dislikes": 635, "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": 3121139, "totalSubmissionRaw": 4504345}, "50": {"acRate": 35.43739954709139, "difficulty": "Medium", "likes": 9890, "dislikes": 9627, "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": 1811498, "totalSubmissionRaw": 5111833}, "51": {"acRate": 69.78589325697894, "difficulty": "Hard", "likes": 12510, "dislikes": 292, "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": 796004, "totalSubmissionRaw": 1140639}, "52": {"acRate": 74.83690151530132, "difficulty": "Hard", "likes": 3895, "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": 416287, "totalSubmissionRaw": 556259}, "53": {"acRate": 51.10423765290815, "difficulty": "Medium", "likes": 34293, "dislikes": 1455, "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": 4188714, "totalSubmissionRaw": 8196417}, "54": {"acRate": 51.02187675210808, "difficulty": "Medium", "likes": 15015, "dislikes": 1336, "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": 1563363, "totalSubmissionRaw": 3064123}, "55": {"acRate": 38.740140164215056, "difficulty": "Medium", "likes": 19568, "dislikes": 1265, "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": 2106872, "totalSubmissionRaw": 5438471}, "56": {"acRate": 47.8727156178209, "difficulty": "Medium", "likes": 22372, "dislikes": 790, "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": 2596660, "totalSubmissionRaw": 5424105}, "57": {"acRate": 42.09307580927298, "difficulty": "Medium", "likes": 10486, "dislikes": 826, "categoryTitle": "Algorithms", "frontendQuestionId": "57", "paidOnly": false, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1207024, "totalSubmissionRaw": 2867512}, "58": {"acRate": 53.41641858798002, "difficulty": "Easy", "likes": 5303, "dislikes": 292, "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": 2214565, "totalSubmissionRaw": 4145850}, "59": {"acRate": 71.93172065604043, "difficulty": "Medium", "likes": 6433, "dislikes": 265, "categoryTitle": "Algorithms", "frontendQuestionId": "59", "paidOnly": false, "title": "Spiral Matrix II", "titleSlug": "spiral-matrix-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 607651, "totalSubmissionRaw": 844762}, "60": {"acRate": 47.944944738440775, "difficulty": "Hard", "likes": 6718, "dislikes": 482, "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": 420656, "totalSubmissionRaw": 877371}, "61": {"acRate": 38.52816663778716, "difficulty": "Medium", "likes": 9797, "dislikes": 1460, "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": 1056161, "totalSubmissionRaw": 2741271}, "62": {"acRate": 64.75158446272302, "difficulty": "Medium", "likes": 16772, "dislikes": 451, "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": 1978036, "totalSubmissionRaw": 3054793}, "63": {"acRate": 42.1216706280932, "difficulty": "Medium", "likes": 8819, "dislikes": 513, "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": 1015263, "totalSubmissionRaw": 2410313}, "64": {"acRate": 64.83489713206653, "difficulty": "Medium", "likes": 12554, "dislikes": 172, "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": 1274819, "totalSubmissionRaw": 1966256}, "65": {"acRate": 20.26911766645128, "difficulty": "Hard", "likes": 1273, "dislikes": 2025, "categoryTitle": "Algorithms", "frontendQuestionId": "65", "paidOnly": false, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 384267, "totalSubmissionRaw": 1895823}, "66": {"acRate": 46.027942353822574, "difficulty": "Easy", "likes": 9484, "dislikes": 5411, "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": 2435349, "totalSubmissionRaw": 5291021}, "67": {"acRate": 54.23000152479728, "difficulty": "Easy", "likes": 9495, "dislikes": 989, "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": 1571983, "totalSubmissionRaw": 2898737}, "68": {"acRate": 44.87916801456933, "difficulty": "Hard", "likes": 3770, "dislikes": 4792, "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": 449487, "totalSubmissionRaw": 1001550}, "69": {"acRate": 39.28386666156445, "difficulty": "Easy", "likes": 8285, "dislikes": 4518, "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": 2135270, "totalSubmissionRaw": 5435505}, "70": {"acRate": 53.09405608016522, "difficulty": "Easy", "likes": 22119, "dislikes": 862, "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": 3536647, "totalSubmissionRaw": 6661108}, "71": {"acRate": 43.93153832867837, "difficulty": "Medium", "likes": 5662, "dislikes": 1293, "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": 834280, "totalSubmissionRaw": 1899047}, "72": {"acRate": 57.231365646430056, "difficulty": "Medium", "likes": 14973, "dislikes": 239, "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": 947482, "totalSubmissionRaw": 1655530}, "73": {"acRate": 57.21076331098267, "difficulty": "Medium", "likes": 14681, "dislikes": 751, "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": 1582551, "totalSubmissionRaw": 2766186}, "74": {"acRate": 50.91760237161071, "difficulty": "Medium", "likes": 15923, "dislikes": 424, "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": 1953907, "totalSubmissionRaw": 3837390}, "75": {"acRate": 64.81977853918292, "difficulty": "Medium", "likes": 18730, "dislikes": 661, "categoryTitle": "Algorithms", "frontendQuestionId": "75", "paidOnly": false, "title": "Sort Colors", "titleSlug": "sort-colors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2315002, "totalSubmissionRaw": 3571449}, "76": {"acRate": 43.605854212057636, "difficulty": "Hard", "likes": 18027, "dislikes": 744, "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": 1457209, "totalSubmissionRaw": 3341783}, "77": {"acRate": 71.16511466090279, "difficulty": "Medium", "likes": 8280, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "77", "paidOnly": false, "title": "Combinations", "titleSlug": "combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 961389, "totalSubmissionRaw": 1350930}, "78": {"acRate": 79.10406907382821, "difficulty": "Medium", "likes": 17399, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "78", "paidOnly": false, "title": "Subsets", "titleSlug": "subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2103882, "totalSubmissionRaw": 2659640}, "79": {"acRate": 43.50405818303657, "difficulty": "Medium", "likes": 16006, "dislikes": 678, "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": 1786607, "totalSubmissionRaw": 4106762}, "80": {"acRate": 59.92720462684799, "difficulty": "Medium", "likes": 7032, "dislikes": 1356, "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": 1127652, "totalSubmissionRaw": 1881707}, "81": {"acRate": 38.09052306689543, "difficulty": "Medium", "likes": 8572, "dislikes": 1051, "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": 794773, "totalSubmissionRaw": 2086538}, "82": {"acRate": 48.183358572121676, "difficulty": "Medium", "likes": 8878, "dislikes": 246, "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": 786549, "totalSubmissionRaw": 1632408}, "83": {"acRate": 53.28856165058762, "difficulty": "Easy", "likes": 8769, "dislikes": 311, "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": 1637909, "totalSubmissionRaw": 3073663}, "84": {"acRate": 45.361500208114755, "difficulty": "Hard", "likes": 17402, "dislikes": 298, "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": 977567, "totalSubmissionRaw": 2155055}, "85": {"acRate": 51.507860329333134, "difficulty": "Hard", "likes": 10657, "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": 517842, "totalSubmissionRaw": 1005365}, "86": {"acRate": 57.08145939076468, "difficulty": "Medium", "likes": 7387, "dislikes": 884, "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": 663407, "totalSubmissionRaw": 1162211}, "87": {"acRate": 40.64406808525132, "difficulty": "Hard", "likes": 3348, "dislikes": 1283, "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": 238664, "totalSubmissionRaw": 587205}, "88": {"acRate": 50.842211807015836, "difficulty": "Easy", "likes": 15263, "dislikes": 2017, "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": 3569909, "totalSubmissionRaw": 7021553}, "89": {"acRate": 59.947188358309646, "difficulty": "Medium", "likes": 2265, "dislikes": 2728, "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": 311021, "totalSubmissionRaw": 518825}, "90": {"acRate": 57.99260976728421, "difficulty": "Medium", "likes": 9843, "dislikes": 327, "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": 1007735, "totalSubmissionRaw": 1737695}, "91": {"acRate": 35.38210049594045, "difficulty": "Medium", "likes": 11997, "dislikes": 4529, "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": 1309932, "totalSubmissionRaw": 3702254}, "92": {"acRate": 48.23325649505193, "difficulty": "Medium", "likes": 11707, "dislikes": 629, "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": 928192, "totalSubmissionRaw": 1924378}, "93": {"acRate": 50.89403084679623, "difficulty": "Medium", "likes": 5257, "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": 479688, "totalSubmissionRaw": 942524}, "94": {"acRate": 76.95447297143073, "difficulty": "Easy", "likes": 13579, "dislikes": 804, "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": 2703922, "totalSubmissionRaw": 3513666}, "95": {"acRate": 58.547428541381585, "difficulty": "Medium", "likes": 7592, "dislikes": 528, "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": 467647, "totalSubmissionRaw": 798749}, "96": {"acRate": 61.485697059857046, "difficulty": "Medium", "likes": 10401, "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": 689401, "totalSubmissionRaw": 1121238}, "97": {"acRate": 40.515110455181215, "difficulty": "Medium", "likes": 8262, "dislikes": 492, "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": 556456, "totalSubmissionRaw": 1373453}, "98": {"acRate": 33.351452725261005, "difficulty": "Medium", "likes": 16943, "dislikes": 1383, "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": 2490389, "totalSubmissionRaw": 7467109}, "99": {"acRate": 54.12708358028664, "difficulty": "Medium", "likes": 7954, "dislikes": 260, "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": 479453, "totalSubmissionRaw": 885789}, "100": {"acRate": 63.15892747560887, "difficulty": "Easy", "likes": 11656, "dislikes": 243, "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": 2349706, "totalSubmissionRaw": 3720307}, "101": {"acRate": 57.415394756926666, "difficulty": "Easy", "likes": 15407, "dislikes": 387, "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": 2125205, "totalSubmissionRaw": 3701455}, "102": {"acRate": 68.34717697838131, "difficulty": "Medium", "likes": 15458, "dislikes": 320, "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": 2406738, "totalSubmissionRaw": 3521345}, "103": {"acRate": 59.878842059561485, "difficulty": "Medium", "likes": 10924, "dislikes": 306, "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": 1260560, "totalSubmissionRaw": 2105179}, "104": {"acRate": 76.01482897765544, "difficulty": "Easy", "likes": 12946, "dislikes": 235, "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": 3353889, "totalSubmissionRaw": 4412152}, "105": {"acRate": 64.85103962993689, "difficulty": "Medium", "likes": 15142, "dislikes": 517, "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": 1327346, "totalSubmissionRaw": 2046760}, "106": {"acRate": 64.08696284257299, "difficulty": "Medium", "likes": 8077, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "106", "paidOnly": false, "title": "Construct Binary Tree from Inorder and Postorder Traversal", "titleSlug": "construct-binary-tree-from-inorder-and-postorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 687689, "totalSubmissionRaw": 1073056}, "107": {"acRate": 64.18642032597724, "difficulty": "Medium", "likes": 4889, "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": 670854, "totalSubmissionRaw": 1045164}, "108": {"acRate": 72.49581940036232, "difficulty": "Easy", "likes": 11035, "dislikes": 568, "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": 1279333, "totalSubmissionRaw": 1764699}, "109": {"acRate": 62.64281134622597, "difficulty": "Medium", "likes": 7485, "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": 546162, "totalSubmissionRaw": 871867}, "110": {"acRate": 53.239557544308646, "difficulty": "Easy", "likes": 10832, "dislikes": 707, "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": 1624654, "totalSubmissionRaw": 3051595}, "111": {"acRate": 48.82244820004148, "difficulty": "Easy", "likes": 7327, "dislikes": 1313, "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": 1264082, "totalSubmissionRaw": 2589140}, "112": {"acRate": 51.237823753336066, "difficulty": "Easy", "likes": 9766, "dislikes": 1120, "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": 1556229, "totalSubmissionRaw": 3037266}, "113": {"acRate": 59.08674268930919, "difficulty": "Medium", "likes": 7995, "dislikes": 156, "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": 899245, "totalSubmissionRaw": 1521907}, "114": {"acRate": 66.18575690751071, "difficulty": "Medium", "likes": 12371, "dislikes": 565, "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": 1020452, "totalSubmissionRaw": 1541800}, "115": {"acRate": 48.127513898392294, "difficulty": "Hard", "likes": 6699, "dislikes": 292, "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": 445231, "totalSubmissionRaw": 925107}, "116": {"acRate": 63.5212430724026, "difficulty": "Medium", "likes": 9780, "dislikes": 307, "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": 1086104, "totalSubmissionRaw": 1709828}, "117": {"acRate": 53.41885094373986, "difficulty": "Medium", "likes": 5870, "dislikes": 323, "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": 662882, "totalSubmissionRaw": 1240914}, "118": {"acRate": 75.24176866129645, "difficulty": "Easy", "likes": 13005, "dislikes": 463, "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": 1799745, "totalSubmissionRaw": 2391951}, "119": {"acRate": 64.58721077660022, "difficulty": "Easy", "likes": 4863, "dislikes": 345, "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": 929678, "totalSubmissionRaw": 1439415}, "120": {"acRate": 57.578727364601164, "difficulty": "Medium", "likes": 9609, "dislikes": 561, "categoryTitle": "Algorithms", "frontendQuestionId": "120", "paidOnly": false, "title": "Triangle", "titleSlug": "triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 828396, "totalSubmissionRaw": 1438723}, "121": {"acRate": 54.076746274915656, "difficulty": "Easy", "likes": 31335, "dislikes": 1185, "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": 5142645, "totalSubmissionRaw": 9509922}, "122": {"acRate": 67.51270037214742, "difficulty": "Medium", "likes": 13755, "dislikes": 2714, "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": 2086982, "totalSubmissionRaw": 3091234}, "123": {"acRate": 49.05677104441319, "difficulty": "Hard", "likes": 9743, "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": 658491, "totalSubmissionRaw": 1342302}, "124": {"acRate": 40.350181505755, "difficulty": "Hard", "likes": 16805, "dislikes": 741, "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": 1330946, "totalSubmissionRaw": 3298493}, "125": {"acRate": 48.57270161455259, "difficulty": "Easy", "likes": 9515, "dislikes": 8403, "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": 3324899, "totalSubmissionRaw": 6845209}, "126": {"acRate": 27.171454039350202, "difficulty": "Hard", "likes": 6042, "dislikes": 758, "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": 377374, "totalSubmissionRaw": 1388861}, "127": {"acRate": 40.23888156628112, "difficulty": "Hard", "likes": 12155, "dislikes": 1887, "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": 1141160, "totalSubmissionRaw": 2835961}, "128": {"acRate": 47.394723333871994, "difficulty": "Medium", "likes": 20245, "dislikes": 1039, "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": 1994351, "totalSubmissionRaw": 4207960}, "129": {"acRate": 66.58097814444494, "difficulty": "Medium", "likes": 8089, "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": 935521, "totalSubmissionRaw": 1405088}, "130": {"acRate": 40.6090065228299, "difficulty": "Medium", "likes": 8746, "dislikes": 1894, "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": 776958, "totalSubmissionRaw": 1913262}, "131": {"acRate": 70.159928238365, "difficulty": "Medium", "likes": 12972, "dislikes": 506, "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": 954990, "totalSubmissionRaw": 1361165}, "132": {"acRate": 34.281164172798, "difficulty": "Hard", "likes": 5493, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "132", "paidOnly": false, "title": "Palindrome Partitioning II", "titleSlug": "palindrome-partitioning-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 298567, "totalSubmissionRaw": 870936}, "133": {"acRate": 58.84391358517358, "difficulty": "Medium", "likes": 9582, "dislikes": 3867, "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": 1328565, "totalSubmissionRaw": 2257789}, "134": {"acRate": 45.58586655490085, "difficulty": "Medium", "likes": 12096, "dislikes": 1186, "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": 887523, "totalSubmissionRaw": 1946925}, "135": {"acRate": 43.775081920977335, "difficulty": "Hard", "likes": 7941, "dislikes": 675, "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": 589796, "totalSubmissionRaw": 1347332}, "136": {"acRate": 73.93693945854379, "difficulty": "Easy", "likes": 16624, "dislikes": 739, "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": 3040411, "totalSubmissionRaw": 4112178}, "137": {"acRate": 63.637987723362144, "difficulty": "Medium", "likes": 7986, "dislikes": 699, "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": 634061, "totalSubmissionRaw": 996357}, "138": {"acRate": 57.44473160982705, "difficulty": "Medium", "likes": 13994, "dislikes": 1494, "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": 1341145, "totalSubmissionRaw": 2334677}, "139": {"acRate": 47.1750205876025, "difficulty": "Medium", "likes": 17306, "dislikes": 803, "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": 1780439, "totalSubmissionRaw": 3774115}, "140": {"acRate": 51.586017406555264, "difficulty": "Hard", "likes": 7227, "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": 680027, "totalSubmissionRaw": 1318239}, "141": {"acRate": 51.027791717748485, "difficulty": "Easy", "likes": 15647, "dislikes": 1396, "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": 3234492, "totalSubmissionRaw": 6338687}, "142": {"acRate": 52.44649516284474, "difficulty": "Medium", "likes": 13682, "dislikes": 973, "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": 1392058, "totalSubmissionRaw": 2654245}, "143": {"acRate": 59.92339234692032, "difficulty": "Medium", "likes": 11217, "dislikes": 413, "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": 1060360, "totalSubmissionRaw": 1769529}, "144": {"acRate": 70.65552539447953, "difficulty": "Easy", "likes": 8044, "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": 1739254, "totalSubmissionRaw": 2461597}, "145": {"acRate": 73.26698744648925, "difficulty": "Easy", "likes": 7161, "dislikes": 202, "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": 1394007, "totalSubmissionRaw": 1902640}, "146": {"acRate": 43.13729750389049, "difficulty": "Medium", "likes": 20874, "dislikes": 1054, "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": 1747167, "totalSubmissionRaw": 4050253}, "147": {"acRate": 54.433937650285934, "difficulty": "Medium", "likes": 3126, "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": 385971, "totalSubmissionRaw": 709064}, "148": {"acRate": 59.310818124117645, "difficulty": "Medium", "likes": 11735, "dislikes": 355, "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": 862508, "totalSubmissionRaw": 1454217}, "149": {"acRate": 27.41620518605329, "difficulty": "Hard", "likes": 4208, "dislikes": 505, "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": 412201, "totalSubmissionRaw": 1503494}, "150": {"acRate": 52.54392732148215, "difficulty": "Medium", "likes": 7730, "dislikes": 1100, "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": 1143551, "totalSubmissionRaw": 2176372}, "151": {"acRate": 45.765510157296575, "difficulty": "Medium", "likes": 8601, "dislikes": 5211, "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": 1760748, "totalSubmissionRaw": 3847350}, "152": {"acRate": 33.8399162105695, "difficulty": "Medium", "likes": 18653, "dislikes": 719, "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": 1366034, "totalSubmissionRaw": 4036767}, "153": {"acRate": 51.20315812582001, "difficulty": "Medium", "likes": 13382, "dislikes": 596, "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": 1987203, "totalSubmissionRaw": 3881011}, "154": {"acRate": 43.71930651149461, "difficulty": "Hard", "likes": 4713, "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": 471382, "totalSubmissionRaw": 1078196}, "155": {"acRate": 54.882000541734875, "difficulty": "Medium", "likes": 14284, "dislikes": 884, "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": 1817448, "totalSubmissionRaw": 3311554}, "156": {"acRate": 63.16285117138135, "difficulty": "Medium", "likes": 263, "dislikes": 352, "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": 103960, "totalSubmissionRaw": 164591}, "157": {"acRate": 41.74359833930736, "difficulty": "Easy", "likes": 580, "dislikes": 3509, "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": 194253, "totalSubmissionRaw": 465348}, "158": {"acRate": 42.489913597338926, "difficulty": "Hard", "likes": 869, "dislikes": 1805, "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": 185986, "totalSubmissionRaw": 437717}, "159": {"acRate": 55.652698473874054, "difficulty": "Medium", "likes": 2216, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "159", "paidOnly": true, "title": "Longest Substring with At Most Two Distinct Characters", "titleSlug": "longest-substring-with-at-most-two-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 265696, "totalSubmissionRaw": 477418}, "160": {"acRate": 58.679574134247304, "difficulty": "Easy", "likes": 15086, "dislikes": 1367, "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": 1687409, "totalSubmissionRaw": 2875637}, "161": {"acRate": 34.38252997356278, "difficulty": "Medium", "likes": 1391, "dislikes": 188, "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": 211463, "totalSubmissionRaw": 615037}, "162": {"acRate": 45.99470838452567, "difficulty": "Medium", "likes": 12224, "dislikes": 4709, "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": 1519510, "totalSubmissionRaw": 3303674}, "163": {"acRate": 34.11248155862189, "difficulty": "Easy", "likes": 1101, "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": 251568, "totalSubmissionRaw": 737470}, "164": {"acRate": 47.05051313357973, "difficulty": "Medium", "likes": 3295, "dislikes": 405, "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": 228131, "totalSubmissionRaw": 484860}, "165": {"acRate": 41.24886104598942, "difficulty": "Medium", "likes": 2650, "dislikes": 2738, "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": 508840, "totalSubmissionRaw": 1233586}, "166": {"acRate": 25.32559704512162, "difficulty": "Medium", "likes": 2100, "dislikes": 3683, "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": 234085, "totalSubmissionRaw": 924302}, "167": {"acRate": 61.98583739971417, "difficulty": "Medium", "likes": 11837, "dislikes": 1428, "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": 2218549, "totalSubmissionRaw": 3579119}, "168": {"acRate": 41.50374077937281, "difficulty": "Easy", "likes": 5599, "dislikes": 824, "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": 553080, "totalSubmissionRaw": 1332607}, "169": {"acRate": 65.16361386439199, "difficulty": "Easy", "likes": 19445, "dislikes": 646, "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": 3273277, "totalSubmissionRaw": 5023174}, "170": {"acRate": 38.277645810473516, "difficulty": "Easy", "likes": 670, "dislikes": 449, "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": 158723, "totalSubmissionRaw": 414658}, "171": {"acRate": 64.37889363447255, "difficulty": "Easy", "likes": 4793, "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": 715833, "totalSubmissionRaw": 1111908}, "172": {"acRate": 43.780542930866226, "difficulty": "Medium", "likes": 3229, "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": 481357, "totalSubmissionRaw": 1099477}, "173": {"acRate": 72.952471444562, "difficulty": "Medium", "likes": 8609, "dislikes": 513, "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": 832274, "totalSubmissionRaw": 1140846}, "174": {"acRate": 38.42135771512646, "difficulty": "Hard", "likes": 5833, "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": 233978, "totalSubmissionRaw": 608979}, "175": {"acRate": 76.62754977260742, "difficulty": "Easy", "likes": 3548, "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": 1084067, "totalSubmissionRaw": 1414720}, "176": {"acRate": 41.436739223639805, "difficulty": "Medium", "likes": 3629, "dislikes": 961, "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": 939407, "totalSubmissionRaw": 2267078}, "177": {"acRate": 37.9557874293113, "difficulty": "Medium", "likes": 1997, "dislikes": 1035, "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": 418611, "totalSubmissionRaw": 1102896}, "178": {"acRate": 63.26181636820347, "difficulty": "Medium", "likes": 2182, "dislikes": 275, "categoryTitle": "Database", "frontendQuestionId": "178", "paidOnly": false, "title": "Rank Scores", "titleSlug": "rank-scores", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 417309, "totalSubmissionRaw": 659655}, "179": {"acRate": 36.84230566457735, "difficulty": "Medium", "likes": 8093, "dislikes": 676, "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": 503148, "totalSubmissionRaw": 1365680}, "180": {"acRate": 43.90277895667829, "difficulty": "Medium", "likes": 2150, "dislikes": 326, "categoryTitle": "Database", "frontendQuestionId": "180", "paidOnly": false, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 418947, "totalSubmissionRaw": 954253}, "181": {"acRate": 70.13151461716748, "difficulty": "Easy", "likes": 2624, "dislikes": 258, "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": 685661, "totalSubmissionRaw": 977681}, "182": {"acRate": 71.48293896083172, "difficulty": "Easy", "likes": 2096, "dislikes": 71, "categoryTitle": "Database", "frontendQuestionId": "182", "paidOnly": false, "title": "Duplicate Emails", "titleSlug": "duplicate-emails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 712251, "totalSubmissionRaw": 996393}, "183": {"acRate": 69.55263394240579, "difficulty": "Easy", "likes": 2648, "dislikes": 138, "categoryTitle": "Database", "frontendQuestionId": "183", "paidOnly": false, "title": "Customers Who Never Order", "titleSlug": "customers-who-never-order", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 859612, "totalSubmissionRaw": 1235918}, "184": {"acRate": 52.557133142900156, "difficulty": "Medium", "likes": 2079, "dislikes": 187, "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": 411956, "totalSubmissionRaw": 783826}, "185": {"acRate": 54.82236593893987, "difficulty": "Hard", "likes": 2130, "dislikes": 245, "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": 369081, "totalSubmissionRaw": 673234}, "186": {"acRate": 55.093487321582415, "difficulty": "Medium", "likes": 1075, "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": 165627, "totalSubmissionRaw": 300629}, "187": {"acRate": 49.53039538405697, "difficulty": "Medium", "likes": 3346, "dislikes": 538, "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": 395733, "totalSubmissionRaw": 798970}, "188": {"acRate": 44.34499854262878, "difficulty": "Hard", "likes": 7471, "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": 497499, "totalSubmissionRaw": 1121883}, "189": {"acRate": 41.42076587527953, "difficulty": "Medium", "likes": 18213, "dislikes": 1990, "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": 2455704, "totalSubmissionRaw": 5928702}, "190": {"acRate": 59.99881559439184, "difficulty": "Easy", "likes": 5146, "dislikes": 1460, "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": 851043, "totalSubmissionRaw": 1418433}, "191": {"acRate": 72.25344435377559, "difficulty": "Easy", "likes": 6557, "dislikes": 1341, "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": 1568109, "totalSubmissionRaw": 2170290}, "192": {"acRate": 25.96431548138241, "difficulty": "Medium", "likes": 544, "dislikes": 308, "categoryTitle": "Shell", "frontendQuestionId": "192", "paidOnly": false, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53581, "totalSubmissionRaw": 206364}, "193": {"acRate": 26.260164297356166, "difficulty": "Easy", "likes": 425, "dislikes": 968, "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": 88132, "totalSubmissionRaw": 335611}, "194": {"acRate": 26.77884000039382, "difficulty": "Medium", "likes": 147, "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": 27199, "totalSubmissionRaw": 101569}, "195": {"acRate": 33.59339077885861, "difficulty": "Easy", "likes": 391, "dislikes": 468, "categoryTitle": "Shell", "frontendQuestionId": "195", "paidOnly": false, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 112513, "totalSubmissionRaw": 334926}, "196": {"acRate": 62.75774325153275, "difficulty": "Easy", "likes": 1637, "dislikes": 335, "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": 580078, "totalSubmissionRaw": 924315}, "197": {"acRate": 48.645741411888224, "difficulty": "Easy", "likes": 3050, "dislikes": 630, "categoryTitle": "Database", "frontendQuestionId": "197", "paidOnly": false, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 772865, "totalSubmissionRaw": 1588750}, "198": {"acRate": 51.43658914629313, "difficulty": "Medium", "likes": 21236, "dislikes": 433, "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": 2407574, "totalSubmissionRaw": 4680674}, "199": {"acRate": 63.75601940275216, "difficulty": "Medium", "likes": 12113, "dislikes": 983, "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": 1450400, "totalSubmissionRaw": 2274927}, "200": {"acRate": 60.27888377794161, "difficulty": "Medium", "likes": 22941, "dislikes": 524, "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": 2913231, "totalSubmissionRaw": 4832936}, "201": {"acRate": 47.20849094041248, "difficulty": "Medium", "likes": 4027, "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": 411608, "totalSubmissionRaw": 871894}, "202": {"acRate": 56.718746397029996, "difficulty": "Easy", "likes": 10462, "dislikes": 1479, "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": 1574222, "totalSubmissionRaw": 2775488}, "203": {"acRate": 49.74804631956374, "difficulty": "Easy", "likes": 8365, "dislikes": 251, "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": 1196541, "totalSubmissionRaw": 2405202}, "204": {"acRate": 33.941977247741015, "difficulty": "Medium", "likes": 8025, "dislikes": 1462, "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": 921877, "totalSubmissionRaw": 2716038}, "205": {"acRate": 45.64267511026346, "difficulty": "Easy", "likes": 9119, "dislikes": 2118, "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": 1466283, "totalSubmissionRaw": 3212527}, "206": {"acRate": 77.49777235840494, "difficulty": "Easy", "likes": 21759, "dislikes": 456, "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": 4475611, "totalSubmissionRaw": 5775150}, "207": {"acRate": 47.39077465069676, "difficulty": "Medium", "likes": 16326, "dislikes": 733, "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": 1698712, "totalSubmissionRaw": 3584483}, "208": {"acRate": 66.14637575505104, "difficulty": "Medium", "likes": 11616, "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": 1117839, "totalSubmissionRaw": 1689948}, "209": {"acRate": 47.74683880113826, "difficulty": "Medium", "likes": 12720, "dislikes": 444, "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": 1151871, "totalSubmissionRaw": 2412452}, "210": {"acRate": 51.35181890300736, "difficulty": "Medium", "likes": 10857, "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": 1125004, "totalSubmissionRaw": 2190797}, "211": {"acRate": 45.814201971411606, "difficulty": "Medium", "likes": 7621, "dislikes": 458, "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": 673605, "totalSubmissionRaw": 1470304}, "212": {"acRate": 36.546520800114735, "difficulty": "Hard", "likes": 9479, "dislikes": 467, "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": 693112, "totalSubmissionRaw": 1896521}, "213": {"acRate": 42.46653926549519, "difficulty": "Medium", "likes": 9933, "dislikes": 158, "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": 829094, "totalSubmissionRaw": 1952354}, "214": {"acRate": 33.95461956083099, "difficulty": "Hard", "likes": 3639, "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": 189314, "totalSubmissionRaw": 557551}, "215": {"acRate": 67.06060734692024, "difficulty": "Medium", "likes": 17193, "dislikes": 892, "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": 2480297, "totalSubmissionRaw": 3698593}, "216": {"acRate": 70.45194681669162, "difficulty": "Medium", "likes": 6053, "dislikes": 113, "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": 557010, "totalSubmissionRaw": 790624}, "217": {"acRate": 62.169820790749355, "difficulty": "Easy", "likes": 12128, "dislikes": 1304, "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": 4298148, "totalSubmissionRaw": 6913570}, "218": {"acRate": 43.012290632193064, "difficulty": "Hard", "likes": 5918, "dislikes": 267, "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": 297115, "totalSubmissionRaw": 690769}, "219": {"acRate": 46.2765116054206, "difficulty": "Easy", "likes": 6213, "dislikes": 3112, "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": 1038553, "totalSubmissionRaw": 2244242}, "220": {"acRate": 22.960331274787986, "difficulty": "Hard", "likes": 1021, "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": 259991, "totalSubmissionRaw": 1132352}, "221": {"acRate": 47.202352891602125, "difficulty": "Medium", "likes": 10180, "dislikes": 230, "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": 716913, "totalSubmissionRaw": 1518810}, "222": {"acRate": 66.97878589638103, "difficulty": "Easy", "likes": 8714, "dislikes": 524, "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": 794489, "totalSubmissionRaw": 1186184}, "223": {"acRate": 46.575375764696346, "difficulty": "Medium", "likes": 1999, "dislikes": 1648, "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": 229923, "totalSubmissionRaw": 493658}, "224": {"acRate": 43.84863742869236, "difficulty": "Hard", "likes": 6353, "dislikes": 505, "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": 495158, "totalSubmissionRaw": 1129253}, "225": {"acRate": 65.03146655508252, "difficulty": "Easy", "likes": 6137, "dislikes": 1212, "categoryTitle": "Algorithms", "frontendQuestionId": "225", "paidOnly": false, "title": "Implement Stack using Queues", "titleSlug": "implement-stack-using-queues", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 739766, "totalSubmissionRaw": 1137553}, "226": {"acRate": 77.71753638359695, "difficulty": "Easy", "likes": 14045, "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": 2224276, "totalSubmissionRaw": 2861997}, "227": {"acRate": 44.1335015483427, "difficulty": "Medium", "likes": 6167, "dislikes": 852, "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": 669549, "totalSubmissionRaw": 1517098}, "228": {"acRate": 51.45609717527526, "difficulty": "Easy", "likes": 4005, "dislikes": 2191, "categoryTitle": "Algorithms", "frontendQuestionId": "228", "paidOnly": false, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 624737, "totalSubmissionRaw": 1214119}, "229": {"acRate": 52.497568369514816, "difficulty": "Medium", "likes": 9773, "dislikes": 433, "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": 767498, "totalSubmissionRaw": 1461973}, "230": {"acRate": 73.52577799712554, "difficulty": "Medium", "likes": 11568, "dislikes": 233, "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": 1559799, "totalSubmissionRaw": 2121427}, "231": {"acRate": 47.942673442181686, "difficulty": "Easy", "likes": 6874, "dislikes": 438, "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": 1426305, "totalSubmissionRaw": 2975018}, "232": {"acRate": 66.89222923044179, "difficulty": "Easy", "likes": 7707, "dislikes": 439, "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": 1008876, "totalSubmissionRaw": 1508216}, "233": {"acRate": 34.84090058669453, "difficulty": "Hard", "likes": 1575, "dislikes": 1481, "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": 98698, "totalSubmissionRaw": 283282}, "234": {"acRate": 54.02089778733151, "difficulty": "Easy", "likes": 16613, "dislikes": 888, "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": 2068262, "totalSubmissionRaw": 3828634}, "235": {"acRate": 65.91102520205177, "difficulty": "Medium", "likes": 11221, "dislikes": 323, "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": 1610807, "totalSubmissionRaw": 2443909}, "236": {"acRate": 63.66461013965996, "difficulty": "Medium", "likes": 16714, "dislikes": 423, "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": 1768062, "totalSubmissionRaw": 2777159}, "237": {"acRate": 80.6386147066388, "difficulty": "Medium", "likes": 5168, "dislikes": 1587, "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": 1492422, "totalSubmissionRaw": 1850754}, "238": {"acRate": 66.63662469788379, "difficulty": "Medium", "likes": 22822, "dislikes": 1437, "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": 2913118, "totalSubmissionRaw": 4371651}, "239": {"acRate": 46.79913156355359, "difficulty": "Hard", "likes": 18360, "dislikes": 696, "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": 1106448, "totalSubmissionRaw": 2364248}, "240": {"acRate": 53.42202352274491, "difficulty": "Medium", "likes": 11991, "dislikes": 207, "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": 987961, "totalSubmissionRaw": 1849355}, "241": {"acRate": 65.91347199072398, "difficulty": "Medium", "likes": 5396, "dislikes": 281, "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": 227385, "totalSubmissionRaw": 344975}, "242": {"acRate": 65.21300390872526, "difficulty": "Easy", "likes": 12261, "dislikes": 408, "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": 3861334, "totalSubmissionRaw": 5921110}, "243": {"acRate": 65.46268818108636, "difficulty": "Easy", "likes": 1268, "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": 217941, "totalSubmissionRaw": 332924}, "244": {"acRate": 61.3841489073026, "difficulty": "Medium", "likes": 1053, "dislikes": 339, "categoryTitle": "Algorithms", "frontendQuestionId": "244", "paidOnly": true, "title": "Shortest Word Distance II", "titleSlug": "shortest-word-distance-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 156087, "totalSubmissionRaw": 254279}, "245": {"acRate": 58.60453354500179, "difficulty": "Medium", "likes": 505, "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": 83430, "totalSubmissionRaw": 142361}, "246": {"acRate": 47.68963237309911, "difficulty": "Easy", "likes": 597, "dislikes": 1018, "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": 177435, "totalSubmissionRaw": 372062}, "247": {"acRate": 52.612877244516035, "difficulty": "Medium", "likes": 926, "dislikes": 252, "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": 144365, "totalSubmissionRaw": 274392}, "248": {"acRate": 42.199970143426384, "difficulty": "Hard", "likes": 301, "dislikes": 189, "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": 36749, "totalSubmissionRaw": 87083}, "249": {"acRate": 66.01055097779832, "difficulty": "Medium", "likes": 1673, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "249", "paidOnly": true, "title": "Group Shifted Strings", "titleSlug": "group-shifted-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 248493, "totalSubmissionRaw": 376447}, "250": {"acRate": 56.60871177285268, "difficulty": "Medium", "likes": 1205, "dislikes": 431, "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": 155730, "totalSubmissionRaw": 275099}, "251": {"acRate": 49.650692862784794, "difficulty": "Medium", "likes": 717, "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": 129490, "totalSubmissionRaw": 260802}, "252": {"acRate": 58.34557751407613, "difficulty": "Easy", "likes": 2040, "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": 416154, "totalSubmissionRaw": 713256}, "253": {"acRate": 51.48041362483169, "difficulty": "Medium", "likes": 6959, "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": 927936, "totalSubmissionRaw": 1802503}, "254": {"acRate": 49.70776638218239, "difficulty": "Medium", "likes": 1135, "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": 129358, "totalSubmissionRaw": 260237}, "255": {"acRate": 50.19972640218878, "difficulty": "Medium", "likes": 1203, "dislikes": 90, "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": 82566, "totalSubmissionRaw": 164475}, "256": {"acRate": 62.855134317909744, "difficulty": "Medium", "likes": 2299, "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": 213693, "totalSubmissionRaw": 339977}, "257": {"acRate": 64.572863686142, "difficulty": "Easy", "likes": 6617, "dislikes": 301, "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": 765941, "totalSubmissionRaw": 1186166}, "258": {"acRate": 67.0676162278947, "difficulty": "Easy", "likes": 4860, "dislikes": 1938, "categoryTitle": "Algorithms", "frontendQuestionId": "258", "paidOnly": false, "title": "Add Digits", "titleSlug": "add-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 838143, "totalSubmissionRaw": 1249699}, "259": {"acRate": 50.83848277675519, "difficulty": "Medium", "likes": 1559, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "259", "paidOnly": true, "title": "3Sum Smaller", "titleSlug": "3sum-smaller", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154671, "totalSubmissionRaw": 304240}, "260": {"acRate": 70.77374289634423, "difficulty": "Medium", "likes": 6379, "dislikes": 267, "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": 476107, "totalSubmissionRaw": 672717}, "261": {"acRate": 48.45864315476875, "difficulty": "Medium", "likes": 3293, "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": 420999, "totalSubmissionRaw": 868772}, "262": {"acRate": 36.56528141207807, "difficulty": "Hard", "likes": 1251, "dislikes": 671, "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": 194935, "totalSubmissionRaw": 533115}, "263": {"acRate": 42.136630533314914, "difficulty": "Easy", "likes": 3418, "dislikes": 1722, "categoryTitle": "Algorithms", "frontendQuestionId": "263", "paidOnly": false, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 555006, "totalSubmissionRaw": 1317158}, "264": {"acRate": 49.123232892448236, "difficulty": "Medium", "likes": 6522, "dislikes": 393, "categoryTitle": "Algorithms", "frontendQuestionId": "264", "paidOnly": false, "title": "Ugly Number II", "titleSlug": "ugly-number-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 453292, "totalSubmissionRaw": 922765}, "265": {"acRate": 55.066200568057674, "difficulty": "Hard", "likes": 1307, "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": 126019, "totalSubmissionRaw": 228850}, "266": {"acRate": 67.65282994430774, "difficulty": "Easy", "likes": 1057, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "266", "paidOnly": true, "title": "Palindrome Permutation", "titleSlug": "palindrome-permutation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208939, "totalSubmissionRaw": 308840}, "267": {"acRate": 41.819584112010915, "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": 70489, "totalSubmissionRaw": 168555}, "268": {"acRate": 67.93929466370679, "difficulty": "Easy", "likes": 12269, "dislikes": 3345, "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": 2452045, "totalSubmissionRaw": 3609171}, "269": {"acRate": 35.94978500667976, "difficulty": "Hard", "likes": 4437, "dislikes": 998, "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": 393955, "totalSubmissionRaw": 1095847}, "270": {"acRate": 51.13714866044785, "difficulty": "Easy", "likes": 1813, "dislikes": 143, "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": 359013, "totalSubmissionRaw": 702061}, "271": {"acRate": 47.518181456901004, "difficulty": "Medium", "likes": 1467, "dislikes": 412, "categoryTitle": "Algorithms", "frontendQuestionId": "271", "paidOnly": true, "title": "Encode and Decode Strings", "titleSlug": "encode-and-decode-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 215226, "totalSubmissionRaw": 452932}, "272": {"acRate": 59.422819515878345, "difficulty": "Hard", "likes": 1296, "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": 121197, "totalSubmissionRaw": 203957}, "273": {"acRate": 33.97678999997978, "difficulty": "Hard", "likes": 3611, "dislikes": 6706, "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": 504130, "totalSubmissionRaw": 1483754}, "274": {"acRate": 39.29953142681878, "difficulty": "Medium", "likes": 1352, "dislikes": 615, "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": 540714, "totalSubmissionRaw": 1375879}, "275": {"acRate": 38.400253569855266, "difficulty": "Medium", "likes": 358, "dislikes": 100, "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": 214437, "totalSubmissionRaw": 558426}, "276": {"acRate": 46.99521763799952, "difficulty": "Medium", "likes": 1562, "dislikes": 389, "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": 115956, "totalSubmissionRaw": 246740}, "277": {"acRate": 47.53483848941828, "difficulty": "Medium", "likes": 2846, "dislikes": 282, "categoryTitle": "Algorithms", "frontendQuestionId": "277", "paidOnly": true, "title": "Find the Celebrity", "titleSlug": "find-the-celebrity", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 275680, "totalSubmissionRaw": 579956}, "278": {"acRate": 44.81224398477821, "difficulty": "Easy", "likes": 8407, "dislikes": 3315, "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": 1750591, "totalSubmissionRaw": 3906503}, "279": {"acRate": 55.072227402714304, "difficulty": "Medium", "likes": 11242, "dislikes": 475, "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": 884709, "totalSubmissionRaw": 1606453}, "280": {"acRate": 67.8253487303121, "difficulty": "Medium", "likes": 1213, "dislikes": 103, "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": 144605, "totalSubmissionRaw": 213202}, "281": {"acRate": 64.2945806131281, "difficulty": "Medium", "likes": 682, "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": 95824, "totalSubmissionRaw": 149039}, "282": {"acRate": 40.2371719522244, "difficulty": "Hard", "likes": 3417, "dislikes": 631, "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": 235851, "totalSubmissionRaw": 586153}, "283": {"acRate": 62.0462051828186, "difficulty": "Easy", "likes": 16898, "dislikes": 474, "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": 3277196, "totalSubmissionRaw": 5281860}, "284": {"acRate": 59.84686732938965, "difficulty": "Medium", "likes": 1858, "dislikes": 1039, "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": 224798, "totalSubmissionRaw": 375622}, "285": {"acRate": 50.07572298831724, "difficulty": "Medium", "likes": 2572, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "285", "paidOnly": true, "title": "Inorder Successor in BST", "titleSlug": "inorder-successor-in-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 338916, "totalSubmissionRaw": 676806}, "286": {"acRate": 61.79755049914427, "difficulty": "Medium", "likes": 3144, "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": 332908, "totalSubmissionRaw": 538713}, "287": {"acRate": 61.48398993469416, "difficulty": "Medium", "likes": 23441, "dislikes": 4737, "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": 1865533, "totalSubmissionRaw": 3034180}, "288": {"acRate": 26.491848087209984, "difficulty": "Medium", "likes": 204, "dislikes": 1823, "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": 74436, "totalSubmissionRaw": 280977}, "289": {"acRate": 69.9507624110988, "difficulty": "Medium", "likes": 6386, "dislikes": 577, "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": 498653, "totalSubmissionRaw": 712865}, "290": {"acRate": 42.358893839902905, "difficulty": "Easy", "likes": 7302, "dislikes": 1039, "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": 780744, "totalSubmissionRaw": 1843166}, "291": {"acRate": 48.356734688812644, "difficulty": "Medium", "likes": 919, "dislikes": 75, "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": 77936, "totalSubmissionRaw": 161169}, "292": {"acRate": 57.201073824728844, "difficulty": "Easy", "likes": 1738, "dislikes": 2701, "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": 396531, "totalSubmissionRaw": 693223}, "293": {"acRate": 64.68504757274812, "difficulty": "Easy", "likes": 227, "dislikes": 467, "categoryTitle": "Algorithms", "frontendQuestionId": "293", "paidOnly": true, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74512, "totalSubmissionRaw": 115192}, "294": {"acRate": 52.15829958334547, "difficulty": "Medium", "likes": 621, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "294", "paidOnly": true, "title": "Flip Game II", "titleSlug": "flip-game-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71605, "totalSubmissionRaw": 137284}, "295": {"acRate": 52.28049535603715, "difficulty": "Hard", "likes": 11999, "dislikes": 244, "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": 844313, "totalSubmissionRaw": 1614974}, "296": {"acRate": 60.98290325101039, "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": 85856, "totalSubmissionRaw": 140787}, "297": {"acRate": 57.43345000799069, "difficulty": "Hard", "likes": 10235, "dislikes": 401, "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": 916410, "totalSubmissionRaw": 1595604}, "298": {"acRate": 53.69932233510689, "difficulty": "Medium", "likes": 1140, "dislikes": 238, "categoryTitle": "Algorithms", "frontendQuestionId": "298", "paidOnly": true, "title": "Binary Tree Longest Consecutive Sequence", "titleSlug": "binary-tree-longest-consecutive-sequence", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150478, "totalSubmissionRaw": 280225}, "299": {"acRate": 50.59045103605705, "difficulty": "Medium", "likes": 2443, "dislikes": 1783, "categoryTitle": "Algorithms", "frontendQuestionId": "299", "paidOnly": false, "title": "Bulls and Cows", "titleSlug": "bulls-and-cows", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 383851, "totalSubmissionRaw": 758742}, "300": {"acRate": 56.171345274574676, "difficulty": "Medium", "likes": 21003, "dislikes": 453, "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": 1822275, "totalSubmissionRaw": 3244141}, "301": {"acRate": 48.49877356876133, "difficulty": "Hard", "likes": 5868, "dislikes": 287, "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": 442108, "totalSubmissionRaw": 911587}, "302": {"acRate": 59.0951525194296, "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": 50641, "totalSubmissionRaw": 85694}, "303": {"acRate": 64.72885805235204, "difficulty": "Easy", "likes": 3267, "dislikes": 1916, "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": 570578, "totalSubmissionRaw": 881490}, "304": {"acRate": 55.17766556421194, "difficulty": "Medium", "likes": 4986, "dislikes": 345, "categoryTitle": "Algorithms", "frontendQuestionId": "304", "paidOnly": false, "title": "Range Sum Query 2D - Immutable", "titleSlug": "range-sum-query-2d-immutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 380043, "totalSubmissionRaw": 688764}, "305": {"acRate": 39.909309163352994, "difficulty": "Hard", "likes": 1870, "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": 149443, "totalSubmissionRaw": 374452}, "306": {"acRate": 31.9485801683766, "difficulty": "Medium", "likes": 1180, "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": 94417, "totalSubmissionRaw": 295528}, "307": {"acRate": 41.24451676807698, "difficulty": "Medium", "likes": 4774, "dislikes": 256, "categoryTitle": "Algorithms", "frontendQuestionId": "307", "paidOnly": false, "title": "Range Sum Query - Mutable", "titleSlug": "range-sum-query-mutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 279816, "totalSubmissionRaw": 678431}, "308": {"acRate": 44.25855599386493, "difficulty": "Hard", "likes": 801, "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": 78200, "totalSubmissionRaw": 176689}, "309": {"acRate": 59.01461023477328, "difficulty": "Medium", "likes": 9438, "dislikes": 324, "categoryTitle": "Algorithms", "frontendQuestionId": "309", "paidOnly": false, "title": "Best Time to Buy and Sell Stock with Cooldown", "titleSlug": "best-time-to-buy-and-sell-stock-with-cooldown", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 550673, "totalSubmissionRaw": 933113}, "310": {"acRate": 41.84847706588338, "difficulty": "Medium", "likes": 8285, "dislikes": 384, "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": 387809, "totalSubmissionRaw": 926696}, "311": {"acRate": 68.24683428924008, "difficulty": "Medium", "likes": 1066, "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": 194670, "totalSubmissionRaw": 285244}, "312": {"acRate": 59.722831587137236, "difficulty": "Hard", "likes": 9032, "dislikes": 254, "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": 306276, "totalSubmissionRaw": 512829}, "313": {"acRate": 45.33859298606897, "difficulty": "Medium", "likes": 2178, "dislikes": 391, "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": 132979, "totalSubmissionRaw": 293302}, "314": {"acRate": 55.02150208212774, "difficulty": "Medium", "likes": 3264, "dislikes": 334, "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": 436419, "totalSubmissionRaw": 793179}, "315": {"acRate": 42.5758071961072, "difficulty": "Hard", "likes": 8854, "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": 330212, "totalSubmissionRaw": 775586}, "316": {"acRate": 50.07497295463048, "difficulty": "Medium", "likes": 8694, "dislikes": 634, "categoryTitle": "Algorithms", "frontendQuestionId": "316", "paidOnly": false, "title": "Remove Duplicate Letters", "titleSlug": "remove-duplicate-letters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 345303, "totalSubmissionRaw": 689574}, "317": {"acRate": 43.43803971336151, "difficulty": "Hard", "likes": 1877, "dislikes": 303, "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": 182094, "totalSubmissionRaw": 419204}, "318": {"acRate": 60.14372671345637, "difficulty": "Medium", "likes": 3520, "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": 222118, "totalSubmissionRaw": 369312}, "319": {"acRate": 53.06103570842169, "difficulty": "Medium", "likes": 2686, "dislikes": 3124, "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": 229446, "totalSubmissionRaw": 432419}, "320": {"acRate": 59.707062302806634, "difficulty": "Medium", "likes": 704, "dislikes": 229, "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": 72479, "totalSubmissionRaw": 121391}, "321": {"acRate": 30.677223147235722, "difficulty": "Hard", "likes": 1940, "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": 63194, "totalSubmissionRaw": 205997}, "322": {"acRate": 44.7104182706418, "difficulty": "Medium", "likes": 19065, "dislikes": 460, "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": 1940771, "totalSubmissionRaw": 4340766}, "323": {"acRate": 63.195399744096505, "difficulty": "Medium", "likes": 2677, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "323", "paidOnly": true, "title": "Number of Connected Components in an Undirected Graph", "titleSlug": "number-of-connected-components-in-an-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 420789, "totalSubmissionRaw": 665860}, "324": {"acRate": 34.721560860495984, "difficulty": "Medium", "likes": 3084, "dislikes": 961, "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": 164792, "totalSubmissionRaw": 474610}, "325": {"acRate": 49.608678318890455, "difficulty": "Medium", "likes": 2044, "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": 189143, "totalSubmissionRaw": 381271}, "326": {"acRate": 46.97972311980942, "difficulty": "Easy", "likes": 3112, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "326", "paidOnly": false, "title": "Power of Three", "titleSlug": "power-of-three", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 884109, "totalSubmissionRaw": 1881895}, "327": {"acRate": 36.09523852543804, "difficulty": "Hard", "likes": 2317, "dislikes": 245, "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": 79908, "totalSubmissionRaw": 221381}, "328": {"acRate": 61.58197549139355, "difficulty": "Medium", "likes": 10067, "dislikes": 537, "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": 1013408, "totalSubmissionRaw": 1645625}, "329": {"acRate": 54.025034332376784, "difficulty": "Hard", "likes": 8997, "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": 548784, "totalSubmissionRaw": 1015796}, "330": {"acRate": 53.15322508208665, "difficulty": "Hard", "likes": 2313, "dislikes": 194, "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": 159777, "totalSubmissionRaw": 300597}, "331": {"acRate": 45.479859328005226, "difficulty": "Medium", "likes": 2340, "dislikes": 125, "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": 144711, "totalSubmissionRaw": 318187}, "332": {"acRate": 43.28119196566604, "difficulty": "Hard", "likes": 5913, "dislikes": 1875, "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": 445139, "totalSubmissionRaw": 1028476}, "333": {"acRate": 44.25695171310428, "difficulty": "Medium", "likes": 1492, "dislikes": 133, "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": 111203, "totalSubmissionRaw": 251268}, "334": {"acRate": 39.46880200887244, "difficulty": "Medium", "likes": 8171, "dislikes": 557, "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": 632481, "totalSubmissionRaw": 1602466}, "335": {"acRate": 30.879321008865368, "difficulty": "Hard", "likes": 387, "dislikes": 512, "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": 35946, "totalSubmissionRaw": 116408}, "336": {"acRate": 35.57195099128506, "difficulty": "Hard", "likes": 4474, "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": 210984, "totalSubmissionRaw": 593119}, "337": {"acRate": 54.409559538391406, "difficulty": "Medium", "likes": 8552, "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": 396230, "totalSubmissionRaw": 728236}, "338": {"acRate": 78.78388228690307, "difficulty": "Easy", "likes": 11169, "dislikes": 545, "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": 1184579, "totalSubmissionRaw": 1503582}, "339": {"acRate": 84.15754404680264, "difficulty": "Medium", "likes": 1736, "dislikes": 426, "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": 298202, "totalSubmissionRaw": 354338}, "340": {"acRate": 48.99619175782632, "difficulty": "Medium", "likes": 2834, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "340", "paidOnly": true, "title": "Longest Substring with At Most K Distinct Characters", "titleSlug": "longest-substring-with-at-most-k-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 353167, "totalSubmissionRaw": 720805}, "341": {"acRate": 64.74365889365994, "difficulty": "Medium", "likes": 4898, "dislikes": 1759, "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": 462134, "totalSubmissionRaw": 713791}, "342": {"acRate": 48.36065122172943, "difficulty": "Easy", "likes": 3937, "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": 702216, "totalSubmissionRaw": 1452040}, "343": {"acRate": 60.59398655540026, "difficulty": "Medium", "likes": 5121, "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": 368937, "totalSubmissionRaw": 608868}, "344": {"acRate": 78.95340772823455, "difficulty": "Easy", "likes": 8694, "dislikes": 1183, "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": 2810736, "totalSubmissionRaw": 3559996}, "345": {"acRate": 54.11382640969459, "difficulty": "Easy", "likes": 4622, "dislikes": 2796, "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": 968118, "totalSubmissionRaw": 1789040}, "346": {"acRate": 78.75582545112643, "difficulty": "Easy", "likes": 1662, "dislikes": 173, "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": 405407, "totalSubmissionRaw": 514765}, "347": {"acRate": 63.21248080002704, "difficulty": "Medium", "likes": 17476, "dislikes": 671, "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": 2300086, "totalSubmissionRaw": 3638662}, "348": {"acRate": 58.17820616584505, "difficulty": "Medium", "likes": 2072, "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": 253024, "totalSubmissionRaw": 434906}, "349": {"acRate": 75.11652061357954, "difficulty": "Easy", "likes": 6121, "dislikes": 2295, "categoryTitle": "Algorithms", "frontendQuestionId": "349", "paidOnly": false, "title": "Intersection of Two Arrays", "titleSlug": "intersection-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1295271, "totalSubmissionRaw": 1724350}, "350": {"acRate": 58.63826803531123, "difficulty": "Easy", "likes": 7706, "dislikes": 976, "categoryTitle": "Algorithms", "frontendQuestionId": "350", "paidOnly": false, "title": "Intersection of Two Arrays II", "titleSlug": "intersection-of-two-arrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1420014, "totalSubmissionRaw": 2421654}, "351": {"acRate": 52.90340323135098, "difficulty": "Medium", "likes": 186, "dislikes": 210, "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": 76948, "totalSubmissionRaw": 145450}, "352": {"acRate": 60.15390430932066, "difficulty": "Hard", "likes": 1741, "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": 111393, "totalSubmissionRaw": 185180}, "353": {"acRate": 38.85754236262677, "difficulty": "Medium", "likes": 947, "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": 86704, "totalSubmissionRaw": 223133}, "354": {"acRate": 37.069502761888714, "difficulty": "Hard", "likes": 6002, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "354", "paidOnly": false, "title": "Russian Doll Envelopes", "titleSlug": "russian-doll-envelopes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226627, "totalSubmissionRaw": 611357}, "355": {"acRate": 40.463964827420256, "difficulty": "Medium", "likes": 3965, "dislikes": 540, "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": 198423, "totalSubmissionRaw": 490374}, "356": {"acRate": 35.70207236167157, "difficulty": "Medium", "likes": 300, "dislikes": 622, "categoryTitle": "Algorithms", "frontendQuestionId": "356", "paidOnly": true, "title": "Line Reflection", "titleSlug": "line-reflection", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41760, "totalSubmissionRaw": 116968}, "357": {"acRate": 53.3289190531369, "difficulty": "Medium", "likes": 1541, "dislikes": 1499, "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": 144972, "totalSubmissionRaw": 271844}, "358": {"acRate": 38.96233797562942, "difficulty": "Hard", "likes": 964, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "358", "paidOnly": true, "title": "Rearrange String k Distance Apart", "titleSlug": "rearrange-string-k-distance-apart", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66220, "totalSubmissionRaw": 169959}, "359": {"acRate": 76.07319707467988, "difficulty": "Easy", "likes": 1740, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "359", "paidOnly": true, "title": "Logger Rate Limiter", "titleSlug": "logger-rate-limiter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 332449, "totalSubmissionRaw": 437012}, "360": {"acRate": 56.03655198551396, "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": 66535, "totalSubmissionRaw": 118735}, "361": {"acRate": 51.85620177418508, "difficulty": "Medium", "likes": 962, "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": 79033, "totalSubmissionRaw": 152408}, "362": {"acRate": 68.81372745134038, "difficulty": "Medium", "likes": 2036, "dislikes": 234, "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": 251120, "totalSubmissionRaw": 364928}, "363": {"acRate": 44.259195659489144, "difficulty": "Hard", "likes": 3462, "dislikes": 173, "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": 127582, "totalSubmissionRaw": 288261}, "364": {"acRate": 64.7719207092192, "difficulty": "Medium", "likes": 1128, "dislikes": 456, "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": 139623, "totalSubmissionRaw": 215561}, "365": {"acRate": 41.42287768627316, "difficulty": "Medium", "likes": 1522, "dislikes": 1476, "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": 108193, "totalSubmissionRaw": 261190}, "366": {"acRate": 80.71828384186244, "difficulty": "Medium", "likes": 3227, "dislikes": 59, "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": 260871, "totalSubmissionRaw": 323187}, "367": {"acRate": 43.82211191789781, "difficulty": "Easy", "likes": 4267, "dislikes": 310, "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": 653307, "totalSubmissionRaw": 1490813}, "368": {"acRate": 45.62796978212474, "difficulty": "Medium", "likes": 5979, "dislikes": 283, "categoryTitle": "Algorithms", "frontendQuestionId": "368", "paidOnly": false, "title": "Largest Divisible Subset", "titleSlug": "largest-divisible-subset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 312562, "totalSubmissionRaw": 685024}, "369": {"acRate": 61.11729574413671, "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": 81249, "totalSubmissionRaw": 132940}, "370": {"acRate": 71.78814222115268, "difficulty": "Medium", "likes": 1640, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "370", "paidOnly": true, "title": "Range Addition", "titleSlug": "range-addition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95460, "totalSubmissionRaw": 132975}, "371": {"acRate": 52.43067745762243, "difficulty": "Medium", "likes": 4240, "dislikes": 5567, "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": 512243, "totalSubmissionRaw": 976990}, "372": {"acRate": 35.079956311087464, "difficulty": "Medium", "likes": 946, "dislikes": 1443, "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": 75156, "totalSubmissionRaw": 214242}, "373": {"acRate": 40.1167297490424, "difficulty": "Medium", "likes": 6313, "dislikes": 454, "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": 317758, "totalSubmissionRaw": 792085}, "374": {"acRate": 54.13574547549792, "difficulty": "Easy", "likes": 3781, "dislikes": 548, "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": 701831, "totalSubmissionRaw": 1296429}, "375": {"acRate": 49.777893411794416, "difficulty": "Medium", "likes": 2164, "dislikes": 2128, "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": 130100, "totalSubmissionRaw": 261361}, "376": {"acRate": 48.588327711288755, "difficulty": "Medium", "likes": 5123, "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": 252359, "totalSubmissionRaw": 519383}, "377": {"acRate": 54.26502392101692, "difficulty": "Medium", "likes": 7418, "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": 502588, "totalSubmissionRaw": 926172}, "378": {"acRate": 62.72854178234041, "difficulty": "Medium", "likes": 9960, "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": 637181, "totalSubmissionRaw": 1015777}, "379": {"acRate": 51.91283816108273, "difficulty": "Medium", "likes": 354, "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": 67278, "totalSubmissionRaw": 129598}, "380": {"acRate": 54.61013258897418, "difficulty": "Medium", "likes": 9270, "dislikes": 631, "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": 978197, "totalSubmissionRaw": 1791228}, "381": {"acRate": 35.57204771496158, "difficulty": "Hard", "likes": 2297, "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": 147820, "totalSubmissionRaw": 415551}, "382": {"acRate": 63.377499164073804, "difficulty": "Medium", "likes": 3085, "dislikes": 706, "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": 248301, "totalSubmissionRaw": 391781}, "383": {"acRate": 62.46385655069282, "difficulty": "Easy", "likes": 5038, "dislikes": 505, "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": 1276481, "totalSubmissionRaw": 2043555}, "384": {"acRate": 58.502472846343146, "difficulty": "Medium", "likes": 1354, "dislikes": 930, "categoryTitle": "Algorithms", "frontendQuestionId": "384", "paidOnly": false, "title": "Shuffle an Array", "titleSlug": "shuffle-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343750, "totalSubmissionRaw": 587582}, "385": {"acRate": 38.70468191213622, "difficulty": "Medium", "likes": 458, "dislikes": 1390, "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": 58984, "totalSubmissionRaw": 152395}, "386": {"acRate": 64.64256476081705, "difficulty": "Medium", "likes": 1980, "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": 127916, "totalSubmissionRaw": 197882}, "387": {"acRate": 62.50175512864307, "difficulty": "Easy", "likes": 9008, "dislikes": 298, "categoryTitle": "Algorithms", "frontendQuestionId": "387", "paidOnly": false, "title": "First Unique Character in a String", "titleSlug": "first-unique-character-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1789441, "totalSubmissionRaw": 2863028}, "388": {"acRate": 47.75998923718552, "difficulty": "Medium", "likes": 1297, "dislikes": 2501, "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": 159750, "totalSubmissionRaw": 334485}, "389": {"acRate": 59.57236239420024, "difficulty": "Easy", "likes": 5018, "dislikes": 483, "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": 777101, "totalSubmissionRaw": 1304467}, "390": {"acRate": 45.7979152355067, "difficulty": "Medium", "likes": 1564, "dislikes": 711, "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": 76667, "totalSubmissionRaw": 167404}, "391": {"acRate": 34.038760093000455, "difficulty": "Hard", "likes": 883, "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": 45824, "totalSubmissionRaw": 134623}, "392": {"acRate": 48.08357744934705, "difficulty": "Easy", "likes": 9717, "dislikes": 541, "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": 1612203, "totalSubmissionRaw": 3352917}, "393": {"acRate": 45.2424203105402, "difficulty": "Medium", "likes": 905, "dislikes": 2865, "categoryTitle": "Algorithms", "frontendQuestionId": "393", "paidOnly": false, "title": "UTF-8 Validation", "titleSlug": "utf-8-validation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125524, "totalSubmissionRaw": 277449}, "394": {"acRate": 59.74957906740703, "difficulty": "Medium", "likes": 12785, "dislikes": 624, "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": 857697, "totalSubmissionRaw": 1435489}, "395": {"acRate": 45.06973504733571, "difficulty": "Medium", "likes": 6256, "dislikes": 518, "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": 233605, "totalSubmissionRaw": 518319}, "396": {"acRate": 42.91914832051313, "difficulty": "Medium", "likes": 1565, "dislikes": 268, "categoryTitle": "Algorithms", "frontendQuestionId": "396", "paidOnly": false, "title": "Rotate Function", "titleSlug": "rotate-function", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88995, "totalSubmissionRaw": 207355}, "397": {"acRate": 36.02342592619331, "difficulty": "Medium", "likes": 1335, "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": 124743, "totalSubmissionRaw": 346283}, "398": {"acRate": 63.73333619791387, "difficulty": "Medium", "likes": 1294, "dislikes": 1287, "categoryTitle": "Algorithms", "frontendQuestionId": "398", "paidOnly": false, "title": "Random Pick Index", "titleSlug": "random-pick-index", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 237320, "totalSubmissionRaw": 372364}, "399": {"acRate": 62.14888930251822, "difficulty": "Medium", "likes": 9361, "dislikes": 950, "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": 504178, "totalSubmissionRaw": 811243}, "400": {"acRate": 35.06815495182601, "difficulty": "Medium", "likes": 1083, "dislikes": 2061, "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": 100566, "totalSubmissionRaw": 286773}, "401": {"acRate": 55.04853478173111, "difficulty": "Easy", "likes": 1407, "dislikes": 2584, "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": 149998, "totalSubmissionRaw": 272482}, "402": {"acRate": 33.87553078381002, "difficulty": "Medium", "likes": 9562, "dislikes": 494, "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": 512965, "totalSubmissionRaw": 1514266}, "403": {"acRate": 46.187879998858214, "difficulty": "Hard", "likes": 5602, "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": 275077, "totalSubmissionRaw": 595561}, "404": {"acRate": 60.93832685707375, "difficulty": "Easy", "likes": 5497, "dislikes": 311, "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": 644863, "totalSubmissionRaw": 1058223}, "405": {"acRate": 49.16351413526916, "difficulty": "Easy", "likes": 1316, "dislikes": 221, "categoryTitle": "Algorithms", "frontendQuestionId": "405", "paidOnly": false, "title": "Convert a Number to Hexadecimal", "titleSlug": "convert-a-number-to-hexadecimal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 153870, "totalSubmissionRaw": 312976}, "406": {"acRate": 73.69076680669757, "difficulty": "Medium", "likes": 7092, "dislikes": 720, "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": 308203, "totalSubmissionRaw": 418239}, "407": {"acRate": 48.222263245338745, "difficulty": "Hard", "likes": 3766, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "407", "paidOnly": false, "title": "Trapping Rain Water II", "titleSlug": "trapping-rain-water-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91427, "totalSubmissionRaw": 189595}, "408": {"acRate": 36.06368779546883, "difficulty": "Easy", "likes": 750, "dislikes": 2229, "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": 209398, "totalSubmissionRaw": 580637}, "409": {"acRate": 55.36734841866924, "difficulty": "Easy", "likes": 5933, "dislikes": 412, "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": 816975, "totalSubmissionRaw": 1475557}, "410": {"acRate": 56.273341115545236, "difficulty": "Hard", "likes": 9913, "dislikes": 227, "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": 382276, "totalSubmissionRaw": 679321}, "411": {"acRate": 39.84768851228145, "difficulty": "Hard", "likes": 182, "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": 14860, "totalSubmissionRaw": 37292}, "412": {"acRate": 72.87773628159465, "difficulty": "Easy", "likes": 2797, "dislikes": 383, "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": 1314843, "totalSubmissionRaw": 1804178}, "413": {"acRate": 65.02456816289927, "difficulty": "Medium", "likes": 5358, "dislikes": 296, "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": 313237, "totalSubmissionRaw": 481721}, "414": {"acRate": 35.50849857216057, "difficulty": "Easy", "likes": 3058, "dislikes": 3193, "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": 573098, "totalSubmissionRaw": 1613974}, "415": {"acRate": 51.65254383308636, "difficulty": "Easy", "likes": 5057, "dislikes": 756, "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": 704471, "totalSubmissionRaw": 1363866}, "416": {"acRate": 46.68518531761802, "difficulty": "Medium", "likes": 12358, "dislikes": 254, "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": 913938, "totalSubmissionRaw": 1957658}, "417": {"acRate": 55.88847868332869, "difficulty": "Medium", "likes": 7460, "dislikes": 1496, "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": 504998, "totalSubmissionRaw": 903590}, "418": {"acRate": 36.2556061729703, "difficulty": "Medium", "likes": 1120, "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": 102665, "totalSubmissionRaw": 283170}, "419": {"acRate": 75.62346083380334, "difficulty": "Medium", "likes": 2307, "dislikes": 972, "categoryTitle": "Algorithms", "frontendQuestionId": "419", "paidOnly": false, "title": "Battleships in a Board", "titleSlug": "battleships-in-a-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 215877, "totalSubmissionRaw": 285463}, "420": {"acRate": 13.994114312285419, "difficulty": "Hard", "likes": 884, "dislikes": 1734, "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": 43939, "totalSubmissionRaw": 313982}, "421": {"acRate": 53.329979816410564, "difficulty": "Medium", "likes": 5546, "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": 170689, "totalSubmissionRaw": 320062}, "422": {"acRate": 41.396199936711476, "difficulty": "Easy", "likes": 430, "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": 60176, "totalSubmissionRaw": 145366}, "423": {"acRate": 51.2296581011128, "difficulty": "Medium", "likes": 830, "dislikes": 2734, "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": 82636, "totalSubmissionRaw": 161305}, "424": {"acRate": 55.09286338654018, "difficulty": "Medium", "likes": 10840, "dislikes": 557, "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": 845819, "totalSubmissionRaw": 1535262}, "425": {"acRate": 53.53561855596999, "difficulty": "Hard", "likes": 1094, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "425", "paidOnly": true, "title": "Word Squares", "titleSlug": "word-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75497, "totalSubmissionRaw": 141022}, "426": {"acRate": 64.90878380564705, "difficulty": "Medium", "likes": 2616, "dislikes": 215, "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": 300891, "totalSubmissionRaw": 463561}, "427": {"acRate": 75.88732233574976, "difficulty": "Medium", "likes": 1530, "dislikes": 1847, "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": 132947, "totalSubmissionRaw": 175190}, "428": {"acRate": 67.5054122688081, "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": 90115, "totalSubmissionRaw": 133493}, "429": {"acRate": 70.97328227158988, "difficulty": "Medium", "likes": 3638, "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": 316538, "totalSubmissionRaw": 445996}, "430": {"acRate": 60.398955669605336, "difficulty": "Medium", "likes": 5050, "dislikes": 328, "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": 337756, "totalSubmissionRaw": 559209}, "431": {"acRate": 79.65773329028092, "difficulty": "Hard", "likes": 520, "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": 22203, "totalSubmissionRaw": 27873}, "432": {"acRate": 37.08336765974791, "difficulty": "Hard", "likes": 1578, "dislikes": 176, "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": 85525, "totalSubmissionRaw": 230629}, "433": {"acRate": 54.33132858191462, "difficulty": "Medium", "likes": 2997, "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": 183566, "totalSubmissionRaw": 337864}, "434": {"acRate": 36.35762232953101, "difficulty": "Easy", "likes": 793, "dislikes": 1267, "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": 194554, "totalSubmissionRaw": 535112}, "435": {"acRate": 53.98974228435406, "difficulty": "Medium", "likes": 8223, "dislikes": 224, "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": 627806, "totalSubmissionRaw": 1162824}, "436": {"acRate": 52.58401952750108, "difficulty": "Medium", "likes": 2164, "dislikes": 362, "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": 119992, "totalSubmissionRaw": 228191}, "437": {"acRate": 46.09896097225789, "difficulty": "Medium", "likes": 11014, "dislikes": 524, "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": 597762, "totalSubmissionRaw": 1296693}, "438": {"acRate": 51.22094591284774, "difficulty": "Medium", "likes": 12377, "dislikes": 342, "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": 909701, "totalSubmissionRaw": 1776037}, "439": {"acRate": 61.15224097260026, "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": 33701, "totalSubmissionRaw": 55110}, "440": {"acRate": 32.672315772375335, "difficulty": "Hard", "likes": 771, "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": 24136, "totalSubmissionRaw": 73874}, "441": {"acRate": 46.81069720205456, "difficulty": "Easy", "likes": 3896, "dislikes": 1333, "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": 464151, "totalSubmissionRaw": 991549}, "442": {"acRate": 75.91312057564097, "difficulty": "Medium", "likes": 10493, "dislikes": 406, "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": 814254, "totalSubmissionRaw": 1072613}, "443": {"acRate": 55.56498989097239, "difficulty": "Medium", "likes": 5108, "dislikes": 8017, "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": 652443, "totalSubmissionRaw": 1174198}, "444": {"acRate": 28.511084980646075, "difficulty": "Medium", "likes": 573, "dislikes": 1515, "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": 56495, "totalSubmissionRaw": 198151}, "445": {"acRate": 61.35435927413588, "difficulty": "Medium", "likes": 5903, "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": 489100, "totalSubmissionRaw": 797171}, "446": {"acRate": 54.57814531947148, "difficulty": "Hard", "likes": 3360, "dislikes": 156, "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": 151927, "totalSubmissionRaw": 278366}, "447": {"acRate": 55.6885412754655, "difficulty": "Medium", "likes": 842, "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": 102316, "totalSubmissionRaw": 183729}, "448": {"acRate": 61.312901744267414, "difficulty": "Easy", "likes": 9463, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "448", "paidOnly": false, "title": "Find All Numbers Disappeared in an Array", "titleSlug": "find-all-numbers-disappeared-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 933156, "totalSubmissionRaw": 1521957}, "449": {"acRate": 57.92830506435703, "difficulty": "Medium", "likes": 3497, "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": 240779, "totalSubmissionRaw": 415650}, "450": {"acRate": 51.896512675883066, "difficulty": "Medium", "likes": 9213, "dislikes": 290, "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": 556817, "totalSubmissionRaw": 1072939}, "451": {"acRate": 72.96893003886524, "difficulty": "Medium", "likes": 8359, "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": 787793, "totalSubmissionRaw": 1079628}, "452": {"acRate": 59.30303552472307, "difficulty": "Medium", "likes": 7501, "dislikes": 244, "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": 557519, "totalSubmissionRaw": 940122}, "453": {"acRate": 56.950774621497224, "difficulty": "Medium", "likes": 2587, "dislikes": 1894, "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": 177810, "totalSubmissionRaw": 312217}, "454": {"acRate": 57.35707076601968, "difficulty": "Medium", "likes": 4920, "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": 334160, "totalSubmissionRaw": 582596}, "455": {"acRate": 53.05293002732668, "difficulty": "Easy", "likes": 4010, "dislikes": 378, "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": 511953, "totalSubmissionRaw": 964983}, "456": {"acRate": 33.79548424872322, "difficulty": "Medium", "likes": 7235, "dislikes": 438, "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": 266081, "totalSubmissionRaw": 787330}, "457": {"acRate": 34.476439575936965, "difficulty": "Medium", "likes": 695, "dislikes": 793, "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": 84097, "totalSubmissionRaw": 243926}, "458": {"acRate": 59.53059406574045, "difficulty": "Hard", "likes": 1791, "dislikes": 3358, "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": 120962, "totalSubmissionRaw": 203193}, "459": {"acRate": 46.252669070676106, "difficulty": "Easy", "likes": 6420, "dislikes": 524, "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": 469836, "totalSubmissionRaw": 1015803}, "460": {"acRate": 44.79900889923075, "difficulty": "Hard", "likes": 5712, "dislikes": 331, "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": 264335, "totalSubmissionRaw": 590049}, "461": {"acRate": 75.57213311037904, "difficulty": "Easy", "likes": 3849, "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": 588883, "totalSubmissionRaw": 779233}, "462": {"acRate": 60.330455924699386, "difficulty": "Medium", "likes": 3363, "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": 187095, "totalSubmissionRaw": 310117}, "463": {"acRate": 73.03838446123015, "difficulty": "Easy", "likes": 6859, "dislikes": 390, "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": 658582, "totalSubmissionRaw": 901693}, "464": {"acRate": 29.79285521679457, "difficulty": "Medium", "likes": 2669, "dislikes": 403, "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": 98334, "totalSubmissionRaw": 330059}, "465": {"acRate": 49.62183235867446, "difficulty": "Hard", "likes": 1460, "dislikes": 152, "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": 95460, "totalSubmissionRaw": 192375}, "466": {"acRate": 30.642836105470384, "difficulty": "Hard", "likes": 407, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "466", "paidOnly": false, "title": "Count The Repetitions", "titleSlug": "count-the-repetitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19768, "totalSubmissionRaw": 64511}, "467": {"acRate": 40.13127010345127, "difficulty": "Medium", "likes": 1444, "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": 46163, "totalSubmissionRaw": 115030}, "468": {"acRate": 27.34264697349674, "difficulty": "Medium", "likes": 1026, "dislikes": 2714, "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": 169648, "totalSubmissionRaw": 620452}, "469": {"acRate": 39.6395412342982, "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": 10887, "totalSubmissionRaw": 27465}, "470": {"acRate": 45.80172084940449, "difficulty": "Medium", "likes": 1111, "dislikes": 376, "categoryTitle": "Algorithms", "frontendQuestionId": "470", "paidOnly": false, "title": "Implement Rand10() Using Rand7()", "titleSlug": "implement-rand10-using-rand7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Rejection Sampling", "id": "VG9waWNUYWdOb2RlOjU0NTY5", "slug": "rejection-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86446, "totalSubmissionRaw": 188742}, "471": {"acRate": 50.47379114181227, "difficulty": "Hard", "likes": 625, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "471", "paidOnly": true, "title": "Encode String with Shortest Length", "titleSlug": "encode-string-with-shortest-length", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31054, "totalSubmissionRaw": 61525}, "472": {"acRate": 49.349758390093676, "difficulty": "Hard", "likes": 3879, "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": 230909, "totalSubmissionRaw": 467903}, "473": {"acRate": 40.409786572465045, "difficulty": "Medium", "likes": 3833, "dislikes": 298, "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": 169987, "totalSubmissionRaw": 420658}, "474": {"acRate": 47.939690151649394, "difficulty": "Medium", "likes": 5454, "dislikes": 462, "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": 213730, "totalSubmissionRaw": 445831}, "475": {"acRate": 38.45897223629422, "difficulty": "Medium", "likes": 2119, "dislikes": 1166, "categoryTitle": "Algorithms", "frontendQuestionId": "475", "paidOnly": false, "title": "Heaters", "titleSlug": "heaters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 124504, "totalSubmissionRaw": 323732}, "476": {"acRate": 70.30256317163102, "difficulty": "Easy", "likes": 3071, "dislikes": 135, "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": 472474, "totalSubmissionRaw": 672058}, "477": {"acRate": 52.97836220561063, "difficulty": "Medium", "likes": 2219, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "477", "paidOnly": false, "title": "Total Hamming Distance", "titleSlug": "total-hamming-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112970, "totalSubmissionRaw": 213238}, "478": {"acRate": 40.07144955415099, "difficulty": "Medium", "likes": 456, "dislikes": 772, "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": 42287, "totalSubmissionRaw": 105529}, "479": {"acRate": 33.68618179886309, "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": 25363, "totalSubmissionRaw": 75292}, "480": {"acRate": 38.90451091107133, "difficulty": "Hard", "likes": 3230, "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": 155371, "totalSubmissionRaw": 399364}, "481": {"acRate": 51.61407570943945, "difficulty": "Medium", "likes": 319, "dislikes": 1305, "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": 38341, "totalSubmissionRaw": 74284}, "482": {"acRate": 44.038216830034244, "difficulty": "Easy", "likes": 1114, "dislikes": 1419, "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": 291399, "totalSubmissionRaw": 661696}, "483": {"acRate": 41.45580342017511, "difficulty": "Hard", "likes": 390, "dislikes": 506, "categoryTitle": "Algorithms", "frontendQuestionId": "483", "paidOnly": false, "title": "Smallest Good Base", "titleSlug": "smallest-good-base", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23248, "totalSubmissionRaw": 56079}, "484": {"acRate": 66.94986541049798, "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": 39795, "totalSubmissionRaw": 59440}, "485": {"acRate": 60.335392461618284, "difficulty": "Easy", "likes": 5816, "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": 1309383, "totalSubmissionRaw": 2170174}, "486": {"acRate": 55.444887422129256, "difficulty": "Medium", "likes": 5862, "dislikes": 285, "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": 242262, "totalSubmissionRaw": 436942}, "487": {"acRate": 50.51439674377314, "difficulty": "Medium", "likes": 1545, "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": 150788, "totalSubmissionRaw": 298505}, "488": {"acRate": 32.52020513922079, "difficulty": "Hard", "likes": 456, "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": 24223, "totalSubmissionRaw": 74486}, "489": {"acRate": 76.8568319040458, "difficulty": "Hard", "likes": 2777, "dislikes": 178, "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": 170190, "totalSubmissionRaw": 221438}, "490": {"acRate": 58.37705629413389, "difficulty": "Medium", "likes": 1849, "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": 177576, "totalSubmissionRaw": 304188}, "491": {"acRate": 61.01596211191019, "difficulty": "Medium", "likes": 3655, "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": 173925, "totalSubmissionRaw": 285049}, "492": {"acRate": 58.594817110506135, "difficulty": "Easy", "likes": 704, "dislikes": 391, "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": 124405, "totalSubmissionRaw": 212314}, "493": {"acRate": 30.970161698669845, "difficulty": "Hard", "likes": 6225, "dislikes": 272, "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": 204285, "totalSubmissionRaw": 659620}, "494": {"acRate": 47.419390786706884, "difficulty": "Medium", "likes": 10973, "dislikes": 364, "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": 651043, "totalSubmissionRaw": 1372947}, "495": {"acRate": 56.67999360307052, "difficulty": "Easy", "likes": 1159, "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": 159489, "totalSubmissionRaw": 281385}, "496": {"acRate": 72.96447663671769, "difficulty": "Easy", "likes": 8125, "dislikes": 784, "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": 804463, "totalSubmissionRaw": 1102541}, "497": {"acRate": 40.23166536802296, "difficulty": "Medium", "likes": 484, "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": 42339, "totalSubmissionRaw": 105238}, "498": {"acRate": 60.82232718823566, "difficulty": "Medium", "likes": 3464, "dislikes": 689, "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": 318302, "totalSubmissionRaw": 523332}, "499": {"acRate": 49.2638817363909, "difficulty": "Hard", "likes": 484, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "499", "paidOnly": true, "title": "The Maze III", "titleSlug": "the-maze-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 32525, "totalSubmissionRaw": 66022}, "500": {"acRate": 71.16426538467209, "difficulty": "Easy", "likes": 1615, "dislikes": 1137, "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": 241286, "totalSubmissionRaw": 339055}, "501": {"acRate": 56.5505595232599, "difficulty": "Easy", "likes": 3906, "dislikes": 785, "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": 318469, "totalSubmissionRaw": 563158}, "502": {"acRate": 53.17549963442764, "difficulty": "Hard", "likes": 3806, "dislikes": 258, "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": 234913, "totalSubmissionRaw": 441771}, "503": {"acRate": 64.6117360370749, "difficulty": "Medium", "likes": 8042, "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": 445443, "totalSubmissionRaw": 689414}, "504": {"acRate": 50.61914234001756, "difficulty": "Easy", "likes": 808, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "504", "paidOnly": false, "title": "Base 7", "titleSlug": "base-7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 141235, "totalSubmissionRaw": 279015}, "505": {"acRate": 53.593718836194526, "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": 110171, "totalSubmissionRaw": 205567}, "506": {"acRate": 72.06923980152267, "difficulty": "Easy", "likes": 1924, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "506", "paidOnly": false, "title": "Relative Ranks", "titleSlug": "relative-ranks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 304429, "totalSubmissionRaw": 422413}, "507": {"acRate": 41.87878992786583, "difficulty": "Easy", "likes": 1095, "dislikes": 1236, "categoryTitle": "Algorithms", "frontendQuestionId": "507", "paidOnly": false, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210572, "totalSubmissionRaw": 502813}, "508": {"acRate": 66.99291734477711, "difficulty": "Medium", "likes": 2264, "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": 147367, "totalSubmissionRaw": 219974}, "509": {"acRate": 71.6875789270949, "difficulty": "Easy", "likes": 8239, "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": 1965282, "totalSubmissionRaw": 2741454}, "510": {"acRate": 60.89047372766784, "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": 67108, "totalSubmissionRaw": 110211}, "511": {"acRate": 74.94550923527748, "difficulty": "Easy", "likes": 864, "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": 299489, "totalSubmissionRaw": 399609}, "512": {"acRate": 53.106268489693385, "difficulty": "Easy", "likes": 267, "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": 89216, "totalSubmissionRaw": 167997}, "513": {"acRate": 71.34985010616282, "difficulty": "Medium", "likes": 3807, "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": 371994, "totalSubmissionRaw": 521367}, "514": {"acRate": 59.00698589438185, "difficulty": "Hard", "likes": 1489, "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": 110228, "totalSubmissionRaw": 186805}, "515": {"acRate": 65.69881380248776, "difficulty": "Medium", "likes": 3620, "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": 355357, "totalSubmissionRaw": 540888}, "516": {"acRate": 63.10191896430468, "difficulty": "Medium", "likes": 9614, "dislikes": 331, "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": 527580, "totalSubmissionRaw": 836076}, "517": {"acRate": 41.561078622482135, "difficulty": "Hard", "likes": 772, "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": 30702, "totalSubmissionRaw": 73872}, "518": {"acRate": 64.62284454026381, "difficulty": "Medium", "likes": 9411, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "518", "paidOnly": false, "title": "Coin Change II", "titleSlug": "coin-change-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 678618, "totalSubmissionRaw": 1050122}, "519": {"acRate": 42.35389365868354, "difficulty": "Medium", "likes": 433, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "519", "paidOnly": false, "title": "Random Flip Matrix", "titleSlug": "random-flip-matrix", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22495, "totalSubmissionRaw": 53112}, "520": {"acRate": 56.40660570672017, "difficulty": "Easy", "likes": 3411, "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": 446491, "totalSubmissionRaw": 791558}, "521": {"acRate": 60.91820650918258, "difficulty": "Easy", "likes": 43, "dislikes": 142, "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": 118651, "totalSubmissionRaw": 194771}, "522": {"acRate": 42.01289866324342, "difficulty": "Medium", "likes": 516, "dislikes": 1311, "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": 54655, "totalSubmissionRaw": 130091}, "523": {"acRate": 30.33145617089496, "difficulty": "Medium", "likes": 6301, "dislikes": 655, "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": 594079, "totalSubmissionRaw": 1958624}, "524": {"acRate": 51.337486615399584, "difficulty": "Medium", "likes": 1799, "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": 158217, "totalSubmissionRaw": 308190}, "525": {"acRate": 48.950429260920686, "difficulty": "Medium", "likes": 8003, "dislikes": 387, "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": 480025, "totalSubmissionRaw": 980636}, "526": {"acRate": 64.34165321117884, "difficulty": "Medium", "likes": 3228, "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": 180912, "totalSubmissionRaw": 281174}, "527": {"acRate": 61.24581939799331, "difficulty": "Hard", "likes": 387, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "527", "paidOnly": true, "title": "Word Abbreviation", "titleSlug": "word-abbreviation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27835, "totalSubmissionRaw": 45448}, "528": {"acRate": 47.14398367240577, "difficulty": "Medium", "likes": 1930, "dislikes": 853, "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": 484847, "totalSubmissionRaw": 1028441}, "529": {"acRate": 67.03374836039113, "difficulty": "Medium", "likes": 1968, "dislikes": 1065, "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": 164046, "totalSubmissionRaw": 244722}, "530": {"acRate": 58.5006215804297, "difficulty": "Easy", "likes": 4411, "dislikes": 229, "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": 416463, "totalSubmissionRaw": 711895}, "531": {"acRate": 62.38118276509762, "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": 43839, "totalSubmissionRaw": 70276}, "532": {"acRate": 43.35699136662006, "difficulty": "Medium", "likes": 3891, "dislikes": 2256, "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": 352844, "totalSubmissionRaw": 813813}, "533": {"acRate": 48.67564046895354, "difficulty": "Medium", "likes": 87, "dislikes": 776, "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": 13452, "totalSubmissionRaw": 27636}, "534": {"acRate": 80.97963271437769, "difficulty": "Medium", "likes": 401, "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": 79241, "totalSubmissionRaw": 97853}, "535": {"acRate": 86.48508766254771, "difficulty": "Medium", "likes": 2029, "dislikes": 3785, "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": 267358, "totalSubmissionRaw": 309136}, "536": {"acRate": 57.22273338523603, "difficulty": "Medium", "likes": 1064, "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": 97019, "totalSubmissionRaw": 169547}, "537": {"acRate": 72.02969933102992, "difficulty": "Medium", "likes": 716, "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": 97982, "totalSubmissionRaw": 136030}, "538": {"acRate": 69.71591485333724, "difficulty": "Medium", "likes": 5248, "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": 309333, "totalSubmissionRaw": 443705}, "539": {"acRate": 57.025489395661175, "difficulty": "Medium", "likes": 1875, "dislikes": 265, "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": 155061, "totalSubmissionRaw": 271916}, "540": {"acRate": 59.24990033978608, "difficulty": "Medium", "likes": 11335, "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": 723824, "totalSubmissionRaw": 1221646}, "541": {"acRate": 51.04885133247776, "difficulty": "Easy", "likes": 2008, "dislikes": 3868, "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": 261340, "totalSubmissionRaw": 511941}, "542": {"acRate": 49.38191639476163, "difficulty": "Medium", "likes": 9580, "dislikes": 424, "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": 610674, "totalSubmissionRaw": 1236640}, "543": {"acRate": 61.34293132285745, "difficulty": "Easy", "likes": 13984, "dislikes": 1045, "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": 1641587, "totalSubmissionRaw": 2676087}, "544": {"acRate": 77.20368174374612, "difficulty": "Medium", "likes": 390, "dislikes": 135, "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": 27344, "totalSubmissionRaw": 35418}, "545": {"acRate": 45.82607139780386, "difficulty": "Medium", "likes": 1332, "dislikes": 2205, "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": 138303, "totalSubmissionRaw": 301801}, "546": {"acRate": 48.012125335147466, "difficulty": "Hard", "likes": 2302, "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": 47991, "totalSubmissionRaw": 99956}, "547": {"acRate": 67.04213095137915, "difficulty": "Medium", "likes": 9831, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "547", "paidOnly": false, "title": "Number of Provinces", "titleSlug": "number-of-provinces", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 979922, "totalSubmissionRaw": 1461652}, "548": {"acRate": 50.14365423051299, "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": 24085, "totalSubmissionRaw": 48032}, "549": {"acRate": 49.53555891211345, "difficulty": "Medium", "likes": 1158, "dislikes": 96, "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": 54768, "totalSubmissionRaw": 110563}, "550": {"acRate": 37.5520020800832, "difficulty": "Medium", "likes": 954, "dislikes": 197, "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": 202192, "totalSubmissionRaw": 538432}, "551": {"acRate": 49.27392078470379, "difficulty": "Easy", "likes": 774, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "551", "paidOnly": false, "title": "Student Attendance Record I", "titleSlug": "student-attendance-record-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 228863, "totalSubmissionRaw": 464476}, "552": {"acRate": 55.27100591715977, "difficulty": "Hard", "likes": 2284, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "552", "paidOnly": false, "title": "Student Attendance Record II", "titleSlug": "student-attendance-record-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140112, "totalSubmissionRaw": 253500}, "553": {"acRate": 61.115086376845454, "difficulty": "Medium", "likes": 379, "dislikes": 1602, "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": 41851, "totalSubmissionRaw": 68479}, "554": {"acRate": 55.29227712370533, "difficulty": "Medium", "likes": 2536, "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": 145260, "totalSubmissionRaw": 262713}, "555": {"acRate": 43.49971531599925, "difficulty": "Medium", "likes": 76, "dislikes": 261, "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": 6876, "totalSubmissionRaw": 15807}, "556": {"acRate": 34.17727674437289, "difficulty": "Medium", "likes": 3697, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "556", "paidOnly": false, "title": "Next Greater Element III", "titleSlug": "next-greater-element-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161651, "totalSubmissionRaw": 472978}, "557": {"acRate": 83.26222759234922, "difficulty": "Easy", "likes": 5942, "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": 935794, "totalSubmissionRaw": 1123912}, "558": {"acRate": 50.068757776177065, "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": 15292, "totalSubmissionRaw": 30542}, "559": {"acRate": 72.38105590292274, "difficulty": "Easy", "likes": 2777, "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": 292989, "totalSubmissionRaw": 404787}, "560": {"acRate": 44.03390196113678, "difficulty": "Medium", "likes": 21807, "dislikes": 673, "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": 1371800, "totalSubmissionRaw": 3115328}, "561": {"acRate": 79.26928828483135, "difficulty": "Easy", "likes": 2075, "dislikes": 264, "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": 501991, "totalSubmissionRaw": 633273}, "562": {"acRate": 50.44545027653135, "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": 77347, "totalSubmissionRaw": 153328}, "563": {"acRate": 62.50010641528066, "difficulty": "Easy", "likes": 2246, "dislikes": 2187, "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": 220246, "totalSubmissionRaw": 352393}, "564": {"acRate": 31.773203204914275, "difficulty": "Hard", "likes": 1223, "dislikes": 1684, "categoryTitle": "Algorithms", "frontendQuestionId": "564", "paidOnly": false, "title": "Find the Closest Palindrome", "titleSlug": "find-the-closest-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 117103, "totalSubmissionRaw": 368559}, "565": {"acRate": 56.34398774615587, "difficulty": "Medium", "likes": 2212, "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": 133160, "totalSubmissionRaw": 236334}, "566": {"acRate": 63.300515049666664, "difficulty": "Easy", "likes": 3517, "dislikes": 413, "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": 389105, "totalSubmissionRaw": 614696}, "567": {"acRate": 44.72131370780069, "difficulty": "Medium", "likes": 11356, "dislikes": 424, "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": 919543, "totalSubmissionRaw": 2056163}, "568": {"acRate": 45.84231653425131, "difficulty": "Hard", "likes": 570, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "568", "paidOnly": true, "title": "Maximum Vacation Days", "titleSlug": "maximum-vacation-days", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38486, "totalSubmissionRaw": 83953}, "569": {"acRate": 65.8521609068724, "difficulty": "Hard", "likes": 324, "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": 41826, "totalSubmissionRaw": 63515}, "570": {"acRate": 49.65212569358701, "difficulty": "Medium", "likes": 1180, "dislikes": 130, "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": 430686, "totalSubmissionRaw": 867408}, "571": {"acRate": 42.422868156630436, "difficulty": "Hard", "likes": 308, "dislikes": 79, "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": 29934, "totalSubmissionRaw": 70561}, "572": {"acRate": 48.56804449107901, "difficulty": "Easy", "likes": 8259, "dislikes": 521, "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": 912773, "totalSubmissionRaw": 1879374}, "573": {"acRate": 57.15406219163525, "difficulty": "Medium", "likes": 412, "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": 22589, "totalSubmissionRaw": 39523}, "574": {"acRate": 61.08464706586937, "difficulty": "Medium", "likes": 174, "dislikes": 413, "categoryTitle": "Database", "frontendQuestionId": "574", "paidOnly": true, "title": "Winning Candidate", "titleSlug": "winning-candidate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66297, "totalSubmissionRaw": 108533}, "575": {"acRate": 68.21940507224319, "difficulty": "Easy", "likes": 1535, "dislikes": 1373, "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": 298069, "totalSubmissionRaw": 436927}, "576": {"acRate": 48.10288685681473, "difficulty": "Medium", "likes": 3889, "dislikes": 294, "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": 211100, "totalSubmissionRaw": 438851}, "577": {"acRate": 76.14675570945667, "difficulty": "Easy", "likes": 982, "dislikes": 225, "categoryTitle": "Database", "frontendQuestionId": "577", "paidOnly": false, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 461783, "totalSubmissionRaw": 606441}, "578": {"acRate": 40.23827904938761, "difficulty": "Medium", "likes": 130, "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": 57855, "totalSubmissionRaw": 143781}, "579": {"acRate": 47.40560483554439, "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": 36234, "totalSubmissionRaw": 76434}, "580": {"acRate": 59.175139108332765, "difficulty": "Medium", "likes": 246, "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": 68913, "totalSubmissionRaw": 116456}, "581": {"acRate": 37.03271118143483, "difficulty": "Medium", "likes": 7765, "dislikes": 262, "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": 336090, "totalSubmissionRaw": 907549}, "582": {"acRate": 69.62340094847168, "difficulty": "Medium", "likes": 1108, "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": 87351, "totalSubmissionRaw": 125463}, "583": {"acRate": 62.52271583779226, "difficulty": "Medium", "likes": 5803, "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": 272142, "totalSubmissionRaw": 435269}, "584": {"acRate": 70.70299085026944, "difficulty": "Easy", "likes": 2140, "dislikes": 371, "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": 1060256, "totalSubmissionRaw": 1499596}, "585": {"acRate": 48.67121206105603, "difficulty": "Medium", "likes": 591, "dislikes": 498, "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": 134847, "totalSubmissionRaw": 277057}, "586": {"acRate": 64.68461618221409, "difficulty": "Easy", "likes": 996, "dislikes": 75, "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": 280728, "totalSubmissionRaw": 433995}, "587": {"acRate": 51.97894996650329, "difficulty": "Hard", "likes": 1479, "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": 58967, "totalSubmissionRaw": 113444}, "588": {"acRate": 48.066728616310456, "difficulty": "Hard", "likes": 1494, "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": 108626, "totalSubmissionRaw": 225989}, "589": {"acRate": 75.77505618597212, "difficulty": "Easy", "likes": 3169, "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": 439658, "totalSubmissionRaw": 580215}, "590": {"acRate": 80.3546013905431, "difficulty": "Easy", "likes": 2679, "dislikes": 119, "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": 373759, "totalSubmissionRaw": 465138}, "591": {"acRate": 39.17538311846266, "difficulty": "Hard", "likes": 170, "dislikes": 649, "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": 16105, "totalSubmissionRaw": 41110}, "592": {"acRate": 66.03969536118163, "difficulty": "Medium", "likes": 849, "dislikes": 687, "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": 125906, "totalSubmissionRaw": 190652}, "593": {"acRate": 44.130820118380655, "difficulty": "Medium", "likes": 1055, "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": 111538, "totalSubmissionRaw": 252744}, "594": {"acRate": 55.23598213139417, "difficulty": "Easy", "likes": 2171, "dislikes": 253, "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": 167788, "totalSubmissionRaw": 303768}, "595": {"acRate": 68.11716543079096, "difficulty": "Easy", "likes": 2758, "dislikes": 1324, "categoryTitle": "Database", "frontendQuestionId": "595", "paidOnly": false, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1358053, "totalSubmissionRaw": 1993701}, "596": {"acRate": 56.962140682816575, "difficulty": "Easy", "likes": 1062, "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": 468750, "totalSubmissionRaw": 822915}, "597": {"acRate": 41.774707354002615, "difficulty": "Easy", "likes": 306, "dislikes": 767, "categoryTitle": "Database", "frontendQuestionId": "597", "paidOnly": true, "title": "Friend Requests I: Overall Acceptance Rate", "titleSlug": "friend-requests-i-overall-acceptance-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76977, "totalSubmissionRaw": 184267}, "598": {"acRate": 56.40554223288036, "difficulty": "Easy", "likes": 944, "dislikes": 969, "categoryTitle": "Algorithms", "frontendQuestionId": "598", "paidOnly": false, "title": "Range Addition II", "titleSlug": "range-addition-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105845, "totalSubmissionRaw": 187650}, "599": {"acRate": 56.159463331120506, "difficulty": "Easy", "likes": 1952, "dislikes": 399, "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": 241100, "totalSubmissionRaw": 429312}, "600": {"acRate": 40.07426982739142, "difficulty": "Hard", "likes": 1537, "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": 40792, "totalSubmissionRaw": 101791}, "601": {"acRate": 48.85880233764717, "difficulty": "Hard", "likes": 684, "dislikes": 569, "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": 108768, "totalSubmissionRaw": 222617}, "602": {"acRate": 58.157198386773004, "difficulty": "Medium", "likes": 657, "dislikes": 132, "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": 159342, "totalSubmissionRaw": 273985}, "603": {"acRate": 65.95484826054773, "difficulty": "Easy", "likes": 643, "dislikes": 76, "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": 89105, "totalSubmissionRaw": 135100}, "604": {"acRate": 39.99462892905516, "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": 34253, "totalSubmissionRaw": 85644}, "605": {"acRate": 28.942899763051127, "difficulty": "Easy", "likes": 6613, "dislikes": 1193, "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": 886301, "totalSubmissionRaw": 3062245}, "606": {"acRate": 69.48959071741704, "difficulty": "Medium", "likes": 80, "dislikes": 40, "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": 324473, "totalSubmissionRaw": 466938}, "607": {"acRate": 65.76727680025601, "difficulty": "Easy", "likes": 1176, "dislikes": 102, "categoryTitle": "Database", "frontendQuestionId": "607", "paidOnly": false, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230171, "totalSubmissionRaw": 349978}, "608": {"acRate": 72.76747237898074, "difficulty": "Medium", "likes": 1245, "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": 168015, "totalSubmissionRaw": 230893}, "609": {"acRate": 67.64959597204373, "difficulty": "Medium", "likes": 1516, "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": 153708, "totalSubmissionRaw": 227212}, "610": {"acRate": 72.32718764375518, "difficulty": "Easy", "likes": 603, "dislikes": 172, "categoryTitle": "Database", "frontendQuestionId": "610", "paidOnly": false, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 218543, "totalSubmissionRaw": 302160}, "611": {"acRate": 51.41880653928846, "difficulty": "Medium", "likes": 3825, "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": 202804, "totalSubmissionRaw": 394416}, "612": {"acRate": 61.28924272635976, "difficulty": "Medium", "likes": 219, "dislikes": 70, "categoryTitle": "Database", "frontendQuestionId": "612", "paidOnly": true, "title": "Shortest Distance in a Plane", "titleSlug": "shortest-distance-in-a-plane", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42110, "totalSubmissionRaw": 68707}, "613": {"acRate": 80.19995440778975, "difficulty": "Easy", "likes": 330, "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": 73880, "totalSubmissionRaw": 92120}, "614": {"acRate": 38.96765982396305, "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": 54499, "totalSubmissionRaw": 139857}, "615": {"acRate": 56.2753036437247, "difficulty": "Hard", "likes": 237, "dislikes": 75, "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": 37390, "totalSubmissionRaw": 66442}, "616": {"acRate": 49.98592890851626, "difficulty": "Medium", "likes": 1081, "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": 92361, "totalSubmissionRaw": 184775}, "617": {"acRate": 79.08586316719082, "difficulty": "Easy", "likes": 8797, "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": 791639, "totalSubmissionRaw": 1000987}, "618": {"acRate": 63.42769701606733, "difficulty": "Hard", "likes": 187, "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": 24870, "totalSubmissionRaw": 39210}, "619": {"acRate": 65.70890960191817, "difficulty": "Easy", "likes": 660, "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": 248289, "totalSubmissionRaw": 377862}, "620": {"acRate": 74.1789917015447, "difficulty": "Easy", "likes": 1157, "dislikes": 542, "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": 564487, "totalSubmissionRaw": 760976}, "621": {"acRate": 60.29873909872939, "difficulty": "Medium", "likes": 10563, "dislikes": 2086, "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": 670605, "totalSubmissionRaw": 1112139}, "622": {"acRate": 51.74006794692095, "difficulty": "Medium", "likes": 3543, "dislikes": 294, "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": 331849, "totalSubmissionRaw": 641379}, "623": {"acRate": 64.05821173298611, "difficulty": "Medium", "likes": 3556, "dislikes": 266, "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": 278454, "totalSubmissionRaw": 434689}, "624": {"acRate": 45.88063587235218, "difficulty": "Medium", "likes": 1395, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "624", "paidOnly": false, "title": "Maximum Distance in Arrays", "titleSlug": "maximum-distance-in-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 174468, "totalSubmissionRaw": 380265}, "625": {"acRate": 33.70136543826164, "difficulty": "Medium", "likes": 129, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "625", "paidOnly": true, "title": "Minimum Factorization", "titleSlug": "minimum-factorization", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 11477, "totalSubmissionRaw": 34055}, "626": {"acRate": 70.73198441281058, "difficulty": "Medium", "likes": 1475, "dislikes": 589, "categoryTitle": "Database", "frontendQuestionId": "626", "paidOnly": false, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249036, "totalSubmissionRaw": 352084}, "627": {"acRate": 83.44887263337381, "difficulty": "Easy", "likes": 1728, "dislikes": 565, "categoryTitle": "Database", "frontendQuestionId": "627", "paidOnly": false, "title": "Swap Salary", "titleSlug": "swap-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 425288, "totalSubmissionRaw": 509639}, "628": {"acRate": 45.19460667110884, "difficulty": "Easy", "likes": 4232, "dislikes": 680, "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": 345915, "totalSubmissionRaw": 765390}, "629": {"acRate": 49.42289140673766, "difficulty": "Hard", "likes": 2684, "dislikes": 325, "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": 130642, "totalSubmissionRaw": 264335}, "630": {"acRate": 40.297725938915576, "difficulty": "Hard", "likes": 3801, "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": 114670, "totalSubmissionRaw": 284557}, "631": {"acRate": 44.168851723241914, "difficulty": "Hard", "likes": 239, "dislikes": 277, "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": 18698, "totalSubmissionRaw": 42333}, "632": {"acRate": 63.13520858509637, "difficulty": "Hard", "likes": 3484, "dislikes": 76, "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": 113370, "totalSubmissionRaw": 179567}, "633": {"acRate": 36.59538559024996, "difficulty": "Medium", "likes": 3215, "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": 358640, "totalSubmissionRaw": 980015}, "634": {"acRate": 41.87814462521576, "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": 11403, "totalSubmissionRaw": 27229}, "635": {"acRate": 60.33260632497274, "difficulty": "Medium", "likes": 473, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "635", "paidOnly": true, "title": "Design Log Storage System", "titleSlug": "design-log-storage-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35408, "totalSubmissionRaw": 58688}, "636": {"acRate": 62.43071360899063, "difficulty": "Medium", "likes": 1955, "dislikes": 2798, "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": 229317, "totalSubmissionRaw": 367315}, "637": {"acRate": 73.14879997870769, "difficulty": "Easy", "likes": 5285, "dislikes": 328, "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": 549671, "totalSubmissionRaw": 751443}, "638": {"acRate": 51.85670490506329, "difficulty": "Medium", "likes": 1509, "dislikes": 761, "categoryTitle": "Algorithms", "frontendQuestionId": "638", "paidOnly": false, "title": "Shopping Offers", "titleSlug": "shopping-offers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62925, "totalSubmissionRaw": 121344}, "639": {"acRate": 30.833792462770298, "difficulty": "Hard", "likes": 1577, "dislikes": 819, "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": 76671, "totalSubmissionRaw": 248659}, "640": {"acRate": 44.04187139500107, "difficulty": "Medium", "likes": 508, "dislikes": 839, "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": 41232, "totalSubmissionRaw": 93620}, "641": {"acRate": 57.255303030303025, "difficulty": "Medium", "likes": 1181, "dislikes": 77, "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": 75577, "totalSubmissionRaw": 132000}, "642": {"acRate": 49.09205349058731, "difficulty": "Hard", "likes": 2114, "dislikes": 180, "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": 145852, "totalSubmissionRaw": 297099}, "643": {"acRate": 43.76828063201955, "difficulty": "Easy", "likes": 3545, "dislikes": 328, "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": 552322, "totalSubmissionRaw": 1261923}, "644": {"acRate": 36.896264678273496, "difficulty": "Hard", "likes": 623, "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": 20832, "totalSubmissionRaw": 56461}, "645": {"acRate": 44.54291582350351, "difficulty": "Easy", "likes": 4767, "dislikes": 1164, "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": 471493, "totalSubmissionRaw": 1058514}, "646": {"acRate": 60.15903568836578, "difficulty": "Medium", "likes": 4609, "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": 247845, "totalSubmissionRaw": 411983}, "647": {"acRate": 70.59693512150615, "difficulty": "Medium", "likes": 10833, "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": 863498, "totalSubmissionRaw": 1223141}, "648": {"acRate": 68.06726863984697, "difficulty": "Medium", "likes": 2942, "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": 274015, "totalSubmissionRaw": 402565}, "649": {"acRate": 47.93528618842107, "difficulty": "Medium", "likes": 2399, "dislikes": 1830, "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": 169266, "totalSubmissionRaw": 353117}, "650": {"acRate": 59.597936762510464, "difficulty": "Medium", "likes": 4192, "dislikes": 244, "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": 257888, "totalSubmissionRaw": 432714}, "651": {"acRate": 55.7930402930403, "difficulty": "Medium", "likes": 710, "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": 30463, "totalSubmissionRaw": 54600}, "652": {"acRate": 59.611546340991616, "difficulty": "Medium", "likes": 5852, "dislikes": 476, "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": 271192, "totalSubmissionRaw": 454932}, "653": {"acRate": 61.5283496684645, "difficulty": "Easy", "likes": 6784, "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": 572904, "totalSubmissionRaw": 931122}, "654": {"acRate": 85.56659872074225, "difficulty": "Medium", "likes": 5232, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "654", "paidOnly": false, "title": "Maximum Binary Tree", "titleSlug": "maximum-binary-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 304338, "totalSubmissionRaw": 355674}, "655": {"acRate": 64.50038002414271, "difficulty": "Medium", "likes": 496, "dislikes": 455, "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": 72133, "totalSubmissionRaw": 111833}, "656": {"acRate": 32.167063153642445, "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": 14333, "totalSubmissionRaw": 44558}, "657": {"acRate": 75.90938374897796, "difficulty": "Easy", "likes": 2437, "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": 446562, "totalSubmissionRaw": 588283}, "658": {"acRate": 47.74996860077673, "difficulty": "Medium", "likes": 8253, "dislikes": 708, "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": 581682, "totalSubmissionRaw": 1218183}, "659": {"acRate": 51.16797387391222, "difficulty": "Medium", "likes": 4436, "dislikes": 805, "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": 132238, "totalSubmissionRaw": 258439}, "660": {"acRate": 57.39641835329024, "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": 10833, "totalSubmissionRaw": 18874}, "661": {"acRate": 67.54100313728605, "difficulty": "Easy", "likes": 1138, "dislikes": 2914, "categoryTitle": "Algorithms", "frontendQuestionId": "661", "paidOnly": false, "title": "Image Smoother", "titleSlug": "image-smoother", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 170075, "totalSubmissionRaw": 251810}, "662": {"acRate": 43.18411976146342, "difficulty": "Medium", "likes": 8822, "dislikes": 1221, "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": 409796, "totalSubmissionRaw": 948952}, "663": {"acRate": 41.59368023355658, "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": 31486, "totalSubmissionRaw": 75699}, "664": {"acRate": 61.20184745138726, "difficulty": "Hard", "likes": 2636, "dislikes": 280, "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": 146291, "totalSubmissionRaw": 239031}, "665": {"acRate": 24.82337481212303, "difficulty": "Medium", "likes": 5730, "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": 268050, "totalSubmissionRaw": 1079829}, "666": {"acRate": 62.45594087549744, "difficulty": "Medium", "likes": 415, "dislikes": 517, "categoryTitle": "Algorithms", "frontendQuestionId": "666", "paidOnly": true, "title": "Path Sum IV", "titleSlug": "path-sum-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38451, "totalSubmissionRaw": 61565}, "667": {"acRate": 60.27921292733869, "difficulty": "Medium", "likes": 795, "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": 54836, "totalSubmissionRaw": 90970}, "668": {"acRate": 52.10543830729107, "difficulty": "Hard", "likes": 2163, "dislikes": 59, "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": 67327, "totalSubmissionRaw": 129213}, "669": {"acRate": 66.28611221560017, "difficulty": "Medium", "likes": 5863, "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": 301743, "totalSubmissionRaw": 455213}, "670": {"acRate": 48.968339595967116, "difficulty": "Medium", "likes": 3393, "dislikes": 209, "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": 263243, "totalSubmissionRaw": 537579}, "671": {"acRate": 44.7226501447462, "difficulty": "Easy", "likes": 1862, "dislikes": 1880, "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": 199442, "totalSubmissionRaw": 445952}, "672": {"acRate": 50.161662817551964, "difficulty": "Medium", "likes": 164, "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": 23892, "totalSubmissionRaw": 47630}, "673": {"acRate": 48.66876032141428, "difficulty": "Medium", "likes": 6827, "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": 245785, "totalSubmissionRaw": 505016}, "674": {"acRate": 50.48934934762579, "difficulty": "Easy", "likes": 2349, "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": 275636, "totalSubmissionRaw": 545929}, "675": {"acRate": 34.57739498957586, "difficulty": "Hard", "likes": 1233, "dislikes": 675, "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": 70819, "totalSubmissionRaw": 204813}, "676": {"acRate": 57.67984964210021, "difficulty": "Medium", "likes": 1409, "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": 86544, "totalSubmissionRaw": 150042}, "677": {"acRate": 56.87297215724742, "difficulty": "Medium", "likes": 1660, "dislikes": 158, "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": 120598, "totalSubmissionRaw": 212048}, "678": {"acRate": 38.192322574619396, "difficulty": "Medium", "likes": 6207, "dislikes": 193, "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": 400736, "totalSubmissionRaw": 1049255}, "679": {"acRate": 49.45078441913885, "difficulty": "Hard", "likes": 1472, "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": 80945, "totalSubmissionRaw": 163688}, "680": {"acRate": 41.24752944485096, "difficulty": "Easy", "likes": 8279, "dislikes": 447, "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": 792000, "totalSubmissionRaw": 1920115}, "681": {"acRate": 46.80081555303633, "difficulty": "Medium", "likes": 731, "dislikes": 1066, "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": 110639, "totalSubmissionRaw": 236404}, "682": {"acRate": 77.16609645338632, "difficulty": "Easy", "likes": 2879, "dislikes": 1918, "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": 387256, "totalSubmissionRaw": 501850}, "683": {"acRate": 37.16784372652141, "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": 61838, "totalSubmissionRaw": 166375}, "684": {"acRate": 63.38417385920052, "difficulty": "Medium", "likes": 6234, "dislikes": 406, "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": 386942, "totalSubmissionRaw": 610471}, "685": {"acRate": 34.613969026924494, "difficulty": "Hard", "likes": 2343, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "685", "paidOnly": false, "title": "Redundant Connection II", "titleSlug": "redundant-connection-ii", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73356, "totalSubmissionRaw": 211926}, "686": {"acRate": 35.522774368216716, "difficulty": "Medium", "likes": 2572, "dislikes": 985, "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": 178968, "totalSubmissionRaw": 503812}, "687": {"acRate": 41.824437192322584, "difficulty": "Medium", "likes": 4253, "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": 189036, "totalSubmissionRaw": 451975}, "688": {"acRate": 56.31263650984275, "difficulty": "Medium", "likes": 3853, "dislikes": 478, "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": 160366, "totalSubmissionRaw": 284777}, "689": {"acRate": 50.30479622742783, "difficulty": "Hard", "likes": 1973, "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": 78726, "totalSubmissionRaw": 156498}, "690": {"acRate": 67.3957393142843, "difficulty": "Medium", "likes": 2108, "dislikes": 1338, "categoryTitle": "Algorithms", "frontendQuestionId": "690", "paidOnly": false, "title": "Employee Importance", "titleSlug": "employee-importance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 218032, "totalSubmissionRaw": 323512}, "691": {"acRate": 49.08629278483046, "difficulty": "Hard", "likes": 1233, "dislikes": 115, "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": 76366, "totalSubmissionRaw": 155575}, "692": {"acRate": 58.38548786886266, "difficulty": "Medium", "likes": 7676, "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": 637631, "totalSubmissionRaw": 1092106}, "693": {"acRate": 62.86453031108389, "difficulty": "Easy", "likes": 1365, "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": 139558, "totalSubmissionRaw": 221998}, "694": {"acRate": 61.58266282878976, "difficulty": "Medium", "likes": 2242, "dislikes": 143, "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": 173509, "totalSubmissionRaw": 281746}, "695": {"acRate": 72.44547779732345, "difficulty": "Medium", "likes": 9997, "dislikes": 204, "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": 921661, "totalSubmissionRaw": 1272218}, "696": {"acRate": 65.65546929614776, "difficulty": "Easy", "likes": 3991, "dislikes": 874, "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": 214134, "totalSubmissionRaw": 326148}, "697": {"acRate": 56.71745294123668, "difficulty": "Easy", "likes": 3045, "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": 221641, "totalSubmissionRaw": 390783}, "698": {"acRate": 38.17342876369426, "difficulty": "Medium", "likes": 7162, "dislikes": 517, "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": 277396, "totalSubmissionRaw": 726673}, "699": {"acRate": 45.43834351355292, "difficulty": "Hard", "likes": 635, "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": 28045, "totalSubmissionRaw": 61721}, "700": {"acRate": 80.51665557639183, "difficulty": "Easy", "likes": 5985, "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": 958334, "totalSubmissionRaw": 1190231}, "701": {"acRate": 73.67234539328311, "difficulty": "Medium", "likes": 5887, "dislikes": 178, "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": 576795, "totalSubmissionRaw": 782919}, "702": {"acRate": 72.30685842306859, "difficulty": "Medium", "likes": 911, "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": 100049, "totalSubmissionRaw": 138368}, "703": {"acRate": 59.18436882070303, "difficulty": "Easy", "likes": 5852, "dislikes": 3737, "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": 698278, "totalSubmissionRaw": 1179835}, "704": {"acRate": 58.283535365736086, "difficulty": "Easy", "likes": 11939, "dislikes": 254, "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": 2629781, "totalSubmissionRaw": 4512050}, "705": {"acRate": 67.13566869912788, "difficulty": "Easy", "likes": 3789, "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": 438549, "totalSubmissionRaw": 653228}, "706": {"acRate": 65.59340960739753, "difficulty": "Easy", "likes": 5119, "dislikes": 468, "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": 602660, "totalSubmissionRaw": 918781}, "707": {"acRate": 28.42316898192383, "difficulty": "Medium", "likes": 2666, "dislikes": 1624, "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": 351024, "totalSubmissionRaw": 1234994}, "708": {"acRate": 36.53077216741345, "difficulty": "Medium", "likes": 1224, "dislikes": 779, "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": 181807, "totalSubmissionRaw": 497679}, "709": {"acRate": 83.62728491616711, "difficulty": "Easy", "likes": 1859, "dislikes": 2775, "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": 549498, "totalSubmissionRaw": 657079}, "710": {"acRate": 33.5478019550236, "difficulty": "Hard", "likes": 867, "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": 43277, "totalSubmissionRaw": 129001}, "711": {"acRate": 53.07667451414855, "difficulty": "Hard", "likes": 263, "dislikes": 274, "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": 11498, "totalSubmissionRaw": 21663}, "712": {"acRate": 65.2238221603515, "difficulty": "Medium", "likes": 3991, "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": 149930, "totalSubmissionRaw": 229870}, "713": {"acRate": 51.7328487535055, "difficulty": "Medium", "likes": 6877, "dislikes": 220, "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": 427600, "totalSubmissionRaw": 826555}, "714": {"acRate": 69.22296548667663, "difficulty": "Medium", "likes": 7195, "dislikes": 215, "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": 399852, "totalSubmissionRaw": 577630}, "715": {"acRate": 43.87214338025407, "difficulty": "Hard", "likes": 1500, "dislikes": 127, "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": 76080, "totalSubmissionRaw": 173413}, "716": {"acRate": 45.072462089178764, "difficulty": "Hard", "likes": 1926, "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": 155625, "totalSubmissionRaw": 345280}, "717": {"acRate": 45.20114764722549, "difficulty": "Easy", "likes": 872, "dislikes": 2117, "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": 138796, "totalSubmissionRaw": 307063}, "718": {"acRate": 50.947908414139896, "difficulty": "Medium", "likes": 6817, "dislikes": 170, "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": 311253, "totalSubmissionRaw": 610924}, "719": {"acRate": 45.28056429433529, "difficulty": "Hard", "likes": 3719, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "719", "paidOnly": false, "title": "Find K-th Smallest Pair Distance", "titleSlug": "find-k-th-smallest-pair-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 183082, "totalSubmissionRaw": 404328}, "720": {"acRate": 52.718867495350366, "difficulty": "Medium", "likes": 1975, "dislikes": 1497, "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": 157600, "totalSubmissionRaw": 298946}, "721": {"acRate": 57.84130479664166, "difficulty": "Medium", "likes": 6825, "dislikes": 1175, "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": 420241, "totalSubmissionRaw": 726545}, "722": {"acRate": 38.94011026120282, "difficulty": "Medium", "likes": 720, "dislikes": 1813, "categoryTitle": "Algorithms", "frontendQuestionId": "722", "paidOnly": false, "title": "Remove Comments", "titleSlug": "remove-comments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74374, "totalSubmissionRaw": 190998}, "723": {"acRate": 76.92074128363522, "difficulty": "Medium", "likes": 1017, "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": 73467, "totalSubmissionRaw": 95510}, "724": {"acRate": 58.51828022423198, "difficulty": "Easy", "likes": 8417, "dislikes": 857, "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": 1175103, "totalSubmissionRaw": 2008097}, "725": {"acRate": 64.34123068650072, "difficulty": "Medium", "likes": 3968, "dislikes": 318, "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": 205798, "totalSubmissionRaw": 319854}, "726": {"acRate": 65.19393095205663, "difficulty": "Hard", "likes": 1880, "dislikes": 407, "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": 148369, "totalSubmissionRaw": 227581}, "727": {"acRate": 43.53461592472968, "difficulty": "Hard", "likes": 1457, "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": 93003, "totalSubmissionRaw": 213630}, "728": {"acRate": 78.95959314044717, "difficulty": "Easy", "likes": 1789, "dislikes": 376, "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": 254620, "totalSubmissionRaw": 322469}, "729": {"acRate": 56.58300565129964, "difficulty": "Medium", "likes": 4224, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "729", "paidOnly": false, "title": "My Calendar I", "titleSlug": "my-calendar-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290960, "totalSubmissionRaw": 514218}, "730": {"acRate": 45.923916320009646, "difficulty": "Hard", "likes": 1931, "dislikes": 99, "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": 38087, "totalSubmissionRaw": 82935}, "731": {"acRate": 55.78205382671809, "difficulty": "Medium", "likes": 1754, "dislikes": 149, "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": 103985, "totalSubmissionRaw": 186413}, "732": {"acRate": 71.67580866026599, "difficulty": "Hard", "likes": 1966, "dislikes": 270, "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": 92646, "totalSubmissionRaw": 129257}, "733": {"acRate": 64.75003568784588, "difficulty": "Easy", "likes": 8492, "dislikes": 884, "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": 975190, "totalSubmissionRaw": 1506085}, "734": {"acRate": 44.39970405871684, "difficulty": "Easy", "likes": 49, "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": 67813, "totalSubmissionRaw": 152733}, "735": {"acRate": 44.683937616922194, "difficulty": "Medium", "likes": 8077, "dislikes": 1106, "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": 581850, "totalSubmissionRaw": 1302146}, "736": {"acRate": 52.024213185262724, "difficulty": "Hard", "likes": 477, "dislikes": 363, "categoryTitle": "Algorithms", "frontendQuestionId": "736", "paidOnly": false, "title": "Parse Lisp Expression", "titleSlug": "parse-lisp-expression", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22861, "totalSubmissionRaw": 43943}, "737": {"acRate": 50.174189376186476, "difficulty": "Medium", "likes": 841, "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": 72154, "totalSubmissionRaw": 143808}, "738": {"acRate": 48.33100625276431, "difficulty": "Medium", "likes": 1327, "dislikes": 106, "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": 55730, "totalSubmissionRaw": 115309}, "739": {"acRate": 66.29949530536888, "difficulty": "Medium", "likes": 13282, "dislikes": 329, "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": 1065111, "totalSubmissionRaw": 1606514}, "740": {"acRate": 56.531031973294944, "difficulty": "Medium", "likes": 7567, "dislikes": 383, "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": 357326, "totalSubmissionRaw": 632089}, "741": {"acRate": 37.21629558532816, "difficulty": "Hard", "likes": 4302, "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": 84528, "totalSubmissionRaw": 227128}, "742": {"acRate": 46.47138723203212, "difficulty": "Medium", "likes": 862, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "742", "paidOnly": true, "title": "Closest Leaf in a Binary Tree", "titleSlug": "closest-leaf-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47213, "totalSubmissionRaw": 101597}, "743": {"acRate": 54.96563378450839, "difficulty": "Medium", "likes": 7493, "dislikes": 369, "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": 541233, "totalSubmissionRaw": 984680}, "744": {"acRate": 52.70156565210877, "difficulty": "Easy", "likes": 4464, "dislikes": 2197, "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": 513601, "totalSubmissionRaw": 974543}, "745": {"acRate": 41.161254792668835, "difficulty": "Hard", "likes": 2279, "dislikes": 485, "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": 98659, "totalSubmissionRaw": 239689}, "746": {"acRate": 66.18562140592842, "difficulty": "Easy", "likes": 11490, "dislikes": 1776, "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": 1261890, "totalSubmissionRaw": 1906592}, "747": {"acRate": 49.36952200970969, "difficulty": "Easy", "likes": 1211, "dislikes": 906, "categoryTitle": "Algorithms", "frontendQuestionId": "747", "paidOnly": false, "title": "Largest Number At Least Twice of Others", "titleSlug": "largest-number-at-least-twice-of-others", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 257584, "totalSubmissionRaw": 521747}, "748": {"acRate": 60.434825188522176, "difficulty": "Easy", "likes": 553, "dislikes": 1108, "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": 80223, "totalSubmissionRaw": 132743}, "749": {"acRate": 51.44531098436348, "difficulty": "Hard", "likes": 396, "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": 13259, "totalSubmissionRaw": 25773}, "750": {"acRate": 67.8117048346056, "difficulty": "Medium", "likes": 622, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "750", "paidOnly": true, "title": "Number Of Corner Rectangles", "titleSlug": "number-of-corner-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38909, "totalSubmissionRaw": 57378}, "751": {"acRate": 55.54650343491281, "difficulty": "Medium", "likes": 90, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "751", "paidOnly": true, "title": "IP to CIDR", "titleSlug": "ip-to-cidr", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25227, "totalSubmissionRaw": 45416}, "752": {"acRate": 60.357731594595386, "difficulty": "Medium", "likes": 4777, "dislikes": 221, "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": 328066, "totalSubmissionRaw": 543536}, "753": {"acRate": 57.151900528160695, "difficulty": "Hard", "likes": 567, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "753", "paidOnly": false, "title": "Cracking the Safe", "titleSlug": "cracking-the-safe", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Eulerian Circuit", "id": "VG9waWNUYWdOb2RlOjYxMDc0", "slug": "eulerian-circuit"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60489, "totalSubmissionRaw": 105839}, "754": {"acRate": 43.36051606621227, "difficulty": "Medium", "likes": 1823, "dislikes": 813, "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": 57000, "totalSubmissionRaw": 131456}, "755": {"acRate": 47.131792327241925, "difficulty": "Medium", "likes": 302, "dislikes": 764, "categoryTitle": "Algorithms", "frontendQuestionId": "755", "paidOnly": true, "title": "Pour Water", "titleSlug": "pour-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38945, "totalSubmissionRaw": 82630}, "756": {"acRate": 52.93729271588256, "difficulty": "Medium", "likes": 537, "dislikes": 480, "categoryTitle": "Algorithms", "frontendQuestionId": "756", "paidOnly": false, "title": "Pyramid Transition Matrix", "titleSlug": "pyramid-transition-matrix", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34477, "totalSubmissionRaw": 65128}, "757": {"acRate": 44.714782253117974, "difficulty": "Hard", "likes": 714, "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": 24057, "totalSubmissionRaw": 53801}, "758": {"acRate": 51.581123161172556, "difficulty": "Medium", "likes": 270, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "758", "paidOnly": true, "title": "Bold Words in String", "titleSlug": "bold-words-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19215, "totalSubmissionRaw": 37252}, "759": {"acRate": 72.25321322226829, "difficulty": "Hard", "likes": 1904, "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": 153356, "totalSubmissionRaw": 212248}, "760": {"acRate": 83.70607028753993, "difficulty": "Easy", "likes": 612, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "760", "paidOnly": true, "title": "Find Anagram Mappings", "titleSlug": "find-anagram-mappings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 103228, "totalSubmissionRaw": 123322}, "761": {"acRate": 61.54104753580313, "difficulty": "Hard", "likes": 707, "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": 18306, "totalSubmissionRaw": 29746}, "762": {"acRate": 69.92560091568104, "difficulty": "Easy", "likes": 718, "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": 102634, "totalSubmissionRaw": 146776}, "763": {"acRate": 79.9898760606117, "difficulty": "Medium", "likes": 10324, "dislikes": 401, "categoryTitle": "Algorithms", "frontendQuestionId": "763", "paidOnly": false, "title": "Partition Labels", "titleSlug": "partition-labels", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 557811, "totalSubmissionRaw": 697352}, "764": {"acRate": 48.39022746960121, "difficulty": "Medium", "likes": 1472, "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": 60330, "totalSubmissionRaw": 124675}, "765": {"acRate": 57.605007028822655, "difficulty": "Hard", "likes": 2361, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "765", "paidOnly": false, "title": "Couples Holding Hands", "titleSlug": "couples-holding-hands", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64335, "totalSubmissionRaw": 111683}, "766": {"acRate": 69.13291863906213, "difficulty": "Easy", "likes": 3547, "dislikes": 169, "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": 345971, "totalSubmissionRaw": 500445}, "767": {"acRate": 54.95746444809395, "difficulty": "Medium", "likes": 8542, "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": 416287, "totalSubmissionRaw": 757467}, "768": {"acRate": 53.4520744728071, "difficulty": "Hard", "likes": 1841, "dislikes": 57, "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": 66233, "totalSubmissionRaw": 123911}, "769": {"acRate": 58.56354177162828, "difficulty": "Medium", "likes": 2829, "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": 110428, "totalSubmissionRaw": 188561}, "770": {"acRate": 55.723419614313705, "difficulty": "Hard", "likes": 168, "dislikes": 1413, "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": 10807, "totalSubmissionRaw": 19394}, "771": {"acRate": 88.8380031428319, "difficulty": "Easy", "likes": 5121, "dislikes": 596, "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": 1096187, "totalSubmissionRaw": 1233917}, "772": {"acRate": 51.03117993904085, "difficulty": "Hard", "likes": 1136, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "772", "paidOnly": true, "title": "Basic Calculator III", "titleSlug": "basic-calculator-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130425, "totalSubmissionRaw": 255579}, "773": {"acRate": 65.08642041422891, "difficulty": "Hard", "likes": 2031, "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": 97230, "totalSubmissionRaw": 149386}, "774": {"acRate": 52.38440524771508, "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": 31065, "totalSubmissionRaw": 59302}, "775": {"acRate": 42.4352968282006, "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": 77357, "totalSubmissionRaw": 182294}, "776": {"acRate": 82.6082334897423, "difficulty": "Medium", "likes": 1060, "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": 108800, "totalSubmissionRaw": 131706}, "777": {"acRate": 36.88448670207738, "difficulty": "Medium", "likes": 1225, "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": 78052, "totalSubmissionRaw": 211612}, "778": {"acRate": 61.45268721981206, "difficulty": "Hard", "likes": 3736, "dislikes": 250, "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": 178340, "totalSubmissionRaw": 290207}, "779": {"acRate": 46.77015334075699, "difficulty": "Medium", "likes": 3807, "dislikes": 397, "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": 210425, "totalSubmissionRaw": 449913}, "780": {"acRate": 33.34918717360906, "difficulty": "Hard", "likes": 1528, "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": 70117, "totalSubmissionRaw": 210253}, "781": {"acRate": 53.02830440817664, "difficulty": "Medium", "likes": 1348, "dislikes": 624, "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": 61506, "totalSubmissionRaw": 115988}, "782": {"acRate": 50.89748256839629, "difficulty": "Hard", "likes": 361, "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": 18176, "totalSubmissionRaw": 35711}, "783": {"acRate": 59.765326699803836, "difficulty": "Easy", "likes": 3498, "dislikes": 420, "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": 261395, "totalSubmissionRaw": 437370}, "784": {"acRate": 74.43937279644607, "difficulty": "Medium", "likes": 4664, "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": 311000, "totalSubmissionRaw": 417790}, "785": {"acRate": 56.324677608604425, "difficulty": "Medium", "likes": 8337, "dislikes": 387, "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": 605323, "totalSubmissionRaw": 1074703}, "786": {"acRate": 68.21330326944758, "difficulty": "Medium", "likes": 2019, "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": 151263, "totalSubmissionRaw": 221750}, "787": {"acRate": 39.58073425167913, "difficulty": "Medium", "likes": 10016, "dislikes": 417, "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": 608515, "totalSubmissionRaw": 1537399}, "788": {"acRate": 56.457655475381564, "difficulty": "Medium", "likes": 748, "dislikes": 1929, "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": 110010, "totalSubmissionRaw": 194854}, "789": {"acRate": 62.10721632850631, "difficulty": "Medium", "likes": 293, "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": 30794, "totalSubmissionRaw": 49582}, "790": {"acRate": 49.92969826978676, "difficulty": "Medium", "likes": 3481, "dislikes": 1119, "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": 145238, "totalSubmissionRaw": 290881}, "791": {"acRate": 70.95463341554937, "difficulty": "Medium", "likes": 3624, "dislikes": 415, "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": 451363, "totalSubmissionRaw": 636129}, "792": {"acRate": 50.84475267561106, "difficulty": "Medium", "likes": 5508, "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": 234165, "totalSubmissionRaw": 460549}, "793": {"acRate": 45.003794586390086, "difficulty": "Hard", "likes": 439, "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": 19569, "totalSubmissionRaw": 43483}, "794": {"acRate": 34.70933414057679, "difficulty": "Medium", "likes": 550, "dislikes": 1151, "categoryTitle": "Algorithms", "frontendQuestionId": "794", "paidOnly": false, "title": "Valid Tic-Tac-Toe State", "titleSlug": "valid-tic-tac-toe-state", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59623, "totalSubmissionRaw": 171778}, "795": {"acRate": 53.333086876155264, "difficulty": "Medium", "likes": 2302, "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": 72133, "totalSubmissionRaw": 135250}, "796": {"acRate": 59.11660325793101, "difficulty": "Easy", "likes": 3662, "dislikes": 187, "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": 360801, "totalSubmissionRaw": 610322}, "797": {"acRate": 82.63772575352225, "difficulty": "Medium", "likes": 7265, "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": 545185, "totalSubmissionRaw": 659730}, "798": {"acRate": 51.72080017208002, "difficulty": "Hard", "likes": 542, "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": 14427, "totalSubmissionRaw": 27894}, "799": {"acRate": 58.24711596391143, "difficulty": "Medium", "likes": 3657, "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": 156623, "totalSubmissionRaw": 268894}, "800": {"acRate": 67.58184552500674, "difficulty": "Easy", "likes": 108, "dislikes": 684, "categoryTitle": "Algorithms", "frontendQuestionId": "800", "paidOnly": true, "title": "Similar RGB Color", "titleSlug": "similar-rgb-color", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17526, "totalSubmissionRaw": 25933}, "801": {"acRate": 40.26053518804638, "difficulty": "Hard", "likes": 2820, "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": 81561, "totalSubmissionRaw": 202583}, "802": {"acRate": 63.973351044149105, "difficulty": "Medium", "likes": 5811, "dislikes": 462, "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": 278371, "totalSubmissionRaw": 435137}, "803": {"acRate": 34.954936731620705, "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": 31105, "totalSubmissionRaw": 88986}, "804": {"acRate": 82.96883273468283, "difficulty": "Easy", "likes": 2522, "dislikes": 1536, "categoryTitle": "Algorithms", "frontendQuestionId": "804", "paidOnly": false, "title": "Unique Morse Code Words", "titleSlug": "unique-morse-code-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 361958, "totalSubmissionRaw": 436258}, "805": {"acRate": 25.55321064969169, "difficulty": "Hard", "likes": 1274, "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": 37164, "totalSubmissionRaw": 145461}, "806": {"acRate": 69.04223258549015, "difficulty": "Easy", "likes": 605, "dislikes": 1335, "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": 84536, "totalSubmissionRaw": 122441}, "807": {"acRate": 86.22069169889792, "difficulty": "Medium", "likes": 2574, "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": 168752, "totalSubmissionRaw": 195721}, "808": {"acRate": 53.80244064367234, "difficulty": "Medium", "likes": 988, "dislikes": 2686, "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": 68073, "totalSubmissionRaw": 126524}, "809": {"acRate": 46.21161439018071, "difficulty": "Medium", "likes": 869, "dislikes": 1908, "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": 119500, "totalSubmissionRaw": 258593}, "810": {"acRate": 60.80466893915918, "difficulty": "Hard", "likes": 226, "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": 11773, "totalSubmissionRaw": 19362}, "811": {"acRate": 76.3965957723789, "difficulty": "Medium", "likes": 1559, "dislikes": 1300, "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": 234740, "totalSubmissionRaw": 307265}, "812": {"acRate": 61.06782461153778, "difficulty": "Easy", "likes": 532, "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": 54705, "totalSubmissionRaw": 89581}, "813": {"acRate": 53.67569195496099, "difficulty": "Medium", "likes": 2107, "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": 55250, "totalSubmissionRaw": 102933}, "814": {"acRate": 72.26408272470894, "difficulty": "Medium", "likes": 4532, "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": 249833, "totalSubmissionRaw": 345722}, "815": {"acRate": 47.53031985908699, "difficulty": "Hard", "likes": 4268, "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": 211825, "totalSubmissionRaw": 445664}, "816": {"acRate": 56.90828622433799, "difficulty": "Medium", "likes": 322, "dislikes": 662, "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": 30603, "totalSubmissionRaw": 53776}, "817": {"acRate": 56.92266182920388, "difficulty": "Medium", "likes": 1103, "dislikes": 2233, "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": 99157, "totalSubmissionRaw": 174196}, "818": {"acRate": 43.81414063068085, "difficulty": "Hard", "likes": 1911, "dislikes": 182, "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": 90382, "totalSubmissionRaw": 206285}, "819": {"acRate": 44.32923796319213, "difficulty": "Easy", "likes": 1712, "dislikes": 3062, "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": 368962, "totalSubmissionRaw": 832322}, "820": {"acRate": 60.47315290766087, "difficulty": "Medium", "likes": 1754, "dislikes": 654, "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": 97646, "totalSubmissionRaw": 161470}, "821": {"acRate": 71.7573369514711, "difficulty": "Easy", "likes": 3149, "dislikes": 180, "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": 193038, "totalSubmissionRaw": 269015}, "822": {"acRate": 48.049895850791295, "difficulty": "Medium", "likes": 175, "dislikes": 757, "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": 20069, "totalSubmissionRaw": 41767}, "823": {"acRate": 52.894913161374966, "difficulty": "Medium", "likes": 3302, "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": 150787, "totalSubmissionRaw": 285069}, "824": {"acRate": 68.47534649525673, "difficulty": "Easy", "likes": 915, "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": 184135, "totalSubmissionRaw": 268907}, "825": {"acRate": 47.96680920382814, "difficulty": "Medium", "likes": 768, "dislikes": 1218, "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": 94224, "totalSubmissionRaw": 196438}, "826": {"acRate": 55.887952858084965, "difficulty": "Medium", "likes": 2372, "dislikes": 170, "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": 210167, "totalSubmissionRaw": 376050}, "827": {"acRate": 48.42724441327978, "difficulty": "Hard", "likes": 3954, "dislikes": 78, "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": 195436, "totalSubmissionRaw": 403577}, "828": {"acRate": 52.610993958737026, "difficulty": "Hard", "likes": 2160, "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": 73849, "totalSubmissionRaw": 140368}, "829": {"acRate": 41.88374194097697, "difficulty": "Hard", "likes": 1376, "dislikes": 1381, "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": 88546, "totalSubmissionRaw": 211409}, "830": {"acRate": 52.4840284010345, "difficulty": "Easy", "likes": 879, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "830", "paidOnly": false, "title": "Positions of Large Groups", "titleSlug": "positions-of-large-groups", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98829, "totalSubmissionRaw": 188303}, "831": {"acRate": 49.40698068451373, "difficulty": "Medium", "likes": 169, "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": 20412, "totalSubmissionRaw": 41314}, "832": {"acRate": 82.3232286380369, "difficulty": "Easy", "likes": 3460, "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": 451291, "totalSubmissionRaw": 548194}, "833": {"acRate": 52.188632281507374, "difficulty": "Medium", "likes": 1191, "dislikes": 1020, "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": 151382, "totalSubmissionRaw": 290067}, "834": {"acRate": 65.29320288488618, "difficulty": "Hard", "likes": 5596, "dislikes": 138, "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": 159969, "totalSubmissionRaw": 245001}, "835": {"acRate": 63.65174928088836, "difficulty": "Medium", "likes": 1334, "dislikes": 482, "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": 95153, "totalSubmissionRaw": 149490}, "836": {"acRate": 45.05350755092572, "difficulty": "Easy", "likes": 1997, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "836", "paidOnly": false, "title": "Rectangle Overlap", "titleSlug": "rectangle-overlap", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150506, "totalSubmissionRaw": 334063}, "837": {"acRate": 44.95643441362056, "difficulty": "Medium", "likes": 1987, "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": 77446, "totalSubmissionRaw": 172269}, "838": {"acRate": 57.239525104896046, "difficulty": "Medium", "likes": 3389, "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": 126461, "totalSubmissionRaw": 220933}, "839": {"acRate": 55.112720875017395, "difficulty": "Hard", "likes": 2349, "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": 122795, "totalSubmissionRaw": 222807}, "840": {"acRate": 51.723600853378926, "difficulty": "Medium", "likes": 807, "dislikes": 1826, "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": 142797, "totalSubmissionRaw": 276078}, "841": {"acRate": 73.548210821033, "difficulty": "Medium", "likes": 6168, "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": 479144, "totalSubmissionRaw": 651470}, "842": {"acRate": 39.16452367601849, "difficulty": "Medium", "likes": 1135, "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": 40511, "totalSubmissionRaw": 103438}, "843": {"acRate": 38.749059175864375, "difficulty": "Hard", "likes": 1547, "dislikes": 1790, "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": 147241, "totalSubmissionRaw": 379986}, "844": {"acRate": 49.258564186844936, "difficulty": "Easy", "likes": 7552, "dislikes": 355, "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": 855406, "totalSubmissionRaw": 1736563}, "845": {"acRate": 40.57938577123396, "difficulty": "Medium", "likes": 2787, "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": 134166, "totalSubmissionRaw": 330626}, "846": {"acRate": 56.749786111507206, "difficulty": "Medium", "likes": 3282, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "846", "paidOnly": false, "title": "Hand of Straights", "titleSlug": "hand-of-straights", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 318387, "totalSubmissionRaw": 561037}, "847": {"acRate": 65.40771732151363, "difficulty": "Hard", "likes": 4334, "dislikes": 171, "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": 126318, "totalSubmissionRaw": 193124}, "848": {"acRate": 44.82802960098965, "difficulty": "Medium", "likes": 1376, "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": 101101, "totalSubmissionRaw": 225532}, "849": {"acRate": 48.3018922629908, "difficulty": "Medium", "likes": 3226, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "849", "paidOnly": false, "title": "Maximize Distance to Closest Person", "titleSlug": "maximize-distance-to-closest-person", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233231, "totalSubmissionRaw": 482861}, "850": {"acRate": 54.29537118433417, "difficulty": "Hard", "likes": 970, "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": 35823, "totalSubmissionRaw": 65978}, "851": {"acRate": 60.098364161231686, "difficulty": "Medium", "likes": 1315, "dislikes": 816, "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": 50589, "totalSubmissionRaw": 84177}, "852": {"acRate": 68.21563024268893, "difficulty": "Medium", "likes": 7588, "dislikes": 1923, "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": 864861, "totalSubmissionRaw": 1267835}, "853": {"acRate": 51.79677157620532, "difficulty": "Medium", "likes": 3606, "dislikes": 1008, "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": 291100, "totalSubmissionRaw": 562005}, "854": {"acRate": 40.004052753339295, "difficulty": "Hard", "likes": 1138, "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": 47380, "totalSubmissionRaw": 118438}, "855": {"acRate": 43.56763012151104, "difficulty": "Medium", "likes": 1335, "dislikes": 487, "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": 63248, "totalSubmissionRaw": 145172}, "856": {"acRate": 64.02604937777599, "difficulty": "Medium", "likes": 5434, "dislikes": 210, "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": 192009, "totalSubmissionRaw": 299892}, "857": {"acRate": 63.509631973042126, "difficulty": "Hard", "likes": 2918, "dislikes": 395, "categoryTitle": "Algorithms", "frontendQuestionId": "857", "paidOnly": false, "title": "Minimum Cost to Hire K Workers", "titleSlug": "minimum-cost-to-hire-k-workers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141730, "totalSubmissionRaw": 223163}, "858": {"acRate": 62.44997416777836, "difficulty": "Medium", "likes": 1109, "dislikes": 2548, "categoryTitle": "Algorithms", "frontendQuestionId": "858", "paidOnly": false, "title": "Mirror Reflection", "titleSlug": "mirror-reflection", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80987, "totalSubmissionRaw": 129679}, "859": {"acRate": 33.18717253167849, "difficulty": "Easy", "likes": 3189, "dislikes": 1800, "categoryTitle": "Algorithms", "frontendQuestionId": "859", "paidOnly": false, "title": "Buddy Strings", "titleSlug": "buddy-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250067, "totalSubmissionRaw": 753505}, "860": {"acRate": 58.29326691924535, "difficulty": "Easy", "likes": 2876, "dislikes": 190, "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": 363729, "totalSubmissionRaw": 623960}, "861": {"acRate": 80.39060294852031, "difficulty": "Medium", "likes": 2299, "dislikes": 215, "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": 148102, "totalSubmissionRaw": 184228}, "862": {"acRate": 26.126449810740237, "difficulty": "Hard", "likes": 4290, "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": 103258, "totalSubmissionRaw": 395224}, "863": {"acRate": 64.96103329430218, "difficulty": "Medium", "likes": 11060, "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": 470450, "totalSubmissionRaw": 724205}, "864": {"acRate": 53.508604206500955, "difficulty": "Hard", "likes": 2344, "dislikes": 103, "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": 78358, "totalSubmissionRaw": 146440}, "865": {"acRate": 70.97912145624622, "difficulty": "Medium", "likes": 2653, "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": 143258, "totalSubmissionRaw": 201832}, "866": {"acRate": 26.143513134746698, "difficulty": "Medium", "likes": 440, "dislikes": 830, "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": 35071, "totalSubmissionRaw": 134148}, "867": {"acRate": 72.3760269802505, "difficulty": "Easy", "likes": 3773, "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": 423199, "totalSubmissionRaw": 584723}, "868": {"acRate": 63.8499055187506, "difficulty": "Easy", "likes": 642, "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": 85485, "totalSubmissionRaw": 133886}, "869": {"acRate": 62.566976087560846, "difficulty": "Medium", "likes": 2119, "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": 114786, "totalSubmissionRaw": 183461}, "870": {"acRate": 52.761875644896236, "difficulty": "Medium", "likes": 1620, "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": 69031, "totalSubmissionRaw": 130835}, "871": {"acRate": 40.151947903575916, "difficulty": "Hard", "likes": 4675, "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": 140580, "totalSubmissionRaw": 350120}, "872": {"acRate": 70.05350896941012, "difficulty": "Easy", "likes": 4134, "dislikes": 116, "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": 510322, "totalSubmissionRaw": 728472}, "873": {"acRate": 48.413129681304156, "difficulty": "Medium", "likes": 2026, "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": 65929, "totalSubmissionRaw": 136180}, "874": {"acRate": 40.70599128849079, "difficulty": "Medium", "likes": 206, "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": 43081, "totalSubmissionRaw": 105836}, "875": {"acRate": 48.39297605232752, "difficulty": "Medium", "likes": 10871, "dislikes": 699, "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": 771051, "totalSubmissionRaw": 1593320}, "876": {"acRate": 79.2228698433895, "difficulty": "Easy", "likes": 11760, "dislikes": 379, "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": 2078773, "totalSubmissionRaw": 2623957}, "877": {"acRate": 71.06746906395239, "difficulty": "Medium", "likes": 3321, "dislikes": 2904, "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": 258262, "totalSubmissionRaw": 363406}, "878": {"acRate": 35.57184024892598, "difficulty": "Hard", "likes": 1282, "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": 40241, "totalSubmissionRaw": 113126}, "879": {"acRate": 48.182403385842505, "difficulty": "Hard", "likes": 1844, "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": 65119, "totalSubmissionRaw": 135151}, "880": {"acRate": 36.514914704335524, "difficulty": "Medium", "likes": 2520, "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": 98591, "totalSubmissionRaw": 270002}, "881": {"acRate": 59.57902099066619, "difficulty": "Medium", "likes": 6440, "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": 429330, "totalSubmissionRaw": 720606}, "882": {"acRate": 50.52741151977793, "difficulty": "Hard", "likes": 816, "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": 29124, "totalSubmissionRaw": 57640}, "883": {"acRate": 73.1469546609268, "difficulty": "Easy", "likes": 588, "dislikes": 1416, "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": 58450, "totalSubmissionRaw": 79908}, "884": {"acRate": 67.75689246275847, "difficulty": "Easy", "likes": 1341, "dislikes": 170, "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": 146279, "totalSubmissionRaw": 215888}, "885": {"acRate": 84.57479452054795, "difficulty": "Medium", "likes": 1483, "dislikes": 1012, "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": 154349, "totalSubmissionRaw": 182501}, "886": {"acRate": 50.75126347253285, "difficulty": "Medium", "likes": 4681, "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": 215801, "totalSubmissionRaw": 425215}, "887": {"acRate": 27.985510977089696, "difficulty": "Hard", "likes": 3632, "dislikes": 192, "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": 76101, "totalSubmissionRaw": 271930}, "888": {"acRate": 62.1248774740583, "difficulty": "Easy", "likes": 2113, "dislikes": 382, "categoryTitle": "Algorithms", "frontendQuestionId": "888", "paidOnly": false, "title": "Fair Candy Swap", "titleSlug": "fair-candy-swap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128660, "totalSubmissionRaw": 207099}, "889": {"acRate": 71.65643588559632, "difficulty": "Medium", "likes": 2751, "dislikes": 116, "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": 105527, "totalSubmissionRaw": 147268}, "890": {"acRate": 76.79350489703768, "difficulty": "Medium", "likes": 3925, "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": 191159, "totalSubmissionRaw": 248926}, "891": {"acRate": 38.133771431567546, "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": 21819, "totalSubmissionRaw": 57217}, "892": {"acRate": 66.61223324983354, "difficulty": "Easy", "likes": 572, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "892", "paidOnly": false, "title": "Surface Area of 3D Shapes", "titleSlug": "surface-area-of-3d-shapes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42015, "totalSubmissionRaw": 63074}, "893": {"acRate": 72.06295830566427, "difficulty": "Medium", "likes": 535, "dislikes": 1482, "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": 51004, "totalSubmissionRaw": 70777}, "894": {"acRate": 82.77416956417153, "difficulty": "Medium", "likes": 5082, "dislikes": 355, "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": 189259, "totalSubmissionRaw": 228645}, "895": {"acRate": 66.46699723051097, "difficulty": "Hard", "likes": 4703, "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": 179758, "totalSubmissionRaw": 270447}, "896": {"acRate": 61.332000265889974, "difficulty": "Easy", "likes": 3068, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "896", "paidOnly": false, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 452104, "totalSubmissionRaw": 737144}, "897": {"acRate": 78.40807055050774, "difficulty": "Easy", "likes": 4332, "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": 293402, "totalSubmissionRaw": 374199}, "898": {"acRate": 39.440192979537514, "difficulty": "Medium", "likes": 1470, "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": 37932, "totalSubmissionRaw": 96176}, "899": {"acRate": 66.00060662322264, "difficulty": "Hard", "likes": 1759, "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": 71808, "totalSubmissionRaw": 108799}, "900": {"acRate": 59.63170903118312, "difficulty": "Medium", "likes": 748, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "900", "paidOnly": false, "title": "RLE Iterator", "titleSlug": "rle-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75517, "totalSubmissionRaw": 126639}, "901": {"acRate": 66.48032835967967, "difficulty": "Medium", "likes": 6399, "dislikes": 419, "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": 350819, "totalSubmissionRaw": 527706}, "902": {"acRate": 42.62849012982394, "difficulty": "Hard", "likes": 1397, "dislikes": 98, "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": 45543, "totalSubmissionRaw": 106837}, "903": {"acRate": 57.273194992282626, "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": 16698, "totalSubmissionRaw": 29155}, "904": {"acRate": 44.83314982288149, "difficulty": "Medium", "likes": 4712, "dislikes": 352, "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": 434862, "totalSubmissionRaw": 969962}, "905": {"acRate": 76.24605379089257, "difficulty": "Easy", "likes": 5393, "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": 828161, "totalSubmissionRaw": 1086169}, "906": {"acRate": 39.0298999152888, "difficulty": "Hard", "likes": 363, "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": 24880, "totalSubmissionRaw": 63746}, "907": {"acRate": 37.262217382950105, "difficulty": "Medium", "likes": 8152, "dislikes": 635, "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": 279252, "totalSubmissionRaw": 749424}, "908": {"acRate": 70.56692289878458, "difficulty": "Easy", "likes": 716, "dislikes": 2042, "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": 94462, "totalSubmissionRaw": 133862}, "909": {"acRate": 43.88310530733751, "difficulty": "Medium", "likes": 2927, "dislikes": 1048, "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": 202840, "totalSubmissionRaw": 462226}, "910": {"acRate": 36.499100242093135, "difficulty": "Medium", "likes": 1655, "dislikes": 462, "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": 56386, "totalSubmissionRaw": 154486}, "911": {"acRate": 52.13073464282092, "difficulty": "Medium", "likes": 1019, "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": 61679, "totalSubmissionRaw": 118316}, "912": {"acRate": 57.90382423980371, "difficulty": "Medium", "likes": 6495, "dislikes": 798, "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": 786088, "totalSubmissionRaw": 1357576}, "913": {"acRate": 33.83141382049246, "difficulty": "Hard", "likes": 919, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "913", "paidOnly": false, "title": "Cat and Mouse", "titleSlug": "cat-and-mouse", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20445, "totalSubmissionRaw": 60432}, "914": {"acRate": 29.910778410683044, "difficulty": "Easy", "likes": 1821, "dislikes": 519, "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": 127021, "totalSubmissionRaw": 424671}, "915": {"acRate": 48.81586088241747, "difficulty": "Medium", "likes": 1662, "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": 84552, "totalSubmissionRaw": 173206}, "916": {"acRate": 51.856254245164976, "difficulty": "Medium", "likes": 2712, "dislikes": 234, "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": 116045, "totalSubmissionRaw": 223783}, "917": {"acRate": 65.38198557653077, "difficulty": "Easy", "likes": 2263, "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": 232363, "totalSubmissionRaw": 355393}, "918": {"acRate": 45.59383743511767, "difficulty": "Medium", "likes": 6665, "dislikes": 305, "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": 281260, "totalSubmissionRaw": 616882}, "919": {"acRate": 65.93563876448589, "difficulty": "Medium", "likes": 1111, "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": 57122, "totalSubmissionRaw": 86634}, "920": {"acRate": 60.379266965864275, "difficulty": "Hard", "likes": 2367, "dislikes": 198, "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": 71033, "totalSubmissionRaw": 117646}, "921": {"acRate": 74.85631413217313, "difficulty": "Medium", "likes": 4110, "dislikes": 208, "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": 376792, "totalSubmissionRaw": 503351}, "922": {"acRate": 70.85220728340722, "difficulty": "Easy", "likes": 2616, "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": 265124, "totalSubmissionRaw": 374193}, "923": {"acRate": 45.523633314024366, "difficulty": "Medium", "likes": 2618, "dislikes": 318, "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": 105308, "totalSubmissionRaw": 231326}, "924": {"acRate": 42.03352451547197, "difficulty": "Hard", "likes": 1004, "dislikes": 600, "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": 54892, "totalSubmissionRaw": 130591}, "925": {"acRate": 32.299895953933, "difficulty": "Easy", "likes": 2440, "dislikes": 382, "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": 148700, "totalSubmissionRaw": 460373}, "926": {"acRate": 61.517212606986185, "difficulty": "Medium", "likes": 4438, "dislikes": 179, "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": 194638, "totalSubmissionRaw": 316396}, "927": {"acRate": 40.02567595891847, "difficulty": "Hard", "likes": 834, "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": 30554, "totalSubmissionRaw": 76336}, "928": {"acRate": 44.07820713824587, "difficulty": "Hard", "likes": 673, "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": 23897, "totalSubmissionRaw": 54215}, "929": {"acRate": 67.29074209804253, "difficulty": "Easy", "likes": 2697, "dislikes": 344, "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": 501277, "totalSubmissionRaw": 744942}, "930": {"acRate": 63.659841058066014, "difficulty": "Medium", "likes": 3965, "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": 274358, "totalSubmissionRaw": 430975}, "931": {"acRate": 62.89712612191087, "difficulty": "Medium", "likes": 6393, "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": 471836, "totalSubmissionRaw": 750169}, "932": {"acRate": 65.99221902434086, "difficulty": "Medium", "likes": 1073, "dislikes": 1520, "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": 45629, "totalSubmissionRaw": 69143}, "933": {"acRate": 76.11547951797361, "difficulty": "Easy", "likes": 570, "dislikes": 875, "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": 297369, "totalSubmissionRaw": 390682}, "934": {"acRate": 57.91455990093901, "difficulty": "Medium", "likes": 5406, "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": 213274, "totalSubmissionRaw": 368257}, "935": {"acRate": 60.51563812241346, "difficulty": "Medium", "likes": 3042, "dislikes": 445, "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": 179421, "totalSubmissionRaw": 296487}, "936": {"acRate": 62.53157066015703, "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": 59173, "totalSubmissionRaw": 94629}, "937": {"acRate": 56.5088244419704, "difficulty": "Medium", "likes": 2108, "dislikes": 4387, "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": 371541, "totalSubmissionRaw": 657492}, "938": {"acRate": 87.03142021650456, "difficulty": "Easy", "likes": 6967, "dislikes": 379, "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": 1103286, "totalSubmissionRaw": 1267687}, "939": {"acRate": 54.16494141405336, "difficulty": "Medium", "likes": 1983, "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": 149128, "totalSubmissionRaw": 275317}, "940": {"acRate": 43.169906663047335, "difficulty": "Hard", "likes": 1730, "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": 41349, "totalSubmissionRaw": 95782}, "941": {"acRate": 33.54539452291183, "difficulty": "Easy", "likes": 2950, "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": 440499, "totalSubmissionRaw": 1313143}, "942": {"acRate": 79.1572217378669, "difficulty": "Easy", "likes": 2469, "dislikes": 1026, "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": 163428, "totalSubmissionRaw": 206460}, "943": {"acRate": 44.167944333058145, "difficulty": "Hard", "likes": 1450, "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": 29960, "totalSubmissionRaw": 67832}, "944": {"acRate": 74.65155354252296, "difficulty": "Easy", "likes": 1712, "dislikes": 2881, "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": 194156, "totalSubmissionRaw": 260083}, "945": {"acRate": 60.040985652525535, "difficulty": "Medium", "likes": 2656, "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": 240541, "totalSubmissionRaw": 400628}, "946": {"acRate": 69.563252846075, "difficulty": "Medium", "likes": 5920, "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": 315602, "totalSubmissionRaw": 453690}, "947": {"acRate": 62.15074617724517, "difficulty": "Medium", "likes": 5869, "dislikes": 684, "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": 304425, "totalSubmissionRaw": 489817}, "948": {"acRate": 59.00109369303682, "difficulty": "Medium", "likes": 3268, "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": 234666, "totalSubmissionRaw": 397733}, "949": {"acRate": 35.39074966380591, "difficulty": "Medium", "likes": 713, "dislikes": 1060, "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": 90266, "totalSubmissionRaw": 255054}, "950": {"acRate": 83.03262166275866, "difficulty": "Medium", "likes": 3481, "dislikes": 661, "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": 201842, "totalSubmissionRaw": 243088}, "951": {"acRate": 67.08032291685068, "difficulty": "Medium", "likes": 2310, "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": 151892, "totalSubmissionRaw": 226433}, "952": {"acRate": 40.920693339665206, "difficulty": "Hard", "likes": 1639, "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": 55148, "totalSubmissionRaw": 134768}, "953": {"acRate": 55.17983942870154, "difficulty": "Easy", "likes": 4897, "dislikes": 1635, "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": 518626, "totalSubmissionRaw": 939884}, "954": {"acRate": 39.18969955591056, "difficulty": "Medium", "likes": 1527, "dislikes": 161, "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": 90276, "totalSubmissionRaw": 230358}, "955": {"acRate": 35.38945658794072, "difficulty": "Medium", "likes": 663, "dislikes": 88, "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": 20918, "totalSubmissionRaw": 59108}, "956": {"acRate": 52.14402166880882, "difficulty": "Hard", "likes": 2373, "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": 60449, "totalSubmissionRaw": 115927}, "957": {"acRate": 39.010005947926864, "difficulty": "Medium", "likes": 1494, "dislikes": 1756, "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": 162653, "totalSubmissionRaw": 416952}, "958": {"acRate": 57.221574207997016, "difficulty": "Medium", "likes": 4298, "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": 245286, "totalSubmissionRaw": 428660}, "959": {"acRate": 77.98659817100364, "difficulty": "Medium", "likes": 3830, "dislikes": 814, "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": 134653, "totalSubmissionRaw": 172662}, "960": {"acRate": 58.41606930655116, "difficulty": "Hard", "likes": 603, "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": 15238, "totalSubmissionRaw": 26086}, "961": {"acRate": 76.97324045765437, "difficulty": "Easy", "likes": 1351, "dislikes": 330, "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": 244213, "totalSubmissionRaw": 317270}, "962": {"acRate": 50.5777714817663, "difficulty": "Medium", "likes": 1692, "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": 49985, "totalSubmissionRaw": 98828}, "963": {"acRate": 55.249888773542935, "difficulty": "Medium", "likes": 383, "dislikes": 463, "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": 29804, "totalSubmissionRaw": 53944}, "964": {"acRate": 48.76393831553974, "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": 10276, "totalSubmissionRaw": 21074}, "965": {"acRate": 71.29112931822847, "difficulty": "Easy", "likes": 1901, "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": 229191, "totalSubmissionRaw": 321486}, "966": {"acRate": 51.3812488665901, "difficulty": "Medium", "likes": 424, "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": 42500, "totalSubmissionRaw": 82715}, "967": {"acRate": 58.244832387276425, "difficulty": "Medium", "likes": 2813, "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": 135957, "totalSubmissionRaw": 233422}, "968": {"acRate": 46.78569141100365, "difficulty": "Hard", "likes": 5364, "dislikes": 78, "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": 146093, "totalSubmissionRaw": 312260}, "969": {"acRate": 70.9545835306115, "difficulty": "Medium", "likes": 1505, "dislikes": 1536, "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": 97409, "totalSubmissionRaw": 137284}, "970": {"acRate": 43.887113120760894, "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": 56294, "totalSubmissionRaw": 128270}, "971": {"acRate": 50.72297210136855, "difficulty": "Medium", "likes": 955, "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": 43253, "totalSubmissionRaw": 85273}, "972": {"acRate": 44.24940157300809, "difficulty": "Hard", "likes": 95, "dislikes": 218, "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": 7764, "totalSubmissionRaw": 17546}, "973": {"acRate": 66.80790020637527, "difficulty": "Medium", "likes": 8444, "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": 1275135, "totalSubmissionRaw": 1908659}, "974": {"acRate": 55.44439495630539, "difficulty": "Medium", "likes": 7236, "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": 361002, "totalSubmissionRaw": 651108}, "975": {"acRate": 40.25270676316899, "difficulty": "Hard", "likes": 2009, "dislikes": 507, "categoryTitle": "Algorithms", "frontendQuestionId": "975", "paidOnly": false, "title": "Odd Even Jump", "titleSlug": "odd-even-jump", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88818, "totalSubmissionRaw": 220651}, "976": {"acRate": 56.3376154957345, "difficulty": "Easy", "likes": 2978, "dislikes": 412, "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": 248041, "totalSubmissionRaw": 440276}, "977": {"acRate": 72.94994559221874, "difficulty": "Easy", "likes": 9370, "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": 1942815, "totalSubmissionRaw": 2663216}, "978": {"acRate": 47.61132070369018, "difficulty": "Medium", "likes": 1985, "dislikes": 235, "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": 105630, "totalSubmissionRaw": 221859}, "979": {"acRate": 77.1179153294535, "difficulty": "Medium", "likes": 5832, "dislikes": 233, "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": 200886, "totalSubmissionRaw": 260492}, "980": {"acRate": 81.9540405764349, "difficulty": "Hard", "likes": 5165, "dislikes": 191, "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": 208882, "totalSubmissionRaw": 254877}, "981": {"acRate": 49.280676139752, "difficulty": "Medium", "likes": 4813, "dislikes": 596, "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": 479294, "totalSubmissionRaw": 972579}, "982": {"acRate": 58.43045604108368, "difficulty": "Hard", "likes": 443, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "982", "paidOnly": false, "title": "Triples with Bitwise AND Equal To Zero", "titleSlug": "triples-with-bitwise-and-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19001, "totalSubmissionRaw": 32519}, "983": {"acRate": 65.23536808001306, "difficulty": "Medium", "likes": 7910, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "983", "paidOnly": false, "title": "Minimum Cost For Tickets", "titleSlug": "minimum-cost-for-tickets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 307664, "totalSubmissionRaw": 471622}, "984": {"acRate": 44.1007111008268, "difficulty": "Medium", "likes": 816, "dislikes": 369, "categoryTitle": "Algorithms", "frontendQuestionId": "984", "paidOnly": false, "title": "String Without AAA or BBB", "titleSlug": "string-without-aaa-or-bbb", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49552, "totalSubmissionRaw": 112361}, "985": {"acRate": 68.24318783674926, "difficulty": "Medium", "likes": 2085, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "985", "paidOnly": false, "title": "Sum of Even Numbers After Queries", "titleSlug": "sum-of-even-numbers-after-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141477, "totalSubmissionRaw": 207313}, "986": {"acRate": 71.85683766741657, "difficulty": "Medium", "likes": 5573, "dislikes": 114, "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": 430873, "totalSubmissionRaw": 599627}, "987": {"acRate": 48.67819756767131, "difficulty": "Hard", "likes": 7681, "dislikes": 4334, "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": 467944, "totalSubmissionRaw": 961301}, "988": {"acRate": 60.5745954500247, "difficulty": "Medium", "likes": 2293, "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": 193680, "totalSubmissionRaw": 319738}, "989": {"acRate": 45.121402127872464, "difficulty": "Easy", "likes": 3453, "dislikes": 294, "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": 270574, "totalSubmissionRaw": 599659}, "990": {"acRate": 50.630795649685176, "difficulty": "Medium", "likes": 3757, "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": 132678, "totalSubmissionRaw": 262050}, "991": {"acRate": 54.681581035144035, "difficulty": "Medium", "likes": 2712, "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": 104074, "totalSubmissionRaw": 190328}, "992": {"acRate": 64.05365473497353, "difficulty": "Hard", "likes": 6091, "dislikes": 100, "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": 236709, "totalSubmissionRaw": 369548}, "993": {"acRate": 56.62810289554202, "difficulty": "Easy", "likes": 4044, "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": 286685, "totalSubmissionRaw": 506260}, "994": {"acRate": 54.870977662543496, "difficulty": "Medium", "likes": 13021, "dislikes": 410, "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": 952763, "totalSubmissionRaw": 1736370}, "995": {"acRate": 62.7235675142091, "difficulty": "Hard", "likes": 1884, "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": 123270, "totalSubmissionRaw": 196528}, "996": {"acRate": 50.222827888475564, "difficulty": "Hard", "likes": 989, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "996", "paidOnly": false, "title": "Number of Squareful Arrays", "titleSlug": "number-of-squareful-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40907, "totalSubmissionRaw": 81452}, "997": {"acRate": 49.761576393135485, "difficulty": "Easy", "likes": 6648, "dislikes": 603, "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": 611939, "totalSubmissionRaw": 1229741}, "998": {"acRate": 69.74378017081322, "difficulty": "Medium", "likes": 535, "dislikes": 789, "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": 37564, "totalSubmissionRaw": 53860}, "999": {"acRate": 69.42936010037641, "difficulty": "Easy", "likes": 715, "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": 69169, "totalSubmissionRaw": 99625}, "1000": {"acRate": 43.42329020332717, "difficulty": "Hard", "likes": 2481, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1000", "paidOnly": false, "title": "Minimum Cost to Merge Stones", "titleSlug": "minimum-cost-to-merge-stones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41111, "totalSubmissionRaw": 94675}, "1001": {"acRate": 37.28258645385717, "difficulty": "Hard", "likes": 615, "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": 21864, "totalSubmissionRaw": 58644}, "1002": {"acRate": 74.5926490013495, "difficulty": "Easy", "likes": 4268, "dislikes": 412, "categoryTitle": "Algorithms", "frontendQuestionId": "1002", "paidOnly": false, "title": "Find Common Characters", "titleSlug": "find-common-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 365363, "totalSubmissionRaw": 489811}, "1003": {"acRate": 60.04973100049731, "difficulty": "Medium", "likes": 1004, "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": 66411, "totalSubmissionRaw": 110594}, "1004": {"acRate": 63.95151298766189, "difficulty": "Medium", "likes": 8713, "dislikes": 140, "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": 659143, "totalSubmissionRaw": 1030695}, "1005": {"acRate": 51.4295484539718, "difficulty": "Easy", "likes": 1559, "dislikes": 115, "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": 96254, "totalSubmissionRaw": 187157}, "1006": {"acRate": 57.79757339097692, "difficulty": "Medium", "likes": 375, "dislikes": 355, "categoryTitle": "Algorithms", "frontendQuestionId": "1006", "paidOnly": false, "title": "Clumsy Factorial", "titleSlug": "clumsy-factorial", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33155, "totalSubmissionRaw": 57364}, "1007": {"acRate": 52.264228279955674, "difficulty": "Medium", "likes": 2844, "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": 206566, "totalSubmissionRaw": 395234}, "1008": {"acRate": 82.48674465578185, "difficulty": "Medium", "likes": 6200, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1008", "paidOnly": false, "title": "Construct Binary Search Tree from Preorder Traversal", "titleSlug": "construct-binary-search-tree-from-preorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 392042, "totalSubmissionRaw": 475279}, "1009": {"acRate": 60.74984128152517, "difficulty": "Easy", "likes": 2457, "dislikes": 115, "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": 264098, "totalSubmissionRaw": 434731}, "1010": {"acRate": 53.00568582444455, "difficulty": "Medium", "likes": 4213, "dislikes": 173, "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": 282656, "totalSubmissionRaw": 533256}, "1011": {"acRate": 70.28431176707525, "difficulty": "Medium", "likes": 9582, "dislikes": 232, "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": 429253, "totalSubmissionRaw": 610738}, "1012": {"acRate": 42.56012560363489, "difficulty": "Hard", "likes": 777, "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": 17891, "totalSubmissionRaw": 42037}, "1013": {"acRate": 42.0159355723098, "difficulty": "Easy", "likes": 1713, "dislikes": 160, "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": 98082, "totalSubmissionRaw": 233440}, "1014": {"acRate": 59.414285884839, "difficulty": "Medium", "likes": 2586, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1014", "paidOnly": false, "title": "Best Sightseeing Pair", "titleSlug": "best-sightseeing-pair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 99532, "totalSubmissionRaw": 167522}, "1015": {"acRate": 46.608369404156235, "difficulty": "Medium", "likes": 1144, "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": 63853, "totalSubmissionRaw": 136999}, "1016": {"acRate": 57.45665589186012, "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": 39105, "totalSubmissionRaw": 68060}, "1017": {"acRate": 60.99823131012467, "difficulty": "Medium", "likes": 516, "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": 28280, "totalSubmissionRaw": 46362}, "1018": {"acRate": 46.81146250831616, "difficulty": "Easy", "likes": 732, "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": 57697, "totalSubmissionRaw": 123254}, "1019": {"acRate": 61.221231529465804, "difficulty": "Medium", "likes": 3312, "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": 165271, "totalSubmissionRaw": 269957}, "1020": {"acRate": 69.35519344753378, "difficulty": "Medium", "likes": 4091, "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": 249119, "totalSubmissionRaw": 359193}, "1021": {"acRate": 83.74510650811446, "difficulty": "Easy", "likes": 2992, "dislikes": 1615, "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": 364519, "totalSubmissionRaw": 435272}, "1022": {"acRate": 73.15123385318607, "difficulty": "Easy", "likes": 3354, "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": 217968, "totalSubmissionRaw": 297969}, "1023": {"acRate": 62.702008666773665, "difficulty": "Medium", "likes": 909, "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": 50788, "totalSubmissionRaw": 80999}, "1024": {"acRate": 51.503558204119415, "difficulty": "Medium", "likes": 1768, "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": 71213, "totalSubmissionRaw": 138270}, "1025": {"acRate": 69.19688053058246, "difficulty": "Easy", "likes": 2205, "dislikes": 4141, "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": 274084, "totalSubmissionRaw": 396093}, "1026": {"acRate": 78.08591676740092, "difficulty": "Medium", "likes": 4940, "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": 333968, "totalSubmissionRaw": 427693}, "1027": {"acRate": 49.175991696229424, "difficulty": "Medium", "likes": 4697, "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": 181454, "totalSubmissionRaw": 368989}, "1028": {"acRate": 75.1008413844725, "difficulty": "Hard", "likes": 1637, "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": 54180, "totalSubmissionRaw": 72143}, "1029": {"acRate": 66.92728441862779, "difficulty": "Medium", "likes": 4731, "dislikes": 353, "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": 248756, "totalSubmissionRaw": 371681}, "1030": {"acRate": 71.61264995554734, "difficulty": "Easy", "likes": 758, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "1030", "paidOnly": false, "title": "Matrix Cells in Distance Order", "titleSlug": "matrix-cells-in-distance-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62023, "totalSubmissionRaw": 86609}, "1031": {"acRate": 59.869199421585385, "difficulty": "Medium", "likes": 2560, "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": 72866, "totalSubmissionRaw": 121709}, "1032": {"acRate": 52.11900452747027, "difficulty": "Hard", "likes": 1816, "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": 91288, "totalSubmissionRaw": 175153}, "1033": {"acRate": 48.70639074636318, "difficulty": "Medium", "likes": 226, "dislikes": 649, "categoryTitle": "Algorithms", "frontendQuestionId": "1033", "paidOnly": false, "title": "Moving Stones Until Consecutive", "titleSlug": "moving-stones-until-consecutive", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26149, "totalSubmissionRaw": 53687}, "1034": {"acRate": 49.21462495688397, "difficulty": "Medium", "likes": 744, "dislikes": 888, "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": 37097, "totalSubmissionRaw": 75378}, "1035": {"acRate": 63.43230104777952, "difficulty": "Medium", "likes": 3828, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1035", "paidOnly": false, "title": "Uncrossed Lines", "titleSlug": "uncrossed-lines", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163760, "totalSubmissionRaw": 258165}, "1036": {"acRate": 34.82888792623306, "difficulty": "Hard", "likes": 671, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "1036", "paidOnly": false, "title": "Escape a Large Maze", "titleSlug": "escape-a-large-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22512, "totalSubmissionRaw": 64636}, "1037": {"acRate": 37.286428787217616, "difficulty": "Easy", "likes": 421, "dislikes": 529, "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": 55540, "totalSubmissionRaw": 148955}, "1038": {"acRate": 88.24831691073729, "difficulty": "Medium", "likes": 4328, "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": 291786, "totalSubmissionRaw": 330642}, "1039": {"acRate": 59.6420833886015, "difficulty": "Medium", "likes": 1841, "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": 53957, "totalSubmissionRaw": 90468}, "1040": {"acRate": 57.075992637391536, "difficulty": "Medium", "likes": 375, "dislikes": 650, "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": 10853, "totalSubmissionRaw": 19015}, "1041": {"acRate": 55.89970944679317, "difficulty": "Medium", "likes": 3742, "dislikes": 703, "categoryTitle": "Algorithms", "frontendQuestionId": "1041", "paidOnly": false, "title": "Robot Bounded In Circle", "titleSlug": "robot-bounded-in-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241834, "totalSubmissionRaw": 432617}, "1042": {"acRate": 51.587822834374784, "difficulty": "Medium", "likes": 1458, "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": 82475, "totalSubmissionRaw": 159873}, "1043": {"acRate": 76.66309682839422, "difficulty": "Medium", "likes": 4735, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1043", "paidOnly": false, "title": "Partition Array for Maximum Sum", "titleSlug": "partition-array-for-maximum-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 202583, "totalSubmissionRaw": 264251}, "1044": {"acRate": 30.563947852320695, "difficulty": "Hard", "likes": 2234, "dislikes": 387, "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": 70309, "totalSubmissionRaw": 230039}, "1045": {"acRate": 62.22306891953282, "difficulty": "Medium", "likes": 759, "dislikes": 67, "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": 212298, "totalSubmissionRaw": 341191}, "1046": {"acRate": 65.58398169290808, "difficulty": "Easy", "likes": 6051, "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": 658593, "totalSubmissionRaw": 1004199}, "1047": {"acRate": 70.02253580843181, "difficulty": "Easy", "likes": 6628, "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": 607761, "totalSubmissionRaw": 867951}, "1048": {"acRate": 61.33750627673022, "difficulty": "Medium", "likes": 7331, "dislikes": 255, "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": 425091, "totalSubmissionRaw": 693036}, "1049": {"acRate": 56.00628045089802, "difficulty": "Medium", "likes": 3134, "dislikes": 121, "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": 93456, "totalSubmissionRaw": 166867}, "1050": {"acRate": 70.21654798113173, "difficulty": "Easy", "likes": 658, "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": 192768, "totalSubmissionRaw": 274534}, "1051": {"acRate": 80.83756245513676, "difficulty": "Easy", "likes": 1609, "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": 514655, "totalSubmissionRaw": 636651}, "1052": {"acRate": 64.2742389987627, "difficulty": "Medium", "likes": 2451, "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": 198439, "totalSubmissionRaw": 308737}, "1053": {"acRate": 49.69426068299661, "difficulty": "Medium", "likes": 450, "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": 41691, "totalSubmissionRaw": 83895}, "1054": {"acRate": 46.746877315273764, "difficulty": "Medium", "likes": 1270, "dislikes": 51, "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": 44798, "totalSubmissionRaw": 95831}, "1055": {"acRate": 60.39892906697239, "difficulty": "Medium", "likes": 1274, "dislikes": 69, "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": 92718, "totalSubmissionRaw": 153510}, "1056": {"acRate": 48.860942917766394, "difficulty": "Easy", "likes": 316, "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": 47207, "totalSubmissionRaw": 96614}, "1057": {"acRate": 58.668112026145906, "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": 72522, "totalSubmissionRaw": 123614}, "1058": {"acRate": 45.18472789438693, "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": 9515, "totalSubmissionRaw": 21058}, "1059": {"acRate": 37.49082905355833, "difficulty": "Medium", "likes": 711, "dislikes": 391, "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": 62852, "totalSubmissionRaw": 167646}, "1060": {"acRate": 57.39531967049568, "difficulty": "Medium", "likes": 1662, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1060", "paidOnly": true, "title": "Missing Element in Sorted Array", "titleSlug": "missing-element-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140952, "totalSubmissionRaw": 245581}, "1061": {"acRate": 76.68286428378968, "difficulty": "Medium", "likes": 2358, "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": 82533, "totalSubmissionRaw": 107629}, "1062": {"acRate": 62.42614054218548, "difficulty": "Medium", "likes": 706, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1062", "paidOnly": true, "title": "Longest Repeating Substring", "titleSlug": "longest-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49232, "totalSubmissionRaw": 78865}, "1063": {"acRate": 79.19995738787685, "difficulty": "Hard", "likes": 311, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1063", "paidOnly": true, "title": "Number of Valid Subarrays", "titleSlug": "number-of-valid-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14869, "totalSubmissionRaw": 18774}, "1064": {"acRate": 64.13931795815327, "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": 44970, "totalSubmissionRaw": 70113}, "1065": {"acRate": 67.60210174349176, "difficulty": "Easy", "likes": 378, "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": 28305, "totalSubmissionRaw": 41870}, "1066": {"acRate": 55.19513865114687, "difficulty": "Medium", "likes": 937, "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": 51592, "totalSubmissionRaw": 93472}, "1067": {"acRate": 46.337138424027486, "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": 4181, "totalSubmissionRaw": 9023}, "1068": {"acRate": 84.27195540125328, "difficulty": "Easy", "likes": 925, "dislikes": 217, "categoryTitle": "Database", "frontendQuestionId": "1068", "paidOnly": false, "title": "Product Sales Analysis I", "titleSlug": "product-sales-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 591052, "totalSubmissionRaw": 701363}, "1069": {"acRate": 81.96650667934678, "difficulty": "Easy", "likes": 80, "dislikes": 181, "categoryTitle": "Database", "frontendQuestionId": "1069", "paidOnly": true, "title": "Product Sales Analysis II", "titleSlug": "product-sales-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55161, "totalSubmissionRaw": 67297}, "1070": {"acRate": 43.51307754349579, "difficulty": "Medium", "likes": 450, "dislikes": 911, "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": 188822, "totalSubmissionRaw": 433945}, "1071": {"acRate": 51.724352894125815, "difficulty": "Easy", "likes": 5219, "dislikes": 1373, "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": 539318, "totalSubmissionRaw": 1042678}, "1072": {"acRate": 64.1615194144377, "difficulty": "Medium", "likes": 746, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1072", "paidOnly": false, "title": "Flip Columns For Maximum Number of Equal Rows", "titleSlug": "flip-columns-for-maximum-number-of-equal-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23580, "totalSubmissionRaw": 36751}, "1073": {"acRate": 37.05109664979513, "difficulty": "Medium", "likes": 321, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1073", "paidOnly": false, "title": "Adding Two Negabinary Numbers", "titleSlug": "adding-two-negabinary-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18447, "totalSubmissionRaw": 49788}, "1074": {"acRate": 74.43396495769608, "difficulty": "Hard", "likes": 3729, "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": 156420, "totalSubmissionRaw": 210146}, "1075": {"acRate": 63.1251642849358, "difficulty": "Easy", "likes": 629, "dislikes": 171, "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": 295376, "totalSubmissionRaw": 467920}, "1076": {"acRate": 50.027616563139965, "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": 58874, "totalSubmissionRaw": 117683}, "1077": {"acRate": 76.68953268381833, "difficulty": "Medium", "likes": 271, "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": 59587, "totalSubmissionRaw": 77699}, "1078": {"acRate": 63.510013160872816, "difficulty": "Easy", "likes": 496, "dislikes": 361, "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": 75763, "totalSubmissionRaw": 119293}, "1079": {"acRate": 76.43650058021997, "difficulty": "Medium", "likes": 2498, "dislikes": 71, "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": 104731, "totalSubmissionRaw": 137017}, "1080": {"acRate": 55.99715201139196, "difficulty": "Medium", "likes": 702, "dislikes": 716, "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": 39324, "totalSubmissionRaw": 70225}, "1081": {"acRate": 61.20092378752887, "difficulty": "Medium", "likes": 2612, "dislikes": 193, "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": 72610, "totalSubmissionRaw": 118642}, "1082": {"acRate": 74.47619047619047, "difficulty": "Easy", "likes": 197, "dislikes": 76, "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": 60214, "totalSubmissionRaw": 80850}, "1083": {"acRate": 49.76056232458588, "difficulty": "Easy", "likes": 272, "dislikes": 47, "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": 59749, "totalSubmissionRaw": 120073}, "1084": {"acRate": 46.66210701354606, "difficulty": "Easy", "likes": 733, "dislikes": 155, "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": 143954, "totalSubmissionRaw": 308503}, "1085": {"acRate": 76.49381168729438, "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": 24413, "totalSubmissionRaw": 31915}, "1086": {"acRate": 74.51749667784597, "difficulty": "Easy", "likes": 800, "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": 105983, "totalSubmissionRaw": 142226}, "1087": {"acRate": 66.449871912851, "difficulty": "Medium", "likes": 645, "dislikes": 52, "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": 53435, "totalSubmissionRaw": 80414}, "1088": {"acRate": 47.163721759660426, "difficulty": "Hard", "likes": 492, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "1088", "paidOnly": true, "title": "Confusing Number II", "titleSlug": "confusing-number-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37556, "totalSubmissionRaw": 79629}, "1089": {"acRate": 52.12584217446097, "difficulty": "Easy", "likes": 2623, "dislikes": 756, "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": 439677, "totalSubmissionRaw": 843469}, "1090": {"acRate": 62.424799725694335, "difficulty": "Medium", "likes": 454, "dislikes": 629, "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": 40053, "totalSubmissionRaw": 64162}, "1091": {"acRate": 48.03247017195946, "difficulty": "Medium", "likes": 6580, "dislikes": 242, "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": 516387, "totalSubmissionRaw": 1075077}, "1092": {"acRate": 59.538255632389024, "difficulty": "Hard", "likes": 4934, "dislikes": 71, "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": 133455, "totalSubmissionRaw": 224150}, "1093": {"acRate": 42.040267362243235, "difficulty": "Medium", "likes": 157, "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": 20630, "totalSubmissionRaw": 49072}, "1094": {"acRate": 55.96859251172176, "difficulty": "Medium", "likes": 4471, "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": 229665, "totalSubmissionRaw": 410347}, "1095": {"acRate": 40.27521535879261, "difficulty": "Hard", "likes": 3271, "dislikes": 133, "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": 145170, "totalSubmissionRaw": 360445}, "1096": {"acRate": 63.839296924042685, "difficulty": "Hard", "likes": 482, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "1096", "paidOnly": false, "title": "Brace Expansion II", "titleSlug": "brace-expansion-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25424, "totalSubmissionRaw": 39825}, "1097": {"acRate": 51.0774361030793, "difficulty": "Hard", "likes": 186, "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": 24201, "totalSubmissionRaw": 47381}, "1098": {"acRate": 43.19977308064042, "difficulty": "Medium", "likes": 202, "dislikes": 607, "categoryTitle": "Database", "frontendQuestionId": "1098", "paidOnly": true, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41121, "totalSubmissionRaw": 95188}, "1099": {"acRate": 61.85204804657965, "difficulty": "Easy", "likes": 1138, "dislikes": 130, "categoryTitle": "Algorithms", "frontendQuestionId": "1099", "paidOnly": true, "title": "Two Sum Less Than K", "titleSlug": "two-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 136612, "totalSubmissionRaw": 220869}, "1100": {"acRate": 74.78351409978308, "difficulty": "Medium", "likes": 573, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1100", "paidOnly": true, "title": "Find K-Length Substrings With No Repeated Characters", "titleSlug": "find-k-length-substrings-with-no-repeated-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43094, "totalSubmissionRaw": 57625}, "1101": {"acRate": 65.34902900735815, "difficulty": "Medium", "likes": 1043, "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": 101422, "totalSubmissionRaw": 155201}, "1102": {"acRate": 53.7668624430866, "difficulty": "Medium", "likes": 1298, "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": 63532, "totalSubmissionRaw": 118162}, "1103": {"acRate": 65.55042534340808, "difficulty": "Easy", "likes": 983, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1103", "paidOnly": false, "title": "Distribute Candies to People", "titleSlug": "distribute-candies-to-people", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91003, "totalSubmissionRaw": 138829}, "1104": {"acRate": 75.47748591356012, "difficulty": "Medium", "likes": 1494, "dislikes": 318, "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": 46750, "totalSubmissionRaw": 61939}, "1105": {"acRate": 68.82293821474572, "difficulty": "Medium", "likes": 2537, "dislikes": 243, "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": 141065, "totalSubmissionRaw": 204968}, "1106": {"acRate": 59.7435987127466, "difficulty": "Hard", "likes": 1197, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1106", "paidOnly": false, "title": "Parsing A Boolean Expression", "titleSlug": "parsing-a-boolean-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34159, "totalSubmissionRaw": 57176}, "1107": {"acRate": 44.59804441019219, "difficulty": "Medium", "likes": 150, "dislikes": 167, "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": 37035, "totalSubmissionRaw": 83043}, "1108": {"acRate": 89.31103142005296, "difficulty": "Easy", "likes": 2133, "dislikes": 1758, "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": 685380, "totalSubmissionRaw": 767408}, "1109": {"acRate": 62.50581782673371, "difficulty": "Medium", "likes": 1655, "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": 68492, "totalSubmissionRaw": 109577}, "1110": {"acRate": 72.4194801994275, "difficulty": "Medium", "likes": 4570, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "1110", "paidOnly": false, "title": "Delete Nodes And Return Forest", "titleSlug": "delete-nodes-and-return-forest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343818, "totalSubmissionRaw": 474759}, "1111": {"acRate": 72.04231878088963, "difficulty": "Medium", "likes": 441, "dislikes": 1777, "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": 27987, "totalSubmissionRaw": 38848}, "1112": {"acRate": 70.87671965930122, "difficulty": "Medium", "likes": 303, "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": 63575, "totalSubmissionRaw": 89698}, "1113": {"acRate": 64.92356981890256, "difficulty": "Easy", "likes": 113, "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": 47824, "totalSubmissionRaw": 73662}, "1114": {"acRate": 69.86256337636394, "difficulty": "Easy", "likes": 1484, "dislikes": 204, "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": 165764, "totalSubmissionRaw": 237272}, "1115": {"acRate": 66.80729674949329, "difficulty": "Medium", "likes": 685, "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": 88994, "totalSubmissionRaw": 133210}, "1116": {"acRate": 61.439859124329644, "difficulty": "Medium", "likes": 493, "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": 53730, "totalSubmissionRaw": 87452}, "1117": {"acRate": 56.736453704081214, "difficulty": "Medium", "likes": 520, "dislikes": 166, "categoryTitle": "Concurrency", "frontendQuestionId": "1117", "paidOnly": false, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55663, "totalSubmissionRaw": 98108}, "1118": {"acRate": 58.449384038564546, "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": 8730, "totalSubmissionRaw": 14936}, "1119": {"acRate": 91.17291710885075, "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": 111681, "totalSubmissionRaw": 122494}, "1120": {"acRate": 66.66634827543389, "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": 69795, "totalSubmissionRaw": 104693}, "1121": {"acRate": 61.40525725675844, "difficulty": "Hard", "likes": 122, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1121", "paidOnly": true, "title": "Divide Array Into Increasing Sequences", "titleSlug": "divide-array-into-increasing-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4929, "totalSubmissionRaw": 8027}, "1122": {"acRate": 74.79924551006023, "difficulty": "Easy", "likes": 3168, "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": 340638, "totalSubmissionRaw": 455404}, "1123": {"acRate": 72.59862163594974, "difficulty": "Medium", "likes": 1975, "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": 116401, "totalSubmissionRaw": 160335}, "1124": {"acRate": 35.33423439224952, "difficulty": "Medium", "likes": 1435, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "1124", "paidOnly": false, "title": "Longest Well-Performing Interval", "titleSlug": "longest-well-performing-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34247, "totalSubmissionRaw": 96923}, "1125": {"acRate": 55.49327064658625, "difficulty": "Hard", "likes": 2182, "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": 64446, "totalSubmissionRaw": 116133}, "1126": {"acRate": 65.7126176541786, "difficulty": "Medium", "likes": 273, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1126", "paidOnly": true, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46147, "totalSubmissionRaw": 70226}, "1127": {"acRate": 47.00899484761156, "difficulty": "Hard", "likes": 182, "dislikes": 134, "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": 16149, "totalSubmissionRaw": 34353}, "1128": {"acRate": 48.537734250567624, "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": 71615, "totalSubmissionRaw": 147545}, "1129": {"acRate": 47.095072822814046, "difficulty": "Medium", "likes": 3506, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "1129", "paidOnly": false, "title": "Shortest Path with Alternating Colors", "titleSlug": "shortest-path-with-alternating-colors", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120902, "totalSubmissionRaw": 256719}, "1130": {"acRate": 67.73431879128785, "difficulty": "Medium", "likes": 4287, "dislikes": 277, "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": 103559, "totalSubmissionRaw": 152890}, "1131": {"acRate": 48.5081087320367, "difficulty": "Medium", "likes": 648, "dislikes": 407, "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": 25215, "totalSubmissionRaw": 51981}, "1132": {"acRate": 32.244129097073966, "difficulty": "Medium", "likes": 156, "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": 38514, "totalSubmissionRaw": 119445}, "1133": {"acRate": 69.25399408435425, "difficulty": "Easy", "likes": 319, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1133", "paidOnly": true, "title": "Largest Unique Number", "titleSlug": "largest-unique-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67666, "totalSubmissionRaw": 97707}, "1134": {"acRate": 77.7899456577887, "difficulty": "Easy", "likes": 208, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1134", "paidOnly": true, "title": "Armstrong Number", "titleSlug": "armstrong-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37648, "totalSubmissionRaw": 48397}, "1135": {"acRate": 62.13368428796808, "difficulty": "Medium", "likes": 1122, "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": 76009, "totalSubmissionRaw": 122332}, "1136": {"acRate": 61.51829759128156, "difficulty": "Medium", "likes": 1169, "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": 89415, "totalSubmissionRaw": 145347}, "1137": {"acRate": 63.77342191807189, "difficulty": "Easy", "likes": 4458, "dislikes": 194, "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": 815035, "totalSubmissionRaw": 1278018}, "1138": {"acRate": 51.68238993710692, "difficulty": "Medium", "likes": 908, "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": 52592, "totalSubmissionRaw": 101760}, "1139": {"acRate": 50.335752298016445, "difficulty": "Medium", "likes": 712, "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": 26011, "totalSubmissionRaw": 51675}, "1140": {"acRate": 73.2713684607172, "difficulty": "Medium", "likes": 3299, "dislikes": 888, "categoryTitle": "Algorithms", "frontendQuestionId": "1140", "paidOnly": false, "title": "Stone Game II", "titleSlug": "stone-game-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 175005, "totalSubmissionRaw": 238845}, "1141": {"acRate": 48.87755707745617, "difficulty": "Easy", "likes": 699, "dislikes": 814, "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": 263493, "totalSubmissionRaw": 539089}, "1142": {"acRate": 35.74197371344861, "difficulty": "Easy", "likes": 99, "dislikes": 370, "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": 43429, "totalSubmissionRaw": 121507}, "1143": {"acRate": 57.741039074025956, "difficulty": "Medium", "likes": 13635, "dislikes": 199, "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": 1193315, "totalSubmissionRaw": 2066667}, "1144": {"acRate": 48.10201123391919, "difficulty": "Medium", "likes": 436, "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": 21238, "totalSubmissionRaw": 44152}, "1145": {"acRate": 52.149148950261605, "difficulty": "Medium", "likes": 1356, "dislikes": 214, "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": 47244, "totalSubmissionRaw": 90594}, "1146": {"acRate": 36.87603327602535, "difficulty": "Medium", "likes": 3721, "dislikes": 504, "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": 223497, "totalSubmissionRaw": 606072}, "1147": {"acRate": 58.76348721772972, "difficulty": "Hard", "likes": 674, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1147", "paidOnly": false, "title": "Longest Chunked Palindrome Decomposition", "titleSlug": "longest-chunked-palindrome-decomposition", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25216, "totalSubmissionRaw": 42911}, "1148": {"acRate": 76.32540675343003, "difficulty": "Easy", "likes": 1517, "dislikes": 89, "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": 761459, "totalSubmissionRaw": 997645}, "1149": {"acRate": 47.07668851209286, "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": 38287, "totalSubmissionRaw": 81329}, "1150": {"acRate": 58.96634002826233, "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": 50908, "totalSubmissionRaw": 86334}, "1151": {"acRate": 60.280224110011346, "difficulty": "Medium", "likes": 1213, "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": 69610, "totalSubmissionRaw": 115478}, "1152": {"acRate": 42.762535477767265, "difficulty": "Medium", "likes": 495, "dislikes": 3757, "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": 103055, "totalSubmissionRaw": 240995}, "1153": {"acRate": 34.933965594176456, "difficulty": "Hard", "likes": 880, "dislikes": 337, "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": 52453, "totalSubmissionRaw": 150149}, "1154": {"acRate": 48.90500417647505, "difficulty": "Easy", "likes": 456, "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": 64403, "totalSubmissionRaw": 131690}, "1155": {"acRate": 61.10970263992934, "difficulty": "Medium", "likes": 5070, "dislikes": 173, "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": 298890, "totalSubmissionRaw": 489104}, "1156": {"acRate": 44.035714285714285, "difficulty": "Medium", "likes": 1022, "dislikes": 98, "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": 33291, "totalSubmissionRaw": 75600}, "1157": {"acRate": 41.910180365573176, "difficulty": "Hard", "likes": 633, "dislikes": 62, "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": 17311, "totalSubmissionRaw": 41305}, "1158": {"acRate": 57.153600008297936, "difficulty": "Medium", "likes": 650, "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": 110203, "totalSubmissionRaw": 192819}, "1159": {"acRate": 57.18797520177799, "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": 19556, "totalSubmissionRaw": 34196}, "1160": {"acRate": 70.68686783856559, "difficulty": "Easy", "likes": 2119, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1160", "paidOnly": false, "title": "Find Words That Can Be Formed by Characters", "titleSlug": "find-words-that-can-be-formed-by-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 269340, "totalSubmissionRaw": 381033}, "1161": {"acRate": 67.17255841423841, "difficulty": "Medium", "likes": 3548, "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": 303666, "totalSubmissionRaw": 452070}, "1162": {"acRate": 51.635725217743165, "difficulty": "Medium", "likes": 4141, "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": 158232, "totalSubmissionRaw": 306439}, "1163": {"acRate": 34.5479835826305, "difficulty": "Hard", "likes": 595, "dislikes": 450, "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": 35269, "totalSubmissionRaw": 102087}, "1164": {"acRate": 56.41428375161986, "difficulty": "Medium", "likes": 926, "dislikes": 254, "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": 151929, "totalSubmissionRaw": 269311}, "1165": {"acRate": 87.55584175151931, "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": 87020, "totalSubmissionRaw": 99388}, "1166": {"acRate": 63.16498993963783, "difficulty": "Medium", "likes": 578, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1166", "paidOnly": true, "title": "Design File System", "titleSlug": "design-file-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62785, "totalSubmissionRaw": 99398}, "1167": {"acRate": 70.25576641038175, "difficulty": "Medium", "likes": 1315, "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": 126464, "totalSubmissionRaw": 180006}, "1168": {"acRate": 64.88450998303537, "difficulty": "Hard", "likes": 1161, "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": 49721, "totalSubmissionRaw": 76630}, "1169": {"acRate": 31.09878036249239, "difficulty": "Medium", "likes": 550, "dislikes": 2327, "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": 78688, "totalSubmissionRaw": 253026}, "1170": {"acRate": 62.450245932652294, "difficulty": "Medium", "likes": 712, "dislikes": 974, "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": 82528, "totalSubmissionRaw": 132150}, "1171": {"acRate": 52.74389190852542, "difficulty": "Medium", "likes": 3314, "dislikes": 216, "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": 167974, "totalSubmissionRaw": 318471}, "1172": {"acRate": 32.74507433820863, "difficulty": "Hard", "likes": 483, "dislikes": 65, "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": 18963, "totalSubmissionRaw": 57911}, "1173": {"acRate": 80.94672815707368, "difficulty": "Easy", "likes": 292, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1173", "paidOnly": true, "title": "Immediate Food Delivery I", "titleSlug": "immediate-food-delivery-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77054, "totalSubmissionRaw": 95191}, "1174": {"acRate": 52.210493772634926, "difficulty": "Medium", "likes": 756, "dislikes": 132, "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": 189144, "totalSubmissionRaw": 362272}, "1175": {"acRate": 57.91929582692613, "difficulty": "Easy", "likes": 410, "dislikes": 524, "categoryTitle": "Algorithms", "frontendQuestionId": "1175", "paidOnly": false, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32769, "totalSubmissionRaw": 56577}, "1176": {"acRate": 53.53792182295103, "difficulty": "Easy", "likes": 155, "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": 33269, "totalSubmissionRaw": 62141}, "1177": {"acRate": 39.383706205149856, "difficulty": "Medium", "likes": 808, "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": 28923, "totalSubmissionRaw": 73439}, "1178": {"acRate": 46.807026914745244, "difficulty": "Hard", "likes": 1271, "dislikes": 88, "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": 31547, "totalSubmissionRaw": 67398}, "1179": {"acRate": 76.95051575913395, "difficulty": "Easy", "likes": 743, "dislikes": 606, "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": 123611, "totalSubmissionRaw": 160637}, "1180": {"acRate": 80.04973986621691, "difficulty": "Easy", "likes": 356, "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": 28003, "totalSubmissionRaw": 34982}, "1181": {"acRate": 46.020205835143045, "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": 9748, "totalSubmissionRaw": 21182}, "1182": {"acRate": 55.43411519096156, "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": 36112, "totalSubmissionRaw": 65144}, "1183": {"acRate": 68.26011483509147, "difficulty": "Hard", "likes": 164, "dislikes": 29, "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": 5112, "totalSubmissionRaw": 7489}, "1184": {"acRate": 54.15905408666276, "difficulty": "Easy", "likes": 761, "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": 62844, "totalSubmissionRaw": 116036}, "1185": {"acRate": 57.76538072580779, "difficulty": "Easy", "likes": 405, "dislikes": 2453, "categoryTitle": "Algorithms", "frontendQuestionId": "1185", "paidOnly": false, "title": "Day of the Week", "titleSlug": "day-of-the-week", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69687, "totalSubmissionRaw": 120638}, "1186": {"acRate": 44.224712931410394, "difficulty": "Medium", "likes": 1829, "dislikes": 68, "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": 54767, "totalSubmissionRaw": 123838}, "1187": {"acRate": 58.1461780929866, "difficulty": "Hard", "likes": 2243, "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": 59030, "totalSubmissionRaw": 101520}, "1188": {"acRate": 72.4630590077307, "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": 51835, "totalSubmissionRaw": 71533}, "1189": {"acRate": 59.695575831349444, "difficulty": "Easy", "likes": 1714, "dislikes": 107, "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": 221662, "totalSubmissionRaw": 371322}, "1190": {"acRate": 71.72667824698797, "difficulty": "Medium", "likes": 2817, "dislikes": 118, "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": 219262, "totalSubmissionRaw": 305691}, "1191": {"acRate": 23.894848442943033, "difficulty": "Medium", "likes": 1449, "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": 36286, "totalSubmissionRaw": 151857}, "1192": {"acRate": 56.474256083853334, "difficulty": "Hard", "likes": 6234, "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": 244179, "totalSubmissionRaw": 432373}, "1193": {"acRate": 58.12088488508341, "difficulty": "Medium", "likes": 849, "dislikes": 84, "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": 222707, "totalSubmissionRaw": 383182}, "1194": {"acRate": 49.208215199502106, "difficulty": "Hard", "likes": 150, "dislikes": 55, "categoryTitle": "Database", "frontendQuestionId": "1194", "paidOnly": true, "title": "Tournament Winners", "titleSlug": "tournament-winners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21348, "totalSubmissionRaw": 43383}, "1195": {"acRate": 72.9091936167208, "difficulty": "Medium", "likes": 609, "dislikes": 411, "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": 51627, "totalSubmissionRaw": 70810}, "1196": {"acRate": 67.01298701298701, "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": 37152, "totalSubmissionRaw": 55440}, "1197": {"acRate": 40.6983519016714, "difficulty": "Medium", "likes": 1514, "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": 160660, "totalSubmissionRaw": 394758}, "1198": {"acRate": 76.47491638795987, "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": 45732, "totalSubmissionRaw": 59800}, "1199": {"acRate": 45.78304944486587, "difficulty": "Hard", "likes": 235, "dislikes": 31, "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": 6639, "totalSubmissionRaw": 14501}, "1200": {"acRate": 69.73640261014789, "difficulty": "Easy", "likes": 2358, "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": 202517, "totalSubmissionRaw": 290404}, "1201": {"acRate": 29.8387379491674, "difficulty": "Medium", "likes": 1239, "dislikes": 501, "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": 34046, "totalSubmissionRaw": 114100}, "1202": {"acRate": 58.580440244460064, "difficulty": "Medium", "likes": 3703, "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": 119145, "totalSubmissionRaw": 203387}, "1203": {"acRate": 66.2275734636705, "difficulty": "Hard", "likes": 1776, "dislikes": 302, "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": 55554, "totalSubmissionRaw": 83884}, "1204": {"acRate": 67.50669297204077, "difficulty": "Medium", "likes": 733, "dislikes": 34, "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": 149518, "totalSubmissionRaw": 221483}, "1205": {"acRate": 41.72852505045188, "difficulty": "Medium", "likes": 157, "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": 23779, "totalSubmissionRaw": 56985}, "1206": {"acRate": 61.812703991965854, "difficulty": "Hard", "likes": 668, "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": 24620, "totalSubmissionRaw": 39830}, "1207": {"acRate": 77.45245963245875, "difficulty": "Easy", "likes": 5106, "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": 688374, "totalSubmissionRaw": 888770}, "1208": {"acRate": 58.34890965732087, "difficulty": "Medium", "likes": 1795, "dislikes": 138, "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": 162950, "totalSubmissionRaw": 279269}, "1209": {"acRate": 58.241889859197606, "difficulty": "Medium", "likes": 5792, "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": 330666, "totalSubmissionRaw": 567746}, "1210": {"acRate": 50.02746018273504, "difficulty": "Hard", "likes": 270, "dislikes": 73, "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": 10020, "totalSubmissionRaw": 20029}, "1211": {"acRate": 44.875267803495454, "difficulty": "Easy", "likes": 650, "dislikes": 429, "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": 221818, "totalSubmissionRaw": 494296}, "1212": {"acRate": 55.400040647652595, "difficulty": "Medium", "likes": 311, "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": 40889, "totalSubmissionRaw": 73806}, "1213": {"acRate": 79.80903711672941, "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": 89018, "totalSubmissionRaw": 111539}, "1214": {"acRate": 67.23517404383325, "difficulty": "Medium", "likes": 550, "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": 50064, "totalSubmissionRaw": 74462}, "1215": {"acRate": 47.37099057755212, "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": 9703, "totalSubmissionRaw": 20483}, "1216": {"acRate": 49.23089389171743, "difficulty": "Hard", "likes": 770, "dislikes": 14, "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": 72908, "totalSubmissionRaw": 148094}, "1217": {"acRate": 71.81270158809969, "difficulty": "Easy", "likes": 2308, "dislikes": 317, "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": 134256, "totalSubmissionRaw": 186953}, "1218": {"acRate": 54.63720998965568, "difficulty": "Medium", "likes": 3222, "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": 147892, "totalSubmissionRaw": 270679}, "1219": {"acRate": 68.03147905254224, "difficulty": "Medium", "likes": 3297, "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": 220439, "totalSubmissionRaw": 324025}, "1220": {"acRate": 61.78378673063294, "difficulty": "Hard", "likes": 3254, "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": 169994, "totalSubmissionRaw": 275144}, "1221": {"acRate": 86.37814626768932, "difficulty": "Easy", "likes": 2755, "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": 319841, "totalSubmissionRaw": 370280}, "1222": {"acRate": 71.99181334424888, "difficulty": "Medium", "likes": 948, "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": 43969, "totalSubmissionRaw": 61075}, "1223": {"acRate": 49.43942771905625, "difficulty": "Hard", "likes": 934, "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": 30824, "totalSubmissionRaw": 62347}, "1224": {"acRate": 37.38777053208581, "difficulty": "Hard", "likes": 541, "dislikes": 67, "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": 15824, "totalSubmissionRaw": 42324}, "1225": {"acRate": 57.35266472412821, "difficulty": "Hard", "likes": 323, "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": 24406, "totalSubmissionRaw": 42555}, "1226": {"acRate": 54.132093755678035, "difficulty": "Medium", "likes": 354, "dislikes": 333, "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": 35751, "totalSubmissionRaw": 66044}, "1227": {"acRate": 66.55115785033071, "difficulty": "Medium", "likes": 617, "dislikes": 973, "categoryTitle": "Algorithms", "frontendQuestionId": "1227", "paidOnly": false, "title": "Airplane Seat Assignment Probability", "titleSlug": "airplane-seat-assignment-probability", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44172, "totalSubmissionRaw": 66373}, "1228": {"acRate": 51.97367197813435, "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": 27953, "totalSubmissionRaw": 53783}, "1229": {"acRate": 54.99495249816769, "difficulty": "Medium", "likes": 885, "dislikes": 34, "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": 79533, "totalSubmissionRaw": 144620}, "1230": {"acRate": 58.21855918512636, "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": 21259, "totalSubmissionRaw": 36518}, "1231": {"acRate": 58.90609068397944, "difficulty": "Hard", "likes": 989, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1231", "paidOnly": true, "title": "Divide Chocolate", "titleSlug": "divide-chocolate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56617, "totalSubmissionRaw": 96114}, "1232": {"acRate": 39.50662595913867, "difficulty": "Easy", "likes": 2604, "dislikes": 279, "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": 263716, "totalSubmissionRaw": 667522}, "1233": {"acRate": 66.06723340356996, "difficulty": "Medium", "likes": 814, "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": 54557, "totalSubmissionRaw": 82578}, "1234": {"acRate": 38.60729512079583, "difficulty": "Medium", "likes": 1196, "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": 35860, "totalSubmissionRaw": 92884}, "1235": {"acRate": 54.30756871093273, "difficulty": "Hard", "likes": 6831, "dislikes": 109, "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": 320417, "totalSubmissionRaw": 590005}, "1236": {"acRate": 67.99590824765505, "difficulty": "Medium", "likes": 288, "dislikes": 327, "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": 39218, "totalSubmissionRaw": 57677}, "1237": {"acRate": 69.65657049841717, "difficulty": "Medium", "likes": 518, "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": 69752, "totalSubmissionRaw": 100137}, "1238": {"acRate": 70.52607997610426, "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": 18889, "totalSubmissionRaw": 26783}, "1239": {"acRate": 54.12404003437855, "difficulty": "Medium", "likes": 4428, "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": 292830, "totalSubmissionRaw": 541035}, "1240": {"acRate": 54.38498241526848, "difficulty": "Hard", "likes": 688, "dislikes": 569, "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": 24278, "totalSubmissionRaw": 44641}, "1241": {"acRate": 65.94676224959517, "difficulty": "Easy", "likes": 178, "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": 36245, "totalSubmissionRaw": 54961}, "1242": {"acRate": 49.43654150113204, "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": 57862, "totalSubmissionRaw": 117044}, "1243": {"acRate": 52.444022770398476, "difficulty": "Easy", "likes": 153, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1243", "paidOnly": true, "title": "Array Transformation", "titleSlug": "array-transformation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13818, "totalSubmissionRaw": 26349}, "1244": {"acRate": 67.91754804446644, "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": 75453, "totalSubmissionRaw": 111095}, "1245": {"acRate": 61.20027635320064, "difficulty": "Medium", "likes": 855, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1245", "paidOnly": true, "title": "Tree Diameter", "titleSlug": "tree-diameter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46063, "totalSubmissionRaw": 75266}, "1246": {"acRate": 46.31534391534392, "difficulty": "Hard", "likes": 310, "dislikes": 14, "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": 10941, "totalSubmissionRaw": 23624}, "1247": {"acRate": 64.46000588718299, "difficulty": "Medium", "likes": 1387, "dislikes": 243, "categoryTitle": "Algorithms", "frontendQuestionId": "1247", "paidOnly": false, "title": "Minimum Swaps to Make Strings Equal", "titleSlug": "minimum-swaps-to-make-strings-equal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41607, "totalSubmissionRaw": 64547}, "1248": {"acRate": 71.4425473921562, "difficulty": "Medium", "likes": 4594, "dislikes": 117, "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": 273116, "totalSubmissionRaw": 382288}, "1249": {"acRate": 69.22447496861861, "difficulty": "Medium", "likes": 6907, "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": 769848, "totalSubmissionRaw": 1112108}, "1250": {"acRate": 59.899446472166495, "difficulty": "Hard", "likes": 514, "dislikes": 379, "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": 24781, "totalSubmissionRaw": 41371}, "1251": {"acRate": 37.478435115249255, "difficulty": "Easy", "likes": 1230, "dislikes": 173, "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": 287839, "totalSubmissionRaw": 768018}, "1252": {"acRate": 78.8073083292872, "difficulty": "Easy", "likes": 1225, "dislikes": 1524, "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": 118486, "totalSubmissionRaw": 150349}, "1253": {"acRate": 46.83509116180198, "difficulty": "Medium", "likes": 464, "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": 28642, "totalSubmissionRaw": 61155}, "1254": {"acRate": 66.43327629719073, "difficulty": "Medium", "likes": 4553, "dislikes": 167, "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": 232173, "totalSubmissionRaw": 349484}, "1255": {"acRate": 82.02640514072452, "difficulty": "Hard", "likes": 1748, "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": 116927, "totalSubmissionRaw": 142548}, "1256": {"acRate": 69.88037217545414, "difficulty": "Medium", "likes": 78, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1256", "paidOnly": true, "title": "Encode Number", "titleSlug": "encode-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7886, "totalSubmissionRaw": 11285}, "1257": {"acRate": 66.0963705280648, "difficulty": "Medium", "likes": 438, "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": 25459, "totalSubmissionRaw": 38518}, "1258": {"acRate": 56.43790616296508, "difficulty": "Medium", "likes": 356, "dislikes": 163, "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": 23709, "totalSubmissionRaw": 42009}, "1259": {"acRate": 59.61250374513133, "difficulty": "Hard", "likes": 234, "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": 11935, "totalSubmissionRaw": 20023}, "1260": {"acRate": 67.43825060914523, "difficulty": "Easy", "likes": 1732, "dislikes": 343, "categoryTitle": "Algorithms", "frontendQuestionId": "1260", "paidOnly": false, "title": "Shift 2D Grid", "titleSlug": "shift-2d-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109049, "totalSubmissionRaw": 161702}, "1261": {"acRate": 77.54633920296571, "difficulty": "Medium", "likes": 994, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1261", "paidOnly": false, "title": "Find Elements in a Contaminated Binary Tree", "titleSlug": "find-elements-in-a-contaminated-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66938, "totalSubmissionRaw": 86320}, "1262": {"acRate": 50.59750446259772, "difficulty": "Medium", "likes": 1819, "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": 57541, "totalSubmissionRaw": 113723}, "1263": {"acRate": 49.10162154734093, "difficulty": "Hard", "likes": 850, "dislikes": 58, "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": 28585, "totalSubmissionRaw": 58216}, "1264": {"acRate": 65.2157732557274, "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": 43809, "totalSubmissionRaw": 67176}, "1265": {"acRate": 94.05860655088891, "difficulty": "Medium", "likes": 579, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1265", "paidOnly": true, "title": "Print Immutable Linked List in Reverse", "titleSlug": "print-immutable-linked-list-in-reverse", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59414, "totalSubmissionRaw": 63167}, "1266": {"acRate": 82.46820225110639, "difficulty": "Easy", "likes": 2205, "dislikes": 230, "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": 236659, "totalSubmissionRaw": 286970}, "1267": {"acRate": 60.65567271862364, "difficulty": "Medium", "likes": 1304, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1267", "paidOnly": false, "title": "Count Servers that Communicate", "titleSlug": "count-servers-that-communicate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61204, "totalSubmissionRaw": 100904}, "1268": {"acRate": 65.10243809037529, "difficulty": "Medium", "likes": 4746, "dislikes": 243, "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": 326404, "totalSubmissionRaw": 501369}, "1269": {"acRate": 50.27036643682374, "difficulty": "Hard", "likes": 1550, "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": 93244, "totalSubmissionRaw": 185487}, "1270": {"acRate": 84.72485061616176, "difficulty": "Medium", "likes": 423, "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": 56857, "totalSubmissionRaw": 67108}, "1271": {"acRate": 58.15095111474739, "difficulty": "Easy", "likes": 78, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1271", "paidOnly": true, "title": "Hexspeak", "titleSlug": "hexspeak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11371, "totalSubmissionRaw": 19555}, "1272": {"acRate": 66.27456580333077, "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": 37127, "totalSubmissionRaw": 56021}, "1273": {"acRate": 61.2279471900923, "difficulty": "Medium", "likes": 226, "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": 10480, "totalSubmissionRaw": 17117}, "1274": {"acRate": 68.66682232080318, "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": 29407, "totalSubmissionRaw": 42827}, "1275": {"acRate": 53.95783065900348, "difficulty": "Easy", "likes": 1498, "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": 131716, "totalSubmissionRaw": 244110}, "1276": {"acRate": 51.20454545454546, "difficulty": "Medium", "likes": 331, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "1276", "paidOnly": false, "title": "Number of Burgers with No Waste of Ingredients", "titleSlug": "number-of-burgers-with-no-waste-of-ingredients", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27036, "totalSubmissionRaw": 52800}, "1277": {"acRate": 75.51234551908179, "difficulty": "Medium", "likes": 4882, "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": 233163, "totalSubmissionRaw": 308775}, "1278": {"acRate": 61.16461183013351, "difficulty": "Hard", "likes": 1149, "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": 29915, "totalSubmissionRaw": 48909}, "1279": {"acRate": 72.82667854138836, "difficulty": "Easy", "likes": 75, "dislikes": 354, "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": 14718, "totalSubmissionRaw": 20210}, "1280": {"acRate": 58.55217756574703, "difficulty": "Easy", "likes": 1826, "dislikes": 248, "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": 312225, "totalSubmissionRaw": 533246}, "1281": {"acRate": 86.58244544723783, "difficulty": "Easy", "likes": 2580, "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": 515937, "totalSubmissionRaw": 595891}, "1282": {"acRate": 87.42490436842596, "difficulty": "Medium", "likes": 3003, "dislikes": 711, "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": 215518, "totalSubmissionRaw": 246518}, "1283": {"acRate": 61.21272885293767, "difficulty": "Medium", "likes": 2951, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "1283", "paidOnly": false, "title": "Find the Smallest Divisor Given a Threshold", "titleSlug": "find-the-smallest-divisor-given-a-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 215518, "totalSubmissionRaw": 352081}, "1284": {"acRate": 72.18350877936162, "difficulty": "Hard", "likes": 971, "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": 34080, "totalSubmissionRaw": 47213}, "1285": {"acRate": 82.21553599381976, "difficulty": "Medium", "likes": 562, "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": 40440, "totalSubmissionRaw": 49188}, "1286": {"acRate": 73.32000827072851, "difficulty": "Medium", "likes": 1364, "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": 74465, "totalSubmissionRaw": 101562}, "1287": {"acRate": 60.99568688376662, "difficulty": "Easy", "likes": 1707, "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": 221038, "totalSubmissionRaw": 362383}, "1288": {"acRate": 56.27755318565131, "difficulty": "Medium", "likes": 2231, "dislikes": 59, "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": 123061, "totalSubmissionRaw": 218668}, "1289": {"acRate": 64.30228998149734, "difficulty": "Hard", "likes": 2261, "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": 144920, "totalSubmissionRaw": 225373}, "1290": {"acRate": 81.13179517067206, "difficulty": "Easy", "likes": 4167, "dislikes": 160, "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": 496972, "totalSubmissionRaw": 612549}, "1291": {"acRate": 65.28370723400229, "difficulty": "Medium", "likes": 2863, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "1291", "paidOnly": false, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [{"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220813, "totalSubmissionRaw": 338236}, "1292": {"acRate": 53.687169822978774, "difficulty": "Medium", "likes": 1088, "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": 34755, "totalSubmissionRaw": 64737}, "1293": {"acRate": 45.309589418285206, "difficulty": "Hard", "likes": 4533, "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": 217208, "totalSubmissionRaw": 479388}, "1294": {"acRate": 66.76823744502825, "difficulty": "Easy", "likes": 141, "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": 40535, "totalSubmissionRaw": 60711}, "1295": {"acRate": 77.43405249596017, "difficulty": "Easy", "likes": 2396, "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"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 709196, "totalSubmissionRaw": 915871}, "1296": {"acRate": 58.52289356919583, "difficulty": "Medium", "likes": 1868, "dislikes": 114, "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": 99977, "totalSubmissionRaw": 170834}, "1297": {"acRate": 52.17591569017613, "difficulty": "Medium", "likes": 1095, "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": 56638, "totalSubmissionRaw": 108552}, "1298": {"acRate": 57.76491885950734, "difficulty": "Hard", "likes": 345, "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": 17869, "totalSubmissionRaw": 30934}, "1299": {"acRate": 71.28840186733011, "difficulty": "Easy", "likes": 2602, "dislikes": 246, "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": 408027, "totalSubmissionRaw": 572362}, "1300": {"acRate": 44.702038800071854, "difficulty": "Medium", "likes": 1148, "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": 39817, "totalSubmissionRaw": 89072}, "1301": {"acRate": 39.79773282951767, "difficulty": "Hard", "likes": 515, "dislikes": 26, "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": 14324, "totalSubmissionRaw": 35992}, "1302": {"acRate": 86.32616370128268, "difficulty": "Medium", "likes": 4707, "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": 342834, "totalSubmissionRaw": 397138}, "1303": {"acRate": 89.56738872588801, "difficulty": "Easy", "likes": 335, "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": 71739, "totalSubmissionRaw": 80095}, "1304": {"acRate": 76.16258705931484, "difficulty": "Easy", "likes": 1997, "dislikes": 599, "categoryTitle": "Algorithms", "frontendQuestionId": "1304", "paidOnly": false, "title": "Find N Unique Integers Sum up to Zero", "titleSlug": "find-n-unique-integers-sum-up-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 226145, "totalSubmissionRaw": 296924}, "1305": {"acRate": 79.84713120761342, "difficulty": "Medium", "likes": 3074, "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": 223346, "totalSubmissionRaw": 279717}, "1306": {"acRate": 65.23163893616275, "difficulty": "Medium", "likes": 4163, "dislikes": 105, "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": 241861, "totalSubmissionRaw": 370772}, "1307": {"acRate": 34.6674684305472, "difficulty": "Hard", "likes": 504, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1307", "paidOnly": false, "title": "Verbal Arithmetic Puzzle", "titleSlug": "verbal-arithmetic-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14413, "totalSubmissionRaw": 41575}, "1308": {"acRate": 86.41599337062358, "difficulty": "Medium", "likes": 216, "dislikes": 63, "categoryTitle": "Database", "frontendQuestionId": "1308", "paidOnly": true, "title": "Running Total for Different Genders", "titleSlug": "running-total-for-different-genders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41712, "totalSubmissionRaw": 48269}, "1309": {"acRate": 79.85161514070552, "difficulty": "Easy", "likes": 1542, "dislikes": 111, "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": 128938, "totalSubmissionRaw": 161472}, "1310": {"acRate": 73.25654022629543, "difficulty": "Medium", "likes": 1500, "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": 60989, "totalSubmissionRaw": 83254}, "1311": {"acRate": 47.76448186383408, "difficulty": "Medium", "likes": 409, "dislikes": 425, "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": 25586, "totalSubmissionRaw": 53567}, "1312": {"acRate": 71.26463831456266, "difficulty": "Hard", "likes": 5088, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1312", "paidOnly": false, "title": "Minimum Insertion Steps to Make a String Palindrome", "titleSlug": "minimum-insertion-steps-to-make-a-string-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190779, "totalSubmissionRaw": 267705}, "1313": {"acRate": 85.8242280582154, "difficulty": "Easy", "likes": 1273, "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": 274447, "totalSubmissionRaw": 319778}, "1314": {"acRate": 75.62688646389599, "difficulty": "Medium", "likes": 2401, "dislikes": 377, "categoryTitle": "Algorithms", "frontendQuestionId": "1314", "paidOnly": false, "title": "Matrix Block Sum", "titleSlug": "matrix-block-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91203, "totalSubmissionRaw": 120596}, "1315": {"acRate": 85.59293365908664, "difficulty": "Medium", "likes": 2754, "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": 159404, "totalSubmissionRaw": 186235}, "1316": {"acRate": 50.84246735074627, "difficulty": "Hard", "likes": 319, "dislikes": 205, "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": 17441, "totalSubmissionRaw": 34304}, "1317": {"acRate": 53.95621973398777, "difficulty": "Easy", "likes": 413, "dislikes": 315, "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": 49248, "totalSubmissionRaw": 91274}, "1318": {"acRate": 71.17825182807019, "difficulty": "Medium", "likes": 1988, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "1318", "paidOnly": false, "title": "Minimum Flips to Make a OR b Equal to c", "titleSlug": "minimum-flips-to-make-a-or-b-equal-to-c", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136567, "totalSubmissionRaw": 191867}, "1319": {"acRate": 63.34144839116534, "difficulty": "Medium", "likes": 5068, "dislikes": 73, "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": 237545, "totalSubmissionRaw": 375023}, "1320": {"acRate": 59.09124021125478, "difficulty": "Hard", "likes": 1005, "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": 32447, "totalSubmissionRaw": 54910}, "1321": {"acRate": 52.789419101873825, "difficulty": "Medium", "likes": 797, "dislikes": 296, "categoryTitle": "Database", "frontendQuestionId": "1321", "paidOnly": false, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 111475, "totalSubmissionRaw": 211171}, "1322": {"acRate": 59.373230130262414, "difficulty": "Easy", "likes": 260, "dislikes": 64, "categoryTitle": "Database", "frontendQuestionId": "1322", "paidOnly": true, "title": "Ads Performance", "titleSlug": "ads-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44030, "totalSubmissionRaw": 74158}, "1323": {"acRate": 82.43600608235216, "difficulty": "Easy", "likes": 2801, "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": 274318, "totalSubmissionRaw": 332763}, "1324": {"acRate": 64.60117955637764, "difficulty": "Medium", "likes": 785, "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": 42609, "totalSubmissionRaw": 65957}, "1325": {"acRate": 77.41074180530568, "difficulty": "Medium", "likes": 2750, "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": 215993, "totalSubmissionRaw": 279022}, "1326": {"acRate": 50.76554988205082, "difficulty": "Hard", "likes": 3417, "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": 136007, "totalSubmissionRaw": 267912}, "1327": {"acRate": 71.16367220074294, "difficulty": "Easy", "likes": 379, "dislikes": 36, "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": 140808, "totalSubmissionRaw": 197865}, "1328": {"acRate": 51.700944057508465, "difficulty": "Medium", "likes": 2337, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "1328", "paidOnly": false, "title": "Break a Palindrome", "titleSlug": "break-a-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173330, "totalSubmissionRaw": 335255}, "1329": {"acRate": 82.90711993155529, "difficulty": "Medium", "likes": 3398, "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": 167644, "totalSubmissionRaw": 202207}, "1330": {"acRate": 41.90724405239241, "difficulty": "Hard", "likes": 481, "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": 6271, "totalSubmissionRaw": 14964}, "1331": {"acRate": 62.57685915019017, "difficulty": "Easy", "likes": 1706, "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": 122736, "totalSubmissionRaw": 196134}, "1332": {"acRate": 76.51014945349097, "difficulty": "Easy", "likes": 1668, "dislikes": 1770, "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": 137198, "totalSubmissionRaw": 179320}, "1333": {"acRate": 61.72363795260889, "difficulty": "Medium", "likes": 307, "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": 31076, "totalSubmissionRaw": 50347}, "1334": {"acRate": 68.39761423773744, "difficulty": "Medium", "likes": 3183, "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": 213642, "totalSubmissionRaw": 312353}, "1335": {"acRate": 59.5887343790116, "difficulty": "Hard", "likes": 3420, "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": 199599, "totalSubmissionRaw": 334963}, "1336": {"acRate": 47.64027557749696, "difficulty": "Hard", "likes": 92, "dislikes": 316, "categoryTitle": "Database", "frontendQuestionId": "1336", "paidOnly": true, "title": "Number of Transactions per Visit", "titleSlug": "number-of-transactions-per-visit", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12930, "totalSubmissionRaw": 27142}, "1337": {"acRate": 73.62388586161353, "difficulty": "Easy", "likes": 4178, "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": 372369, "totalSubmissionRaw": 505771}, "1338": {"acRate": 68.96262437252723, "difficulty": "Medium", "likes": 3259, "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": 199753, "totalSubmissionRaw": 289654}, "1339": {"acRate": 47.712398633908556, "difficulty": "Medium", "likes": 3016, "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": 126852, "totalSubmissionRaw": 265868}, "1340": {"acRate": 63.52617909436519, "difficulty": "Hard", "likes": 1112, "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": 33754, "totalSubmissionRaw": 53134}, "1341": {"acRate": 40.33270558694287, "difficulty": "Medium", "likes": 606, "dislikes": 189, "categoryTitle": "Database", "frontendQuestionId": "1341", "paidOnly": false, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 120788, "totalSubmissionRaw": 299481}, "1342": {"acRate": 85.3016520000531, "difficulty": "Easy", "likes": 3975, "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": 706936, "totalSubmissionRaw": 828749}, "1343": {"acRate": 68.88522943304574, "difficulty": "Medium", "likes": 1609, "dislikes": 106, "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": 108342, "totalSubmissionRaw": 157279}, "1344": {"acRate": 63.90033672778029, "difficulty": "Medium", "likes": 1317, "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": 125437, "totalSubmissionRaw": 196301}, "1345": {"acRate": 46.17059470365068, "difficulty": "Hard", "likes": 3741, "dislikes": 131, "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": 147377, "totalSubmissionRaw": 319201}, "1346": {"acRate": 37.42037344069939, "difficulty": "Easy", "likes": 1930, "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": 368792, "totalSubmissionRaw": 985538}, "1347": {"acRate": 82.02552189591226, "difficulty": "Medium", "likes": 2718, "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": 287068, "totalSubmissionRaw": 349974}, "1348": {"acRate": 44.726619662099246, "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": 33621, "totalSubmissionRaw": 75170}, "1349": {"acRate": 50.822814675002945, "difficulty": "Hard", "likes": 830, "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": 17233, "totalSubmissionRaw": 33908}, "1350": {"acRate": 89.7550423306773, "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": 57673, "totalSubmissionRaw": 64256}, "1351": {"acRate": 77.42255406870072, "difficulty": "Easy", "likes": 4980, "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": 437168, "totalSubmissionRaw": 564652}, "1352": {"acRate": 51.81599163598345, "difficulty": "Medium", "likes": 1484, "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": 91192, "totalSubmissionRaw": 175992}, "1353": {"acRate": 32.47703211129583, "difficulty": "Medium", "likes": 3059, "dislikes": 431, "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": 92795, "totalSubmissionRaw": 285725}, "1354": {"acRate": 36.20898560558329, "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": 67239, "totalSubmissionRaw": 185697}, "1355": {"acRate": 72.42947046014692, "difficulty": "Medium", "likes": 147, "dislikes": 48, "categoryTitle": "Database", "frontendQuestionId": "1355", "paidOnly": true, "title": "Activity Participants", "titleSlug": "activity-participants", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30267, "totalSubmissionRaw": 41789}, "1356": {"acRate": 78.32680437851913, "difficulty": "Easy", "likes": 2458, "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": 231338, "totalSubmissionRaw": 295350}, "1357": {"acRate": 71.41512584631265, "difficulty": "Medium", "likes": 195, "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": 23522, "totalSubmissionRaw": 32937}, "1358": {"acRate": 67.70793319094666, "difficulty": "Medium", "likes": 3286, "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": 132195, "totalSubmissionRaw": 195243}, "1359": {"acRate": 64.99851878030654, "difficulty": "Hard", "likes": 3036, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1359", "paidOnly": false, "title": "Count All Valid Pickup and Delivery Options", "titleSlug": "count-all-valid-pickup-and-delivery-options", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125063, "totalSubmissionRaw": 192409}, "1360": {"acRate": 50.328606652795216, "difficulty": "Easy", "likes": 374, "dislikes": 1281, "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": 54907, "totalSubmissionRaw": 109097}, "1361": {"acRate": 43.82161278523816, "difficulty": "Medium", "likes": 2136, "dislikes": 510, "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": 117413, "totalSubmissionRaw": 267934}, "1362": {"acRate": 60.97579995321151, "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": 23458, "totalSubmissionRaw": 38471}, "1363": {"acRate": 32.69156260244985, "difficulty": "Hard", "likes": 605, "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": 21938, "totalSubmissionRaw": 67106}, "1364": {"acRate": 74.99274836838289, "difficulty": "Medium", "likes": 88, "dislikes": 388, "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": 20683, "totalSubmissionRaw": 27580}, "1365": {"acRate": 86.9433758027003, "difficulty": "Easy", "likes": 5491, "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": 594371, "totalSubmissionRaw": 683630}, "1366": {"acRate": 58.553396508879786, "difficulty": "Medium", "likes": 1458, "dislikes": 170, "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": 77050, "totalSubmissionRaw": 131589}, "1367": {"acRate": 44.06295026303738, "difficulty": "Medium", "likes": 2249, "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": 78900, "totalSubmissionRaw": 179062}, "1368": {"acRate": 62.391315273659345, "difficulty": "Hard", "likes": 1774, "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": 49656, "totalSubmissionRaw": 79588}, "1369": {"acRate": 67.67750356676684, "difficulty": "Hard", "likes": 162, "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": 22294, "totalSubmissionRaw": 32942}, "1370": {"acRate": 76.59856526358345, "difficulty": "Easy", "likes": 782, "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": 81471, "totalSubmissionRaw": 106361}, "1371": {"acRate": 64.18048714356726, "difficulty": "Medium", "likes": 1632, "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": 28405, "totalSubmissionRaw": 44258}, "1372": {"acRate": 65.90365757640826, "difficulty": "Medium", "likes": 3470, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1372", "paidOnly": false, "title": "Longest ZigZag Path in a Binary Tree", "titleSlug": "longest-zigzag-path-in-a-binary-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 184149, "totalSubmissionRaw": 279421}, "1373": {"acRate": 41.88771265155757, "difficulty": "Hard", "likes": 2682, "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": 80047, "totalSubmissionRaw": 191099}, "1374": {"acRate": 77.99662441882683, "difficulty": "Easy", "likes": 487, "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": 97970, "totalSubmissionRaw": 125608}, "1375": {"acRate": 65.80120320529996, "difficulty": "Medium", "likes": 943, "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": 54032, "totalSubmissionRaw": 82114}, "1376": {"acRate": 60.050129757088285, "difficulty": "Medium", "likes": 4100, "dislikes": 302, "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": 223527, "totalSubmissionRaw": 372234}, "1377": {"acRate": 35.54959117573781, "difficulty": "Hard", "likes": 792, "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": 31391, "totalSubmissionRaw": 88302}, "1378": {"acRate": 83.33419292726117, "difficulty": "Easy", "likes": 1282, "dislikes": 115, "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": 581661, "totalSubmissionRaw": 697982}, "1379": {"acRate": 85.90893660664631, "difficulty": "Easy", "likes": 1754, "dislikes": 2005, "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": 237887, "totalSubmissionRaw": 276906}, "1380": {"acRate": 79.90399461200735, "difficulty": "Easy", "likes": 2191, "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": 251509, "totalSubmissionRaw": 314766}, "1381": {"acRate": 77.20360975991444, "difficulty": "Medium", "likes": 1830, "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": 118401, "totalSubmissionRaw": 153362}, "1382": {"acRate": 84.69544435168362, "difficulty": "Medium", "likes": 3655, "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": 258698, "totalSubmissionRaw": 305445}, "1383": {"acRate": 47.687820042992136, "difficulty": "Hard", "likes": 3106, "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": 96945, "totalSubmissionRaw": 203292}, "1384": {"acRate": 61.14663566342101, "difficulty": "Hard", "likes": 229, "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": 16830, "totalSubmissionRaw": 27524}, "1385": {"acRate": 68.9231547017189, "difficulty": "Easy", "likes": 917, "dislikes": 3055, "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": 109064, "totalSubmissionRaw": 158240}, "1386": {"acRate": 42.261212519593464, "difficulty": "Medium", "likes": 906, "dislikes": 399, "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": 50148, "totalSubmissionRaw": 118662}, "1387": {"acRate": 70.18599803285427, "difficulty": "Medium", "likes": 1451, "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": 95620, "totalSubmissionRaw": 136238}, "1388": {"acRate": 52.17275595939627, "difficulty": "Hard", "likes": 1065, "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": 27446, "totalSubmissionRaw": 52606}, "1389": {"acRate": 85.98864879830194, "difficulty": "Easy", "likes": 2061, "dislikes": 1870, "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": 260893, "totalSubmissionRaw": 303404}, "1390": {"acRate": 43.23590886520318, "difficulty": "Medium", "likes": 418, "dislikes": 191, "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": 37441, "totalSubmissionRaw": 86597}, "1391": {"acRate": 48.20901744484351, "difficulty": "Medium", "likes": 829, "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": 30067, "totalSubmissionRaw": 62368}, "1392": {"acRate": 46.52633187522683, "difficulty": "Hard", "likes": 1369, "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": 48714, "totalSubmissionRaw": 104702}, "1393": {"acRate": 85.36822126599151, "difficulty": "Medium", "likes": 819, "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": 117843, "totalSubmissionRaw": 138041}, "1394": {"acRate": 67.71690846849783, "difficulty": "Easy", "likes": 1156, "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": 132931, "totalSubmissionRaw": 196304}, "1395": {"acRate": 70.13598144297924, "difficulty": "Medium", "likes": 3351, "dislikes": 229, "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": 221629, "totalSubmissionRaw": 315999}, "1396": {"acRate": 74.71373833055698, "difficulty": "Medium", "likes": 3508, "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": 234572, "totalSubmissionRaw": 313961}, "1397": {"acRate": 42.64823841549947, "difficulty": "Hard", "likes": 489, "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": 6912, "totalSubmissionRaw": 16207}, "1398": {"acRate": 72.49539028887523, "difficulty": "Medium", "likes": 305, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1398", "paidOnly": true, "title": "Customers Who Bought Products A and B but Not C", "titleSlug": "customers-who-bought-products-a-and-b-but-not-c", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54257, "totalSubmissionRaw": 74842}, "1399": {"acRate": 66.4268453427065, "difficulty": "Easy", "likes": 443, "dislikes": 985, "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": 48380, "totalSubmissionRaw": 72832}, "1400": {"acRate": 62.157139925670904, "difficulty": "Medium", "likes": 1056, "dislikes": 94, "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": 54523, "totalSubmissionRaw": 87718}, "1401": {"acRate": 46.78733512035882, "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": 17629, "totalSubmissionRaw": 37679}, "1402": {"acRate": 76.22357689018688, "difficulty": "Hard", "likes": 3316, "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": 152422, "totalSubmissionRaw": 199967}, "1403": {"acRate": 72.76280245991148, "difficulty": "Easy", "likes": 586, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "1403", "paidOnly": false, "title": "Minimum Subsequence in Non-Increasing Order", "titleSlug": "minimum-subsequence-in-non-increasing-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75960, "totalSubmissionRaw": 104394}, "1404": {"acRate": 61.48694270053554, "difficulty": "Medium", "likes": 1380, "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": 146615, "totalSubmissionRaw": 238449}, "1405": {"acRate": 57.52132316740516, "difficulty": "Medium", "likes": 2014, "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": 86458, "totalSubmissionRaw": 150306}, "1406": {"acRate": 63.62746976082316, "difficulty": "Hard", "likes": 2217, "dislikes": 72, "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": 93003, "totalSubmissionRaw": 146168}, "1407": {"acRate": 57.56218055683296, "difficulty": "Easy", "likes": 635, "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": 131430, "totalSubmissionRaw": 228327}, "1408": {"acRate": 64.08935060668898, "difficulty": "Easy", "likes": 904, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1408", "paidOnly": false, "title": "String Matching in an Array", "titleSlug": "string-matching-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93647, "totalSubmissionRaw": 146120}, "1409": {"acRate": 84.35100190761906, "difficulty": "Medium", "likes": 492, "dislikes": 628, "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": 51735, "totalSubmissionRaw": 61333}, "1410": {"acRate": 50.916987464218735, "difficulty": "Medium", "likes": 191, "dislikes": 324, "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": 25792, "totalSubmissionRaw": 50655}, "1411": {"acRate": 63.80599750714862, "difficulty": "Hard", "likes": 1085, "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": 34810, "totalSubmissionRaw": 54556}, "1412": {"acRate": 58.877590094881505, "difficulty": "Hard", "likes": 217, "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": 27674, "totalSubmissionRaw": 46999}, "1413": {"acRate": 65.37797160937234, "difficulty": "Easy", "likes": 1561, "dislikes": 336, "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": 152905, "totalSubmissionRaw": 233879}, "1414": {"acRate": 65.39287500367723, "difficulty": "Medium", "likes": 1018, "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": 44458, "totalSubmissionRaw": 67986}, "1415": {"acRate": 74.96859010542799, "difficulty": "Medium", "likes": 971, "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": 41172, "totalSubmissionRaw": 54919}, "1416": {"acRate": 47.42124646340114, "difficulty": "Hard", "likes": 1607, "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": 60004, "totalSubmissionRaw": 126534}, "1417": {"acRate": 52.63622305897976, "difficulty": "Easy", "likes": 593, "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": 60249, "totalSubmissionRaw": 114463}, "1418": {"acRate": 75.10874456277186, "difficulty": "Medium", "likes": 395, "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": 30044, "totalSubmissionRaw": 40001}, "1419": {"acRate": 50.3696348872417, "difficulty": "Medium", "likes": 1039, "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": 51237, "totalSubmissionRaw": 101722}, "1420": {"acRate": 68.08464178018093, "difficulty": "Hard", "likes": 1356, "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": 65477, "totalSubmissionRaw": 96170}, "1421": {"acRate": 82.88699012710968, "difficulty": "Easy", "likes": 58, "dislikes": 295, "categoryTitle": "Database", "frontendQuestionId": "1421", "paidOnly": true, "title": "NPV Queries", "titleSlug": "npv-queries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27452, "totalSubmissionRaw": 33120}, "1422": {"acRate": 62.255593517170674, "difficulty": "Easy", "likes": 1555, "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": 166366, "totalSubmissionRaw": 267230}, "1423": {"acRate": 53.81533165368839, "difficulty": "Medium", "likes": 6223, "dislikes": 248, "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": 306085, "totalSubmissionRaw": 568769}, "1424": {"acRate": 57.10105030814826, "difficulty": "Medium", "likes": 2169, "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": 138144, "totalSubmissionRaw": 241929}, "1425": {"acRate": 56.54659111992807, "difficulty": "Hard", "likes": 2132, "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": 79241, "totalSubmissionRaw": 140134}, "1426": {"acRate": 60.28834454418146, "difficulty": "Easy", "likes": 156, "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": 131302, "totalSubmissionRaw": 217791}, "1427": {"acRate": 54.80869151296955, "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": 81749, "totalSubmissionRaw": 149155}, "1428": {"acRate": 54.59599922131704, "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": 185097, "totalSubmissionRaw": 339032}, "1429": {"acRate": 53.94762161927286, "difficulty": "Medium", "likes": 557, "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": 86908, "totalSubmissionRaw": 161097}, "1430": {"acRate": 46.99501797313489, "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": 44711, "totalSubmissionRaw": 95141}, "1431": {"acRate": 87.69730596290874, "difficulty": "Easy", "likes": 4485, "dislikes": 569, "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": 1008727, "totalSubmissionRaw": 1150238}, "1432": {"acRate": 41.04251450342021, "difficulty": "Medium", "likes": 232, "dislikes": 294, "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": 18960, "totalSubmissionRaw": 46196}, "1433": {"acRate": 69.86042590395304, "difficulty": "Medium", "likes": 759, "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": 44747, "totalSubmissionRaw": 64052}, "1434": {"acRate": 43.99853760053996, "difficulty": "Hard", "likes": 899, "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": 15645, "totalSubmissionRaw": 35558}, "1435": {"acRate": 75.16526824307145, "difficulty": "Easy", "likes": 153, "dislikes": 261, "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": 23650, "totalSubmissionRaw": 31464}, "1436": {"acRate": 79.49312704960178, "difficulty": "Easy", "likes": 2216, "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": 278277, "totalSubmissionRaw": 350065}, "1437": {"acRate": 58.06884187880961, "difficulty": "Easy", "likes": 631, "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": 80977, "totalSubmissionRaw": 139450}, "1438": {"acRate": 56.61520132269986, "difficulty": "Medium", "likes": 4072, "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": 232847, "totalSubmissionRaw": 411280}, "1439": {"acRate": 61.93449902858729, "difficulty": "Hard", "likes": 1233, "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": 35704, "totalSubmissionRaw": 57648}, "1440": {"acRate": 72.6348597458643, "difficulty": "Medium", "likes": 215, "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": 30293, "totalSubmissionRaw": 41706}, "1441": {"acRate": 80.02143351865372, "difficulty": "Medium", "likes": 993, "dislikes": 483, "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": 170993, "totalSubmissionRaw": 213684}, "1442": {"acRate": 84.94439978563773, "difficulty": "Medium", "likes": 1933, "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": 126805, "totalSubmissionRaw": 149280}, "1443": {"acRate": 62.45190327409357, "difficulty": "Medium", "likes": 3658, "dislikes": 322, "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": 124328, "totalSubmissionRaw": 199076}, "1444": {"acRate": 61.99307859461489, "difficulty": "Hard", "likes": 1839, "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": 69325, "totalSubmissionRaw": 111827}, "1445": {"acRate": 86.30743446225848, "difficulty": "Medium", "likes": 240, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1445", "paidOnly": true, "title": "Apples & Oranges", "titleSlug": "apples-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54585, "totalSubmissionRaw": 63245}, "1446": {"acRate": 60.2963430887988, "difficulty": "Easy", "likes": 1746, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1446", "paidOnly": false, "title": "Consecutive Characters", "titleSlug": "consecutive-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173721, "totalSubmissionRaw": 288112}, "1447": {"acRate": 67.21633596609516, "difficulty": "Medium", "likes": 416, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1447", "paidOnly": false, "title": "Simplified Fractions", "titleSlug": "simplified-fractions", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34892, "totalSubmissionRaw": 51910}, "1448": {"acRate": 73.04509882869212, "difficulty": "Medium", "likes": 5879, "dislikes": 175, "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": 556947, "totalSubmissionRaw": 762470}, "1449": {"acRate": 48.40843004554695, "difficulty": "Hard", "likes": 695, "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": 18812, "totalSubmissionRaw": 38861}, "1450": {"acRate": 75.70321765965858, "difficulty": "Easy", "likes": 880, "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": 128295, "totalSubmissionRaw": 169471}, "1451": {"acRate": 64.89787043859543, "difficulty": "Medium", "likes": 759, "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": 53727, "totalSubmissionRaw": 82787}, "1452": {"acRate": 58.19321029847345, "difficulty": "Medium", "likes": 355, "dislikes": 227, "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": 25541, "totalSubmissionRaw": 43890}, "1453": {"acRate": 38.35487106862572, "difficulty": "Hard", "likes": 147, "dislikes": 271, "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": 6500, "totalSubmissionRaw": 16947}, "1454": {"acRate": 36.61680996281305, "difficulty": "Medium", "likes": 407, "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": 40075, "totalSubmissionRaw": 109446}, "1455": {"acRate": 64.47233095402564, "difficulty": "Easy", "likes": 830, "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": 84001, "totalSubmissionRaw": 130290}, "1456": {"acRate": 58.95412573159291, "difficulty": "Medium", "likes": 3518, "dislikes": 133, "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": 371388, "totalSubmissionRaw": 629961}, "1457": {"acRate": 68.34215004439184, "difficulty": "Medium", "likes": 3260, "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": 221691, "totalSubmissionRaw": 324384}, "1458": {"acRate": 62.45600467179091, "difficulty": "Hard", "likes": 1659, "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": 79143, "totalSubmissionRaw": 126718}, "1459": {"acRate": 68.565868846079, "difficulty": "Medium", "likes": 97, "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": 17617, "totalSubmissionRaw": 25694}, "1460": {"acRate": 75.96861804564001, "difficulty": "Easy", "likes": 1452, "dislikes": 162, "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": 299011, "totalSubmissionRaw": 393599}, "1461": {"acRate": 56.53818632611857, "difficulty": "Medium", "likes": 2245, "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": 124051, "totalSubmissionRaw": 219411}, "1462": {"acRate": 50.13706267713609, "difficulty": "Medium", "likes": 1474, "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": 64746, "totalSubmissionRaw": 129138}, "1463": {"acRate": 71.85364911518312, "difficulty": "Hard", "likes": 4131, "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": 178575, "totalSubmissionRaw": 248526}, "1464": {"acRate": 82.88094342731831, "difficulty": "Easy", "likes": 2480, "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": 392307, "totalSubmissionRaw": 473338}, "1465": {"acRate": 41.08177375424509, "difficulty": "Medium", "likes": 2620, "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": 168630, "totalSubmissionRaw": 410474}, "1466": {"acRate": 64.53572380946476, "difficulty": "Medium", "likes": 4200, "dislikes": 125, "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": 208129, "totalSubmissionRaw": 322502}, "1467": {"acRate": 60.60006818956699, "difficulty": "Hard", "likes": 285, "dislikes": 173, "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": 8887, "totalSubmissionRaw": 14665}, "1468": {"acRate": 78.43228923172822, "difficulty": "Medium", "likes": 129, "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": 25164, "totalSubmissionRaw": 32084}, "1469": {"acRate": 83.74485290838548, "difficulty": "Easy", "likes": 508, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1469", "paidOnly": true, "title": "Find All The Lonely Nodes", "titleSlug": "find-all-the-lonely-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56333, "totalSubmissionRaw": 67268}, "1470": {"acRate": 88.6125940305751, "difficulty": "Easy", "likes": 5785, "dislikes": 310, "categoryTitle": "Algorithms", "frontendQuestionId": "1470", "paidOnly": false, "title": "Shuffle the Array", "titleSlug": "shuffle-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 730345, "totalSubmissionRaw": 824200}, "1471": {"acRate": 61.350051475898525, "difficulty": "Medium", "likes": 701, "dislikes": 156, "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": 39926, "totalSubmissionRaw": 65079}, "1472": {"acRate": 77.66086831781355, "difficulty": "Medium", "likes": 3872, "dislikes": 240, "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": 249031, "totalSubmissionRaw": 320665}, "1473": {"acRate": 61.01236438979003, "difficulty": "Hard", "likes": 2067, "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": 63606, "totalSubmissionRaw": 104251}, "1474": {"acRate": 73.25740728261114, "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": 32610, "totalSubmissionRaw": 44515}, "1475": {"acRate": 78.4464005788014, "difficulty": "Easy", "likes": 2137, "dislikes": 122, "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": 162639, "totalSubmissionRaw": 207325}, "1476": {"acRate": 88.23165381964029, "difficulty": "Medium", "likes": 634, "dislikes": 1443, "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": 112633, "totalSubmissionRaw": 127656}, "1477": {"acRate": 36.5381009876784, "difficulty": "Medium", "likes": 1702, "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": 48721, "totalSubmissionRaw": 133343}, "1478": {"acRate": 55.497671649407806, "difficulty": "Hard", "likes": 1116, "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": 26100, "totalSubmissionRaw": 47029}, "1479": {"acRate": 77.50712069038813, "difficulty": "Hard", "likes": 152, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1479", "paidOnly": true, "title": "Sales by Day of the Week", "titleSlug": "sales-by-day-of-the-week", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18230, "totalSubmissionRaw": 23521}, "1480": {"acRate": 86.85091877921217, "difficulty": "Easy", "likes": 7912, "dislikes": 347, "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": 1895911, "totalSubmissionRaw": 2182949}, "1481": {"acRate": 63.11857677714401, "difficulty": "Medium", "likes": 2250, "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": 251193, "totalSubmissionRaw": 397970}, "1482": {"acRate": 55.67972326788077, "difficulty": "Medium", "likes": 4670, "dislikes": 228, "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": 273638, "totalSubmissionRaw": 491450}, "1483": {"acRate": 34.89052168875238, "difficulty": "Hard", "likes": 1936, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1483", "paidOnly": false, "title": "Kth Ancestor of a Tree Node", "titleSlug": "kth-ancestor-of-a-tree-node", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37941, "totalSubmissionRaw": 108742}, "1484": {"acRate": 77.16124834887526, "difficulty": "Easy", "likes": 1432, "dislikes": 108, "categoryTitle": "Database", "frontendQuestionId": "1484", "paidOnly": false, "title": "Group Sold Products By The Date", "titleSlug": "group-sold-products-by-the-date", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 234828, "totalSubmissionRaw": 304335}, "1485": {"acRate": 80.71196350025954, "difficulty": "Medium", "likes": 421, "dislikes": 87, "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": 29543, "totalSubmissionRaw": 36603}, "1486": {"acRate": 86.17051454119759, "difficulty": "Easy", "likes": 1393, "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": 203527, "totalSubmissionRaw": 236191}, "1487": {"acRate": 37.26585890465742, "difficulty": "Medium", "likes": 447, "dislikes": 722, "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": 34478, "totalSubmissionRaw": 92519}, "1488": {"acRate": 27.0385178103226, "difficulty": "Medium", "likes": 1534, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "1488", "paidOnly": false, "title": "Avoid Flood in The City", "titleSlug": "avoid-flood-in-the-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37331, "totalSubmissionRaw": 138066}, "1489": {"acRate": 67.45568512770113, "difficulty": "Hard", "likes": 1859, "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": 56283, "totalSubmissionRaw": 83437}, "1490": {"acRate": 83.14940931202224, "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": 29913, "totalSubmissionRaw": 35975}, "1491": {"acRate": 63.47761779985209, "difficulty": "Easy", "likes": 2228, "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": 347632, "totalSubmissionRaw": 547645}, "1492": {"acRate": 68.34092096425107, "difficulty": "Medium", "likes": 1789, "dislikes": 296, "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": 256396, "totalSubmissionRaw": 375172}, "1493": {"acRate": 67.8452257744072, "difficulty": "Medium", "likes": 3988, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1493", "paidOnly": false, "title": "Longest Subarray of 1's After Deleting One Element", "titleSlug": "longest-subarray-of-1s-after-deleting-one-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 310072, "totalSubmissionRaw": 457028}, "1494": {"acRate": 29.506697755223332, "difficulty": "Hard", "likes": 1042, "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": 19362, "totalSubmissionRaw": 65618}, "1495": {"acRate": 49.05475929073108, "difficulty": "Easy", "likes": 87, "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": 32616, "totalSubmissionRaw": 66490}, "1496": {"acRate": 62.47819415734721, "difficulty": "Easy", "likes": 1478, "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": 166540, "totalSubmissionRaw": 266557}, "1497": {"acRate": 38.47708408516781, "difficulty": "Medium", "likes": 1750, "dislikes": 93, "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": 53310, "totalSubmissionRaw": 138550}, "1498": {"acRate": 43.58886766407786, "difficulty": "Medium", "likes": 3923, "dislikes": 373, "categoryTitle": "Algorithms", "frontendQuestionId": "1498", "paidOnly": false, "title": "Number of Subsequences That Satisfy the Given Sum Condition", "titleSlug": "number-of-subsequences-that-satisfy-the-given-sum-condition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125046, "totalSubmissionRaw": 286876}, "1499": {"acRate": 44.12373347910118, "difficulty": "Hard", "likes": 1330, "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": 45203, "totalSubmissionRaw": 102446}, "1500": {"acRate": 43.17746262935991, "difficulty": "Medium", "likes": 49, "dislikes": 121, "categoryTitle": "Algorithms", "frontendQuestionId": "1500", "paidOnly": true, "title": "Design a File Sharing System", "titleSlug": "design-a-file-sharing-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4506, "totalSubmissionRaw": 10436}, "1501": {"acRate": 50.27377611474899, "difficulty": "Medium", "likes": 297, "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": 40305, "totalSubmissionRaw": 80173}, "1502": {"acRate": 69.55103042198235, "difficulty": "Easy", "likes": 2169, "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": 255140, "totalSubmissionRaw": 366839}, "1503": {"acRate": 68.52098198089249, "difficulty": "Medium", "likes": 1499, "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": 90656, "totalSubmissionRaw": 132304}, "1504": {"acRate": 57.23951718765008, "difficulty": "Medium", "likes": 2113, "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": 53634, "totalSubmissionRaw": 93701}, "1505": {"acRate": 39.82869379014989, "difficulty": "Hard", "likes": 488, "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": 10602, "totalSubmissionRaw": 26619}, "1506": {"acRate": 78.36540578625215, "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": 35590, "totalSubmissionRaw": 45416}, "1507": {"acRate": 66.57859412434371, "difficulty": "Easy", "likes": 474, "dislikes": 437, "categoryTitle": "Algorithms", "frontendQuestionId": "1507", "paidOnly": false, "title": "Reformat Date", "titleSlug": "reformat-date", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78367, "totalSubmissionRaw": 117706}, "1508": {"acRate": 63.19284107119222, "difficulty": "Medium", "likes": 1515, "dislikes": 253, "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": 171881, "totalSubmissionRaw": 271995}, "1509": {"acRate": 59.23889111035749, "difficulty": "Medium", "likes": 2475, "dislikes": 277, "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": 234073, "totalSubmissionRaw": 395134}, "1510": {"acRate": 59.623025332951904, "difficulty": "Hard", "likes": 1605, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1510", "paidOnly": false, "title": "Stone Game IV", "titleSlug": "stone-game-iv", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75032, "totalSubmissionRaw": 125844}, "1511": {"acRate": 67.75993446575681, "difficulty": "Easy", "likes": 318, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1511", "paidOnly": true, "title": "Customer Order Frequency", "titleSlug": "customer-order-frequency", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43836, "totalSubmissionRaw": 64695}, "1512": {"acRate": 89.23616795774343, "difficulty": "Easy", "likes": 5461, "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": 828488, "totalSubmissionRaw": 928422}, "1513": {"acRate": 47.023997162897, "difficulty": "Medium", "likes": 876, "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": 47735, "totalSubmissionRaw": 101512}, "1514": {"acRate": 65.62854927600009, "difficulty": "Medium", "likes": 3633, "dislikes": 102, "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": 313170, "totalSubmissionRaw": 477188}, "1515": {"acRate": 35.01265240395675, "difficulty": "Hard", "likes": 235, "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": 15220, "totalSubmissionRaw": 43470}, "1516": {"acRate": 61.906033101975446, "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": 2318, "totalSubmissionRaw": 3745}, "1517": {"acRate": 44.11975042154091, "difficulty": "Easy", "likes": 470, "dislikes": 254, "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": 134488, "totalSubmissionRaw": 304827}, "1518": {"acRate": 71.00919295037839, "difficulty": "Easy", "likes": 1682, "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": 237677, "totalSubmissionRaw": 334713}, "1519": {"acRate": 54.98756491372756, "difficulty": "Medium", "likes": 2256, "dislikes": 808, "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": 85344, "totalSubmissionRaw": 155206}, "1520": {"acRate": 39.68182534146396, "difficulty": "Hard", "likes": 826, "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": 17635, "totalSubmissionRaw": 44441}, "1521": {"acRate": 45.52779689840871, "difficulty": "Hard", "likes": 386, "dislikes": 16, "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": 11244, "totalSubmissionRaw": 24697}, "1522": {"acRate": 74.49858415129775, "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": 50774, "totalSubmissionRaw": 68155}, "1523": {"acRate": 49.98931031294781, "difficulty": "Easy", "likes": 2747, "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": 346053, "totalSubmissionRaw": 692250}, "1524": {"acRate": 43.77333101831756, "difficulty": "Medium", "likes": 1354, "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": 40338, "totalSubmissionRaw": 92152}, "1525": {"acRate": 68.32149172158817, "difficulty": "Medium", "likes": 2054, "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": 106257, "totalSubmissionRaw": 155525}, "1526": {"acRate": 70.97062310203154, "difficulty": "Hard", "likes": 1505, "dislikes": 72, "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": 43703, "totalSubmissionRaw": 61579}, "1527": {"acRate": 40.37674118545435, "difficulty": "Easy", "likes": 659, "dislikes": 574, "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": 245341, "totalSubmissionRaw": 607629}, "1528": {"acRate": 84.86116378127299, "difficulty": "Easy", "likes": 2759, "dislikes": 525, "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": 405033, "totalSubmissionRaw": 477289}, "1529": {"acRate": 73.41510097261825, "difficulty": "Medium", "likes": 1026, "dislikes": 44, "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": 56385, "totalSubmissionRaw": 76803}, "1530": {"acRate": 71.89724724213272, "difficulty": "Medium", "likes": 2400, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1530", "paidOnly": false, "title": "Number of Good Leaf Nodes Pairs", "titleSlug": "number-of-good-leaf-nodes-pairs", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147750, "totalSubmissionRaw": 205502}, "1531": {"acRate": 52.50602942570378, "difficulty": "Hard", "likes": 2433, "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": 99710, "totalSubmissionRaw": 189902}, "1532": {"acRate": 68.4121277894594, "difficulty": "Medium", "likes": 153, "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": 30256, "totalSubmissionRaw": 44227}, "1533": {"acRate": 56.25173604222054, "difficulty": "Medium", "likes": 247, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1533", "paidOnly": true, "title": "Find the Index of the Large Integer", "titleSlug": "find-the-index-of-the-large-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14174, "totalSubmissionRaw": 25199}, "1534": {"acRate": 81.4369361218106, "difficulty": "Easy", "likes": 769, "dislikes": 1201, "categoryTitle": "Algorithms", "frontendQuestionId": "1534", "paidOnly": false, "title": "Count Good Triplets", "titleSlug": "count-good-triplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 126009, "totalSubmissionRaw": 154732}, "1535": {"acRate": 57.02999261313882, "difficulty": "Medium", "likes": 1575, "dislikes": 82, "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": 116579, "totalSubmissionRaw": 204417}, "1536": {"acRate": 47.709344660194176, "difficulty": "Medium", "likes": 566, "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": 15725, "totalSubmissionRaw": 32960}, "1537": {"acRate": 39.545788373538215, "difficulty": "Hard", "likes": 996, "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": 28000, "totalSubmissionRaw": 70804}, "1538": {"acRate": 69.94096425057396, "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": 4262, "totalSubmissionRaw": 6095}, "1539": {"acRate": 60.62408556259064, "difficulty": "Easy", "likes": 6721, "dislikes": 461, "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": 474434, "totalSubmissionRaw": 782584}, "1540": {"acRate": 35.402377490806465, "difficulty": "Medium", "likes": 393, "dislikes": 316, "categoryTitle": "Algorithms", "frontendQuestionId": "1540", "paidOnly": false, "title": "Can Convert String in K Moves", "titleSlug": "can-convert-string-in-k-moves", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20697, "totalSubmissionRaw": 58460}, "1541": {"acRate": 52.7238245244658, "difficulty": "Medium", "likes": 1120, "dislikes": 265, "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": 65609, "totalSubmissionRaw": 124439}, "1542": {"acRate": 43.98390342052314, "difficulty": "Hard", "likes": 818, "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": 15302, "totalSubmissionRaw": 34790}, "1543": {"acRate": 59.33906822246827, "difficulty": "Easy", "likes": 89, "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": 20898, "totalSubmissionRaw": 35220}, "1544": {"acRate": 68.3388468610675, "difficulty": "Easy", "likes": 3035, "dislikes": 173, "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": 325568, "totalSubmissionRaw": 476403}, "1545": {"acRate": 59.04735435030043, "difficulty": "Medium", "likes": 928, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1545", "paidOnly": false, "title": "Find Kth Bit in Nth Binary String", "titleSlug": "find-kth-bit-in-nth-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44615, "totalSubmissionRaw": 75558}, "1546": {"acRate": 47.866764633847666, "difficulty": "Medium", "likes": 1066, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1546", "paidOnly": false, "title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "titleSlug": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29316, "totalSubmissionRaw": 61245}, "1547": {"acRate": 61.68975948026648, "difficulty": "Hard", "likes": 4300, "dislikes": 114, "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": 138066, "totalSubmissionRaw": 223807}, "1548": {"acRate": 59.25095922039999, "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": 17447, "totalSubmissionRaw": 29448}, "1549": {"acRate": 64.8238296412258, "difficulty": "Medium", "likes": 135, "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": 30226, "totalSubmissionRaw": 46629}, "1550": {"acRate": 68.31235629151749, "difficulty": "Easy", "likes": 1133, "dislikes": 95, "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": 278378, "totalSubmissionRaw": 407508}, "1551": {"acRate": 82.42477530285268, "difficulty": "Medium", "likes": 1445, "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": 101244, "totalSubmissionRaw": 122832}, "1552": {"acRate": 71.07497084676055, "difficulty": "Medium", "likes": 2897, "dislikes": 254, "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": 170048, "totalSubmissionRaw": 239252}, "1553": {"acRate": 35.50646603070531, "difficulty": "Hard", "likes": 995, "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": 37258, "totalSubmissionRaw": 104933}, "1554": {"acRate": 41.624501110498805, "difficulty": "Medium", "likes": 376, "dislikes": 99, "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": 24925, "totalSubmissionRaw": 59882}, "1555": {"acRate": 51.2994812994813, "difficulty": "Medium", "likes": 141, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1555", "paidOnly": true, "title": "Bank Account Summary", "titleSlug": "bank-account-summary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18790, "totalSubmissionRaw": 36629}, "1556": {"acRate": 53.770974389166916, "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": 54798, "totalSubmissionRaw": 101910}, "1557": {"acRate": 81.02670128262439, "difficulty": "Medium", "likes": 3705, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1557", "paidOnly": false, "title": "Minimum Number of Vertices to Reach All Nodes", "titleSlug": "minimum-number-of-vertices-to-reach-all-nodes", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188507, "totalSubmissionRaw": 232648}, "1558": {"acRate": 63.763652436763905, "difficulty": "Medium", "likes": 628, "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": 22360, "totalSubmissionRaw": 35067}, "1559": {"acRate": 48.86264216972878, "difficulty": "Medium", "likes": 1164, "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": 44680, "totalSubmissionRaw": 91440}, "1560": {"acRate": 58.99196130041972, "difficulty": "Easy", "likes": 317, "dislikes": 636, "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": 33169, "totalSubmissionRaw": 56227}, "1561": {"acRate": 84.49251016371281, "difficulty": "Medium", "likes": 1894, "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": 170004, "totalSubmissionRaw": 201206}, "1562": {"acRate": 43.013698630136986, "difficulty": "Medium", "likes": 649, "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": 18840, "totalSubmissionRaw": 43800}, "1563": {"acRate": 41.20673979068732, "difficulty": "Hard", "likes": 658, "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": 21301, "totalSubmissionRaw": 51693}, "1564": {"acRate": 67.39499878611313, "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": 16654, "totalSubmissionRaw": 24712}, "1565": {"acRate": 82.14233308877476, "difficulty": "Easy", "likes": 78, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "1565", "paidOnly": true, "title": "Unique Orders and Customers Per Month", "titleSlug": "unique-orders-and-customers-per-month", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22391, "totalSubmissionRaw": 27259}, "1566": {"acRate": 43.33357343513649, "difficulty": "Easy", "likes": 658, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1566", "paidOnly": false, "title": "Detect Pattern of Length M Repeated K or More Times", "titleSlug": "detect-pattern-of-length-m-repeated-k-or-more-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36096, "totalSubmissionRaw": 83298}, "1567": {"acRate": 44.27742055178218, "difficulty": "Medium", "likes": 2416, "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": 97850, "totalSubmissionRaw": 220993}, "1568": {"acRate": 59.886313487593945, "difficulty": "Hard", "likes": 1230, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "1568", "paidOnly": false, "title": "Minimum Number of Days to Disconnect Island", "titleSlug": "minimum-number-of-days-to-disconnect-island", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90918, "totalSubmissionRaw": 151819}, "1569": {"acRate": 53.520726590838066, "difficulty": "Hard", "likes": 1790, "dislikes": 208, "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": 56512, "totalSubmissionRaw": 105589}, "1570": {"acRate": 89.85404442410474, "difficulty": "Medium", "likes": 1214, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "1570", "paidOnly": true, "title": "Dot Product of Two Sparse Vectors", "titleSlug": "dot-product-of-two-sparse-vectors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274872, "totalSubmissionRaw": 305909}, "1571": {"acRate": 87.71164181516951, "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": 43411, "totalSubmissionRaw": 49493}, "1572": {"acRate": 83.1980386099371, "difficulty": "Easy", "likes": 3498, "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": 379725, "totalSubmissionRaw": 456411}, "1573": {"acRate": 33.52076124567474, "difficulty": "Medium", "likes": 740, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1573", "paidOnly": false, "title": "Number of Ways to Split a String", "titleSlug": "number-of-ways-to-split-a-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31000, "totalSubmissionRaw": 92480}, "1574": {"acRate": 38.097544265819344, "difficulty": "Medium", "likes": 1622, "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": 32253, "totalSubmissionRaw": 84659}, "1575": {"acRate": 65.20532495964264, "difficulty": "Hard", "likes": 1628, "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": 58973, "totalSubmissionRaw": 90442}, "1576": {"acRate": 46.19124318413548, "difficulty": "Easy", "likes": 565, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "1576", "paidOnly": false, "title": "Replace All ?'s to Avoid Consecutive Repeating Characters", "titleSlug": "replace-all-s-to-avoid-consecutive-repeating-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62518, "totalSubmissionRaw": 135346}, "1577": {"acRate": 41.52265653344536, "difficulty": "Medium", "likes": 377, "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": 21745, "totalSubmissionRaw": 52369}, "1578": {"acRate": 63.70490468366027, "difficulty": "Medium", "likes": 3824, "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": 262862, "totalSubmissionRaw": 412625}, "1579": {"acRate": 70.83592739163153, "difficulty": "Hard", "likes": 2543, "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": 130846, "totalSubmissionRaw": 184717}, "1580": {"acRate": 66.21652036911996, "difficulty": "Medium", "likes": 221, "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": 8826, "totalSubmissionRaw": 13329}, "1581": {"acRate": 67.93618349055323, "difficulty": "Easy", "likes": 2160, "dislikes": 298, "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": 525798, "totalSubmissionRaw": 773962}, "1582": {"acRate": 68.66178572577569, "difficulty": "Easy", "likes": 1452, "dislikes": 70, "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": 149395, "totalSubmissionRaw": 217581}, "1583": {"acRate": 61.67321753095811, "difficulty": "Medium", "likes": 286, "dislikes": 861, "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": 29185, "totalSubmissionRaw": 47322}, "1584": {"acRate": 67.44776486742057, "difficulty": "Medium", "likes": 5094, "dislikes": 130, "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": 312414, "totalSubmissionRaw": 463194}, "1585": {"acRate": 48.62240165857384, "difficulty": "Hard", "likes": 439, "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": 8912, "totalSubmissionRaw": 18329}, "1586": {"acRate": 63.01871972771305, "difficulty": "Medium", "likes": 261, "dislikes": 52, "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": 14442, "totalSubmissionRaw": 22917}, "1587": {"acRate": 83.37382774359091, "difficulty": "Easy", "likes": 481, "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": 110146, "totalSubmissionRaw": 132111}, "1588": {"acRate": 83.20918123799093, "difficulty": "Easy", "likes": 3717, "dislikes": 304, "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": 207430, "totalSubmissionRaw": 249288}, "1589": {"acRate": 38.39204566110445, "difficulty": "Medium", "likes": 772, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1589", "paidOnly": false, "title": "Maximum Sum Obtained of Any Permutation", "titleSlug": "maximum-sum-obtained-of-any-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21121, "totalSubmissionRaw": 55014}, "1590": {"acRate": 29.19139395994649, "difficulty": "Medium", "likes": 1550, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1590", "paidOnly": false, "title": "Make Sum Divisible by P", "titleSlug": "make-sum-divisible-by-p", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30989, "totalSubmissionRaw": 106158}, "1591": {"acRate": 59.49012746813297, "difficulty": "Hard", "likes": 633, "dislikes": 21, "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": 11901, "totalSubmissionRaw": 20005}, "1592": {"acRate": 43.332865697429725, "difficulty": "Easy", "likes": 458, "dislikes": 349, "categoryTitle": "Algorithms", "frontendQuestionId": "1592", "paidOnly": false, "title": "Rearrange Spaces Between Words", "titleSlug": "rearrange-spaces-between-words", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58687, "totalSubmissionRaw": 135433}, "1593": {"acRate": 56.82710941182633, "difficulty": "Medium", "likes": 844, "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": 32550, "totalSubmissionRaw": 57279}, "1594": {"acRate": 33.96753807929135, "difficulty": "Medium", "likes": 837, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1594", "paidOnly": false, "title": "Maximum Non Negative Product in a Matrix", "titleSlug": "maximum-non-negative-product-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25155, "totalSubmissionRaw": 74056}, "1595": {"acRate": 48.39381925383755, "difficulty": "Hard", "likes": 474, "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": 9521, "totalSubmissionRaw": 19674}, "1596": {"acRate": 78.38808802928284, "difficulty": "Medium", "likes": 243, "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": 34693, "totalSubmissionRaw": 44258}, "1597": {"acRate": 62.517580872011244, "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": 13335, "totalSubmissionRaw": 21330}, "1598": {"acRate": 71.75906461985979, "difficulty": "Easy", "likes": 1450, "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": 252612, "totalSubmissionRaw": 352028}, "1599": {"acRate": 44.23663346208579, "difficulty": "Medium", "likes": 109, "dislikes": 248, "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": 13056, "totalSubmissionRaw": 29514}, "1600": {"acRate": 65.66531189256052, "difficulty": "Medium", "likes": 294, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "1600", "paidOnly": false, "title": "Throne Inheritance", "titleSlug": "throne-inheritance", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18580, "totalSubmissionRaw": 28295}, "1601": {"acRate": 64.51809747663657, "difficulty": "Hard", "likes": 1418, "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": 57094, "totalSubmissionRaw": 88493}, "1602": {"acRate": 75.42443999741786, "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": 23368, "totalSubmissionRaw": 30982}, "1603": {"acRate": 87.98242880610877, "difficulty": "Easy", "likes": 1954, "dislikes": 449, "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": 290818, "totalSubmissionRaw": 330541}, "1604": {"acRate": 45.917708802649685, "difficulty": "Medium", "likes": 311, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1604", "paidOnly": false, "title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "titleSlug": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37709, "totalSubmissionRaw": 82123}, "1605": {"acRate": 83.11781366011081, "difficulty": "Medium", "likes": 2124, "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": 147323, "totalSubmissionRaw": 177246}, "1606": {"acRate": 43.67930144870014, "difficulty": "Hard", "likes": 611, "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": 17608, "totalSubmissionRaw": 40312}, "1607": {"acRate": 54.32364272121053, "difficulty": "Easy", "likes": 134, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "1607", "paidOnly": true, "title": "Sellers With No Sales", "titleSlug": "sellers-with-no-sales", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35111, "totalSubmissionRaw": 64633}, "1608": {"acRate": 66.87983372969084, "difficulty": "Easy", "likes": 2209, "dislikes": 430, "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": 200796, "totalSubmissionRaw": 300234}, "1609": {"acRate": 65.91855697832696, "difficulty": "Medium", "likes": 1780, "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": 161747, "totalSubmissionRaw": 245374}, "1610": {"acRate": 37.46147730622526, "difficulty": "Hard", "likes": 580, "dislikes": 750, "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": 41937, "totalSubmissionRaw": 111947}, "1611": {"acRate": 74.04989076366688, "difficulty": "Hard", "likes": 931, "dislikes": 1028, "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": 59993, "totalSubmissionRaw": 81017}, "1612": {"acRate": 70.68480300187618, "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": 7535, "totalSubmissionRaw": 10660}, "1613": {"acRate": 72.99726601999924, "difficulty": "Medium", "likes": 229, "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": 19491, "totalSubmissionRaw": 26701}, "1614": {"acRate": 83.93753600058284, "difficulty": "Easy", "likes": 2477, "dislikes": 506, "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": 368678, "totalSubmissionRaw": 439229}, "1615": {"acRate": 65.18254437475274, "difficulty": "Medium", "likes": 2358, "dislikes": 369, "categoryTitle": "Algorithms", "frontendQuestionId": "1615", "paidOnly": false, "title": "Maximal Network Rank", "titleSlug": "maximal-network-rank", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146634, "totalSubmissionRaw": 224959}, "1616": {"acRate": 31.083519556410653, "difficulty": "Medium", "likes": 735, "dislikes": 250, "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": 26011, "totalSubmissionRaw": 83681}, "1617": {"acRate": 66.3705809202345, "difficulty": "Hard", "likes": 547, "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": 11208, "totalSubmissionRaw": 16887}, "1618": {"acRate": 61.007118375955706, "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": 6942, "totalSubmissionRaw": 11379}, "1619": {"acRate": 69.02660624064877, "difficulty": "Easy", "likes": 502, "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": 63666, "totalSubmissionRaw": 92234}, "1620": {"acRate": 38.118259576050576, "difficulty": "Medium", "likes": 80, "dislikes": 267, "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": 9225, "totalSubmissionRaw": 24201}, "1621": {"acRate": 43.89609299592933, "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": 10460, "totalSubmissionRaw": 23829}, "1622": {"acRate": 17.51005479336874, "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": 12495, "totalSubmissionRaw": 71359}, "1623": {"acRate": 81.93194203366568, "difficulty": "Easy", "likes": 74, "dislikes": 139, "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": 20297, "totalSubmissionRaw": 24773}, "1624": {"acRate": 68.54645650884629, "difficulty": "Easy", "likes": 1345, "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": 158341, "totalSubmissionRaw": 230999}, "1625": {"acRate": 65.66669463791223, "difficulty": "Medium", "likes": 355, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "1625", "paidOnly": false, "title": "Lexicographically Smallest String After Applying Operations", "titleSlug": "lexicographically-smallest-string-after-applying-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15651, "totalSubmissionRaw": 23834}, "1626": {"acRate": 50.38929584120982, "difficulty": "Medium", "likes": 2953, "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": 85299, "totalSubmissionRaw": 169280}, "1627": {"acRate": 47.39663882874523, "difficulty": "Hard", "likes": 582, "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": 18388, "totalSubmissionRaw": 38796}, "1628": {"acRate": 82.52007601299577, "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": 26923, "totalSubmissionRaw": 32626}, "1629": {"acRate": 59.16544107045015, "difficulty": "Easy", "likes": 764, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "1629", "paidOnly": false, "title": "Slowest Key", "titleSlug": "slowest-key", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102584, "totalSubmissionRaw": 173385}, "1630": {"acRate": 83.75250429307384, "difficulty": "Medium", "likes": 1821, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "1630", "paidOnly": false, "title": "Arithmetic Subarrays", "titleSlug": "arithmetic-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140463, "totalSubmissionRaw": 167712}, "1631": {"acRate": 60.194035965144366, "difficulty": "Medium", "likes": 5951, "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": 282114, "totalSubmissionRaw": 468675}, "1632": {"acRate": 41.03010518679724, "difficulty": "Hard", "likes": 875, "dislikes": 56, "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": 22624, "totalSubmissionRaw": 55140}, "1633": {"acRate": 57.27191564805471, "difficulty": "Easy", "likes": 712, "dislikes": 76, "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": 226446, "totalSubmissionRaw": 395385}, "1634": {"acRate": 58.680667992783455, "difficulty": "Medium", "likes": 158, "dislikes": 12, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 12675, "totalSubmissionRaw": 21600}, "1635": {"acRate": 47.73904980090547, "difficulty": "Hard", "likes": 110, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1635", "paidOnly": true, "title": "Hopper Company Queries I", "titleSlug": "hopper-company-queries-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8752, "totalSubmissionRaw": 18333}, "1636": {"acRate": 79.8299151302986, "difficulty": "Easy", "likes": 3412, "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": 277294, "totalSubmissionRaw": 347356}, "1637": {"acRate": 87.3563388406526, "difficulty": "Easy", "likes": 936, "dislikes": 1734, "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": 177177, "totalSubmissionRaw": 202821}, "1638": {"acRate": 71.3054659477994, "difficulty": "Medium", "likes": 1156, "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": 31609, "totalSubmissionRaw": 44329}, "1639": {"acRate": 50.86821867279118, "difficulty": "Hard", "likes": 1579, "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": 58471, "totalSubmissionRaw": 114947}, "1640": {"acRate": 56.65750196386489, "difficulty": "Easy", "likes": 903, "dislikes": 141, "categoryTitle": "Algorithms", "frontendQuestionId": "1640", "paidOnly": false, "title": "Check Array Formation Through Concatenation", "titleSlug": "check-array-formation-through-concatenation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83665, "totalSubmissionRaw": 147668}, "1641": {"acRate": 78.60643546923744, "difficulty": "Medium", "likes": 3865, "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": 189741, "totalSubmissionRaw": 241381}, "1642": {"acRate": 49.882071426120966, "difficulty": "Medium", "likes": 5910, "dislikes": 141, "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": 232642, "totalSubmissionRaw": 466384}, "1643": {"acRate": 48.35326653018712, "difficulty": "Hard", "likes": 550, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1643", "paidOnly": false, "title": "Kth Smallest Instructions", "titleSlug": "kth-smallest-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13463, "totalSubmissionRaw": 27843}, "1644": {"acRate": 64.97907238945434, "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": 84143, "totalSubmissionRaw": 129493}, "1645": {"acRate": 39.19114664812561, "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": 6764, "totalSubmissionRaw": 17259}, "1646": {"acRate": 50.55292691154081, "difficulty": "Easy", "likes": 760, "dislikes": 945, "categoryTitle": "Algorithms", "frontendQuestionId": "1646", "paidOnly": false, "title": "Get Maximum in Generated Array", "titleSlug": "get-maximum-in-generated-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 110902, "totalSubmissionRaw": 219378}, "1647": {"acRate": 61.26329614342977, "difficulty": "Medium", "likes": 4939, "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": 278011, "totalSubmissionRaw": 453797}, "1648": {"acRate": 29.99412432919425, "difficulty": "Medium", "likes": 1078, "dislikes": 387, "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": 38286, "totalSubmissionRaw": 127645}, "1649": {"acRate": 39.20497113392975, "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": 26688, "totalSubmissionRaw": 68073}, "1650": {"acRate": 80.2420732299727, "difficulty": "Medium", "likes": 1393, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1650", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree III", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 256024, "totalSubmissionRaw": 319066}, "1651": {"acRate": 65.2471625551074, "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": 6956, "totalSubmissionRaw": 10661}, "1652": {"acRate": 66.58450201735836, "difficulty": "Easy", "likes": 807, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1652", "paidOnly": false, "title": "Defuse the Bomb", "titleSlug": "defuse-the-bomb", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51324, "totalSubmissionRaw": 77081}, "1653": {"acRate": 65.81061803757727, "difficulty": "Medium", "likes": 2081, "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": 161929, "totalSubmissionRaw": 246053}, "1654": {"acRate": 29.591271672489945, "difficulty": "Medium", "likes": 1492, "dislikes": 273, "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": 44886, "totalSubmissionRaw": 151689}, "1655": {"acRate": 39.554518139604184, "difficulty": "Hard", "likes": 430, "dislikes": 27, "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": 15929, "totalSubmissionRaw": 40271}, "1656": {"acRate": 84.36434989156253, "difficulty": "Easy", "likes": 528, "dislikes": 3499, "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": 89859, "totalSubmissionRaw": 106513}, "1657": {"acRate": 54.45600023404131, "difficulty": "Medium", "likes": 3712, "dislikes": 297, "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": 372283, "totalSubmissionRaw": 683640}, "1658": {"acRate": 39.785892448582025, "difficulty": "Medium", "likes": 5475, "dislikes": 121, "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": 196673, "totalSubmissionRaw": 494330}, "1659": {"acRate": 39.66607118317988, "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": 5773, "totalSubmissionRaw": 14554}, "1660": {"acRate": 74.46483749674249, "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": 20002, "totalSubmissionRaw": 26861}, "1661": {"acRate": 68.14163489277989, "difficulty": "Easy", "likes": 1444, "dislikes": 144, "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": 330444, "totalSubmissionRaw": 484937}, "1662": {"acRate": 85.58477774438099, "difficulty": "Easy", "likes": 3002, "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": 512533, "totalSubmissionRaw": 598860}, "1663": {"acRate": 66.89107423532194, "difficulty": "Medium", "likes": 1876, "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": 96180, "totalSubmissionRaw": 143786}, "1664": {"acRate": 63.72228796844182, "difficulty": "Medium", "likes": 1318, "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": 40384, "totalSubmissionRaw": 63375}, "1665": {"acRate": 58.49926840129779, "difficulty": "Hard", "likes": 581, "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": 18391, "totalSubmissionRaw": 31438}, "1666": {"acRate": 74.1042345276873, "difficulty": "Medium", "likes": 64, "dislikes": 191, "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": 5005, "totalSubmissionRaw": 6754}, "1667": {"acRate": 61.449139828939934, "difficulty": "Easy", "likes": 884, "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": 252319, "totalSubmissionRaw": 410611}, "1668": {"acRate": 38.92805088114483, "difficulty": "Easy", "likes": 712, "dislikes": 267, "categoryTitle": "Algorithms", "frontendQuestionId": "1668", "paidOnly": false, "title": "Maximum Repeating Substring", "titleSlug": "maximum-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58756, "totalSubmissionRaw": 150938}, "1669": {"acRate": 81.75130899637509, "difficulty": "Medium", "likes": 2096, "dislikes": 220, "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": 223266, "totalSubmissionRaw": 273105}, "1670": {"acRate": 56.646095645694416, "difficulty": "Medium", "likes": 747, "dislikes": 105, "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": 29647, "totalSubmissionRaw": 52338}, "1671": {"acRate": 42.055762129614145, "difficulty": "Hard", "likes": 1593, "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": 32687, "totalSubmissionRaw": 77723}, "1672": {"acRate": 88.22744980096299, "difficulty": "Easy", "likes": 4380, "dislikes": 367, "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": 932864, "totalSubmissionRaw": 1057340}, "1673": {"acRate": 50.771426160208065, "difficulty": "Medium", "likes": 2051, "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": 66177, "totalSubmissionRaw": 130343}, "1674": {"acRate": 40.404257145309415, "difficulty": "Medium", "likes": 668, "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": 9415, "totalSubmissionRaw": 23302}, "1675": {"acRate": 54.04363261631495, "difficulty": "Hard", "likes": 3039, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "1675", "paidOnly": false, "title": "Minimize Deviation in Array", "titleSlug": "minimize-deviation-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95447, "totalSubmissionRaw": 176611}, "1676": {"acRate": 78.53278548193802, "difficulty": "Medium", "likes": 474, "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": 45869, "totalSubmissionRaw": 58407}, "1677": {"acRate": 38.224479075468395, "difficulty": "Easy", "likes": 38, "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": 17464, "totalSubmissionRaw": 45688}, "1678": {"acRate": 87.3844573216021, "difficulty": "Easy", "likes": 1583, "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": 267067, "totalSubmissionRaw": 305623}, "1679": {"acRate": 55.20473654594238, "difficulty": "Medium", "likes": 3165, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1679", "paidOnly": false, "title": "Max Number of K-Sum Pairs", "titleSlug": "max-number-of-k-sum-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 338457, "totalSubmissionRaw": 613093}, "1680": {"acRate": 57.161197394789575, "difficulty": "Medium", "likes": 1421, "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": 91275, "totalSubmissionRaw": 159680}, "1681": {"acRate": 39.05690765926986, "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": 8730, "totalSubmissionRaw": 22352}, "1682": {"acRate": 50.18384001434849, "difficulty": "Medium", "likes": 151, "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": 5596, "totalSubmissionRaw": 11151}, "1683": {"acRate": 85.43160074493905, "difficulty": "Easy", "likes": 1010, "dislikes": 372, "categoryTitle": "Database", "frontendQuestionId": "1683", "paidOnly": false, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 635341, "totalSubmissionRaw": 743683}, "1684": {"acRate": 83.6175842112422, "difficulty": "Easy", "likes": 1726, "dislikes": 74, "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": 190572, "totalSubmissionRaw": 227909}, "1685": {"acRate": 68.39740572525383, "difficulty": "Medium", "likes": 2070, "dislikes": 74, "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": 111892, "totalSubmissionRaw": 163591}, "1686": {"acRate": 57.84058912713883, "difficulty": "Medium", "likes": 843, "dislikes": 73, "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": 21364, "totalSubmissionRaw": 36936}, "1687": {"acRate": 39.42373656528699, "difficulty": "Hard", "likes": 379, "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": 6896, "totalSubmissionRaw": 17492}, "1688": {"acRate": 85.72065025166644, "difficulty": "Easy", "likes": 1761, "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": 252053, "totalSubmissionRaw": 294040}, "1689": {"acRate": 88.73846153846155, "difficulty": "Medium", "likes": 2425, "dislikes": 1493, "categoryTitle": "Algorithms", "frontendQuestionId": "1689", "paidOnly": false, "title": "Partitioning Into Minimum Number Of Deci-Binary Numbers", "titleSlug": "partitioning-into-minimum-number-of-deci-binary-numbers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226392, "totalSubmissionRaw": 255123}, "1690": {"acRate": 58.180564695559525, "difficulty": "Medium", "likes": 1001, "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": 37132, "totalSubmissionRaw": 63822}, "1691": {"acRate": 58.206779019125165, "difficulty": "Hard", "likes": 1162, "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": 30739, "totalSubmissionRaw": 52810}, "1692": {"acRate": 62.68021744268495, "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": 2652, "totalSubmissionRaw": 4231}, "1693": {"acRate": 86.55573334709784, "difficulty": "Easy", "likes": 557, "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": 134149, "totalSubmissionRaw": 154986}, "1694": {"acRate": 66.18806676304376, "difficulty": "Easy", "likes": 356, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "1694", "paidOnly": false, "title": "Reformat Phone Number", "titleSlug": "reformat-phone-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40290, "totalSubmissionRaw": 60872}, "1695": {"acRate": 58.495885333871996, "difficulty": "Medium", "likes": 2805, "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": 133208, "totalSubmissionRaw": 227722}, "1696": {"acRate": 45.65791336648094, "difficulty": "Medium", "likes": 3417, "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": 109642, "totalSubmissionRaw": 240138}, "1697": {"acRate": 62.58837627321749, "difficulty": "Hard", "likes": 1969, "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": 52230, "totalSubmissionRaw": 83450}, "1698": {"acRate": 64.35565114041542, "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": 11371, "totalSubmissionRaw": 17669}, "1699": {"acRate": 81.24079563037115, "difficulty": "Medium", "likes": 293, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "1699", "paidOnly": true, "title": "Number of Calls Between Two Persons", "titleSlug": "number-of-calls-between-two-persons", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43580, "totalSubmissionRaw": 53643}, "1700": {"acRate": 78.3313786182381, "difficulty": "Easy", "likes": 2412, "dislikes": 242, "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": 259139, "totalSubmissionRaw": 330824}, "1701": {"acRate": 73.04605063422363, "difficulty": "Medium", "likes": 1216, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1701", "paidOnly": false, "title": "Average Waiting Time", "titleSlug": "average-waiting-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 197293, "totalSubmissionRaw": 270094}, "1702": {"acRate": 47.04168380638969, "difficulty": "Medium", "likes": 499, "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": 13723, "totalSubmissionRaw": 29172}, "1703": {"acRate": 42.58627087198516, "difficulty": "Hard", "likes": 714, "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": 11477, "totalSubmissionRaw": 26950}, "1704": {"acRate": 78.66082156194187, "difficulty": "Easy", "likes": 2254, "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": 363354, "totalSubmissionRaw": 461925}, "1705": {"acRate": 39.447923533289384, "difficulty": "Medium", "likes": 832, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1705", "paidOnly": false, "title": "Maximum Number of Eaten Apples", "titleSlug": "maximum-number-of-eaten-apples", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23937, "totalSubmissionRaw": 60680}, "1706": {"acRate": 71.88774140611942, "difficulty": "Medium", "likes": 3094, "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": 141933, "totalSubmissionRaw": 197437}, "1707": {"acRate": 51.64500967652751, "difficulty": "Hard", "likes": 1228, "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": 26152, "totalSubmissionRaw": 50638}, "1708": {"acRate": 65.08252284114353, "difficulty": "Easy", "likes": 104, "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": 8833, "totalSubmissionRaw": 13572}, "1709": {"acRate": 70.3977158019208, "difficulty": "Medium", "likes": 211, "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": 24409, "totalSubmissionRaw": 34673}, "1710": {"acRate": 73.78174250298567, "difficulty": "Easy", "likes": 3833, "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": 314460, "totalSubmissionRaw": 426203}, "1711": {"acRate": 30.51110119970064, "difficulty": "Medium", "likes": 1048, "dislikes": 238, "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": 40361, "totalSubmissionRaw": 132283}, "1712": {"acRate": 33.07585582571561, "difficulty": "Medium", "likes": 1408, "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": 33614, "totalSubmissionRaw": 101627}, "1713": {"acRate": 47.739186182449, "difficulty": "Hard", "likes": 721, "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": 12659, "totalSubmissionRaw": 26517}, "1714": {"acRate": 49.72008397480756, "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": 1421, "totalSubmissionRaw": 2858}, "1715": {"acRate": 75.63065207044265, "difficulty": "Medium", "likes": 83, "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": 15890, "totalSubmissionRaw": 21010}, "1716": {"acRate": 78.39451697378392, "difficulty": "Easy", "likes": 1438, "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": 163450, "totalSubmissionRaw": 208497}, "1717": {"acRate": 63.03068887319231, "difficulty": "Medium", "likes": 1408, "dislikes": 116, "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": 135637, "totalSubmissionRaw": 215192}, "1718": {"acRate": 54.0498268349905, "difficulty": "Medium", "likes": 567, "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": 14514, "totalSubmissionRaw": 26853}, "1719": {"acRate": 44.6832686298646, "difficulty": "Hard", "likes": 219, "dislikes": 154, "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": 4719, "totalSubmissionRaw": 10561}, "1720": {"acRate": 86.55862057803219, "difficulty": "Easy", "likes": 1597, "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": 160439, "totalSubmissionRaw": 185353}, "1721": {"acRate": 68.01827505108533, "difficulty": "Medium", "likes": 5373, "dislikes": 183, "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": 352836, "totalSubmissionRaw": 518738}, "1722": {"acRate": 48.974757179331945, "difficulty": "Medium", "likes": 844, "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": 18606, "totalSubmissionRaw": 37991}, "1723": {"acRate": 42.52444444444444, "difficulty": "Hard", "likes": 1051, "dislikes": 31, "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": 28704, "totalSubmissionRaw": 67500}, "1724": {"acRate": 51.28077178975382, "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": 3083, "totalSubmissionRaw": 6012}, "1725": {"acRate": 78.83089458640843, "difficulty": "Easy", "likes": 592, "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": 73915, "totalSubmissionRaw": 93764}, "1726": {"acRate": 61.249390980151254, "difficulty": "Medium", "likes": 629, "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": 28914, "totalSubmissionRaw": 47207}, "1727": {"acRate": 75.37578686008057, "difficulty": "Medium", "likes": 1917, "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": 73161, "totalSubmissionRaw": 97062}, "1728": {"acRate": 40.0506902502157, "difficulty": "Hard", "likes": 271, "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": 7427, "totalSubmissionRaw": 18544}, "1729": {"acRate": 69.16285693330725, "difficulty": "Easy", "likes": 586, "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": 226321, "totalSubmissionRaw": 327229}, "1730": {"acRate": 55.08505367464905, "difficulty": "Medium", "likes": 676, "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": 66707, "totalSubmissionRaw": 121099}, "1731": {"acRate": 49.24751890431862, "difficulty": "Easy", "likes": 549, "dislikes": 73, "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": 160083, "totalSubmissionRaw": 325058}, "1732": {"acRate": 83.46955045535974, "difficulty": "Easy", "likes": 2899, "dislikes": 349, "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": 444960, "totalSubmissionRaw": 533070}, "1733": {"acRate": 42.9705908019897, "difficulty": "Medium", "likes": 216, "dislikes": 398, "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": 9848, "totalSubmissionRaw": 22918}, "1734": {"acRate": 65.30087571302322, "difficulty": "Medium", "likes": 766, "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": 16256, "totalSubmissionRaw": 24894}, "1735": {"acRate": 51.9705249213446, "difficulty": "Hard", "likes": 291, "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": 6277, "totalSubmissionRaw": 12078}, "1736": {"acRate": 42.88697261789205, "difficulty": "Easy", "likes": 368, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1736", "paidOnly": false, "title": "Latest Time by Replacing Hidden Digits", "titleSlug": "latest-time-by-replacing-hidden-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37997, "totalSubmissionRaw": 88598}, "1737": {"acRate": 36.85370846674715, "difficulty": "Medium", "likes": 323, "dislikes": 342, "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": 14042, "totalSubmissionRaw": 38102}, "1738": {"acRate": 61.95829216843342, "difficulty": "Medium", "likes": 509, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1738", "paidOnly": false, "title": "Find Kth Largest XOR Coordinate Value", "titleSlug": "find-kth-largest-xor-coordinate-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23204, "totalSubmissionRaw": 37451}, "1739": {"acRate": 51.89091153355277, "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": 7725, "totalSubmissionRaw": 14887}, "1740": {"acRate": 73.56863296538471, "difficulty": "Medium", "likes": 461, "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": 31391, "totalSubmissionRaw": 42669}, "1741": {"acRate": 86.8457394974562, "difficulty": "Easy", "likes": 717, "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": 145266, "totalSubmissionRaw": 167269}, "1742": {"acRate": 73.60402743580725, "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": 66962, "totalSubmissionRaw": 90976}, "1743": {"acRate": 74.77427487086742, "difficulty": "Medium", "likes": 1958, "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": 109151, "totalSubmissionRaw": 145974}, "1744": {"acRate": 34.541717275530225, "difficulty": "Medium", "likes": 132, "dislikes": 330, "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": 11091, "totalSubmissionRaw": 32109}, "1745": {"acRate": 44.42953248165262, "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": 26153, "totalSubmissionRaw": 58864}, "1746": {"acRate": 62.350731249161406, "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": 9294, "totalSubmissionRaw": 14906}, "1747": {"acRate": 63.438800999167356, "difficulty": "Medium", "likes": 187, "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": 22857, "totalSubmissionRaw": 36030}, "1748": {"acRate": 78.16603224840682, "difficulty": "Easy", "likes": 1556, "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": 182760, "totalSubmissionRaw": 233810}, "1749": {"acRate": 60.37533044766581, "difficulty": "Medium", "likes": 1276, "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": 41566, "totalSubmissionRaw": 68846}, "1750": {"acRate": 55.938981639423524, "difficulty": "Medium", "likes": 1218, "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": 166593, "totalSubmissionRaw": 297812}, "1751": {"acRate": 61.40796808262482, "difficulty": "Hard", "likes": 2080, "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": 76342, "totalSubmissionRaw": 124319}, "1752": {"acRate": 51.46176731275294, "difficulty": "Easy", "likes": 3238, "dislikes": 188, "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": 299595, "totalSubmissionRaw": 582169}, "1753": {"acRate": 67.45687638416669, "difficulty": "Medium", "likes": 946, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1753", "paidOnly": false, "title": "Maximum Score From Removing Stones", "titleSlug": "maximum-score-from-removing-stones", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43252, "totalSubmissionRaw": 64118}, "1754": {"acRate": 48.78281139150704, "difficulty": "Medium", "likes": 547, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1754", "paidOnly": false, "title": "Largest Merge Of Two Strings", "titleSlug": "largest-merge-of-two-strings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24067, "totalSubmissionRaw": 49335}, "1755": {"acRate": 39.88339542421755, "difficulty": "Hard", "likes": 907, "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": 18949, "totalSubmissionRaw": 47511}, "1756": {"acRate": 75.73695180569143, "difficulty": "Medium", "likes": 289, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1756", "paidOnly": true, "title": "Design Most Recently Used Queue", "titleSlug": "design-most-recently-used-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17805, "totalSubmissionRaw": 23509}, "1757": {"acRate": 89.29609973995379, "difficulty": "Easy", "likes": 2421, "dislikes": 109, "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": 1237203, "totalSubmissionRaw": 1385508}, "1758": {"acRate": 63.764184366816714, "difficulty": "Easy", "likes": 1430, "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": 149022, "totalSubmissionRaw": 233708}, "1759": {"acRate": 57.661472534056344, "difficulty": "Medium", "likes": 1485, "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": 113566, "totalSubmissionRaw": 196953}, "1760": {"acRate": 60.36716426699644, "difficulty": "Medium", "likes": 1995, "dislikes": 50, "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": 41004, "totalSubmissionRaw": 67925}, "1761": {"acRate": 42.670208403900666, "difficulty": "Hard", "likes": 323, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "1761", "paidOnly": false, "title": "Minimum Degree of a Connected Trio in a Graph", "titleSlug": "minimum-degree-of-a-connected-trio-in-a-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23935, "totalSubmissionRaw": 56093}, "1762": {"acRate": 79.8660502607871, "difficulty": "Medium", "likes": 1218, "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": 229075, "totalSubmissionRaw": 286824}, "1763": {"acRate": 60.86947561490824, "difficulty": "Easy", "likes": 1344, "dislikes": 887, "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": 59069, "totalSubmissionRaw": 97044}, "1764": {"acRate": 53.77386585486913, "difficulty": "Medium", "likes": 332, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1764", "paidOnly": false, "title": "Form Array by Concatenating Subarrays of Another Array", "titleSlug": "form-array-by-concatenating-subarrays-of-another-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16251, "totalSubmissionRaw": 30221}, "1765": {"acRate": 62.89367282264233, "difficulty": "Medium", "likes": 830, "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": 28777, "totalSubmissionRaw": 45755}, "1766": {"acRate": 41.39294649342264, "difficulty": "Hard", "likes": 403, "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": 10258, "totalSubmissionRaw": 24782}, "1767": {"acRate": 77.46188237991517, "difficulty": "Hard", "likes": 174, "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": 13514, "totalSubmissionRaw": 17446}, "1768": {"acRate": 80.60067755216129, "difficulty": "Easy", "likes": 3939, "dislikes": 101, "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": 1032292, "totalSubmissionRaw": 1280724}, "1769": {"acRate": 85.95370225626596, "difficulty": "Medium", "likes": 2256, "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": 131963, "totalSubmissionRaw": 153528}, "1770": {"acRate": 40.80885869237936, "difficulty": "Hard", "likes": 2524, "dislikes": 512, "categoryTitle": "Algorithms", "frontendQuestionId": "1770", "paidOnly": false, "title": "Maximum Score from Performing Multiplication Operations", "titleSlug": "maximum-score-from-performing-multiplication-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115203, "totalSubmissionRaw": 282299}, "1771": {"acRate": 36.57638954421063, "difficulty": "Hard", "likes": 540, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1771", "paidOnly": false, "title": "Maximize Palindrome Length From Subsequences", "titleSlug": "maximize-palindrome-length-from-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11628, "totalSubmissionRaw": 31791}, "1772": {"acRate": 65.92584790393933, "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": 6259, "totalSubmissionRaw": 9494}, "1773": {"acRate": 84.67055372728574, "difficulty": "Easy", "likes": 1898, "dislikes": 233, "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": 236705, "totalSubmissionRaw": 279560}, "1774": {"acRate": 47.68721468089609, "difficulty": "Medium", "likes": 709, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1774", "paidOnly": false, "title": "Closest Dessert Cost", "titleSlug": "closest-dessert-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31547, "totalSubmissionRaw": 66154}, "1775": {"acRate": 53.81139594044082, "difficulty": "Medium", "likes": 923, "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": 30249, "totalSubmissionRaw": 56213}, "1776": {"acRate": 55.53245889371608, "difficulty": "Hard", "likes": 894, "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": 26715, "totalSubmissionRaw": 48107}, "1777": {"acRate": 82.27552371310645, "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": 21130, "totalSubmissionRaw": 25682}, "1778": {"acRate": 40.385176539247155, "difficulty": "Medium", "likes": 167, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1778", "paidOnly": true, "title": "Shortest Path in a Hidden Grid", "titleSlug": "shortest-path-in-a-hidden-grid", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8304, "totalSubmissionRaw": 20562}, "1779": {"acRate": 68.75682748871091, "difficulty": "Easy", "likes": 845, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1779", "paidOnly": false, "title": "Find Nearest Point That Has the Same X or Y Coordinate", "titleSlug": "find-nearest-point-that-has-the-same-x-or-y-coordinate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117700, "totalSubmissionRaw": 171183}, "1780": {"acRate": 68.01973329222231, "difficulty": "Medium", "likes": 976, "dislikes": 33, "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": 44121, "totalSubmissionRaw": 64865}, "1781": {"acRate": 67.43222398096525, "difficulty": "Medium", "likes": 1127, "dislikes": 179, "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": 66884, "totalSubmissionRaw": 99187}, "1782": {"acRate": 40.534686199623785, "difficulty": "Hard", "likes": 315, "dislikes": 164, "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": 7111, "totalSubmissionRaw": 17543}, "1783": {"acRate": 83.53053132434576, "difficulty": "Medium", "likes": 233, "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": 26333, "totalSubmissionRaw": 31525}, "1784": {"acRate": 39.23889122001764, "difficulty": "Easy", "likes": 338, "dislikes": 971, "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": 45822, "totalSubmissionRaw": 116777}, "1785": {"acRate": 43.72996011574255, "difficulty": "Medium", "likes": 266, "dislikes": 193, "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": 22367, "totalSubmissionRaw": 51148}, "1786": {"acRate": 39.32695124019177, "difficulty": "Medium", "likes": 1099, "dislikes": 212, "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": 25511, "totalSubmissionRaw": 64868}, "1787": {"acRate": 39.836338619740744, "difficulty": "Hard", "likes": 401, "dislikes": 23, "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": 5501, "totalSubmissionRaw": 13809}, "1788": {"acRate": 66.98495370370371, "difficulty": "Hard", "likes": 76, "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": 2315, "totalSubmissionRaw": 3456}, "1789": {"acRate": 65.1767824108625, "difficulty": "Easy", "likes": 520, "dislikes": 222, "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": 144100, "totalSubmissionRaw": 221091}, "1790": {"acRate": 45.8390287370921, "difficulty": "Easy", "likes": 1095, "dislikes": 60, "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": 113684, "totalSubmissionRaw": 248004}, "1791": {"acRate": 86.65635457574005, "difficulty": "Easy", "likes": 1801, "dislikes": 175, "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": 346219, "totalSubmissionRaw": 399531}, "1792": {"acRate": 54.226023154985945, "difficulty": "Medium", "likes": 728, "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": 22763, "totalSubmissionRaw": 41978}, "1793": {"acRate": 64.30793878325393, "difficulty": "Hard", "likes": 1861, "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": 76266, "totalSubmissionRaw": 118595}, "1794": {"acRate": 65.26349614395886, "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": 2031, "totalSubmissionRaw": 3112}, "1795": {"acRate": 85.36337119096382, "difficulty": "Easy", "likes": 858, "dislikes": 56, "categoryTitle": "Database", "frontendQuestionId": "1795", "paidOnly": false, "title": "Rearrange Products Table", "titleSlug": "rearrange-products-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137544, "totalSubmissionRaw": 161128}, "1796": {"acRate": 50.725069034508984, "difficulty": "Easy", "likes": 532, "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": 61354, "totalSubmissionRaw": 120954}, "1797": {"acRate": 57.70834461471814, "difficulty": "Medium", "likes": 377, "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": 31971, "totalSubmissionRaw": 55401}, "1798": {"acRate": 61.1717645643478, "difficulty": "Medium", "likes": 816, "dislikes": 60, "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": 20339, "totalSubmissionRaw": 33249}, "1799": {"acRate": 57.73125699365909, "difficulty": "Hard", "likes": 1632, "dislikes": 112, "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": 61911, "totalSubmissionRaw": 107240}, "1800": {"acRate": 62.006290418011766, "difficulty": "Easy", "likes": 724, "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": 59735, "totalSubmissionRaw": 96337}, "1801": {"acRate": 49.96585321435076, "difficulty": "Medium", "likes": 294, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1801", "paidOnly": false, "title": "Number of Orders in the Backlog", "titleSlug": "number-of-orders-in-the-backlog", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21949, "totalSubmissionRaw": 43928}, "1802": {"acRate": 39.20866538861691, "difficulty": "Medium", "likes": 2548, "dislikes": 453, "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": 74242, "totalSubmissionRaw": 189351}, "1803": {"acRate": 48.22858286629304, "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": 9638, "totalSubmissionRaw": 19984}, "1804": {"acRate": 61.470683511499836, "difficulty": "Medium", "likes": 321, "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": 18976, "totalSubmissionRaw": 30870}, "1805": {"acRate": 38.16270880912917, "difficulty": "Easy", "likes": 613, "dislikes": 102, "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": 49963, "totalSubmissionRaw": 130921}, "1806": {"acRate": 72.87458462457529, "difficulty": "Medium", "likes": 320, "dislikes": 170, "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": 19518, "totalSubmissionRaw": 26783}, "1807": {"acRate": 67.11365460151202, "difficulty": "Medium", "likes": 482, "dislikes": 42, "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": 31781, "totalSubmissionRaw": 47354}, "1808": {"acRate": 33.44319326192438, "difficulty": "Hard", "likes": 225, "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": 7306, "totalSubmissionRaw": 21846}, "1809": {"acRate": 58.56140981837798, "difficulty": "Easy", "likes": 90, "dislikes": 61, "categoryTitle": "Database", "frontendQuestionId": "1809", "paidOnly": true, "title": "Ad-Free Sessions", "titleSlug": "ad-free-sessions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16283, "totalSubmissionRaw": 27805}, "1810": {"acRate": 56.87769307258866, "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": 3432, "totalSubmissionRaw": 6034}, "1811": {"acRate": 60.918261670054854, "difficulty": "Medium", "likes": 198, "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": 15882, "totalSubmissionRaw": 26071}, "1812": {"acRate": 78.70463438274042, "difficulty": "Easy", "likes": 816, "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": 87699, "totalSubmissionRaw": 111428}, "1813": {"acRate": 33.698946730317495, "difficulty": "Medium", "likes": 404, "dislikes": 70, "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": 17789, "totalSubmissionRaw": 52788}, "1814": {"acRate": 48.70688711266835, "difficulty": "Medium", "likes": 1829, "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": 111210, "totalSubmissionRaw": 228325}, "1815": {"acRate": 40.080563947633436, "difficulty": "Hard", "likes": 341, "dislikes": 29, "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": 6766, "totalSubmissionRaw": 16881}, "1816": {"acRate": 85.56162975422858, "difficulty": "Easy", "likes": 1142, "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": 183119, "totalSubmissionRaw": 214020}, "1817": {"acRate": 80.5026483334225, "difficulty": "Medium", "likes": 828, "dislikes": 307, "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": 60187, "totalSubmissionRaw": 74764}, "1818": {"acRate": 30.839214755945672, "difficulty": "Medium", "likes": 1022, "dislikes": 77, "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": 25999, "totalSubmissionRaw": 84305}, "1819": {"acRate": 41.15436125631831, "difficulty": "Hard", "likes": 413, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1819", "paidOnly": false, "title": "Number of Different Subsequences GCDs", "titleSlug": "number-of-different-subsequences-gcds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9526, "totalSubmissionRaw": 23147}, "1820": {"acRate": 50.41488857278331, "difficulty": "Medium", "likes": 215, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1820", "paidOnly": true, "title": "Maximum Number of Accepted Invitations", "titleSlug": "maximum-number-of-accepted-invitations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8504, "totalSubmissionRaw": 16870}, "1821": {"acRate": 87.72036474164133, "difficulty": "Easy", "likes": 60, "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": 25973, "totalSubmissionRaw": 29608}, "1822": {"acRate": 65.32319873789974, "difficulty": "Easy", "likes": 2167, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "1822", "paidOnly": false, "title": "Sign of the Product of an Array", "titleSlug": "sign-of-the-product-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 350293, "totalSubmissionRaw": 536247}, "1823": {"acRate": 81.74649549119309, "difficulty": "Medium", "likes": 3780, "dislikes": 108, "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": 290993, "totalSubmissionRaw": 355970}, "1824": {"acRate": 50.297972443149995, "difficulty": "Medium", "likes": 1193, "dislikes": 49, "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": 44901, "totalSubmissionRaw": 89270}, "1825": {"acRate": 37.302133516861666, "difficulty": "Hard", "likes": 464, "dislikes": 130, "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": 20596, "totalSubmissionRaw": 55214}, "1826": {"acRate": 50.21891010712623, "difficulty": "Easy", "likes": 67, "dislikes": 78, "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": 5391, "totalSubmissionRaw": 10735}, "1827": {"acRate": 80.15361511747957, "difficulty": "Easy", "likes": 1233, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1827", "paidOnly": false, "title": "Minimum Operations to Make the Array Increasing", "titleSlug": "minimum-operations-to-make-the-array-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102478, "totalSubmissionRaw": 127852}, "1828": {"acRate": 86.37530193236715, "difficulty": "Medium", "likes": 1144, "dislikes": 84, "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": 80101, "totalSubmissionRaw": 92736}, "1829": {"acRate": 77.21114937039737, "difficulty": "Medium", "likes": 777, "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": 30720, "totalSubmissionRaw": 39787}, "1830": {"acRate": 50.17434170975111, "difficulty": "Hard", "likes": 180, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1830", "paidOnly": false, "title": "Minimum Number of Operations to Make String Sorted", "titleSlug": "minimum-number-of-operations-to-make-string-sorted", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4173, "totalSubmissionRaw": 8317}, "1831": {"acRate": 81.84062487352787, "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": 20222, "totalSubmissionRaw": 24709}, "1832": {"acRate": 83.40131176293265, "difficulty": "Easy", "likes": 2778, "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": 365201, "totalSubmissionRaw": 437884}, "1833": {"acRate": 73.86530915454766, "difficulty": "Medium", "likes": 2177, "dislikes": 674, "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": 162076, "totalSubmissionRaw": 219421}, "1834": {"acRate": 45.7258518120122, "difficulty": "Medium", "likes": 3176, "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": 111373, "totalSubmissionRaw": 243567}, "1835": {"acRate": 61.62662289210565, "difficulty": "Hard", "likes": 604, "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": 20648, "totalSubmissionRaw": 33505}, "1836": {"acRate": 74.49967174230713, "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": 35178, "totalSubmissionRaw": 47219}, "1837": {"acRate": 77.59839357429719, "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": 57966, "totalSubmissionRaw": 74700}, "1838": {"acRate": 44.171804792114976, "difficulty": "Medium", "likes": 4676, "dislikes": 219, "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": 158469, "totalSubmissionRaw": 358756}, "1839": {"acRate": 49.53572992315009, "difficulty": "Medium", "likes": 758, "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": 32809, "totalSubmissionRaw": 66233}, "1840": {"acRate": 36.450048496605234, "difficulty": "Hard", "likes": 377, "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": 7516, "totalSubmissionRaw": 20620}, "1841": {"acRate": 53.41201799238784, "difficulty": "Medium", "likes": 108, "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": 13893, "totalSubmissionRaw": 26011}, "1842": {"acRate": 53.327840336903776, "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": 5825, "totalSubmissionRaw": 10923}, "1843": {"acRate": 44.8492751399862, "difficulty": "Medium", "likes": 94, "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": 11694, "totalSubmissionRaw": 26074}, "1844": {"acRate": 81.59722835981829, "difficulty": "Easy", "likes": 835, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1844", "paidOnly": false, "title": "Replace All Digits with Characters", "titleSlug": "replace-all-digits-with-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92324, "totalSubmissionRaw": 113146}, "1845": {"acRate": 69.45729424543335, "difficulty": "Medium", "likes": 1417, "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": 125974, "totalSubmissionRaw": 181369}, "1846": {"acRate": 65.86918376743782, "difficulty": "Medium", "likes": 1081, "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": 105861, "totalSubmissionRaw": 160714}, "1847": {"acRate": 38.67196914919258, "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": 9627, "totalSubmissionRaw": 24894}, "1848": {"acRate": 54.50667035640573, "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": 47272, "totalSubmissionRaw": 86726}, "1849": {"acRate": 36.09302813943721, "difficulty": "Medium", "likes": 525, "dislikes": 118, "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": 27500, "totalSubmissionRaw": 76192}, "1850": {"acRate": 71.33675278622087, "difficulty": "Medium", "likes": 775, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1850", "paidOnly": false, "title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number", "titleSlug": "minimum-adjacent-swaps-to-reach-the-kth-smallest-number", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22531, "totalSubmissionRaw": 31584}, "1851": {"acRate": 50.471909519917745, "difficulty": "Hard", "likes": 966, "dislikes": 36, "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": 38289, "totalSubmissionRaw": 75862}, "1852": {"acRate": 71.57093165366175, "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": 7613, "totalSubmissionRaw": 10637}, "1853": {"acRate": 85.79647149066734, "difficulty": "Easy", "likes": 64, "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": 13422, "totalSubmissionRaw": 15644}, "1854": {"acRate": 61.15643231484228, "difficulty": "Easy", "likes": 1316, "dislikes": 237, "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": 74216, "totalSubmissionRaw": 121354}, "1855": {"acRate": 53.55458624387095, "difficulty": "Medium", "likes": 1201, "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": 51444, "totalSubmissionRaw": 96059}, "1856": {"acRate": 38.26601216741952, "difficulty": "Medium", "likes": 1441, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "1856", "paidOnly": false, "title": "Maximum Subarray Min-Product", "titleSlug": "maximum-subarray-min-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29311, "totalSubmissionRaw": 76598}, "1857": {"acRate": 49.878680278147655, "difficulty": "Hard", "likes": 2132, "dislikes": 70, "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": 67426, "totalSubmissionRaw": 135180}, "1858": {"acRate": 68.70923446618606, "difficulty": "Medium", "likes": 180, "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": 8006, "totalSubmissionRaw": 11652}, "1859": {"acRate": 83.33684817298635, "difficulty": "Easy", "likes": 2206, "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": 177825, "totalSubmissionRaw": 213381}, "1860": {"acRate": 72.32591776293134, "difficulty": "Medium", "likes": 224, "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": 21002, "totalSubmissionRaw": 29038}, "1861": {"acRate": 67.85758330661274, "difficulty": "Medium", "likes": 985, "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": 55023, "totalSubmissionRaw": 81086}, "1862": {"acRate": 28.99234655292374, "difficulty": "Hard", "likes": 444, "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": 9584, "totalSubmissionRaw": 33057}, "1863": {"acRate": 87.76268933099092, "difficulty": "Easy", "likes": 2162, "dislikes": 254, "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": 184836, "totalSubmissionRaw": 210609}, "1864": {"acRate": 43.488289292403906, "difficulty": "Medium", "likes": 585, "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": 28093, "totalSubmissionRaw": 64599}, "1865": {"acRate": 51.051709870484764, "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": 26528, "totalSubmissionRaw": 51963}, "1866": {"acRate": 57.801606547438624, "difficulty": "Hard", "likes": 710, "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": 15255, "totalSubmissionRaw": 26392}, "1867": {"acRate": 71.10834904851706, "difficulty": "Medium", "likes": 73, "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": 16591, "totalSubmissionRaw": 23332}, "1868": {"acRate": 58.64219260749308, "difficulty": "Medium", "likes": 370, "dislikes": 68, "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": 46643, "totalSubmissionRaw": 79538}, "1869": {"acRate": 61.31682197155468, "difficulty": "Easy", "likes": 517, "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": 50010, "totalSubmissionRaw": 81560}, "1870": {"acRate": 46.86666394931228, "difficulty": "Medium", "likes": 2313, "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": 103483, "totalSubmissionRaw": 220803}, "1871": {"acRate": 24.981701974125045, "difficulty": "Medium", "likes": 1677, "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": 48466, "totalSubmissionRaw": 194008}, "1872": {"acRate": 53.22283609576427, "difficulty": "Hard", "likes": 449, "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": 10115, "totalSubmissionRaw": 19005}, "1873": {"acRate": 57.56216520223859, "difficulty": "Easy", "likes": 1081, "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": 249723, "totalSubmissionRaw": 433835}, "1874": {"acRate": 89.44997100414864, "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": 20052, "totalSubmissionRaw": 22417}, "1875": {"acRate": 67.40570427546942, "difficulty": "Medium", "likes": 75, "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": 12313, "totalSubmissionRaw": 18267}, "1876": {"acRate": 73.98069869386295, "difficulty": "Easy", "likes": 1514, "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": 132313, "totalSubmissionRaw": 178848}, "1877": {"acRate": 81.45499117738177, "difficulty": "Medium", "likes": 1954, "dislikes": 442, "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": 181419, "totalSubmissionRaw": 222723}, "1878": {"acRate": 48.13586907381175, "difficulty": "Medium", "likes": 208, "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": 15971, "totalSubmissionRaw": 33179}, "1879": {"acRate": 47.92158865972799, "difficulty": "Hard", "likes": 677, "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": 15010, "totalSubmissionRaw": 31322}, "1880": {"acRate": 74.33279406880445, "difficulty": "Easy", "likes": 575, "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": 69380, "totalSubmissionRaw": 93337}, "1881": {"acRate": 38.18614804524707, "difficulty": "Medium", "likes": 381, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1881", "paidOnly": false, "title": "Maximum Value after Insertion", "titleSlug": "maximum-value-after-insertion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28863, "totalSubmissionRaw": 75585}, "1882": {"acRate": 40.352631518453386, "difficulty": "Medium", "likes": 927, "dislikes": 272, "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": 35108, "totalSubmissionRaw": 87003}, "1883": {"acRate": 37.94612262111867, "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": 7198, "totalSubmissionRaw": 18969}, "1884": {"acRate": 73.14325992203345, "difficulty": "Medium", "likes": 1459, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "1884", "paidOnly": false, "title": "Egg Drop With 2 Eggs and N Floors", "titleSlug": "egg-drop-with-2-eggs-and-n-floors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50847, "totalSubmissionRaw": 69517}, "1885": {"acRate": 60.894450367543904, "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": 10852, "totalSubmissionRaw": 17821}, "1886": {"acRate": 57.24711033687234, "difficulty": "Easy", "likes": 1440, "dislikes": 124, "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": 72954, "totalSubmissionRaw": 127437}, "1887": {"acRate": 72.87770659930918, "difficulty": "Medium", "likes": 1226, "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": 95789, "totalSubmissionRaw": 131438}, "1888": {"acRate": 40.058479532163744, "difficulty": "Medium", "likes": 1215, "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": 28633, "totalSubmissionRaw": 71478}, "1889": {"acRate": 31.992230180891102, "difficulty": "Hard", "likes": 405, "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": 13173, "totalSubmissionRaw": 41181}, "1890": {"acRate": 77.31682420601001, "difficulty": "Easy", "likes": 409, "dislikes": 12, "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": 93166, "totalSubmissionRaw": 120499}, "1891": {"acRate": 49.70111675754159, "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": 64354, "totalSubmissionRaw": 129482}, "1892": {"acRate": 43.74705049551675, "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": 7416, "totalSubmissionRaw": 16952}, "1893": {"acRate": 50.027182892899404, "difficulty": "Easy", "likes": 602, "dislikes": 114, "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": 46930, "totalSubmissionRaw": 93809}, "1894": {"acRate": 53.29382854298868, "difficulty": "Medium", "likes": 1113, "dislikes": 128, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 171232, "totalSubmissionRaw": 321300}, "1895": {"acRate": 53.08717234172254, "difficulty": "Medium", "likes": 305, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "1895", "paidOnly": false, "title": "Largest Magic Square", "titleSlug": "largest-magic-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12192, "totalSubmissionRaw": 22966}, "1896": {"acRate": 54.203454894433776, "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": 4236, "totalSubmissionRaw": 7815}, "1897": {"acRate": 67.18176870104361, "difficulty": "Easy", "likes": 1103, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1897", "paidOnly": false, "title": "Redistribute Characters to Make All Strings Equal", "titleSlug": "redistribute-characters-to-make-all-strings-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141945, "totalSubmissionRaw": 211285}, "1898": {"acRate": 44.119818878439574, "difficulty": "Medium", "likes": 978, "dislikes": 130, "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": 31667, "totalSubmissionRaw": 71775}, "1899": {"acRate": 66.40002349854113, "difficulty": "Medium", "likes": 807, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1899", "paidOnly": false, "title": "Merge Triplets to Form Target Triplet", "titleSlug": "merge-triplets-to-form-target-triplet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 67817, "totalSubmissionRaw": 102134}, "1900": {"acRate": 51.038843721770554, "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": 5650, "totalSubmissionRaw": 11070}, "1901": {"acRate": 52.07822591684608, "difficulty": "Medium", "likes": 2098, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "1901", "paidOnly": false, "title": "Find a Peak Element II", "titleSlug": "find-a-peak-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83697, "totalSubmissionRaw": 160714}, "1902": {"acRate": 44.121435142594294, "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": 2398, "totalSubmissionRaw": 5435}, "1903": {"acRate": 63.67684547732393, "difficulty": "Easy", "likes": 2077, "dislikes": 128, "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": 292001, "totalSubmissionRaw": 458567}, "1904": {"acRate": 43.92741715665277, "difficulty": "Medium", "likes": 214, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "1904", "paidOnly": false, "title": "The Number of Full Rounds You Have Played", "titleSlug": "the-number-of-full-rounds-you-have-played", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22562, "totalSubmissionRaw": 51362}, "1905": {"acRate": 72.85826829713167, "difficulty": "Medium", "likes": 2503, "dislikes": 88, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 187735, "totalSubmissionRaw": 257669}, "1906": {"acRate": 44.6713687800341, "difficulty": "Medium", "likes": 534, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1906", "paidOnly": false, "title": "Minimum Absolute Difference Queries", "titleSlug": "minimum-absolute-difference-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11527, "totalSubmissionRaw": 25804}, "1907": {"acRate": 60.67047504509922, "difficulty": "Medium", "likes": 457, "dislikes": 86, "categoryTitle": "Database", "frontendQuestionId": "1907", "paidOnly": false, "title": "Count Salary Categories", "titleSlug": "count-salary-categories", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 121071, "totalSubmissionRaw": 199557}, "1908": {"acRate": 63.093585115245766, "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": 4544, "totalSubmissionRaw": 7202}, "1909": {"acRate": 27.81347575015974, "difficulty": "Easy", "likes": 1249, "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": 69212, "totalSubmissionRaw": 248845}, "1910": {"acRate": 77.86184679758452, "difficulty": "Medium", "likes": 1795, "dislikes": 61, "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": 131001, "totalSubmissionRaw": 168248}, "1911": {"acRate": 58.998303438075496, "difficulty": "Medium", "likes": 1245, "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": 40687, "totalSubmissionRaw": 68963}, "1912": {"acRate": 36.627384664165305, "difficulty": "Hard", "likes": 242, "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": 6931, "totalSubmissionRaw": 18923}, "1913": {"acRate": 82.86883699139115, "difficulty": "Easy", "likes": 1522, "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": 254703, "totalSubmissionRaw": 307357}, "1914": {"acRate": 49.817875081476934, "difficulty": "Medium", "likes": 239, "dislikes": 272, "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": 12993, "totalSubmissionRaw": 26081}, "1915": {"acRate": 66.94994141910219, "difficulty": "Medium", "likes": 1732, "dislikes": 272, "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": 83429, "totalSubmissionRaw": 124614}, "1916": {"acRate": 49.306654847084154, "difficulty": "Hard", "likes": 487, "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": 7787, "totalSubmissionRaw": 15793}, "1917": {"acRate": 27.05144903940085, "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": 6646, "totalSubmissionRaw": 24568}, "1918": {"acRate": 53.011336797354744, "difficulty": "Medium", "likes": 206, "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": 4489, "totalSubmissionRaw": 8468}, "1919": {"acRate": 41.70324846356453, "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": 5700, "totalSubmissionRaw": 13668}, "1920": {"acRate": 90.01314604202277, "difficulty": "Easy", "likes": 3385, "dislikes": 405, "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": 565575, "totalSubmissionRaw": 628325}, "1921": {"acRate": 50.9081334762204, "difficulty": "Medium", "likes": 1508, "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": 110210, "totalSubmissionRaw": 216488}, "1922": {"acRate": 46.43965875479723, "difficulty": "Medium", "likes": 1451, "dislikes": 443, "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": 75992, "totalSubmissionRaw": 163636}, "1923": {"acRate": 28.52248867278152, "difficulty": "Hard", "likes": 478, "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": 7743, "totalSubmissionRaw": 27147}, "1924": {"acRate": 50.62068965517241, "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": 734, "totalSubmissionRaw": 1450}, "1925": {"acRate": 68.05980827013879, "difficulty": "Easy", "likes": 426, "dislikes": 41, "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": 47567, "totalSubmissionRaw": 69890}, "1926": {"acRate": 46.90567321595645, "difficulty": "Medium", "likes": 2331, "dislikes": 112, "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": 165436, "totalSubmissionRaw": 352702}, "1927": {"acRate": 48.00764192139738, "difficulty": "Medium", "likes": 499, "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": 12313, "totalSubmissionRaw": 25648}, "1928": {"acRate": 38.595174665115756, "difficulty": "Hard", "likes": 791, "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": 20572, "totalSubmissionRaw": 53302}, "1929": {"acRate": 90.08489608388733, "difficulty": "Easy", "likes": 3370, "dislikes": 398, "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": 850165, "totalSubmissionRaw": 943738}, "1930": {"acRate": 66.10240908674544, "difficulty": "Medium", "likes": 1730, "dislikes": 77, "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": 108246, "totalSubmissionRaw": 163755}, "1931": {"acRate": 57.81835484446559, "difficulty": "Hard", "likes": 480, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1931", "paidOnly": false, "title": "Painting a Grid With Three Different Colors", "titleSlug": "painting-a-grid-with-three-different-colors", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9721, "totalSubmissionRaw": 16813}, "1932": {"acRate": 36.41634456101601, "difficulty": "Hard", "likes": 580, "dislikes": 41, "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": 9233, "totalSubmissionRaw": 25354}, "1933": {"acRate": 50.7964127961451, "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": 3795, "totalSubmissionRaw": 7471}, "1934": {"acRate": 59.25682922518588, "difficulty": "Medium", "likes": 916, "dislikes": 81, "categoryTitle": "Database", "frontendQuestionId": "1934", "paidOnly": false, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 244755, "totalSubmissionRaw": 413041}, "1935": {"acRate": 73.6164482162137, "difficulty": "Easy", "likes": 594, "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": 63411, "totalSubmissionRaw": 86137}, "1936": {"acRate": 42.962995376245274, "difficulty": "Medium", "likes": 376, "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": 29455, "totalSubmissionRaw": 68559}, "1937": {"acRate": 42.93851753346421, "difficulty": "Medium", "likes": 3089, "dislikes": 220, "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"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142394, "totalSubmissionRaw": 331621}, "1938": {"acRate": 43.15805311065974, "difficulty": "Hard", "likes": 385, "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": 5737, "totalSubmissionRaw": 13293}, "1939": {"acRate": 56.415389122156036, "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": 11555, "totalSubmissionRaw": 20482}, "1940": {"acRate": 81.27200047729849, "difficulty": "Medium", "likes": 186, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1940", "paidOnly": true, "title": "Longest Common Subsequence Between Sorted Arrays", "titleSlug": "longest-common-subsequence-between-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13622, "totalSubmissionRaw": 16761}, "1941": {"acRate": 77.89227025565536, "difficulty": "Easy", "likes": 893, "dislikes": 22, "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": 103712, "totalSubmissionRaw": 133148}, "1942": {"acRate": 42.48725644323758, "difficulty": "Medium", "likes": 580, "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": 17837, "totalSubmissionRaw": 41982}, "1943": {"acRate": 50.30813166992334, "difficulty": "Medium", "likes": 479, "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": 13388, "totalSubmissionRaw": 26612}, "1944": {"acRate": 69.88118008462297, "difficulty": "Hard", "likes": 1768, "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": 60283, "totalSubmissionRaw": 86265}, "1945": {"acRate": 63.1683412577375, "difficulty": "Easy", "likes": 615, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 56010, "totalSubmissionRaw": 88827}, "1946": {"acRate": 36.14230280553553, "difficulty": "Medium", "likes": 215, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1946", "paidOnly": false, "title": "Largest Number After Mutating Substring", "titleSlug": "largest-number-after-mutating-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21050, "totalSubmissionRaw": 58242}, "1947": {"acRate": 62.454552021381616, "difficulty": "Medium", "likes": 787, "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": 25938, "totalSubmissionRaw": 41531}, "1948": {"acRate": 55.56373902903087, "difficulty": "Hard", "likes": 320, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1948", "paidOnly": false, "title": "Delete Duplicate Folders in System", "titleSlug": "delete-duplicate-folders-in-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9053, "totalSubmissionRaw": 16293}, "1949": {"acRate": 54.47822871808257, "difficulty": "Medium", "likes": 147, "dislikes": 84, "categoryTitle": "Database", "frontendQuestionId": "1949", "paidOnly": true, "title": "Strong Friendship", "titleSlug": "strong-friendship", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12524, "totalSubmissionRaw": 22989}, "1950": {"acRate": 49.75417895771878, "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": 3036, "totalSubmissionRaw": 6102}, "1951": {"acRate": 68.84628750144793, "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": 11887, "totalSubmissionRaw": 17266}, "1952": {"acRate": 61.191159212413616, "difficulty": "Easy", "likes": 533, "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": 75084, "totalSubmissionRaw": 122704}, "1953": {"acRate": 40.88873291219626, "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": 24467, "totalSubmissionRaw": 59838}, "1954": {"acRate": 54.631946375065645, "difficulty": "Medium", "likes": 387, "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": 17686, "totalSubmissionRaw": 32373}, "1955": {"acRate": 51.43293847917463, "difficulty": "Hard", "likes": 521, "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": 12114, "totalSubmissionRaw": 23553}, "1956": {"acRate": 47.41420976317061, "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": 981, "totalSubmissionRaw": 2069}, "1957": {"acRate": 58.59616757914782, "difficulty": "Easy", "likes": 442, "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": 39386, "totalSubmissionRaw": 67216}, "1958": {"acRate": 48.86234553027434, "difficulty": "Medium", "likes": 161, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "1958", "paidOnly": false, "title": "Check if Move is Legal", "titleSlug": "check-if-move-is-legal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14195, "totalSubmissionRaw": 29051}, "1959": {"acRate": 43.20310942794499, "difficulty": "Medium", "likes": 567, "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": 8670, "totalSubmissionRaw": 20068}, "1960": {"acRate": 30.8561530847905, "difficulty": "Hard", "likes": 245, "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": 3741, "totalSubmissionRaw": 12124}, "1961": {"acRate": 52.86538516195656, "difficulty": "Easy", "likes": 487, "dislikes": 92, "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": 55801, "totalSubmissionRaw": 105553}, "1962": {"acRate": 62.73153820866083, "difficulty": "Medium", "likes": 1819, "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": 104951, "totalSubmissionRaw": 167303}, "1963": {"acRate": 72.04437372457006, "difficulty": "Medium", "likes": 1810, "dislikes": 77, "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": 80140, "totalSubmissionRaw": 111237}, "1964": {"acRate": 62.90993610833988, "difficulty": "Hard", "likes": 1798, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1964", "paidOnly": false, "title": "Find the Longest Valid Obstacle Course at Each Position", "titleSlug": "find-the-longest-valid-obstacle-course-at-each-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59275, "totalSubmissionRaw": 94222}, "1965": {"acRate": 72.44172487575143, "difficulty": "Easy", "likes": 702, "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": 127977, "totalSubmissionRaw": 176662}, "1966": {"acRate": 64.1326415519964, "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": 2843, "totalSubmissionRaw": 4433}, "1967": {"acRate": 81.20446450802724, "difficulty": "Easy", "likes": 698, "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": 75011, "totalSubmissionRaw": 92373}, "1968": {"acRate": 50.349723353168386, "difficulty": "Medium", "likes": 622, "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": 38584, "totalSubmissionRaw": 76632}, "1969": {"acRate": 35.78479615877844, "difficulty": "Medium", "likes": 243, "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": 11999, "totalSubmissionRaw": 33531}, "1970": {"acRate": 61.98549820341243, "difficulty": "Hard", "likes": 1901, "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": 57617, "totalSubmissionRaw": 92953}, "1971": {"acRate": 53.97456012096311, "difficulty": "Easy", "likes": 3894, "dislikes": 225, "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": 464762, "totalSubmissionRaw": 861073}, "1972": {"acRate": 50.49351454705183, "difficulty": "Hard", "likes": 134, "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": 9771, "totalSubmissionRaw": 19351}, "1973": {"acRate": 77.04512208844379, "difficulty": "Medium", "likes": 176, "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": 13694, "totalSubmissionRaw": 17774}, "1974": {"acRate": 75.69035391405647, "difficulty": "Easy", "likes": 696, "dislikes": 30, "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": 46131, "totalSubmissionRaw": 60947}, "1975": {"acRate": 49.992242850493874, "difficulty": "Medium", "likes": 555, "dislikes": 24, "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": 19334, "totalSubmissionRaw": 38674}, "1976": {"acRate": 27.666930752352126, "difficulty": "Medium", "likes": 2833, "dislikes": 134, "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": 75780, "totalSubmissionRaw": 273902}, "1977": {"acRate": 21.060326743372958, "difficulty": "Hard", "likes": 519, "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": 6626, "totalSubmissionRaw": 31462}, "1978": {"acRate": 48.48908105591444, "difficulty": "Easy", "likes": 371, "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": 141633, "totalSubmissionRaw": 292095}, "1979": {"acRate": 78.10727656892908, "difficulty": "Easy", "likes": 1129, "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": 147497, "totalSubmissionRaw": 188839}, "1980": {"acRate": 74.69515530020887, "difficulty": "Medium", "likes": 1993, "dislikes": 75, "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": 143403, "totalSubmissionRaw": 191984}, "1981": {"acRate": 35.25839808515405, "difficulty": "Medium", "likes": 957, "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": 29903, "totalSubmissionRaw": 84811}, "1982": {"acRate": 49.00583805736526, "difficulty": "Hard", "likes": 584, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1982", "paidOnly": false, "title": "Find Array Given Subset Sums", "titleSlug": "find-array-given-subset-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5792, "totalSubmissionRaw": 11819}, "1983": {"acRate": 53.68299267258002, "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": 2784, "totalSubmissionRaw": 5186}, "1984": {"acRate": 57.26555359422858, "difficulty": "Easy", "likes": 1001, "dislikes": 287, "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": 82077, "totalSubmissionRaw": 143327}, "1985": {"acRate": 45.79809966933724, "difficulty": "Medium", "likes": 1250, "dislikes": 147, "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": 70083, "totalSubmissionRaw": 153026}, "1986": {"acRate": 33.33333333333333, "difficulty": "Medium", "likes": 1118, "dislikes": 68, "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": 27150, "totalSubmissionRaw": 81450}, "1987": {"acRate": 52.33968115135371, "difficulty": "Hard", "likes": 701, "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": 13165, "totalSubmissionRaw": 25153}, "1988": {"acRate": 66.84662719145477, "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": 11515, "totalSubmissionRaw": 17226}, "1989": {"acRate": 51.40992775576788, "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": 2206, "totalSubmissionRaw": 4291}, "1990": {"acRate": 49.18804268575595, "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": 7421, "totalSubmissionRaw": 15085}, "1991": {"acRate": 67.64807917629425, "difficulty": "Easy", "likes": 1381, "dislikes": 65, "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": 103348, "totalSubmissionRaw": 152773}, "1992": {"acRate": 75.77348693440132, "difficulty": "Medium", "likes": 1381, "dislikes": 89, "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": 130169, "totalSubmissionRaw": 171787}, "1993": {"acRate": 46.23134631530482, "difficulty": "Medium", "likes": 464, "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": 17070, "totalSubmissionRaw": 36923}, "1994": {"acRate": 35.06638594078976, "difficulty": "Hard", "likes": 473, "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": 8161, "totalSubmissionRaw": 23273}, "1995": {"acRate": 61.73808172531214, "difficulty": "Easy", "likes": 636, "dislikes": 233, "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": 43513, "totalSubmissionRaw": 70480}, "1996": {"acRate": 44.04365148971359, "difficulty": "Medium", "likes": 3016, "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": 105459, "totalSubmissionRaw": 239442}, "1997": {"acRate": 37.80761492029098, "difficulty": "Medium", "likes": 491, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1997", "paidOnly": false, "title": "First Day Where You Have Been in All the Rooms", "titleSlug": "first-day-where-you-have-been-in-all-the-rooms", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9771, "totalSubmissionRaw": 25844}, "1998": {"acRate": 46.15127335276411, "difficulty": "Hard", "likes": 496, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1998", "paidOnly": false, "title": "GCD Sort of an Array", "titleSlug": "gcd-sort-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9659, "totalSubmissionRaw": 20929}, "1999": {"acRate": 49.33730051393022, "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": 1824, "totalSubmissionRaw": 3697}, "2000": {"acRate": 86.3112890701743, "difficulty": "Easy", "likes": 1335, "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": 276775, "totalSubmissionRaw": 320671}, "2001": {"acRate": 50.20751328917482, "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": 42220, "totalSubmissionRaw": 84091}, "2002": {"acRate": 60.34622613512711, "difficulty": "Medium", "likes": 945, "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": 30502, "totalSubmissionRaw": 50545}, "2003": {"acRate": 46.84190721926571, "difficulty": "Hard", "likes": 452, "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": 8714, "totalSubmissionRaw": 18603}, "2004": {"acRate": 43.526485948768965, "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": 8751, "totalSubmissionRaw": 20105}, "2005": {"acRate": 58.96520963425513, "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": 661, "totalSubmissionRaw": 1121}, "2006": {"acRate": 84.1756972132103, "difficulty": "Easy", "likes": 1642, "dislikes": 43, "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": 163199, "totalSubmissionRaw": 193879}, "2007": {"acRate": 40.49930241906879, "difficulty": "Medium", "likes": 2451, "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": 137014, "totalSubmissionRaw": 338312}, "2008": {"acRate": 44.31234325221989, "difficulty": "Medium", "likes": 1278, "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": 32687, "totalSubmissionRaw": 73765}, "2009": {"acRate": 52.635156694366216, "difficulty": "Hard", "likes": 1881, "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": 75882, "totalSubmissionRaw": 144166}, "2010": {"acRate": 62.55816470078995, "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": 5781, "totalSubmissionRaw": 9241}, "2011": {"acRate": 89.4026909123521, "difficulty": "Easy", "likes": 1613, "dislikes": 189, "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": 418686, "totalSubmissionRaw": 468315}, "2012": {"acRate": 48.46905278236476, "difficulty": "Medium", "likes": 607, "dislikes": 65, "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": 24362, "totalSubmissionRaw": 50263}, "2013": {"acRate": 51.27868394397681, "difficulty": "Medium", "likes": 888, "dislikes": 234, "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": 73407, "totalSubmissionRaw": 143153}, "2014": {"acRate": 55.8578495183546, "difficulty": "Hard", "likes": 462, "dislikes": 81, "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": 8582, "totalSubmissionRaw": 15364}, "2015": {"acRate": 59.44383259911894, "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": 2159, "totalSubmissionRaw": 3632}, "2016": {"acRate": 56.855804663451515, "difficulty": "Easy", "likes": 1014, "dislikes": 32, "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": 89951, "totalSubmissionRaw": 158209}, "2017": {"acRate": 46.17759508894114, "difficulty": "Medium", "likes": 917, "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": 25726, "totalSubmissionRaw": 55711}, "2018": {"acRate": 49.78835502319088, "difficulty": "Medium", "likes": 294, "dislikes": 296, "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": 22113, "totalSubmissionRaw": 44414}, "2019": {"acRate": 33.82756727073037, "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": 7392, "totalSubmissionRaw": 21852}, "2020": {"acRate": 72.0721320202289, "difficulty": "Medium", "likes": 27, "dislikes": 214, "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": 10831, "totalSubmissionRaw": 15028}, "2021": {"acRate": 61.460405889375245, "difficulty": "Medium", "likes": 152, "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": 6178, "totalSubmissionRaw": 10052}, "2022": {"acRate": 71.30173702386475, "difficulty": "Easy", "likes": 1161, "dislikes": 86, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 221269, "totalSubmissionRaw": 310330}, "2023": {"acRate": 75.07305219771769, "difficulty": "Medium", "likes": 706, "dislikes": 54, "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": 48814, "totalSubmissionRaw": 65022}, "2024": {"acRate": 67.48569341288201, "difficulty": "Medium", "likes": 2885, "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": 110850, "totalSubmissionRaw": 164258}, "2025": {"acRate": 34.44202167474859, "difficulty": "Hard", "likes": 482, "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": 10583, "totalSubmissionRaw": 30727}, "2026": {"acRate": 84.2664157537469, "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": 12538, "totalSubmissionRaw": 14879}, "2027": {"acRate": 55.33584345627439, "difficulty": "Easy", "likes": 479, "dislikes": 72, "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": 40269, "totalSubmissionRaw": 72772}, "2028": {"acRate": 47.009010810116095, "difficulty": "Medium", "likes": 489, "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": 32919, "totalSubmissionRaw": 70027}, "2029": {"acRate": 28.76087313310356, "difficulty": "Medium", "likes": 241, "dislikes": 274, "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": 8762, "totalSubmissionRaw": 30465}, "2030": {"acRate": 39.43437914273089, "difficulty": "Hard", "likes": 484, "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": 8924, "totalSubmissionRaw": 22630}, "2031": {"acRate": 52.15346534653465, "difficulty": "Medium", "likes": 172, "dislikes": 17, "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": 4214, "totalSubmissionRaw": 8080}, "2032": {"acRate": 75.59801738380864, "difficulty": "Easy", "likes": 757, "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": 73668, "totalSubmissionRaw": 97447}, "2033": {"acRate": 53.48318655825581, "difficulty": "Medium", "likes": 549, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2033", "paidOnly": false, "title": "Minimum Operations to Make a Uni-Value Grid", "titleSlug": "minimum-operations-to-make-a-uni-value-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23746, "totalSubmissionRaw": 44399}, "2034": {"acRate": 48.628067967275015, "difficulty": "Medium", "likes": 1165, "dislikes": 65, "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": 69541, "totalSubmissionRaw": 143006}, "2035": {"acRate": 20.592559866908736, "difficulty": "Hard", "likes": 3095, "dislikes": 202, "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": 29831, "totalSubmissionRaw": 144863}, "2036": {"acRate": 40.33217649975211, "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": 3254, "totalSubmissionRaw": 8068}, "2037": {"acRate": 87.56867324754685, "difficulty": "Easy", "likes": 1330, "dislikes": 326, "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"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 238452, "totalSubmissionRaw": 272303}, "2038": {"acRate": 62.81049991350977, "difficulty": "Medium", "likes": 1574, "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": 145243, "totalSubmissionRaw": 231240}, "2039": {"acRate": 52.59538672096672, "difficulty": "Medium", "likes": 673, "dislikes": 63, "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": 15756, "totalSubmissionRaw": 29957}, "2040": {"acRate": 29.121896108266625, "difficulty": "Hard", "likes": 687, "dislikes": 38, "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": 12115, "totalSubmissionRaw": 41601}, "2041": {"acRate": 78.18155702384372, "difficulty": "Medium", "likes": 54, "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": 10886, "totalSubmissionRaw": 13924}, "2042": {"acRate": 70.10173941581884, "difficulty": "Easy", "likes": 615, "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": 61942, "totalSubmissionRaw": 88359}, "2043": {"acRate": 63.87906211435623, "difficulty": "Medium", "likes": 263, "dislikes": 218, "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": 31058, "totalSubmissionRaw": 48620}, "2044": {"acRate": 77.97902764537655, "difficulty": "Medium", "likes": 625, "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": 30266, "totalSubmissionRaw": 38813}, "2045": {"acRate": 63.16735738664067, "difficulty": "Hard", "likes": 1202, "dislikes": 66, "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": 82915, "totalSubmissionRaw": 131263}, "2046": {"acRate": 67.06088814283534, "difficulty": "Medium", "likes": 167, "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": 8789, "totalSubmissionRaw": 13106}, "2047": {"acRate": 29.338637493784187, "difficulty": "Easy", "likes": 302, "dislikes": 804, "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": 31270, "totalSubmissionRaw": 106583}, "2048": {"acRate": 48.83263106997306, "difficulty": "Medium", "likes": 198, "dislikes": 280, "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": 14139, "totalSubmissionRaw": 28954}, "2049": {"acRate": 50.1030274211444, "difficulty": "Medium", "likes": 1076, "dislikes": 83, "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": 28449, "totalSubmissionRaw": 56781}, "2050": {"acRate": 67.11038748527294, "difficulty": "Hard", "likes": 1533, "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": 82025, "totalSubmissionRaw": 122224}, "2051": {"acRate": 69.95686374016748, "difficulty": "Medium", "likes": 59, "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": 8271, "totalSubmissionRaw": 11823}, "2052": {"acRate": 49.46822308690013, "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": 1907, "totalSubmissionRaw": 3855}, "2053": {"acRate": 82.10145444175103, "difficulty": "Easy", "likes": 1240, "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": 230311, "totalSubmissionRaw": 280520}, "2054": {"acRate": 46.821770811368054, "difficulty": "Medium", "likes": 841, "dislikes": 26, "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": 19984, "totalSubmissionRaw": 42681}, "2055": {"acRate": 45.251418914610035, "difficulty": "Medium", "likes": 1222, "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": 56767, "totalSubmissionRaw": 125448}, "2056": {"acRate": 52.73504273504274, "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": 4319, "totalSubmissionRaw": 8190}, "2057": {"acRate": 73.24348548443513, "difficulty": "Easy", "likes": 422, "dislikes": 139, "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": 67009, "totalSubmissionRaw": 91488}, "2058": {"acRate": 69.64311899336174, "difficulty": "Medium", "likes": 1253, "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": 175727, "totalSubmissionRaw": 252325}, "2059": {"acRate": 49.67870344043219, "difficulty": "Medium", "likes": 643, "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": 17472, "totalSubmissionRaw": 35170}, "2060": {"acRate": 43.85874601050139, "difficulty": "Hard", "likes": 312, "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": 17040, "totalSubmissionRaw": 38852}, "2061": {"acRate": 62.52558763323216, "difficulty": "Medium", "likes": 122, "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": 8858, "totalSubmissionRaw": 14167}, "2062": {"acRate": 68.24064137365066, "difficulty": "Easy", "likes": 950, "dislikes": 244, "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": 43240, "totalSubmissionRaw": 63364}, "2063": {"acRate": 54.055532034998585, "difficulty": "Medium", "likes": 836, "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": 30643, "totalSubmissionRaw": 56688}, "2064": {"acRate": 53.572814905867894, "difficulty": "Medium", "likes": 1073, "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": 33123, "totalSubmissionRaw": 61828}, "2065": {"acRate": 58.91546967035238, "difficulty": "Hard", "likes": 645, "dislikes": 48, "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": 22805, "totalSubmissionRaw": 38708}, "2066": {"acRate": 82.05341542557618, "difficulty": "Medium", "likes": 71, "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": 9862, "totalSubmissionRaw": 12019}, "2067": {"acRate": 46.59755893663267, "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": 2787, "totalSubmissionRaw": 5981}, "2068": {"acRate": 63.92009849047815, "difficulty": "Easy", "likes": 528, "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": 57631, "totalSubmissionRaw": 90161}, "2069": {"acRate": 26.389983363978637, "difficulty": "Medium", "likes": 166, "dislikes": 308, "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": 12056, "totalSubmissionRaw": 45684}, "2070": {"acRate": 49.93138600274456, "difficulty": "Medium", "likes": 590, "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": 17829, "totalSubmissionRaw": 35707}, "2071": {"acRate": 33.799321986509625, "difficulty": "Hard", "likes": 540, "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": 9671, "totalSubmissionRaw": 28613}, "2072": {"acRate": 74.14446227929375, "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": 11548, "totalSubmissionRaw": 15575}, "2073": {"acRate": 69.91729493935803, "difficulty": "Easy", "likes": 1664, "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": 221824, "totalSubmissionRaw": 317261}, "2074": {"acRate": 58.640402659541415, "difficulty": "Medium", "likes": 725, "dislikes": 341, "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": 28311, "totalSubmissionRaw": 48279}, "2075": {"acRate": 49.06699296420924, "difficulty": "Medium", "likes": 248, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "2075", "paidOnly": false, "title": "Decode the Slanted Ciphertext", "titleSlug": "decode-the-slanted-ciphertext", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14436, "totalSubmissionRaw": 29421}, "2076": {"acRate": 55.529725373504434, "difficulty": "Hard", "likes": 615, "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": 17915, "totalSubmissionRaw": 32262}, "2077": {"acRate": 55.67834469786034, "difficulty": "Medium", "likes": 131, "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": 4735, "totalSubmissionRaw": 8504}, "2078": {"acRate": 66.06982071826668, "difficulty": "Easy", "likes": 904, "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": 57969, "totalSubmissionRaw": 87739}, "2079": {"acRate": 79.84112107823448, "difficulty": "Medium", "likes": 913, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2079", "paidOnly": false, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53670, "totalSubmissionRaw": 67221}, "2080": {"acRate": 40.447969796525875, "difficulty": "Medium", "likes": 659, "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": 22284, "totalSubmissionRaw": 55093}, "2081": {"acRate": 42.51743454898823, "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": 7438, "totalSubmissionRaw": 17494}, "2082": {"acRate": 77.24727379899794, "difficulty": "Easy", "likes": 97, "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": 23589, "totalSubmissionRaw": 30537}, "2083": {"acRate": 74.22394358055378, "difficulty": "Medium", "likes": 134, "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": 12840, "totalSubmissionRaw": 17299}, "2084": {"acRate": 86.74236491777604, "difficulty": "Medium", "likes": 86, "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": 11077, "totalSubmissionRaw": 12770}, "2085": {"acRate": 71.15419425522794, "difficulty": "Easy", "likes": 811, "dislikes": 19, "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": 74686, "totalSubmissionRaw": 104964}, "2086": {"acRate": 46.84991846847801, "difficulty": "Medium", "likes": 539, "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": 22123, "totalSubmissionRaw": 47221}, "2087": {"acRate": 51.06938204514272, "difficulty": "Medium", "likes": 678, "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": 18983, "totalSubmissionRaw": 37171}, "2088": {"acRate": 65.19047922914939, "difficulty": "Hard", "likes": 370, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2088", "paidOnly": false, "title": "Count Fertile Pyramids in a Land", "titleSlug": "count-fertile-pyramids-in-a-land", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10216, "totalSubmissionRaw": 15671}, "2089": {"acRate": 76.59643744887667, "difficulty": "Easy", "likes": 1803, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2089", "paidOnly": false, "title": "Find Target Indices After Sorting Array", "titleSlug": "find-target-indices-after-sorting-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 192901, "totalSubmissionRaw": 251841}, "2090": {"acRate": 45.98120185658938, "difficulty": "Medium", "likes": 1894, "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": 130667, "totalSubmissionRaw": 284174}, "2091": {"acRate": 54.98771379807052, "difficulty": "Medium", "likes": 960, "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": 45427, "totalSubmissionRaw": 82613}, "2092": {"acRate": 45.51851953795198, "difficulty": "Hard", "likes": 1586, "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": 99224, "totalSubmissionRaw": 217986}, "2093": {"acRate": 59.82164090368609, "difficulty": "Medium", "likes": 228, "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": 10062, "totalSubmissionRaw": 16820}, "2094": {"acRate": 61.19127364895447, "difficulty": "Easy", "likes": 711, "dislikes": 264, "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": 33799, "totalSubmissionRaw": 55235}, "2095": {"acRate": 59.554802556973506, "difficulty": "Medium", "likes": 4220, "dislikes": 81, "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": 484729, "totalSubmissionRaw": 813921}, "2096": {"acRate": 56.38761407687185, "difficulty": "Medium", "likes": 3090, "dislikes": 161, "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": 204082, "totalSubmissionRaw": 361927}, "2097": {"acRate": 44.251251364269315, "difficulty": "Hard", "likes": 509, "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": 11758, "totalSubmissionRaw": 26571}, "2098": {"acRate": 36.72869735553379, "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": 3375, "totalSubmissionRaw": 9189}, "2099": {"acRate": 43.97751759510369, "difficulty": "Easy", "likes": 1259, "dislikes": 134, "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": 53675, "totalSubmissionRaw": 122051}, "2100": {"acRate": 49.583266118191105, "difficulty": "Medium", "likes": 893, "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": 27663, "totalSubmissionRaw": 55791}, "2101": {"acRate": 48.779954125671516, "difficulty": "Medium", "likes": 3092, "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": 129302, "totalSubmissionRaw": 265072}, "2102": {"acRate": 64.70322448141303, "difficulty": "Hard", "likes": 385, "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": 15751, "totalSubmissionRaw": 24344}, "2103": {"acRate": 80.85349986989331, "difficulty": "Easy", "likes": 961, "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": 77678, "totalSubmissionRaw": 96072}, "2104": {"acRate": 60.829472828087994, "difficulty": "Medium", "likes": 2416, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2104", "paidOnly": false, "title": "Sum of Subarray Ranges", "titleSlug": "sum-of-subarray-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110692, "totalSubmissionRaw": 181971}, "2105": {"acRate": 48.4132910210939, "difficulty": "Medium", "likes": 277, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2105", "paidOnly": false, "title": "Watering Plants II", "titleSlug": "watering-plants-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20748, "totalSubmissionRaw": 42856}, "2106": {"acRate": 36.47421290798806, "difficulty": "Hard", "likes": 554, "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": 11365, "totalSubmissionRaw": 31159}, "2107": {"acRate": 55.37873965626989, "difficulty": "Medium", "likes": 78, "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": 3480, "totalSubmissionRaw": 6284}, "2108": {"acRate": 83.90191308194184, "difficulty": "Easy", "likes": 1534, "dislikes": 54, "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": 303488, "totalSubmissionRaw": 361718}, "2109": {"acRate": 59.30482696154281, "difficulty": "Medium", "likes": 562, "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": 47142, "totalSubmissionRaw": 79491}, "2110": {"acRate": 59.17724953869532, "difficulty": "Medium", "likes": 714, "dislikes": 32, "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": 38164, "totalSubmissionRaw": 64491}, "2111": {"acRate": 38.91201038991706, "difficulty": "Hard", "likes": 699, "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": 13183, "totalSubmissionRaw": 33879}, "2112": {"acRate": 70.34667930190318, "difficulty": "Medium", "likes": 62, "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": 8908, "totalSubmissionRaw": 12663}, "2113": {"acRate": 73.9373601789709, "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": 1983, "totalSubmissionRaw": 2682}, "2114": {"acRate": 86.61125671345272, "difficulty": "Easy", "likes": 1751, "dislikes": 61, "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": 308660, "totalSubmissionRaw": 356374}, "2115": {"acRate": 50.21499845694888, "difficulty": "Medium", "likes": 1889, "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": 97628, "totalSubmissionRaw": 194420}, "2116": {"acRate": 32.084888004802316, "difficulty": "Medium", "likes": 1158, "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": 27259, "totalSubmissionRaw": 84959}, "2117": {"acRate": 26.19340818544006, "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": 3616, "totalSubmissionRaw": 13805}, "2118": {"acRate": 55.072463768115945, "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": 2698, "totalSubmissionRaw": 4899}, "2119": {"acRate": 80.29602612494169, "difficulty": "Easy", "likes": 683, "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": 94665, "totalSubmissionRaw": 117895}, "2120": {"acRate": 82.69373354127784, "difficulty": "Medium", "likes": 541, "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": 32344, "totalSubmissionRaw": 39113}, "2121": {"acRate": 44.59430710973067, "difficulty": "Medium", "likes": 908, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2121", "paidOnly": false, "title": "Intervals Between Identical Elements", "titleSlug": "intervals-between-identical-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20962, "totalSubmissionRaw": 47006}, "2122": {"acRate": 39.580584186311924, "difficulty": "Hard", "likes": 373, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2122", "paidOnly": false, "title": "Recover the Original Array", "titleSlug": "recover-the-original-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11098, "totalSubmissionRaw": 28039}, "2123": {"acRate": 40.57971014492754, "difficulty": "Hard", "likes": 52, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2123", "paidOnly": true, "title": "Minimum Operations to Remove Adjacent Ones in Matrix", "titleSlug": "minimum-operations-to-remove-adjacent-ones-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 924, "totalSubmissionRaw": 2277}, "2124": {"acRate": 72.16611476750043, "difficulty": "Easy", "likes": 740, "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": 87390, "totalSubmissionRaw": 121096}, "2125": {"acRate": 85.58193212036107, "difficulty": "Medium", "likes": 1862, "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": 212090, "totalSubmissionRaw": 247821}, "2126": {"acRate": 51.765821543022824, "difficulty": "Medium", "likes": 559, "dislikes": 190, "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": 47491, "totalSubmissionRaw": 91742}, "2127": {"acRate": 37.38091349556318, "difficulty": "Hard", "likes": 1038, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2127", "paidOnly": false, "title": "Maximum Employees to Be Invited to a Meeting", "titleSlug": "maximum-employees-to-be-invited-to-a-meeting", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13732, "totalSubmissionRaw": 36737}, "2128": {"acRate": 76.21332726859222, "difficulty": "Medium", "likes": 475, "dislikes": 185, "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": 33511, "totalSubmissionRaw": 43970}, "2129": {"acRate": 64.85073974412528, "difficulty": "Easy", "likes": 736, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2129", "paidOnly": false, "title": "Capitalize the Title", "titleSlug": "capitalize-the-title", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66758, "totalSubmissionRaw": 102941}, "2130": {"acRate": 81.01064088734701, "difficulty": "Medium", "likes": 3542, "dislikes": 103, "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": 316174, "totalSubmissionRaw": 390287}, "2131": {"acRate": 47.98992375161173, "difficulty": "Medium", "likes": 2436, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2131", "paidOnly": false, "title": "Longest Palindrome by Concatenating Two Letter Words", "titleSlug": "longest-palindrome-by-concatenating-two-letter-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120590, "totalSubmissionRaw": 251283}, "2132": {"acRate": 32.50840207760464, "difficulty": "Hard", "likes": 386, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2132", "paidOnly": false, "title": "Stamping the Grid", "titleSlug": "stamping-the-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7448, "totalSubmissionRaw": 22911}, "2133": {"acRate": 51.91042926996429, "difficulty": "Easy", "likes": 970, "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": 78772, "totalSubmissionRaw": 151746}, "2134": {"acRate": 65.50488681825087, "difficulty": "Medium", "likes": 1955, "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": 155222, "totalSubmissionRaw": 236963}, "2135": {"acRate": 43.129087653915015, "difficulty": "Medium", "likes": 693, "dislikes": 160, "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": 35412, "totalSubmissionRaw": 82107}, "2136": {"acRate": 71.81135009069706, "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": 55424, "totalSubmissionRaw": 77180}, "2137": {"acRate": 67.77053455019558, "difficulty": "Medium", "likes": 103, "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": 2599, "totalSubmissionRaw": 3835}, "2138": {"acRate": 67.0018281535649, "difficulty": "Easy", "likes": 465, "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": 49110, "totalSubmissionRaw": 73297}, "2139": {"acRate": 51.02905094278319, "difficulty": "Medium", "likes": 993, "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": 45547, "totalSubmissionRaw": 89257}, "2140": {"acRate": 55.1065867266217, "difficulty": "Medium", "likes": 2339, "dislikes": 60, "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": 105884, "totalSubmissionRaw": 192144}, "2141": {"acRate": 49.996736771688234, "difficulty": "Hard", "likes": 2005, "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": 61285, "totalSubmissionRaw": 122578}, "2142": {"acRate": 48.55662088623996, "difficulty": "Medium", "likes": 107, "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": 9369, "totalSubmissionRaw": 19295}, "2143": {"acRate": 52.05992509363296, "difficulty": "Hard", "likes": 38, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2143", "paidOnly": true, "title": "Choose Numbers From Two Arrays in Range", "titleSlug": "choose-numbers-from-two-arrays-in-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1112, "totalSubmissionRaw": 2136}, "2144": {"acRate": 61.49779012649621, "difficulty": "Easy", "likes": 596, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2144", "paidOnly": false, "title": "Minimum Cost of Buying Candies With Discount", "titleSlug": "minimum-cost-of-buying-candies-with-discount", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52457, "totalSubmissionRaw": 85299}, "2145": {"acRate": 38.906101289917586, "difficulty": "Medium", "likes": 522, "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": 19213, "totalSubmissionRaw": 49383}, "2146": {"acRate": 43.431105412192125, "difficulty": "Medium", "likes": 506, "dislikes": 159, "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": 16258, "totalSubmissionRaw": 37434}, "2147": {"acRate": 49.35758012243428, "difficulty": "Hard", "likes": 1056, "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": 68533, "totalSubmissionRaw": 138850}, "2148": {"acRate": 59.44091686488824, "difficulty": "Easy", "likes": 650, "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": 60474, "totalSubmissionRaw": 101738}, "2149": {"acRate": 84.05346075162521, "difficulty": "Medium", "likes": 3308, "dislikes": 186, "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": 416202, "totalSubmissionRaw": 495162}, "2150": {"acRate": 60.84438677431757, "difficulty": "Medium", "likes": 653, "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": 50642, "totalSubmissionRaw": 83232}, "2151": {"acRate": 50.37804434751, "difficulty": "Hard", "likes": 506, "dislikes": 81, "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": 13859, "totalSubmissionRaw": 27510}, "2152": {"acRate": 43.20134087575948, "difficulty": "Medium", "likes": 71, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2152", "paidOnly": true, "title": "Minimum Number of Lines to Cover Points", "titleSlug": "minimum-number-of-lines-to-cover-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2062, "totalSubmissionRaw": 4773}, "2153": {"acRate": 40.02102220470371, "difficulty": "Hard", "likes": 78, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2153", "paidOnly": true, "title": "The Number of Passengers in Each Bus II", "titleSlug": "the-number-of-passengers-in-each-bus-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3046, "totalSubmissionRaw": 7611}, "2154": {"acRate": 71.3606521895967, "difficulty": "Easy", "likes": 715, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2154", "paidOnly": false, "title": "Keep Multiplying Found Values by Two", "titleSlug": "keep-multiplying-found-values-by-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 98913, "totalSubmissionRaw": 138610}, "2155": {"acRate": 64.38856471180891, "difficulty": "Medium", "likes": 506, "dislikes": 16, "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": 30676, "totalSubmissionRaw": 47642}, "2156": {"acRate": 23.761095967009158, "difficulty": "Hard", "likes": 426, "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": 13598, "totalSubmissionRaw": 57228}, "2157": {"acRate": 26.190732468650772, "difficulty": "Hard", "likes": 476, "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": 9733, "totalSubmissionRaw": 37162}, "2158": {"acRate": 55.297058608860674, "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": 30305, "totalSubmissionRaw": 54804}, "2159": {"acRate": 60.449438202247194, "difficulty": "Medium", "likes": 73, "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": 8070, "totalSubmissionRaw": 13350}, "2160": {"acRate": 86.26016414261073, "difficulty": "Easy", "likes": 1411, "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": 136530, "totalSubmissionRaw": 158277}, "2161": {"acRate": 85.13335203482633, "difficulty": "Medium", "likes": 1109, "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": 81940, "totalSubmissionRaw": 96249}, "2162": {"acRate": 41.27529591447117, "difficulty": "Medium", "likes": 208, "dislikes": 623, "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": 16215, "totalSubmissionRaw": 39285}, "2163": {"acRate": 48.24022219186814, "difficulty": "Hard", "likes": 671, "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": 10595, "totalSubmissionRaw": 21963}, "2164": {"acRate": 62.59426703497319, "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": 65488, "totalSubmissionRaw": 104623}, "2165": {"acRate": 52.339911969331254, "difficulty": "Medium", "likes": 635, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2165", "paidOnly": false, "title": "Smallest Value of the Rearranged Number", "titleSlug": "smallest-value-of-the-rearranged-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36863, "totalSubmissionRaw": 70430}, "2166": {"acRate": 32.64469150613082, "difficulty": "Medium", "likes": 589, "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": 23402, "totalSubmissionRaw": 71687}, "2167": {"acRate": 41.64112161595302, "difficulty": "Hard", "likes": 672, "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": 12905, "totalSubmissionRaw": 30991}, "2168": {"acRate": 60.14304291287387, "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": 2775, "totalSubmissionRaw": 4614}, "2169": {"acRate": 74.54898881568867, "difficulty": "Easy", "likes": 605, "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": 77853, "totalSubmissionRaw": 104432}, "2170": {"acRate": 33.43167180266098, "difficulty": "Medium", "likes": 580, "dislikes": 332, "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": 22891, "totalSubmissionRaw": 68471}, "2171": {"acRate": 43.028805049044756, "difficulty": "Medium", "likes": 872, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2171", "paidOnly": false, "title": "Removing Minimum Number of Magic Beans", "titleSlug": "removing-minimum-number-of-magic-beans", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27680, "totalSubmissionRaw": 64329}, "2172": {"acRate": 49.26802192465136, "difficulty": "Hard", "likes": 513, "dislikes": 30, "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": 14202, "totalSubmissionRaw": 28826}, "2173": {"acRate": 52.893908133347814, "difficulty": "Hard", "likes": 98, "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": 4871, "totalSubmissionRaw": 9209}, "2174": {"acRate": 67.3053892215569, "difficulty": "Medium", "likes": 92, "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": 5058, "totalSubmissionRaw": 7515}, "2175": {"acRate": 60.33125915080527, "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": 6593, "totalSubmissionRaw": 10928}, "2176": {"acRate": 79.65594468513756, "difficulty": "Easy", "likes": 642, "dislikes": 29, "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": 81449, "totalSubmissionRaw": 102251}, "2177": {"acRate": 64.61327677289314, "difficulty": "Medium", "likes": 673, "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": 49046, "totalSubmissionRaw": 75907}, "2178": {"acRate": 59.28232614904566, "difficulty": "Medium", "likes": 786, "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": 47117, "totalSubmissionRaw": 79479}, "2179": {"acRate": 41.55184207954656, "difficulty": "Hard", "likes": 620, "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": 8504, "totalSubmissionRaw": 20466}, "2180": {"acRate": 67.37086755325802, "difficulty": "Easy", "likes": 619, "dislikes": 32, "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": 64641, "totalSubmissionRaw": 95948}, "2181": {"acRate": 89.8200859466192, "difficulty": "Medium", "likes": 2304, "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": 275480, "totalSubmissionRaw": 306702}, "2182": {"acRate": 54.62550917096372, "difficulty": "Medium", "likes": 665, "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": 23200, "totalSubmissionRaw": 42471}, "2183": {"acRate": 29.56533601623382, "difficulty": "Hard", "likes": 847, "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": 17338, "totalSubmissionRaw": 58643}, "2184": {"acRate": 49.09560723514212, "difficulty": "Medium", "likes": 178, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2184", "paidOnly": true, "title": "Number of Ways to Build Sturdy Brick Wall", "titleSlug": "number-of-ways-to-build-sturdy-brick-wall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8360, "totalSubmissionRaw": 17028}, "2185": {"acRate": 78.30662908768001, "difficulty": "Easy", "likes": 699, "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": 101411, "totalSubmissionRaw": 129505}, "2186": {"acRate": 72.74994257965022, "difficulty": "Medium", "likes": 574, "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": 44344, "totalSubmissionRaw": 60954}, "2187": {"acRate": 38.80060196129219, "difficulty": "Medium", "likes": 2810, "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": 118343, "totalSubmissionRaw": 305003}, "2188": {"acRate": 41.91505472568321, "difficulty": "Hard", "likes": 569, "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": 12178, "totalSubmissionRaw": 29054}, "2189": {"acRate": 63.56253383865729, "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": 2348, "totalSubmissionRaw": 3694}, "2190": {"acRate": 59.12953782676972, "difficulty": "Easy", "likes": 371, "dislikes": 238, "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": 38407, "totalSubmissionRaw": 64954}, "2191": {"acRate": 60.22739417456572, "difficulty": "Medium", "likes": 922, "dislikes": 137, "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": 146520, "totalSubmissionRaw": 243278}, "2192": {"acRate": 62.19491738656379, "difficulty": "Medium", "likes": 1614, "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": 133479, "totalSubmissionRaw": 214614}, "2193": {"acRate": 51.25005278939144, "difficulty": "Hard", "likes": 982, "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": 24271, "totalSubmissionRaw": 47358}, "2194": {"acRate": 84.17728013864976, "difficulty": "Easy", "likes": 611, "dislikes": 96, "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": 73826, "totalSubmissionRaw": 87703}, "2195": {"acRate": 25.572589440698014, "difficulty": "Medium", "likes": 754, "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": 33295, "totalSubmissionRaw": 130198}, "2196": {"acRate": 81.7695621154496, "difficulty": "Medium", "likes": 1572, "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": 152432, "totalSubmissionRaw": 186414}, "2197": {"acRate": 39.35201260717434, "difficulty": "Hard", "likes": 428, "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": 14733, "totalSubmissionRaw": 37439}, "2198": {"acRate": 54.99519692603266, "difficulty": "Medium", "likes": 27, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2198", "paidOnly": true, "title": "Number of Single Divisor Triplets", "titleSlug": "number-of-single-divisor-triplets", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1145, "totalSubmissionRaw": 2082}, "2199": {"acRate": 49.51715941167731, "difficulty": "Hard", "likes": 44, "dislikes": 15, "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": 3333, "totalSubmissionRaw": 6731}, "2200": {"acRate": 66.17684763797193, "difficulty": "Easy", "likes": 416, "dislikes": 69, "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": 41297, "totalSubmissionRaw": 62404}, "2201": {"acRate": 56.65200969614973, "difficulty": "Medium", "likes": 214, "dislikes": 198, "categoryTitle": "Algorithms", "frontendQuestionId": "2201", "paidOnly": false, "title": "Count Artifacts That Can Be Extracted", "titleSlug": "count-artifacts-that-can-be-extracted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20099, "totalSubmissionRaw": 35478}, "2202": {"acRate": 23.075549343893158, "difficulty": "Medium", "likes": 618, "dislikes": 322, "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": 29719, "totalSubmissionRaw": 128790}, "2203": {"acRate": 37.17293143147633, "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": 12431, "totalSubmissionRaw": 33441}, "2204": {"acRate": 68.30313656730956, "difficulty": "Hard", "likes": 113, "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": 3506, "totalSubmissionRaw": 5133}, "2205": {"acRate": 50.0859375, "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": 6411, "totalSubmissionRaw": 12800}, "2206": {"acRate": 73.8002806159779, "difficulty": "Easy", "likes": 720, "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": 85736, "totalSubmissionRaw": 116173}, "2207": {"acRate": 34.88554816405636, "difficulty": "Medium", "likes": 502, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2207", "paidOnly": false, "title": "Maximize Number of Subsequences in a String", "titleSlug": "maximize-number-of-subsequences-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19980, "totalSubmissionRaw": 57273}, "2208": {"acRate": 47.06532327241535, "difficulty": "Medium", "likes": 594, "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": 32372, "totalSubmissionRaw": 68781}, "2209": {"acRate": 37.042553812903414, "difficulty": "Hard", "likes": 501, "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": 12683, "totalSubmissionRaw": 34239}, "2210": {"acRate": 61.19432653968031, "difficulty": "Easy", "likes": 692, "dislikes": 93, "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": 52334, "totalSubmissionRaw": 85521}, "2211": {"acRate": 43.96719798782575, "difficulty": "Medium", "likes": 671, "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": 29542, "totalSubmissionRaw": 67191}, "2212": {"acRate": 50.29269373160776, "difficulty": "Medium", "likes": 495, "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": 15894, "totalSubmissionRaw": 31603}, "2213": {"acRate": 32.44684352577184, "difficulty": "Hard", "likes": 300, "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": 4929, "totalSubmissionRaw": 15191}, "2214": {"acRate": 57.630642954856356, "difficulty": "Medium", "likes": 313, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "2214", "paidOnly": true, "title": "Minimum Health to Beat Game", "titleSlug": "minimum-health-to-beat-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31596, "totalSubmissionRaw": 54825}, "2215": {"acRate": 79.40078912829712, "difficulty": "Easy", "likes": 2356, "dislikes": 97, "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": 385973, "totalSubmissionRaw": 486107}, "2216": {"acRate": 48.64014774416021, "difficulty": "Medium", "likes": 795, "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": 33712, "totalSubmissionRaw": 69309}, "2217": {"acRate": 37.31386254218583, "difficulty": "Medium", "likes": 623, "dislikes": 289, "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": 23329, "totalSubmissionRaw": 62521}, "2218": {"acRate": 60.493227183162055, "difficulty": "Hard", "likes": 2319, "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": 68462, "totalSubmissionRaw": 113173}, "2219": {"acRate": 61.992882562277586, "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": 4355, "totalSubmissionRaw": 7025}, "2220": {"acRate": 85.41912444600325, "difficulty": "Easy", "likes": 942, "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": 107160, "totalSubmissionRaw": 125452}, "2221": {"acRate": 78.8711183972245, "difficulty": "Medium", "likes": 1096, "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": 82750, "totalSubmissionRaw": 104918}, "2222": {"acRate": 50.7525385634206, "difficulty": "Medium", "likes": 981, "dislikes": 51, "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": 37936, "totalSubmissionRaw": 74747}, "2223": {"acRate": 40.58318072968024, "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": 8643, "totalSubmissionRaw": 21297}, "2224": {"acRate": 65.34821027407519, "difficulty": "Easy", "likes": 454, "dislikes": 37, "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": 43633, "totalSubmissionRaw": 66769}, "2225": {"acRate": 73.14632592992099, "difficulty": "Medium", "likes": 2156, "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": 254972, "totalSubmissionRaw": 348578}, "2226": {"acRate": 38.377800205298065, "difficulty": "Medium", "likes": 1123, "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": 44491, "totalSubmissionRaw": 115929}, "2227": {"acRate": 40.52907792762556, "difficulty": "Hard", "likes": 334, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "2227", "paidOnly": false, "title": "Encrypt and Decrypt Strings", "titleSlug": "encrypt-and-decrypt-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13283, "totalSubmissionRaw": 32774}, "2228": {"acRate": 44.93020805899394, "difficulty": "Medium", "likes": 63, "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": 8530, "totalSubmissionRaw": 18985}, "2229": {"acRate": 61.31349929164137, "difficulty": "Easy", "likes": 81, "dislikes": 11, "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": 6059, "totalSubmissionRaw": 9882}, "2230": {"acRate": 50.08111031002163, "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": 5557, "totalSubmissionRaw": 11096}, "2231": {"acRate": 62.08251738807482, "difficulty": "Easy", "likes": 618, "dislikes": 298, "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": 45969, "totalSubmissionRaw": 74045}, "2232": {"acRate": 67.76569404832796, "difficulty": "Medium", "likes": 206, "dislikes": 333, "categoryTitle": "Algorithms", "frontendQuestionId": "2232", "paidOnly": false, "title": "Minimize Result by Adding Parentheses to Expression", "titleSlug": "minimize-result-by-adding-parentheses-to-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21622, "totalSubmissionRaw": 31907}, "2233": {"acRate": 41.77144901963204, "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": 33852, "totalSubmissionRaw": 81041}, "2234": {"acRate": 29.680708132458705, "difficulty": "Hard", "likes": 433, "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": 7511, "totalSubmissionRaw": 25306}, "2235": {"acRate": 87.96830682154602, "difficulty": "Easy", "likes": 1650, "dislikes": 3120, "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": 552678, "totalSubmissionRaw": 628270}, "2236": {"acRate": 84.6619829872232, "difficulty": "Easy", "likes": 1277, "dislikes": 1538, "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": 245832, "totalSubmissionRaw": 290369}, "2237": {"acRate": 63.49634193299961, "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": 3298, "totalSubmissionRaw": 5194}, "2238": {"acRate": 71.51203348447855, "difficulty": "Medium", "likes": 68, "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": 8201, "totalSubmissionRaw": 11468}, "2239": {"acRate": 46.041761212529345, "difficulty": "Easy", "likes": 593, "dislikes": 43, "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": 94352, "totalSubmissionRaw": 204927}, "2240": {"acRate": 57.256591486658195, "difficulty": "Medium", "likes": 450, "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": 28839, "totalSubmissionRaw": 50368}, "2241": {"acRate": 42.264906555918124, "difficulty": "Medium", "likes": 262, "dislikes": 348, "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": 22796, "totalSubmissionRaw": 53936}, "2242": {"acRate": 38.79536101758324, "difficulty": "Hard", "likes": 522, "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": 12444, "totalSubmissionRaw": 32076}, "2243": {"acRate": 66.29077728554168, "difficulty": "Easy", "likes": 548, "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": 41150, "totalSubmissionRaw": 62075}, "2244": {"acRate": 62.89829410848519, "difficulty": "Medium", "likes": 2775, "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": 153458, "totalSubmissionRaw": 243978}, "2245": {"acRate": 36.465087556790614, "difficulty": "Medium", "likes": 187, "dislikes": 401, "categoryTitle": "Algorithms", "frontendQuestionId": "2245", "paidOnly": false, "title": "Maximum Trailing Zeros in a Cornered Path", "titleSlug": "maximum-trailing-zeros-in-a-cornered-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8267, "totalSubmissionRaw": 22670}, "2246": {"acRate": 54.3603817931667, "difficulty": "Hard", "likes": 2382, "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": 75861, "totalSubmissionRaw": 139552}, "2247": {"acRate": 50.06751282743721, "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": 1854, "totalSubmissionRaw": 3703}, "2248": {"acRate": 68.3085863858031, "difficulty": "Easy", "likes": 717, "dislikes": 42, "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": 87685, "totalSubmissionRaw": 128366}, "2249": {"acRate": 53.43852149861705, "difficulty": "Medium", "likes": 236, "dislikes": 221, "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": 25503, "totalSubmissionRaw": 47724}, "2250": {"acRate": 35.29219985328878, "difficulty": "Medium", "likes": 506, "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": 17320, "totalSubmissionRaw": 49076}, "2251": {"acRate": 56.773641127513095, "difficulty": "Hard", "likes": 1657, "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": 82881, "totalSubmissionRaw": 145985}, "2252": {"acRate": 55.71329639889196, "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": 1609, "totalSubmissionRaw": 2888}, "2253": {"acRate": 66.82758620689656, "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": 969, "totalSubmissionRaw": 1450}, "2254": {"acRate": 64.24630717209467, "difficulty": "Hard", "likes": 81, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2254", "paidOnly": true, "title": "Design Video Sharing Platform", "titleSlug": "design-video-sharing-platform", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3610, "totalSubmissionRaw": 5619}, "2255": {"acRate": 72.71451639846318, "difficulty": "Easy", "likes": 540, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2255", "paidOnly": false, "title": "Count Prefixes of a Given String", "titleSlug": "count-prefixes-of-a-given-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65294, "totalSubmissionRaw": 89794}, "2256": {"acRate": 43.248278816742555, "difficulty": "Medium", "likes": 1511, "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": 86814, "totalSubmissionRaw": 200734}, "2257": {"acRate": 52.54024990071182, "difficulty": "Medium", "likes": 420, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2257", "paidOnly": false, "title": "Count Unguarded Cells in the Grid", "titleSlug": "count-unguarded-cells-in-the-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17198, "totalSubmissionRaw": 32733}, "2258": {"acRate": 35.227750105023105, "difficulty": "Hard", "likes": 735, "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": 11740, "totalSubmissionRaw": 33326}, "2259": {"acRate": 45.87285181582361, "difficulty": "Easy", "likes": 834, "dislikes": 55, "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": 90542, "totalSubmissionRaw": 197376}, "2260": {"acRate": 51.5854303684207, "difficulty": "Medium", "likes": 962, "dislikes": 38, "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": 78984, "totalSubmissionRaw": 153113}, "2261": {"acRate": 52.21163835359876, "difficulty": "Medium", "likes": 671, "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": 35683, "totalSubmissionRaw": 68343}, "2262": {"acRate": 55.76699153015488, "difficulty": "Hard", "likes": 1117, "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": 34962, "totalSubmissionRaw": 62693}, "2263": {"acRate": 65.90344337948171, "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": 3713, "totalSubmissionRaw": 5634}, "2264": {"acRate": 69.02385739606758, "difficulty": "Easy", "likes": 1004, "dislikes": 50, "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": 150706, "totalSubmissionRaw": 218339}, "2265": {"acRate": 86.35287352433785, "difficulty": "Medium", "likes": 2202, "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": 153171, "totalSubmissionRaw": 177378}, "2266": {"acRate": 47.942474406935325, "difficulty": "Medium", "likes": 873, "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": 21402, "totalSubmissionRaw": 44641}, "2267": {"acRate": 38.99973397180101, "difficulty": "Hard", "likes": 517, "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": 16126, "totalSubmissionRaw": 41349}, "2268": {"acRate": 71.32205132999859, "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": 30513, "totalSubmissionRaw": 42782}, "2269": {"acRate": 60.362180745621174, "difficulty": "Easy", "likes": 659, "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": 63032, "totalSubmissionRaw": 104423}, "2270": {"acRate": 48.153572092108284, "difficulty": "Medium", "likes": 571, "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": 44060, "totalSubmissionRaw": 91500}, "2271": {"acRate": 33.94429326076517, "difficulty": "Medium", "likes": 776, "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": 16964, "totalSubmissionRaw": 49976}, "2272": {"acRate": 46.22956512447911, "difficulty": "Hard", "likes": 1850, "dislikes": 206, "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": 69226, "totalSubmissionRaw": 149744}, "2273": {"acRate": 58.478668926430124, "difficulty": "Easy", "likes": 675, "dislikes": 187, "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": 64178, "totalSubmissionRaw": 109746}, "2274": {"acRate": 51.815351885744676, "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": 33124, "totalSubmissionRaw": 63927}, "2275": {"acRate": 72.94450154162384, "difficulty": "Medium", "likes": 564, "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": 28390, "totalSubmissionRaw": 38920}, "2276": {"acRate": 35.3973264017824, "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": 19065, "totalSubmissionRaw": 53860}, "2277": {"acRate": 62.61394432126139, "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": 5083, "totalSubmissionRaw": 8118}, "2278": {"acRate": 74.14032749428789, "difficulty": "Easy", "likes": 520, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2278", "paidOnly": false, "title": "Percentage of Letter in String", "titleSlug": "percentage-of-letter-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77877, "totalSubmissionRaw": 105040}, "2279": {"acRate": 67.53777592089688, "difficulty": "Medium", "likes": 1673, "dislikes": 71, "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": 96991, "totalSubmissionRaw": 143610}, "2280": {"acRate": 25.445772232065444, "difficulty": "Medium", "likes": 341, "dislikes": 524, "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": 27000, "totalSubmissionRaw": 106108}, "2281": {"acRate": 28.05915582005855, "difficulty": "Hard", "likes": 1188, "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": 20415, "totalSubmissionRaw": 72757}, "2282": {"acRate": 48.60406091370558, "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": 1915, "totalSubmissionRaw": 3940}, "2283": {"acRate": 72.44295478130182, "difficulty": "Easy", "likes": 601, "dislikes": 79, "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": 60734, "totalSubmissionRaw": 83837}, "2284": {"acRate": 57.13241386032458, "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": 35169, "totalSubmissionRaw": 61557}, "2285": {"acRate": 69.31732137259158, "difficulty": "Medium", "likes": 1271, "dislikes": 77, "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": 143726, "totalSubmissionRaw": 207345}, "2286": {"acRate": 18.027022954442714, "difficulty": "Hard", "likes": 333, "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": 7178, "totalSubmissionRaw": 39818}, "2287": {"acRate": 59.389612207755846, "difficulty": "Easy", "likes": 473, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2287", "paidOnly": false, "title": "Rearrange Characters to Make Target String", "titleSlug": "rearrange-characters-to-make-target-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42422, "totalSubmissionRaw": 71430}, "2288": {"acRate": 31.248431303649415, "difficulty": "Medium", "likes": 202, "dislikes": 1102, "categoryTitle": "Algorithms", "frontendQuestionId": "2288", "paidOnly": false, "title": "Apply Discount to Prices", "titleSlug": "apply-discount-to-prices", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24900, "totalSubmissionRaw": 79684}, "2289": {"acRate": 22.19096994227584, "difficulty": "Medium", "likes": 1338, "dislikes": 137, "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": 22643, "totalSubmissionRaw": 102037}, "2290": {"acRate": 54.78115471623881, "difficulty": "Hard", "likes": 955, "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": 27848, "totalSubmissionRaw": 50835}, "2291": {"acRate": 45.39202200825309, "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": 9570, "totalSubmissionRaw": 21083}, "2292": {"acRate": 39.35197561888467, "difficulty": "Medium", "likes": 61, "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": 7360, "totalSubmissionRaw": 18703}, "2293": {"acRate": 63.301623955222006, "difficulty": "Easy", "likes": 535, "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": 50440, "totalSubmissionRaw": 79682}, "2294": {"acRate": 73.9267992140407, "difficulty": "Medium", "likes": 771, "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": 44394, "totalSubmissionRaw": 60052}, "2295": {"acRate": 57.95307825539285, "difficulty": "Medium", "likes": 635, "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": 36806, "totalSubmissionRaw": 63509}, "2296": {"acRate": 45.494347053962336, "difficulty": "Hard", "likes": 572, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "2296", "paidOnly": false, "title": "Design a Text Editor", "titleSlug": "design-a-text-editor", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25874, "totalSubmissionRaw": 56873}, "2297": {"acRate": 45.797988631394844, "difficulty": "Medium", "likes": 147, "dislikes": 42, "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": 5237, "totalSubmissionRaw": 11435}, "2298": {"acRate": 81.53153153153153, "difficulty": "Medium", "likes": 49, "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": 6516, "totalSubmissionRaw": 7992}, "2299": {"acRate": 54.91636783108057, "difficulty": "Easy", "likes": 348, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2299", "paidOnly": false, "title": "Strong Password Checker II", "titleSlug": "strong-password-checker-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43798, "totalSubmissionRaw": 79754}, "2300": {"acRate": 43.627796021899776, "difficulty": "Medium", "likes": 2587, "dislikes": 80, "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": 170449, "totalSubmissionRaw": 390689}, "2301": {"acRate": 41.18289812843214, "difficulty": "Hard", "likes": 380, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "2301", "paidOnly": false, "title": "Match Substring After Replacement", "titleSlug": "match-substring-after-replacement", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14699, "totalSubmissionRaw": 35692}, "2302": {"acRate": 55.144068232911735, "difficulty": "Hard", "likes": 1048, "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": 32132, "totalSubmissionRaw": 58270}, "2303": {"acRate": 65.94071185432433, "difficulty": "Easy", "likes": 264, "dislikes": 281, "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": 39906, "totalSubmissionRaw": 60518}, "2304": {"acRate": 66.93403141361256, "difficulty": "Medium", "likes": 891, "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": 31961, "totalSubmissionRaw": 47750}, "2305": {"acRate": 69.24723660277039, "difficulty": "Medium", "likes": 2570, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2305", "paidOnly": false, "title": "Fair Distribution of Cookies", "titleSlug": "fair-distribution-of-cookies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98982, "totalSubmissionRaw": 142940}, "2306": {"acRate": 46.409965167348176, "difficulty": "Hard", "likes": 1947, "dislikes": 72, "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": 61289, "totalSubmissionRaw": 132060}, "2307": {"acRate": 43.29231144145242, "difficulty": "Hard", "likes": 60, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2307", "paidOnly": true, "title": "Check for Contradictions in Equations", "titleSlug": "check-for-contradictions-in-equations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3553, "totalSubmissionRaw": 8207}, "2308": {"acRate": 69.3757760469579, "difficulty": "Medium", "likes": 79, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "2308", "paidOnly": true, "title": "Arrange Table by Gender", "titleSlug": "arrange-table-by-gender", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6146, "totalSubmissionRaw": 8859}, "2309": {"acRate": 70.23529120075372, "difficulty": "Easy", "likes": 482, "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": 56656, "totalSubmissionRaw": 80666}, "2310": {"acRate": 26.90310561468181, "difficulty": "Medium", "likes": 406, "dislikes": 328, "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": 27149, "totalSubmissionRaw": 100914}, "2311": {"acRate": 38.0659642540076, "difficulty": "Medium", "likes": 686, "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": 22725, "totalSubmissionRaw": 59699}, "2312": {"acRate": 50.22075055187638, "difficulty": "Hard", "likes": 546, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2312", "paidOnly": false, "title": "Selling Pieces of Wood", "titleSlug": "selling-pieces-of-wood", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11375, "totalSubmissionRaw": 22650}, "2313": {"acRate": 58.6435070306038, "difficulty": "Hard", "likes": 100, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2313", "paidOnly": true, "title": "Minimum Flips in Binary Tree to Get Result", "titleSlug": "minimum-flips-in-binary-tree-to-get-result", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3545, "totalSubmissionRaw": 6045}, "2314": {"acRate": 71.9741337237677, "difficulty": "Medium", "likes": 53, "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": 5899, "totalSubmissionRaw": 8196}, "2315": {"acRate": 82.49449153922133, "difficulty": "Easy", "likes": 629, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "2315", "paidOnly": false, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76002, "totalSubmissionRaw": 92130}, "2316": {"acRate": 49.21048381635087, "difficulty": "Medium", "likes": 2051, "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": 94461, "totalSubmissionRaw": 191953}, "2317": {"acRate": 79.59605791458814, "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": 26168, "totalSubmissionRaw": 32876}, "2318": {"acRate": 57.39536773669241, "difficulty": "Hard", "likes": 439, "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": 11300, "totalSubmissionRaw": 19688}, "2319": {"acRate": 65.26914003860176, "difficulty": "Easy", "likes": 494, "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": 54783, "totalSubmissionRaw": 83934}, "2320": {"acRate": 42.08163021750156, "difficulty": "Medium", "likes": 583, "dislikes": 194, "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": 28209, "totalSubmissionRaw": 67034}, "2321": {"acRate": 56.974345564949594, "difficulty": "Hard", "likes": 793, "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": 19610, "totalSubmissionRaw": 34419}, "2322": {"acRate": 52.492749620218206, "difficulty": "Hard", "likes": 453, "dislikes": 18, "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": 7602, "totalSubmissionRaw": 14482}, "2323": {"acRate": 65.91497790644523, "difficulty": "Medium", "likes": 63, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2323", "paidOnly": true, "title": "Find Minimum Time to Finish All Jobs II", "titleSlug": "find-minimum-time-to-finish-all-jobs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8652, "totalSubmissionRaw": 13126}, "2324": {"acRate": 74.44486983154671, "difficulty": "Medium", "likes": 49, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2324", "paidOnly": true, "title": "Product Sales Analysis IV", "titleSlug": "product-sales-analysis-iv", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7778, "totalSubmissionRaw": 10448}, "2325": {"acRate": 84.68005640458858, "difficulty": "Easy", "likes": 998, "dislikes": 102, "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": 111095, "totalSubmissionRaw": 131194}, "2326": {"acRate": 75.87582493351283, "difficulty": "Medium", "likes": 771, "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": 46219, "totalSubmissionRaw": 60914}, "2327": {"acRate": 46.03364720190164, "difficulty": "Medium", "likes": 850, "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": 24982, "totalSubmissionRaw": 54269}, "2328": {"acRate": 58.17795019396822, "difficulty": "Hard", "likes": 1988, "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": 69734, "totalSubmissionRaw": 119864}, "2329": {"acRate": 69.81754836343632, "difficulty": "Easy", "likes": 32, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "2329", "paidOnly": true, "title": "Product Sales Analysis V", "titleSlug": "product-sales-analysis-v", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7615, "totalSubmissionRaw": 10907}, "2330": {"acRate": 76.12008972220625, "difficulty": "Medium", "likes": 103, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2330", "paidOnly": true, "title": "Valid Palindrome IV", "titleSlug": "valid-palindrome-iv", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13234, "totalSubmissionRaw": 17381}, "2331": {"acRate": 82.76064522764673, "difficulty": "Easy", "likes": 1438, "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": 193117, "totalSubmissionRaw": 233344}, "2332": {"acRate": 27.524786843989325, "difficulty": "Medium", "likes": 461, "dislikes": 745, "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": 25374, "totalSubmissionRaw": 92186}, "2333": {"acRate": 25.577972118798165, "difficulty": "Medium", "likes": 628, "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": 14770, "totalSubmissionRaw": 57745}, "2334": {"acRate": 43.433596318211706, "difficulty": "Hard", "likes": 552, "dislikes": 9, "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": 10570, "totalSubmissionRaw": 24336}, "2335": {"acRate": 58.0038038341715, "difficulty": "Easy", "likes": 693, "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": 49711, "totalSubmissionRaw": 85703}, "2336": {"acRate": 71.60569841277302, "difficulty": "Medium", "likes": 1679, "dislikes": 196, "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": 152349, "totalSubmissionRaw": 212761}, "2337": {"acRate": 47.664261298898595, "difficulty": "Medium", "likes": 658, "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": 26355, "totalSubmissionRaw": 55293}, "2338": {"acRate": 26.964593221050865, "difficulty": "Hard", "likes": 485, "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": 6420, "totalSubmissionRaw": 23809}, "2339": {"acRate": 87.7633111040542, "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": 8291, "totalSubmissionRaw": 9447}, "2340": {"acRate": 72.61418123163268, "difficulty": "Medium", "likes": 180, "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": 32863, "totalSubmissionRaw": 45257}, "2341": {"acRate": 75.40530101364399, "difficulty": "Easy", "likes": 682, "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": 72233, "totalSubmissionRaw": 95793}, "2342": {"acRate": 55.26576755255851, "difficulty": "Medium", "likes": 703, "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": 50157, "totalSubmissionRaw": 90756}, "2343": {"acRate": 44.36865986532182, "difficulty": "Medium", "likes": 311, "dislikes": 431, "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": 30704, "totalSubmissionRaw": 69202}, "2344": {"acRate": 56.325389532951455, "difficulty": "Hard", "likes": 547, "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": 28811, "totalSubmissionRaw": 51151}, "2345": {"acRate": 37.75034639123315, "difficulty": "Medium", "likes": 157, "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": 8991, "totalSubmissionRaw": 23817}, "2346": {"acRate": 33.624891500300464, "difficulty": "Medium", "likes": 27, "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": 5036, "totalSubmissionRaw": 14977}, "2347": {"acRate": 60.7750284414107, "difficulty": "Easy", "likes": 371, "dislikes": 38, "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": 42737, "totalSubmissionRaw": 70320}, "2348": {"acRate": 66.77062630057652, "difficulty": "Medium", "likes": 2260, "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": 128669, "totalSubmissionRaw": 192703}, "2349": {"acRate": 44.85968954186653, "difficulty": "Medium", "likes": 398, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2349", "paidOnly": false, "title": "Design a Number Container System", "titleSlug": "design-a-number-container-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23755, "totalSubmissionRaw": 52954}, "2350": {"acRate": 68.70435129033686, "difficulty": "Hard", "likes": 644, "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": 15521, "totalSubmissionRaw": 22591}, "2351": {"acRate": 73.6928207028244, "difficulty": "Easy", "likes": 1043, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2351", "paidOnly": false, "title": "First Letter to Appear Twice", "titleSlug": "first-letter-to-appear-twice", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 129283, "totalSubmissionRaw": 175435}, "2352": {"acRate": 70.40267834387525, "difficulty": "Medium", "likes": 2231, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "2352", "paidOnly": false, "title": "Equal Row and Column Pairs", "titleSlug": "equal-row-and-column-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 243092, "totalSubmissionRaw": 345287}, "2353": {"acRate": 45.23793064942385, "difficulty": "Medium", "likes": 1493, "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": 85074, "totalSubmissionRaw": 188059}, "2354": {"acRate": 47.64181498503964, "difficulty": "Hard", "likes": 591, "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": 15445, "totalSubmissionRaw": 32419}, "2355": {"acRate": 40.14024649383766, "difficulty": "Hard", "likes": 284, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2355", "paidOnly": true, "title": "Maximum Number of Books You Can Take", "titleSlug": "maximum-number-of-books-you-can-take", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11334, "totalSubmissionRaw": 28236}, "2356": {"acRate": 88.66708238179993, "difficulty": "Easy", "likes": 472, "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": 214710, "totalSubmissionRaw": 242153}, "2357": {"acRate": 72.48704502435845, "difficulty": "Easy", "likes": 1181, "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": 116801, "totalSubmissionRaw": 161134}, "2358": {"acRate": 68.11629826009094, "difficulty": "Medium", "likes": 674, "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": 38797, "totalSubmissionRaw": 56957}, "2359": {"acRate": 45.535329382619544, "difficulty": "Medium", "likes": 1685, "dislikes": 405, "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": 79221, "totalSubmissionRaw": 173977}, "2360": {"acRate": 49.77809087706939, "difficulty": "Hard", "likes": 2339, "dislikes": 48, "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": 77726, "totalSubmissionRaw": 156145}, "2361": {"acRate": 78.16239605165303, "difficulty": "Hard", "likes": 185, "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": 11561, "totalSubmissionRaw": 14791}, "2362": {"acRate": 74.78157267672756, "difficulty": "Hard", "likes": 32, "dislikes": 29, "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": 3766, "totalSubmissionRaw": 5036}, "2363": {"acRate": 75.77081418625438, "difficulty": "Easy", "likes": 559, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2363", "paidOnly": false, "title": "Merge Similar Items", "titleSlug": "merge-similar-items", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60184, "totalSubmissionRaw": 79429}, "2364": {"acRate": 41.83591494489494, "difficulty": "Medium", "likes": 988, "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"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33329, "totalSubmissionRaw": 79666}, "2365": {"acRate": 52.74347671330395, "difficulty": "Medium", "likes": 559, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2365", "paidOnly": false, "title": "Task Scheduler II", "titleSlug": "task-scheduler-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38527, "totalSubmissionRaw": 73046}, "2366": {"acRate": 53.48626262144034, "difficulty": "Hard", "likes": 2004, "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": 67221, "totalSubmissionRaw": 125679}, "2367": {"acRate": 84.46685985118243, "difficulty": "Easy", "likes": 1265, "dislikes": 84, "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": 137583, "totalSubmissionRaw": 162884}, "2368": {"acRate": 59.00529100529101, "difficulty": "Medium", "likes": 710, "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": 58548, "totalSubmissionRaw": 99225}, "2369": {"acRate": 51.87782253851423, "difficulty": "Medium", "likes": 1998, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "2369", "paidOnly": false, "title": "Check if There is a Valid Partition For The Array", "titleSlug": "check-if-there-is-a-valid-partition-for-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89372, "totalSubmissionRaw": 172274}, "2370": {"acRate": 47.28723862857237, "difficulty": "Medium", "likes": 1456, "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": 115178, "totalSubmissionRaw": 243571}, "2371": {"acRate": 66.42934196332254, "difficulty": "Hard", "likes": 100, "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": 3079, "totalSubmissionRaw": 4635}, "2372": {"acRate": 83.19302909466843, "difficulty": "Medium", "likes": 37, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2372", "paidOnly": true, "title": "Calculate the Influence of Each Salesperson", "titleSlug": "calculate-the-influence-of-each-salesperson", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5633, "totalSubmissionRaw": 6771}, "2373": {"acRate": 87.92577515793926, "difficulty": "Easy", "likes": 1221, "dislikes": 162, "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": 166316, "totalSubmissionRaw": 189155}, "2374": {"acRate": 47.85822592873389, "difficulty": "Medium", "likes": 445, "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": 35350, "totalSubmissionRaw": 73864}, "2375": {"acRate": 76.24518571708336, "difficulty": "Medium", "likes": 942, "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": 35040, "totalSubmissionRaw": 45957}, "2376": {"acRate": 39.03151808440436, "difficulty": "Hard", "likes": 573, "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": 12421, "totalSubmissionRaw": 31823}, "2377": {"acRate": 78.97219463753724, "difficulty": "Easy", "likes": 38, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2377", "paidOnly": true, "title": "Sort the Olympic Table", "titleSlug": "sort-the-olympic-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6362, "totalSubmissionRaw": 8056}, "2378": {"acRate": 58.12883435582822, "difficulty": "Medium", "likes": 54, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2378", "paidOnly": true, "title": "Choose Edges to Maximize Score in a Tree", "titleSlug": "choose-edges-to-maximize-score-in-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1516, "totalSubmissionRaw": 2608}, "2379": {"acRate": 59.24412030168792, "difficulty": "Easy", "likes": 736, "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": 57103, "totalSubmissionRaw": 96385}, "2380": {"acRate": 50.80822980185824, "difficulty": "Medium", "likes": 503, "dislikes": 111, "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": 33412, "totalSubmissionRaw": 65761}, "2381": {"acRate": 37.86238154099711, "difficulty": "Medium", "likes": 761, "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": 22973, "totalSubmissionRaw": 60675}, "2382": {"acRate": 49.34928631402183, "difficulty": "Hard", "likes": 465, "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": 9404, "totalSubmissionRaw": 19056}, "2383": {"acRate": 41.37660786704153, "difficulty": "Easy", "likes": 346, "dislikes": 280, "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": 33261, "totalSubmissionRaw": 80386}, "2384": {"acRate": 35.49203926601685, "difficulty": "Medium", "likes": 612, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "2384", "paidOnly": false, "title": "Largest Palindromic Number", "titleSlug": "largest-palindromic-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40928, "totalSubmissionRaw": 115316}, "2385": {"acRate": 62.74878023096634, "difficulty": "Medium", "likes": 2733, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2385", "paidOnly": false, "title": "Amount of Time for Binary Tree to Be Infected", "titleSlug": "amount-of-time-for-binary-tree-to-be-infected", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143012, "totalSubmissionRaw": 227912}, "2386": {"acRate": 39.20766180069192, "difficulty": "Hard", "likes": 567, "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": 9293, "totalSubmissionRaw": 23702}, "2387": {"acRate": 69.86027944111777, "difficulty": "Medium", "likes": 77, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2387", "paidOnly": true, "title": "Median of a Row Wise Sorted Matrix", "titleSlug": "median-of-a-row-wise-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3500, "totalSubmissionRaw": 5010}, "2388": {"acRate": 50.588627276765884, "difficulty": "Medium", "likes": 85, "dislikes": 29, "categoryTitle": "Database", "frontendQuestionId": "2388", "paidOnly": true, "title": "Change Null Values in a Table to the Previous Value", "titleSlug": "change-null-values-in-a-table-to-the-previous-value", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4555, "totalSubmissionRaw": 9004}, "2389": {"acRate": 71.97403121883164, "difficulty": "Easy", "likes": 1905, "dislikes": 173, "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": 117625, "totalSubmissionRaw": 163427}, "2390": {"acRate": 76.11358705526521, "difficulty": "Medium", "likes": 2927, "dislikes": 210, "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": 356086, "totalSubmissionRaw": 467835}, "2391": {"acRate": 85.20809651508205, "difficulty": "Medium", "likes": 1535, "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": 135676, "totalSubmissionRaw": 159229}, "2392": {"acRate": 79.5682817857514, "difficulty": "Hard", "likes": 1357, "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": 91895, "totalSubmissionRaw": 115492}, "2393": {"acRate": 74.83935298027919, "difficulty": "Medium", "likes": 133, "dislikes": 2, "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": 6755, "totalSubmissionRaw": 9026}, "2394": {"acRate": 40.73944278955668, "difficulty": "Medium", "likes": 28, "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": 4650, "totalSubmissionRaw": 11414}, "2395": {"acRate": 65.30798216880525, "difficulty": "Easy", "likes": 541, "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": 53034, "totalSubmissionRaw": 81206}, "2396": {"acRate": 87.86360258803487, "difficulty": "Medium", "likes": 635, "dislikes": 1582, "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": 96960, "totalSubmissionRaw": 110353}, "2397": {"acRate": 55.85652574180299, "difficulty": "Medium", "likes": 266, "dislikes": 414, "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": 15775, "totalSubmissionRaw": 28242}, "2398": {"acRate": 34.857439250573705, "difficulty": "Hard", "likes": 804, "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": 22177, "totalSubmissionRaw": 63622}, "2399": {"acRate": 70.80597014925372, "difficulty": "Easy", "likes": 486, "dislikes": 60, "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": 50998, "totalSubmissionRaw": 72025}, "2400": {"acRate": 35.34341329313174, "difficulty": "Medium", "likes": 794, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2400", "paidOnly": false, "title": "Number of Ways to Reach a Position After Exactly k Steps", "titleSlug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31884, "totalSubmissionRaw": 90212}, "2401": {"acRate": 51.63518149540831, "difficulty": "Medium", "likes": 1312, "dislikes": 31, "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": 34467, "totalSubmissionRaw": 66751}, "2402": {"acRate": 44.18163369220005, "difficulty": "Hard", "likes": 1720, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "2402", "paidOnly": false, "title": "Meeting Rooms III", "titleSlug": "meeting-rooms-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120611, "totalSubmissionRaw": 272989}, "2403": {"acRate": 55.97283260087894, "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": 1401, "totalSubmissionRaw": 2503}, "2404": {"acRate": 50.77255474452554, "difficulty": "Easy", "likes": 979, "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": 86948, "totalSubmissionRaw": 171250}, "2405": {"acRate": 78.03371600265925, "difficulty": "Medium", "likes": 2637, "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": 210103, "totalSubmissionRaw": 269247}, "2406": {"acRate": 47.43655341792878, "difficulty": "Medium", "likes": 783, "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": 27813, "totalSubmissionRaw": 58632}, "2407": {"acRate": 24.337597587735665, "difficulty": "Hard", "likes": 887, "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": 16304, "totalSubmissionRaw": 66991}, "2408": {"acRate": 78.37837837837837, "difficulty": "Medium", "likes": 52, "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": 7511, "totalSubmissionRaw": 9583}, "2409": {"acRate": 45.37392000915489, "difficulty": "Easy", "likes": 253, "dislikes": 585, "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": 23790, "totalSubmissionRaw": 52431}, "2410": {"acRate": 63.71628271639948, "difficulty": "Medium", "likes": 507, "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": 38196, "totalSubmissionRaw": 59947}, "2411": {"acRate": 44.435604177026356, "difficulty": "Medium", "likes": 569, "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": 13404, "totalSubmissionRaw": 30165}, "2412": {"acRate": 40.62615237111881, "difficulty": "Hard", "likes": 400, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2412", "paidOnly": false, "title": "Minimum Money Required Before Transactions", "titleSlug": "minimum-money-required-before-transactions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11017, "totalSubmissionRaw": 27118}, "2413": {"acRate": 87.88378739165586, "difficulty": "Easy", "likes": 907, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "2413", "paidOnly": false, "title": "Smallest Even Multiple", "titleSlug": "smallest-even-multiple", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 186970, "totalSubmissionRaw": 212747}, "2414": {"acRate": 58.73741323687555, "difficulty": "Medium", "likes": 509, "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": 48066, "totalSubmissionRaw": 81832}, "2415": {"acRate": 78.23792750185946, "difficulty": "Medium", "likes": 1134, "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": 55750, "totalSubmissionRaw": 71257}, "2416": {"acRate": 46.327440483362885, "difficulty": "Hard", "likes": 671, "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": 26913, "totalSubmissionRaw": 58093}, "2417": {"acRate": 45.16258530710558, "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": 1125, "totalSubmissionRaw": 2491}, "2418": {"acRate": 84.9688181452005, "difficulty": "Easy", "likes": 1724, "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": 305875, "totalSubmissionRaw": 359985}, "2419": {"acRate": 49.70498930370575, "difficulty": "Medium", "likes": 463, "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": 28811, "totalSubmissionRaw": 57964}, "2420": {"acRate": 38.95953757225434, "difficulty": "Medium", "likes": 629, "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": 24601, "totalSubmissionRaw": 63145}, "2421": {"acRate": 56.31449922897473, "difficulty": "Hard", "likes": 2247, "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": 56970, "totalSubmissionRaw": 101163}, "2422": {"acRate": 69.04595538833647, "difficulty": "Medium", "likes": 135, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2422", "paidOnly": true, "title": "Merge Operations to Turn Array Into a Palindrome", "titleSlug": "merge-operations-to-turn-array-into-a-palindrome", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12846, "totalSubmissionRaw": 18605}, "2423": {"acRate": 17.436191168047387, "difficulty": "Easy", "likes": 682, "dislikes": 1230, "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": 49924, "totalSubmissionRaw": 286324}, "2424": {"acRate": 55.62017472572125, "difficulty": "Medium", "likes": 360, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2424", "paidOnly": false, "title": "Longest Uploaded Prefix", "titleSlug": "longest-uploaded-prefix", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21901, "totalSubmissionRaw": 39376}, "2425": {"acRate": 58.21107826183969, "difficulty": "Medium", "likes": 406, "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": 20871, "totalSubmissionRaw": 35854}, "2426": {"acRate": 44.31679217352127, "difficulty": "Hard", "likes": 534, "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": 13771, "totalSubmissionRaw": 31074}, "2427": {"acRate": 79.1735285920596, "difficulty": "Easy", "likes": 582, "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": 93747, "totalSubmissionRaw": 118407}, "2428": {"acRate": 74.97245719194069, "difficulty": "Medium", "likes": 453, "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": 40150, "totalSubmissionRaw": 53553}, "2429": {"acRate": 44.372472814352456, "difficulty": "Medium", "likes": 481, "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": 22606, "totalSubmissionRaw": 50946}, "2430": {"acRate": 33.66570198691603, "difficulty": "Hard", "likes": 483, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2430", "paidOnly": false, "title": "Maximum Deletions on a String", "titleSlug": "maximum-deletions-on-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13843, "totalSubmissionRaw": 41119}, "2431": {"acRate": 63.83881230116649, "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": 2408, "totalSubmissionRaw": 3772}, "2432": {"acRate": 50.37617159589224, "difficulty": "Easy", "likes": 276, "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": 35956, "totalSubmissionRaw": 71375}, "2433": {"acRate": 88.03521842968313, "difficulty": "Medium", "likes": 1391, "dislikes": 86, "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": 154080, "totalSubmissionRaw": 175021}, "2434": {"acRate": 40.148683531233864, "difficulty": "Medium", "likes": 652, "dislikes": 194, "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": 19442, "totalSubmissionRaw": 48424}, "2435": {"acRate": 43.16520797617974, "difficulty": "Hard", "likes": 899, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2435", "paidOnly": false, "title": "Paths in Matrix Whose Sum Is Divisible by K", "titleSlug": "paths-in-matrix-whose-sum-is-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23920, "totalSubmissionRaw": 55415}, "2436": {"acRate": 71.19353873766079, "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": 2380, "totalSubmissionRaw": 3343}, "2437": {"acRate": 46.96549332408531, "difficulty": "Easy", "likes": 287, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "2437", "paidOnly": false, "title": "Number of Valid Clock Times", "titleSlug": "number-of-valid-clock-times", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32502, "totalSubmissionRaw": 69204}, "2438": {"acRate": 40.71993996465661, "difficulty": "Medium", "likes": 294, "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": 16821, "totalSubmissionRaw": 41309}, "2439": {"acRate": 46.45251952995331, "difficulty": "Medium", "likes": 2424, "dislikes": 619, "categoryTitle": "Algorithms", "frontendQuestionId": "2439", "paidOnly": false, "title": "Minimize Maximum of Array", "titleSlug": "minimize-maximum-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83962, "totalSubmissionRaw": 180748}, "2440": {"acRate": 52.99125979505727, "difficulty": "Hard", "likes": 390, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2440", "paidOnly": false, "title": "Create Components With Same Value", "titleSlug": "create-components-with-same-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7033, "totalSubmissionRaw": 13272}, "2441": {"acRate": 75.07261936911718, "difficulty": "Easy", "likes": 998, "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": 227948, "totalSubmissionRaw": 303637}, "2442": {"acRate": 79.74995848456811, "difficulty": "Medium", "likes": 631, "dislikes": 56, "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": 67234, "totalSubmissionRaw": 84306}, "2443": {"acRate": 47.623928557700935, "difficulty": "Medium", "likes": 257, "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": 37170, "totalSubmissionRaw": 78049}, "2444": {"acRate": 67.86338172399253, "difficulty": "Hard", "likes": 3167, "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": 146458, "totalSubmissionRaw": 215813}, "2445": {"acRate": 68.56492027334852, "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": 2107, "totalSubmissionRaw": 3073}, "2446": {"acRate": 51.212494414351575, "difficulty": "Easy", "likes": 460, "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": 46989, "totalSubmissionRaw": 91753}, "2447": {"acRate": 50.37070405615932, "difficulty": "Medium", "likes": 443, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2447", "paidOnly": false, "title": "Number of Subarrays With GCD Equal to K", "titleSlug": "number-of-subarrays-with-gcd-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26836, "totalSubmissionRaw": 53277}, "2448": {"acRate": 46.00967763920125, "difficulty": "Hard", "likes": 2388, "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": 67510, "totalSubmissionRaw": 146730}, "2449": {"acRate": 62.107087646976154, "difficulty": "Hard", "likes": 426, "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": 13258, "totalSubmissionRaw": 21347}, "2450": {"acRate": 63.97553516819572, "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": 1046, "totalSubmissionRaw": 1635}, "2451": {"acRate": 59.42996459046845, "difficulty": "Easy", "likes": 397, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "2451", "paidOnly": false, "title": "Odd String Difference", "titleSlug": "odd-string-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30714, "totalSubmissionRaw": 51681}, "2452": {"acRate": 60.85578868889125, "difficulty": "Medium", "likes": 298, "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": 22855, "totalSubmissionRaw": 37556}, "2453": {"acRate": 39.64726094426201, "difficulty": "Medium", "likes": 567, "dislikes": 25, "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": 18231, "totalSubmissionRaw": 45983}, "2454": {"acRate": 38.979795105293114, "difficulty": "Hard", "likes": 665, "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": 10958, "totalSubmissionRaw": 28112}, "2455": {"acRate": 60.64441771898176, "difficulty": "Easy", "likes": 334, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2455", "paidOnly": false, "title": "Average Value of Even Numbers That Are Divisible by Three", "titleSlug": "average-value-of-even-numbers-that-are-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60511, "totalSubmissionRaw": 99780}, "2456": {"acRate": 43.99736023380786, "difficulty": "Medium", "likes": 273, "dislikes": 366, "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": 23334, "totalSubmissionRaw": 53035}, "2457": {"acRate": 37.742072193252376, "difficulty": "Medium", "likes": 525, "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": 20483, "totalSubmissionRaw": 54271}, "2458": {"acRate": 41.203190277250286, "difficulty": "Hard", "likes": 849, "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": 27122, "totalSubmissionRaw": 65825}, "2459": {"acRate": 45.985932573368906, "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": 1896, "totalSubmissionRaw": 4123}, "2460": {"acRate": 67.90934208945662, "difficulty": "Easy", "likes": 552, "dislikes": 28, "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": 67836, "totalSubmissionRaw": 99892}, "2461": {"acRate": 34.24449506454062, "difficulty": "Medium", "likes": 1331, "dislikes": 25, "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": 64493, "totalSubmissionRaw": 188330}, "2462": {"acRate": 42.91272344900105, "difficulty": "Medium", "likes": 1901, "dislikes": 596, "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": 106106, "totalSubmissionRaw": 247259}, "2463": {"acRate": 40.93890068412362, "difficulty": "Hard", "likes": 469, "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": 8677, "totalSubmissionRaw": 21195}, "2464": {"acRate": 54.60735360871539, "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": 1203, "totalSubmissionRaw": 2203}, "2465": {"acRate": 58.24690363508207, "difficulty": "Easy", "likes": 372, "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": 46276, "totalSubmissionRaw": 79448}, "2466": {"acRate": 54.3921468179521, "difficulty": "Medium", "likes": 1710, "dislikes": 148, "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": 78570, "totalSubmissionRaw": 144451}, "2467": {"acRate": 49.60836473804773, "difficulty": "Medium", "likes": 707, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2467", "paidOnly": false, "title": "Most Profitable Path in a Tree", "titleSlug": "most-profitable-path-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13427, "totalSubmissionRaw": 27066}, "2468": {"acRate": 44.16334732838124, "difficulty": "Hard", "likes": 163, "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": 12307, "totalSubmissionRaw": 27863}, "2469": {"acRate": 89.73152791407453, "difficulty": "Easy", "likes": 623, "dislikes": 338, "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": 199335, "totalSubmissionRaw": 222146}, "2470": {"acRate": 39.10037540980822, "difficulty": "Medium", "likes": 360, "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": 23018, "totalSubmissionRaw": 58869}, "2471": {"acRate": 62.10277028143416, "difficulty": "Medium", "likes": 643, "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": 22552, "totalSubmissionRaw": 36314}, "2472": {"acRate": 40.57733392954738, "difficulty": "Hard", "likes": 460, "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": 16334, "totalSubmissionRaw": 40254}, "2473": {"acRate": 67.77622677977021, "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": 6312, "totalSubmissionRaw": 9313}, "2474": {"acRate": 45.190900625249434, "difficulty": "Hard", "likes": 39, "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": 3397, "totalSubmissionRaw": 7517}, "2475": {"acRate": 71.70679542434945, "difficulty": "Easy", "likes": 406, "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": 44256, "totalSubmissionRaw": 61718}, "2476": {"acRate": 41.597420103400616, "difficulty": "Medium", "likes": 444, "dislikes": 120, "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": 24379, "totalSubmissionRaw": 58607}, "2477": {"acRate": 64.39622370593725, "difficulty": "Medium", "likes": 2206, "dislikes": 89, "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": 71758, "totalSubmissionRaw": 111432}, "2478": {"acRate": 31.203909373611726, "difficulty": "Hard", "likes": 348, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2478", "paidOnly": false, "title": "Number of Beautiful Partitions", "titleSlug": "number-of-beautiful-partitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10536, "totalSubmissionRaw": 33765}, "2479": {"acRate": 49.707602339181285, "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": 680, "totalSubmissionRaw": 1368}, "2480": {"acRate": 76.78629162625283, "difficulty": "Easy", "likes": 28, "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": 4750, "totalSubmissionRaw": 6186}, "2481": {"acRate": 53.54894660506287, "difficulty": "Easy", "likes": 223, "dislikes": 50, "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": 35813, "totalSubmissionRaw": 66879}, "2482": {"acRate": 84.43193698343711, "difficulty": "Medium", "likes": 1177, "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": 128411, "totalSubmissionRaw": 152088}, "2483": {"acRate": 67.36927017906845, "difficulty": "Medium", "likes": 1938, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2483", "paidOnly": false, "title": "Minimum Penalty for a Shop", "titleSlug": "minimum-penalty-for-a-shop", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 109405, "totalSubmissionRaw": 162396}, "2484": {"acRate": 38.294484347472554, "difficulty": "Hard", "likes": 500, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2484", "paidOnly": false, "title": "Count Palindromic Subsequences", "titleSlug": "count-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11303, "totalSubmissionRaw": 29516}, "2485": {"acRate": 83.931417601192, "difficulty": "Easy", "likes": 1287, "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": 234334, "totalSubmissionRaw": 279197}, "2486": {"acRate": 73.00029986851919, "difficulty": "Medium", "likes": 1100, "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": 189884, "totalSubmissionRaw": 260114}, "2487": {"acRate": 74.32644376669954, "difficulty": "Medium", "likes": 2096, "dislikes": 74, "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": 196669, "totalSubmissionRaw": 264602}, "2488": {"acRate": 44.454139327097586, "difficulty": "Hard", "likes": 577, "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": 12737, "totalSubmissionRaw": 28652}, "2489": {"acRate": 56.812204103103625, "difficulty": "Medium", "likes": 47, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2489", "paidOnly": true, "title": "Number of Substrings With Fixed Ratio", "titleSlug": "number-of-substrings-with-fixed-ratio", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1080, "totalSubmissionRaw": 1901}, "2490": {"acRate": 62.87185094073163, "difficulty": "Easy", "likes": 364, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2490", "paidOnly": false, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41403, "totalSubmissionRaw": 65853}, "2491": {"acRate": 60.21249225784935, "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": 37914, "totalSubmissionRaw": 62967}, "2492": {"acRate": 57.4687669744704, "difficulty": "Medium", "likes": 1778, "dislikes": 304, "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": 87814, "totalSubmissionRaw": 152803}, "2493": {"acRate": 39.18888938190531, "difficulty": "Hard", "likes": 420, "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": 8832, "totalSubmissionRaw": 22537}, "2494": {"acRate": 32.043551088777214, "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": 1913, "totalSubmissionRaw": 5970}, "2495": {"acRate": 64.06409819297647, "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": 1879, "totalSubmissionRaw": 2933}, "2496": {"acRate": 72.57703297551934, "difficulty": "Easy", "likes": 398, "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": 46990, "totalSubmissionRaw": 64745}, "2497": {"acRate": 39.67852358981992, "difficulty": "Medium", "likes": 401, "dislikes": 52, "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": 21328, "totalSubmissionRaw": 53752}, "2498": {"acRate": 61.82599884985075, "difficulty": "Medium", "likes": 710, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "2498", "paidOnly": false, "title": "Frog Jump II", "titleSlug": "frog-jump-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22577, "totalSubmissionRaw": 36517}, "2499": {"acRate": 43.255470409011174, "difficulty": "Hard", "likes": 230, "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": 4685, "totalSubmissionRaw": 10830}, "2500": {"acRate": 78.41832782006665, "difficulty": "Easy", "likes": 637, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2500", "paidOnly": false, "title": "Delete Greatest Value in Each Row", "titleSlug": "delete-greatest-value-in-each-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63769, "totalSubmissionRaw": 81319}, "2501": {"acRate": 40.06120296507569, "difficulty": "Medium", "likes": 462, "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": 26968, "totalSubmissionRaw": 67317}, "2502": {"acRate": 53.3283892020172, "difficulty": "Medium", "likes": 287, "dislikes": 87, "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": 17977, "totalSubmissionRaw": 33710}, "2503": {"acRate": 37.899279466728316, "difficulty": "Hard", "likes": 471, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2503", "paidOnly": false, "title": "Maximum Number of Points From Grid Queries", "titleSlug": "maximum-number-of-points-from-grid-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9836, "totalSubmissionRaw": 25953}, "2504": {"acRate": 76.34680134680136, "difficulty": "Easy", "likes": 30, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2504", "paidOnly": true, "title": "Concatenate the Name and the Profession", "titleSlug": "concatenate-the-name-and-the-profession", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4535, "totalSubmissionRaw": 5940}, "2505": {"acRate": 66.88569946394605, "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": 3868, "totalSubmissionRaw": 5783}, "2506": {"acRate": 70.74321725494838, "difficulty": "Easy", "likes": 501, "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": 47821, "totalSubmissionRaw": 67598}, "2507": {"acRate": 49.01410774688557, "difficulty": "Medium", "likes": 390, "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": 23764, "totalSubmissionRaw": 48482}, "2508": {"acRate": 32.65588697754101, "difficulty": "Hard", "likes": 332, "dislikes": 57, "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": 13914, "totalSubmissionRaw": 42602}, "2509": {"acRate": 56.60283304947451, "difficulty": "Hard", "likes": 352, "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": 13626, "totalSubmissionRaw": 24073}, "2510": {"acRate": 50.30004286326618, "difficulty": "Medium", "likes": 94, "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": 4694, "totalSubmissionRaw": 9332}, "2511": {"acRate": 38.68008983681739, "difficulty": "Easy", "likes": 278, "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": 24628, "totalSubmissionRaw": 63671}, "2512": {"acRate": 45.29823816599448, "difficulty": "Medium", "likes": 330, "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": 21340, "totalSubmissionRaw": 47110}, "2513": {"acRate": 30.740224421235457, "difficulty": "Medium", "likes": 479, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2513", "paidOnly": false, "title": "Minimize the Maximum of Two Arrays", "titleSlug": "minimize-the-maximum-of-two-arrays", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13451, "totalSubmissionRaw": 43757}, "2514": {"acRate": 33.78879615993018, "difficulty": "Hard", "likes": 419, "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": 12389, "totalSubmissionRaw": 36666}, "2515": {"acRate": 49.604644017916335, "difficulty": "Easy", "likes": 346, "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": 30677, "totalSubmissionRaw": 61843}, "2516": {"acRate": 34.566518711569, "difficulty": "Medium", "likes": 709, "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": 16977, "totalSubmissionRaw": 49114}, "2517": {"acRate": 64.23691491163683, "difficulty": "Medium", "likes": 911, "dislikes": 146, "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": 22754, "totalSubmissionRaw": 35422}, "2518": {"acRate": 31.588150586299115, "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": 9213, "totalSubmissionRaw": 29166}, "2519": {"acRate": 53.36955754710324, "difficulty": "Hard", "likes": 103, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2519", "paidOnly": true, "title": "Count the Number of K-Big Indices", "titleSlug": "count-the-number-of-k-big-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7563, "totalSubmissionRaw": 14171}, "2520": {"acRate": 84.90281626844431, "difficulty": "Easy", "likes": 509, "dislikes": 33, "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": 90682, "totalSubmissionRaw": 106807}, "2521": {"acRate": 51.730355561179294, "difficulty": "Medium", "likes": 472, "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": 32706, "totalSubmissionRaw": 63224}, "2522": {"acRate": 46.388941728488994, "difficulty": "Medium", "likes": 372, "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": 21948, "totalSubmissionRaw": 47313}, "2523": {"acRate": 38.03069170170459, "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": 25055, "totalSubmissionRaw": 65881}, "2524": {"acRate": 39.37226857369885, "difficulty": "Hard", "likes": 23, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2524", "paidOnly": true, "title": "Maximum Frequency Score of a Subarray", "titleSlug": "maximum-frequency-score-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 991, "totalSubmissionRaw": 2517}, "2525": {"acRate": 36.066173014861775, "difficulty": "Easy", "likes": 198, "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": 34533, "totalSubmissionRaw": 95749}, "2526": {"acRate": 49.58200306346541, "difficulty": "Medium", "likes": 312, "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": 26867, "totalSubmissionRaw": 54187}, "2527": {"acRate": 68.88611691726788, "difficulty": "Medium", "likes": 361, "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": 20433, "totalSubmissionRaw": 29662}, "2528": {"acRate": 32.79765923925276, "difficulty": "Hard", "likes": 460, "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": 7286, "totalSubmissionRaw": 22215}, "2529": {"acRate": 71.06467661691542, "difficulty": "Easy", "likes": 907, "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": 114272, "totalSubmissionRaw": 160800}, "2530": {"acRate": 46.265328874024526, "difficulty": "Medium", "likes": 391, "dislikes": 10, "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": 29050, "totalSubmissionRaw": 62790}, "2531": {"acRate": 26.528040327662257, "difficulty": "Medium", "likes": 567, "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": 19366, "totalSubmissionRaw": 73002}, "2532": {"acRate": 44.24078317017288, "difficulty": "Hard", "likes": 112, "dislikes": 219, "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": 4248, "totalSubmissionRaw": 9602}, "2533": {"acRate": 51.8706404565631, "difficulty": "Medium", "likes": 53, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2533", "paidOnly": true, "title": "Number of Good Binary Strings", "titleSlug": "number-of-good-binary-strings", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5726, "totalSubmissionRaw": 11039}, "2534": {"acRate": 49.14050111005392, "difficulty": "Hard", "likes": 85, "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": 7747, "totalSubmissionRaw": 15765}, "2535": {"acRate": 84.58488321595135, "difficulty": "Easy", "likes": 696, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2535", "paidOnly": false, "title": "Difference Between Element Sum and Digit Sum of an Array", "titleSlug": "difference-between-element-sum-and-digit-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 134387, "totalSubmissionRaw": 158878}, "2536": {"acRate": 50.02213987741499, "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": 21462, "totalSubmissionRaw": 42906}, "2537": {"acRate": 51.383595691797844, "difficulty": "Medium", "likes": 856, "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": 21707, "totalSubmissionRaw": 42245}, "2538": {"acRate": 32.17929150935818, "difficulty": "Hard", "likes": 432, "dislikes": 16, "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": 8012, "totalSubmissionRaw": 24898}, "2539": {"acRate": 52.35387764384808, "difficulty": "Medium", "likes": 28, "dislikes": 69, "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": 2302, "totalSubmissionRaw": 4397}, "2540": {"acRate": 58.69916074887024, "difficulty": "Easy", "likes": 1127, "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": 243679, "totalSubmissionRaw": 415132}, "2541": {"acRate": 31.756072523478572, "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": 22892, "totalSubmissionRaw": 72087}, "2542": {"acRate": 53.834118401556864, "difficulty": "Medium", "likes": 2778, "dislikes": 167, "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": 97370, "totalSubmissionRaw": 180873}, "2543": {"acRate": 42.875864961207796, "difficulty": "Hard", "likes": 246, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2543", "paidOnly": false, "title": "Check if Point Is Reachable", "titleSlug": "check-if-point-is-reachable", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8179, "totalSubmissionRaw": 19076}, "2544": {"acRate": 68.33225316348106, "difficulty": "Easy", "likes": 398, "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": 64315, "totalSubmissionRaw": 94121}, "2545": {"acRate": 85.59219967199671, "difficulty": "Medium", "likes": 667, "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": 66803, "totalSubmissionRaw": 78048}, "2546": {"acRate": 41.349577452704736, "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": 19277, "totalSubmissionRaw": 46621}, "2547": {"acRate": 40.91473780567543, "difficulty": "Hard", "likes": 433, "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": 12515, "totalSubmissionRaw": 30588}, "2548": {"acRate": 66.15096108766994, "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": 1411, "totalSubmissionRaw": 2133}, "2549": {"acRate": 60.56920797338478, "difficulty": "Easy", "likes": 265, "dislikes": 272, "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": 43330, "totalSubmissionRaw": 71538}, "2550": {"acRate": 27.980437745530345, "difficulty": "Medium", "likes": 242, "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": 20940, "totalSubmissionRaw": 74838}, "2551": {"acRate": 66.45408883119815, "difficulty": "Hard", "likes": 2040, "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": 58875, "totalSubmissionRaw": 88595}, "2552": {"acRate": 33.564543093942305, "difficulty": "Hard", "likes": 374, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2552", "paidOnly": false, "title": "Count Increasing Quadruplets", "titleSlug": "count-increasing-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9436, "totalSubmissionRaw": 28113}, "2553": {"acRate": 79.60098656020735, "difficulty": "Easy", "likes": 488, "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": 76167, "totalSubmissionRaw": 95686}, "2554": {"acRate": 54.35527074221002, "difficulty": "Medium", "likes": 335, "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": 32062, "totalSubmissionRaw": 58986}, "2555": {"acRate": 33.63204729113606, "difficulty": "Medium", "likes": 549, "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": 10696, "totalSubmissionRaw": 31803}, "2556": {"acRate": 27.33243739471144, "difficulty": "Medium", "likes": 589, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2556", "paidOnly": false, "title": "Disconnect Path in a Binary Matrix by at Most One Flip", "titleSlug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14440, "totalSubmissionRaw": 52831}, "2557": {"acRate": 39.350525310410696, "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": 1648, "totalSubmissionRaw": 4188}, "2558": {"acRate": 67.13978086867017, "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": 49574, "totalSubmissionRaw": 73837}, "2559": {"acRate": 52.57320399573692, "difficulty": "Medium", "likes": 445, "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": 29104, "totalSubmissionRaw": 55359}, "2560": {"acRate": 44.011531211886016, "difficulty": "Medium", "likes": 915, "dislikes": 32, "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": 19847, "totalSubmissionRaw": 45095}, "2561": {"acRate": 34.32101279570987, "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": 10112, "totalSubmissionRaw": 29463}, "2562": {"acRate": 70.08483343678874, "difficulty": "Easy", "likes": 355, "dislikes": 16, "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": 50808, "totalSubmissionRaw": 72495}, "2563": {"acRate": 33.17746436382834, "difficulty": "Medium", "likes": 806, "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": 26394, "totalSubmissionRaw": 79554}, "2564": {"acRate": 33.69182224559558, "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": 12813, "totalSubmissionRaw": 38030}, "2565": {"acRate": 31.999152003391984, "difficulty": "Hard", "likes": 379, "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": 7547, "totalSubmissionRaw": 23585}, "2566": {"acRate": 60.130005803830535, "difficulty": "Easy", "likes": 230, "dislikes": 42, "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": 25901, "totalSubmissionRaw": 43075}, "2567": {"acRate": 48.183167500412296, "difficulty": "Medium", "likes": 242, "dislikes": 224, "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": 17530, "totalSubmissionRaw": 36382}, "2568": {"acRate": 57.7740755495998, "difficulty": "Medium", "likes": 352, "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": 15952, "totalSubmissionRaw": 27611}, "2569": {"acRate": 28.5644002755092, "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": 5806, "totalSubmissionRaw": 20326}, "2570": {"acRate": 73.8566120728436, "difficulty": "Easy", "likes": 334, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2570", "paidOnly": false, "title": "Merge Two 2D Arrays by Summing Values", "titleSlug": "merge-two-2d-arrays-by-summing-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44328, "totalSubmissionRaw": 60019}, "2571": {"acRate": 55.65798015394603, "difficulty": "Medium", "likes": 533, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "2571", "paidOnly": false, "title": "Minimum Operations to Reduce an Integer to 0", "titleSlug": "minimum-operations-to-reduce-an-integer-to-0", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30008, "totalSubmissionRaw": 53915}, "2572": {"acRate": 23.320148684712162, "difficulty": "Medium", "likes": 459, "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": 9787, "totalSubmissionRaw": 41968}, "2573": {"acRate": 31.630537229029215, "difficulty": "Hard", "likes": 188, "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": 5034, "totalSubmissionRaw": 15915}, "2574": {"acRate": 86.98972904007597, "difficulty": "Easy", "likes": 1054, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2574", "paidOnly": false, "title": "Left and Right Sum Differences", "titleSlug": "left-and-right-sum-differences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 149317, "totalSubmissionRaw": 171649}, "2575": {"acRate": 33.11801695901761, "difficulty": "Medium", "likes": 526, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2575", "paidOnly": false, "title": "Find the Divisibility Array of a String", "titleSlug": "find-the-divisibility-array-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29019, "totalSubmissionRaw": 87623}, "2576": {"acRate": 38.78689941562224, "difficulty": "Medium", "likes": 558, "dislikes": 28, "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": 20642, "totalSubmissionRaw": 53219}, "2577": {"acRate": 35.85233633845972, "difficulty": "Hard", "likes": 545, "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": 12169, "totalSubmissionRaw": 33942}, "2578": {"acRate": 71.04896971083281, "difficulty": "Easy", "likes": 374, "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": 37273, "totalSubmissionRaw": 52461}, "2579": {"acRate": 57.90751122280216, "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": 26960, "totalSubmissionRaw": 46557}, "2580": {"acRate": 36.516241552212776, "difficulty": "Medium", "likes": 313, "dislikes": 20, "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": 16750, "totalSubmissionRaw": 45870}, "2581": {"acRate": 46.33201864467551, "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": 6461, "totalSubmissionRaw": 13945}, "2582": {"acRate": 56.92104807766898, "difficulty": "Easy", "likes": 1019, "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": 190778, "totalSubmissionRaw": 335161}, "2583": {"acRate": 47.84522624831704, "difficulty": "Medium", "likes": 554, "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": 40867, "totalSubmissionRaw": 85415}, "2584": {"acRate": 23.282620507645735, "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": 11998, "totalSubmissionRaw": 51532}, "2585": {"acRate": 57.63274336283186, "difficulty": "Hard", "likes": 469, "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": 17192, "totalSubmissionRaw": 29831}, "2586": {"acRate": 74.31029645562518, "difficulty": "Easy", "likes": 341, "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": 63568, "totalSubmissionRaw": 85544}, "2587": {"acRate": 41.22227629840785, "difficulty": "Medium", "likes": 289, "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": 29645, "totalSubmissionRaw": 71915}, "2588": {"acRate": 50.748482434696626, "difficulty": "Medium", "likes": 501, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2588", "paidOnly": false, "title": "Count the Number of Beautiful Subarrays", "titleSlug": "count-the-number-of-beautiful-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18476, "totalSubmissionRaw": 36407}, "2589": {"acRate": 39.643071987166635, "difficulty": "Hard", "likes": 425, "dislikes": 18, "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": 9885, "totalSubmissionRaw": 24935}, "2590": {"acRate": 58.23033707865169, "difficulty": "Medium", "likes": 39, "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": 2073, "totalSubmissionRaw": 3562}, "2591": {"acRate": 19.223210841049383, "difficulty": "Easy", "likes": 304, "dislikes": 835, "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": 31888, "totalSubmissionRaw": 165887}, "2592": {"acRate": 58.229496001487824, "difficulty": "Medium", "likes": 438, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2592", "paidOnly": false, "title": "Maximize Greatness of an Array", "titleSlug": "maximize-greatness-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25048, "totalSubmissionRaw": 43016}, "2593": {"acRate": 52.74474176852769, "difficulty": "Medium", "likes": 363, "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": 19159, "totalSubmissionRaw": 36324}, "2594": {"acRate": 45.092054740573005, "difficulty": "Medium", "likes": 586, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2594", "paidOnly": false, "title": "Minimum Time to Repair Cars", "titleSlug": "minimum-time-to-repair-cars", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18320, "totalSubmissionRaw": 40628}, "2595": {"acRate": 73.5415591120289, "difficulty": "Easy", "likes": 322, "dislikes": 110, "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": 48433, "totalSubmissionRaw": 65858}, "2596": {"acRate": 57.08018009387872, "difficulty": "Medium", "likes": 389, "dislikes": 58, "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": 29793, "totalSubmissionRaw": 52195}, "2597": {"acRate": 51.15042532477544, "difficulty": "Medium", "likes": 1196, "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": 116113, "totalSubmissionRaw": 227003}, "2598": {"acRate": 39.484136835311055, "difficulty": "Medium", "likes": 349, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2598", "paidOnly": false, "title": "Smallest Missing Non-negative Integer After Operations", "titleSlug": "smallest-missing-non-negative-integer-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15905, "totalSubmissionRaw": 40282}, "2599": {"acRate": 50.71298936997667, "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": 1956, "totalSubmissionRaw": 3857}, "2600": {"acRate": 61.92783901184953, "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": 41914, "totalSubmissionRaw": 67682}, "2601": {"acRate": 37.99476973538407, "difficulty": "Medium", "likes": 380, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2601", "paidOnly": false, "title": "Prime Subtraction Operation", "titleSlug": "prime-subtraction-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17144, "totalSubmissionRaw": 45122}, "2602": {"acRate": 35.75423118805485, "difficulty": "Medium", "likes": 713, "dislikes": 23, "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": 19372, "totalSubmissionRaw": 54181}, "2603": {"acRate": 37.57458161532865, "difficulty": "Hard", "likes": 439, "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": 7746, "totalSubmissionRaw": 20615}, "2604": {"acRate": 40.780759846636464, "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": 1170, "totalSubmissionRaw": 2869}, "2605": {"acRate": 54.32522061716598, "difficulty": "Easy", "likes": 294, "dislikes": 23, "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": 38660, "totalSubmissionRaw": 71164}, "2606": {"acRate": 56.968601761915515, "difficulty": "Medium", "likes": 359, "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": 25220, "totalSubmissionRaw": 44270}, "2607": {"acRate": 37.32060725524778, "difficulty": "Medium", "likes": 461, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2607", "paidOnly": false, "title": "Make K-Subarray Sums Equal", "titleSlug": "make-k-subarray-sums-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10792, "totalSubmissionRaw": 28917}, "2608": {"acRate": 36.498799055124366, "difficulty": "Hard", "likes": 512, "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": 18387, "totalSubmissionRaw": 50377}, "2609": {"acRate": 46.583696510573574, "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": 31853, "totalSubmissionRaw": 68378}, "2610": {"acRate": 87.1771157910204, "difficulty": "Medium", "likes": 1606, "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": 201720, "totalSubmissionRaw": 231391}, "2611": {"acRate": 46.101809572129206, "difficulty": "Medium", "likes": 621, "dislikes": 59, "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": 27260, "totalSubmissionRaw": 59130}, "2612": {"acRate": 16.746239372138653, "difficulty": "Hard", "likes": 241, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2612", "paidOnly": false, "title": "Minimum Reverse Operations", "titleSlug": "minimum-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5121, "totalSubmissionRaw": 30580}, "2613": {"acRate": 42.846212700841626, "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": 560, "totalSubmissionRaw": 1307}, "2614": {"acRate": 34.245551628018205, "difficulty": "Easy", "likes": 346, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2614", "paidOnly": false, "title": "Prime In Diagonal", "titleSlug": "prime-in-diagonal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45825, "totalSubmissionRaw": 133813}, "2615": {"acRate": 31.20526681363815, "difficulty": "Medium", "likes": 734, "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": 20667, "totalSubmissionRaw": 66228}, "2616": {"acRate": 43.96704681908608, "difficulty": "Medium", "likes": 2312, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "2616", "paidOnly": false, "title": "Minimize the Maximum Difference of Pairs", "titleSlug": "minimize-the-maximum-difference-of-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73596, "totalSubmissionRaw": 167389}, "2617": {"acRate": 24.915607066501632, "difficulty": "Hard", "likes": 378, "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": 8857, "totalSubmissionRaw": 35548}, "2618": {"acRate": 27.590801135376235, "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": 23815, "totalSubmissionRaw": 86315}, "2619": {"acRate": 73.60036980673443, "difficulty": "Easy", "likes": 502, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2619", "paidOnly": false, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141705, "totalSubmissionRaw": 192533}, "2620": {"acRate": 81.28305194151471, "difficulty": "Easy", "likes": 1279, "dislikes": 105, "categoryTitle": "JavaScript", "frontendQuestionId": "2620", "paidOnly": false, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 411770, "totalSubmissionRaw": 506588}, "2621": {"acRate": 87.03844254099053, "difficulty": "Easy", "likes": 589, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2621", "paidOnly": false, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144492, "totalSubmissionRaw": 166008}, "2622": {"acRate": 74.56656643848763, "difficulty": "Medium", "likes": 427, "dislikes": 30, "categoryTitle": "JavaScript", "frontendQuestionId": "2622", "paidOnly": false, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46621, "totalSubmissionRaw": 62523}, "2623": {"acRate": 62.60926172510727, "difficulty": "Medium", "likes": 598, "dislikes": 88, "categoryTitle": "JavaScript", "frontendQuestionId": "2623", "paidOnly": false, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105794, "totalSubmissionRaw": 168975}, "2624": {"acRate": 65.66163141993958, "difficulty": "Medium", "likes": 100, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2624", "paidOnly": false, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10867, "totalSubmissionRaw": 16550}, "2625": {"acRate": 63.650405457587844, "difficulty": "Medium", "likes": 338, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2625", "paidOnly": false, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44504, "totalSubmissionRaw": 69919}, "2626": {"acRate": 84.81142978263831, "difficulty": "Easy", "likes": 590, "dislikes": 36, "categoryTitle": "JavaScript", "frontendQuestionId": "2626", "paidOnly": false, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168051, "totalSubmissionRaw": 198144}, "2627": {"acRate": 90.94709033005212, "difficulty": "Medium", "likes": 396, "dislikes": 46, "categoryTitle": "JavaScript", "frontendQuestionId": "2627", "paidOnly": false, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50261, "totalSubmissionRaw": 55264}, "2628": {"acRate": 38.732201115955725, "difficulty": "Medium", "likes": 214, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2628", "paidOnly": true, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12703, "totalSubmissionRaw": 32797}, "2629": {"acRate": 86.33438747725857, "difficulty": "Easy", "likes": 666, "dislikes": 49, "categoryTitle": "JavaScript", "frontendQuestionId": "2629", "paidOnly": false, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141413, "totalSubmissionRaw": 163797}, "2630": {"acRate": 30.97380184462174, "difficulty": "Hard", "likes": 116, "dislikes": 41, "categoryTitle": "JavaScript", "frontendQuestionId": "2630", "paidOnly": false, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5474, "totalSubmissionRaw": 17673}, "2631": {"acRate": 80.88487584650113, "difficulty": "Medium", "likes": 305, "dislikes": 17, "categoryTitle": "JavaScript", "frontendQuestionId": "2631", "paidOnly": false, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44790, "totalSubmissionRaw": 55375}, "2632": {"acRate": 89.24517135632432, "difficulty": "Medium", "likes": 343, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2632", "paidOnly": true, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16588, "totalSubmissionRaw": 18587}, "2633": {"acRate": 77.25223753838112, "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": 11825, "totalSubmissionRaw": 15307}, "2634": {"acRate": 84.7988955274516, "difficulty": "Easy", "likes": 635, "dislikes": 81, "categoryTitle": "JavaScript", "frontendQuestionId": "2634", "paidOnly": false, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 179965, "totalSubmissionRaw": 212226}, "2635": {"acRate": 85.81383169803807, "difficulty": "Easy", "likes": 732, "dislikes": 72, "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": 198272, "totalSubmissionRaw": 231049}, "2636": {"acRate": 79.80805898055166, "difficulty": "Medium", "likes": 285, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2636", "paidOnly": true, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12557, "totalSubmissionRaw": 15734}, "2637": {"acRate": 81.63987230738259, "difficulty": "Medium", "likes": 481, "dislikes": 71, "categoryTitle": "JavaScript", "frontendQuestionId": "2637", "paidOnly": false, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56772, "totalSubmissionRaw": 69540}, "2638": {"acRate": 47.02457956015524, "difficulty": "Medium", "likes": 83, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2638", "paidOnly": true, "title": "Count the Number of K-Free Subsets", "titleSlug": "count-the-number-of-k-free-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3635, "totalSubmissionRaw": 7730}, "2639": {"acRate": 67.9520707526984, "difficulty": "Easy", "likes": 169, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2639", "paidOnly": false, "title": "Find the Width of Columns of a Grid", "titleSlug": "find-the-width-of-columns-of-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28582, "totalSubmissionRaw": 42062}, "2640": {"acRate": 71.03657855339307, "difficulty": "Medium", "likes": 293, "dislikes": 36, "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": 31791, "totalSubmissionRaw": 44753}, "2641": {"acRate": 67.72301933873986, "difficulty": "Medium", "likes": 583, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2641", "paidOnly": false, "title": "Cousins in Binary Tree II", "titleSlug": "cousins-in-binary-tree-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21712, "totalSubmissionRaw": 32060}, "2642": {"acRate": 70.61976757422413, "difficulty": "Hard", "likes": 812, "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": 68242, "totalSubmissionRaw": 96632}, "2643": {"acRate": 75.36527546670922, "difficulty": "Easy", "likes": 453, "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": 66127, "totalSubmissionRaw": 87742}, "2644": {"acRate": 49.53405677150389, "difficulty": "Easy", "likes": 235, "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": 32318, "totalSubmissionRaw": 65244}, "2645": {"acRate": 50.732479199632486, "difficulty": "Medium", "likes": 541, "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": 29817, "totalSubmissionRaw": 58773}, "2646": {"acRate": 45.98128330273586, "difficulty": "Hard", "likes": 478, "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": 10269, "totalSubmissionRaw": 22333}, "2647": {"acRate": 66.80497925311202, "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": 322, "totalSubmissionRaw": 482}, "2648": {"acRate": 83.26882328012431, "difficulty": "Easy", "likes": 245, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2648", "paidOnly": false, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29473, "totalSubmissionRaw": 35395}, "2649": {"acRate": 78.9853719265484, "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": 12688, "totalSubmissionRaw": 16064}, "2650": {"acRate": 48.96384479717813, "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": 2221, "totalSubmissionRaw": 4536}, "2651": {"acRate": 78.4532175179725, "difficulty": "Easy", "likes": 230, "dislikes": 48, "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": 58166, "totalSubmissionRaw": 74141}, "2652": {"acRate": 85.70277949719963, "difficulty": "Easy", "likes": 493, "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": 114918, "totalSubmissionRaw": 134089}, "2653": {"acRate": 33.59875612514135, "difficulty": "Medium", "likes": 624, "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": 21393, "totalSubmissionRaw": 63672}, "2654": {"acRate": 35.51552591296742, "difficulty": "Medium", "likes": 383, "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": 12993, "totalSubmissionRaw": 36584}, "2655": {"acRate": 52.106084243369736, "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": 1336, "totalSubmissionRaw": 2564}, "2656": {"acRate": 82.41758241758241, "difficulty": "Easy", "likes": 372, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2656", "paidOnly": false, "title": "Maximum Sum With Exactly K Elements ", "titleSlug": "maximum-sum-with-exactly-k-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77100, "totalSubmissionRaw": 93548}, "2657": {"acRate": 81.53372423203157, "difficulty": "Medium", "likes": 480, "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": 44219, "totalSubmissionRaw": 54234}, "2658": {"acRate": 60.237304431430815, "difficulty": "Medium", "likes": 435, "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": 27567, "totalSubmissionRaw": 45764}, "2659": {"acRate": 25.657969954039284, "difficulty": "Hard", "likes": 538, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2659", "paidOnly": false, "title": "Make Array Empty", "titleSlug": "make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11221, "totalSubmissionRaw": 43733}, "2660": {"acRate": 34.45650696238178, "difficulty": "Easy", "likes": 275, "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": 35484, "totalSubmissionRaw": 102982}, "2661": {"acRate": 50.83348711324353, "difficulty": "Medium", "likes": 433, "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": 24792, "totalSubmissionRaw": 48771}, "2662": {"acRate": 39.49316054715622, "difficulty": "Medium", "likes": 613, "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": 13714, "totalSubmissionRaw": 34725}, "2663": {"acRate": 37.85322648671446, "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": 5385, "totalSubmissionRaw": 14226}, "2664": {"acRate": 66.5033407572383, "difficulty": "Medium", "likes": 36, "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": 1493, "totalSubmissionRaw": 2245}, "2665": {"acRate": 80.24246299481119, "difficulty": "Easy", "likes": 726, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2665", "paidOnly": false, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 218359, "totalSubmissionRaw": 272124}, "2666": {"acRate": 86.33329736562206, "difficulty": "Easy", "likes": 474, "dislikes": 54, "categoryTitle": "JavaScript", "frontendQuestionId": "2666", "paidOnly": false, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112014, "totalSubmissionRaw": 129746}, "2667": {"acRate": 81.40037206530889, "difficulty": "Easy", "likes": 1282, "dislikes": 177, "categoryTitle": "JavaScript", "frontendQuestionId": "2667", "paidOnly": false, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 469939, "totalSubmissionRaw": 577318}, "2668": {"acRate": 72.55857544517337, "difficulty": "Easy", "likes": 19, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2668", "paidOnly": true, "title": "Find Latest Salaries", "titleSlug": "find-latest-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3871, "totalSubmissionRaw": 5335}, "2669": {"acRate": 72.84918506292553, "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": 3531, "totalSubmissionRaw": 4847}, "2670": {"acRate": 77.96318394334787, "difficulty": "Easy", "likes": 332, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2670", "paidOnly": false, "title": "Find the Distinct Difference Array", "titleSlug": "find-the-distinct-difference-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39854, "totalSubmissionRaw": 51119}, "2671": {"acRate": 30.137388680454492, "difficulty": "Medium", "likes": 322, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2671", "paidOnly": false, "title": "Frequency Tracker", "titleSlug": "frequency-tracker", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22572, "totalSubmissionRaw": 74897}, "2672": {"acRate": 54.86762130421346, "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": 15978, "totalSubmissionRaw": 29121}, "2673": {"acRate": 59.32923617208077, "difficulty": "Medium", "likes": 599, "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": 16894, "totalSubmissionRaw": 28475}, "2674": {"acRate": 74.91459248413861, "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": 1535, "totalSubmissionRaw": 2049}, "2675": {"acRate": 68.3699421965318, "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": 5914, "totalSubmissionRaw": 8650}, "2676": {"acRate": 82.7443741209564, "difficulty": "Medium", "likes": 162, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2676", "paidOnly": true, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9413, "totalSubmissionRaw": 11376}, "2677": {"acRate": 83.52823511309431, "difficulty": "Easy", "likes": 340, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2677", "paidOnly": false, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65142, "totalSubmissionRaw": 77988}, "2678": {"acRate": 81.71449230385304, "difficulty": "Easy", "likes": 712, "dislikes": 59, "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": 255406, "totalSubmissionRaw": 312559}, "2679": {"acRate": 60.207070707070706, "difficulty": "Medium", "likes": 351, "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": 35763, "totalSubmissionRaw": 59400}, "2680": {"acRate": 41.094103322316926, "difficulty": "Medium", "likes": 390, "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": 14175, "totalSubmissionRaw": 34494}, "2681": {"acRate": 31.358977771862108, "difficulty": "Hard", "likes": 315, "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": 9423, "totalSubmissionRaw": 30051}, "2682": {"acRate": 49.28818438745238, "difficulty": "Easy", "likes": 247, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2682", "paidOnly": false, "title": "Find the Losers of the Circular Game", "titleSlug": "find-the-losers-of-the-circular-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28078, "totalSubmissionRaw": 56967}, "2683": {"acRate": 62.067728313967926, "difficulty": "Medium", "likes": 271, "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": 22489, "totalSubmissionRaw": 36233}, "2684": {"acRate": 46.08564175315463, "difficulty": "Medium", "likes": 435, "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": 24689, "totalSubmissionRaw": 53572}, "2685": {"acRate": 66.10767094911743, "difficulty": "Medium", "likes": 665, "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": 29999, "totalSubmissionRaw": 45379}, "2686": {"acRate": 67.38128631536766, "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": 3363, "totalSubmissionRaw": 4991}, "2687": {"acRate": 80.62486439574745, "difficulty": "Easy", "likes": 21, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2687", "paidOnly": true, "title": "Bikes Last Time Used ", "titleSlug": "bikes-last-time-used", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3716, "totalSubmissionRaw": 4609}, "2688": {"acRate": 42.65450861195542, "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": 3368, "totalSubmissionRaw": 7896}, "2689": {"acRate": 74.40893738633412, "difficulty": "Easy", "likes": 37, "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": 2864, "totalSubmissionRaw": 3849}, "2690": {"acRate": 93.02832244008714, "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": 1281, "totalSubmissionRaw": 1377}, "2691": {"acRate": 37.42802303262956, "difficulty": "Hard", "likes": 11, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2691", "paidOnly": true, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 195, "totalSubmissionRaw": 521}, "2692": {"acRate": 63.322884012539184, "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": 404, "totalSubmissionRaw": 638}, "2693": {"acRate": 79.83605301463264, "difficulty": "Medium", "likes": 139, "dislikes": 13, "categoryTitle": "JavaScript", "frontendQuestionId": "2693", "paidOnly": false, "title": "Call Function with Custom Context", "titleSlug": "call-function-with-custom-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10421, "totalSubmissionRaw": 13053}, "2694": {"acRate": 74.25511308608215, "difficulty": "Medium", "likes": 241, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2694", "paidOnly": false, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26068, "totalSubmissionRaw": 35106}, "2695": {"acRate": 88.14892613709435, "difficulty": "Easy", "likes": 229, "dislikes": 48, "categoryTitle": "JavaScript", "frontendQuestionId": "2695", "paidOnly": false, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41125, "totalSubmissionRaw": 46654}, "2696": {"acRate": 69.9709739283678, "difficulty": "Easy", "likes": 413, "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": 53998, "totalSubmissionRaw": 77172}, "2697": {"acRate": 82.1370837374717, "difficulty": "Easy", "likes": 349, "dislikes": 26, "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": 55891, "totalSubmissionRaw": 68046}, "2698": {"acRate": 62.87664493912188, "difficulty": "Medium", "likes": 479, "dislikes": 31, "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": 20450, "totalSubmissionRaw": 32524}, "2699": {"acRate": 57.84301047458942, "difficulty": "Hard", "likes": 672, "dislikes": 145, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 62622, "totalSubmissionRaw": 108261}, "2700": {"acRate": 75.56561085972851, "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": 7348, "totalSubmissionRaw": 9724}, "2701": {"acRate": 32.41583506963483, "difficulty": "Hard", "likes": 47, "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": 2956, "totalSubmissionRaw": 9119}, "2702": {"acRate": 44.799649660608715, "difficulty": "Hard", "likes": 39, "dislikes": 2, "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": 2046, "totalSubmissionRaw": 4567}, "2703": {"acRate": 94.36299088258008, "difficulty": "Easy", "likes": 311, "dislikes": 155, "categoryTitle": "JavaScript", "frontendQuestionId": "2703", "paidOnly": false, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163732, "totalSubmissionRaw": 173513}, "2704": {"acRate": 62.39291239291239, "difficulty": "Easy", "likes": 650, "dislikes": 161, "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": 191977, "totalSubmissionRaw": 307691}, "2705": {"acRate": 65.30218085249068, "difficulty": "Medium", "likes": 177, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2705", "paidOnly": false, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24343, "totalSubmissionRaw": 37278}, "2706": {"acRate": 69.1164093282387, "difficulty": "Easy", "likes": 989, "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": 185590, "totalSubmissionRaw": 268518}, "2707": {"acRate": 52.55321059721598, "difficulty": "Medium", "likes": 2089, "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": 87777, "totalSubmissionRaw": 167025}, "2708": {"acRate": 24.362257708145023, "difficulty": "Medium", "likes": 358, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2708", "paidOnly": false, "title": "Maximum Strength of a Group", "titleSlug": "maximum-strength-of-a-group", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29106, "totalSubmissionRaw": 119481}, "2709": {"acRate": 42.47051282819267, "difficulty": "Hard", "likes": 812, "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": 70899, "totalSubmissionRaw": 166937}, "2710": {"acRate": 78.86189228664827, "difficulty": "Easy", "likes": 316, "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": 68031, "totalSubmissionRaw": 86266}, "2711": {"acRate": 71.26913721562455, "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": 19924, "totalSubmissionRaw": 27956}, "2712": {"acRate": 54.669176198059944, "difficulty": "Medium", "likes": 532, "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": 18880, "totalSubmissionRaw": 34535}, "2713": {"acRate": 30.78844761971469, "difficulty": "Hard", "likes": 581, "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": 13187, "totalSubmissionRaw": 42831}, "2714": {"acRate": 61.931119311193115, "difficulty": "Hard", "likes": 31, "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": 1007, "totalSubmissionRaw": 1626}, "2715": {"acRate": 88.79698867376736, "difficulty": "Easy", "likes": 230, "dislikes": 291, "categoryTitle": "JavaScript", "frontendQuestionId": "2715", "paidOnly": false, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52605, "totalSubmissionRaw": 59242}, "2716": {"acRate": 76.64722145058667, "difficulty": "Easy", "likes": 327, "dislikes": 94, "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": 57943, "totalSubmissionRaw": 75597}, "2717": {"acRate": 64.12116814801378, "difficulty": "Easy", "likes": 207, "dislikes": 17, "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": 31815, "totalSubmissionRaw": 49617}, "2718": {"acRate": 31.08316820142208, "difficulty": "Medium", "likes": 692, "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": 21333, "totalSubmissionRaw": 68632}, "2719": {"acRate": 34.64955577492596, "difficulty": "Hard", "likes": 526, "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": 11232, "totalSubmissionRaw": 32416}, "2720": {"acRate": 51.67214912280702, "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": 1885, "totalSubmissionRaw": 3648}, "2721": {"acRate": 75.44135495972635, "difficulty": "Medium", "likes": 189, "dislikes": 45, "categoryTitle": "JavaScript", "frontendQuestionId": "2721", "paidOnly": false, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27348, "totalSubmissionRaw": 36248}, "2722": {"acRate": 54.889845094664366, "difficulty": "Medium", "likes": 168, "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": 31891, "totalSubmissionRaw": 58100}, "2723": {"acRate": 91.41062418713622, "difficulty": "Easy", "likes": 270, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2723", "paidOnly": false, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99101, "totalSubmissionRaw": 108413}, "2724": {"acRate": 82.68023381684347, "difficulty": "Easy", "likes": 172, "dislikes": 37, "categoryTitle": "JavaScript", "frontendQuestionId": "2724", "paidOnly": false, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42009, "totalSubmissionRaw": 50809}, "2725": {"acRate": 81.02726359864346, "difficulty": "Easy", "likes": 160, "dislikes": 85, "categoryTitle": "JavaScript", "frontendQuestionId": "2725", "paidOnly": false, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42767, "totalSubmissionRaw": 52781}, "2726": {"acRate": 75.60433816803868, "difficulty": "Easy", "likes": 111, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2726", "paidOnly": false, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28930, "totalSubmissionRaw": 38265}, "2727": {"acRate": 80.40098900829886, "difficulty": "Easy", "likes": 175, "dislikes": 11, "categoryTitle": "JavaScript", "frontendQuestionId": "2727", "paidOnly": false, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65686, "totalSubmissionRaw": 81698}, "2728": {"acRate": 84.94917904612979, "difficulty": "Easy", "likes": 52, "dislikes": 10, "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": 2173, "totalSubmissionRaw": 2558}, "2729": {"acRate": 52.3493296579376, "difficulty": "Easy", "likes": 231, "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": 45958, "totalSubmissionRaw": 87791}, "2730": {"acRate": 37.161378158020945, "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": 24020, "totalSubmissionRaw": 64637}, "2731": {"acRate": 28.046717351868082, "difficulty": "Medium", "likes": 485, "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": 13760, "totalSubmissionRaw": 49061}, "2732": {"acRate": 45.92079207920792, "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": 6957, "totalSubmissionRaw": 15150}, "2733": {"acRate": 76.63314587106409, "difficulty": "Easy", "likes": 346, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2733", "paidOnly": false, "title": "Neither Minimum nor Maximum", "titleSlug": "neither-minimum-nor-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96475, "totalSubmissionRaw": 125892}, "2734": {"acRate": 31.23423968234046, "difficulty": "Medium", "likes": 242, "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": 27374, "totalSubmissionRaw": 87641}, "2735": {"acRate": 33.50923482849604, "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": 12065, "totalSubmissionRaw": 36005}, "2736": {"acRate": 29.37977735597394, "difficulty": "Hard", "likes": 332, "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": 5727, "totalSubmissionRaw": 19493}, "2737": {"acRate": 57.51782242384964, "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": 1775, "totalSubmissionRaw": 3086}, "2738": {"acRate": 55.56864424930392, "difficulty": "Medium", "likes": 21, "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": 5189, "totalSubmissionRaw": 9338}, "2739": {"acRate": 39.36165502094459, "difficulty": "Easy", "likes": 283, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2739", "paidOnly": false, "title": "Total Distance Traveled", "titleSlug": "total-distance-traveled", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44446, "totalSubmissionRaw": 112917}, "2740": {"acRate": 65.42995504620787, "difficulty": "Medium", "likes": 284, "dislikes": 21, "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": 33913, "totalSubmissionRaw": 51831}, "2741": {"acRate": 28.655258649548077, "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": 14552, "totalSubmissionRaw": 50783}, "2742": {"acRate": 50.77769037252809, "difficulty": "Hard", "likes": 1373, "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": 65195, "totalSubmissionRaw": 128393}, "2743": {"acRate": 76.62042301569252, "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": 6737, "totalSubmissionRaw": 8793}, "2744": {"acRate": 81.75366145374946, "difficulty": "Easy", "likes": 358, "dislikes": 15, "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": 72455, "totalSubmissionRaw": 88626}, "2745": {"acRate": 54.20817588457575, "difficulty": "Medium", "likes": 310, "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": 20514, "totalSubmissionRaw": 37843}, "2746": {"acRate": 27.092378386943434, "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": 8549, "totalSubmissionRaw": 31555}, "2747": {"acRate": 33.1378156963498, "difficulty": "Medium", "likes": 340, "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": 6836, "totalSubmissionRaw": 20629}, "2748": {"acRate": 50.49328621908127, "difficulty": "Easy", "likes": 208, "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": 35724, "totalSubmissionRaw": 70750}, "2749": {"acRate": 30.207917447252846, "difficulty": "Medium", "likes": 286, "dislikes": 287, "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": 9836, "totalSubmissionRaw": 32561}, "2750": {"acRate": 34.288075339902704, "difficulty": "Medium", "likes": 439, "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": 21991, "totalSubmissionRaw": 64136}, "2751": {"acRate": 57.06357083837843, "difficulty": "Hard", "likes": 1122, "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": 109808, "totalSubmissionRaw": 192431}, "2752": {"acRate": 38.56022808267997, "difficulty": "Hard", "likes": 13, "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": 1623, "totalSubmissionRaw": 4209}, "2753": {"acRate": 66.39042357274401, "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": 722, "totalSubmissionRaw": 1087}, "2754": {"acRate": 87.01657458563537, "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": 630, "totalSubmissionRaw": 724}, "2755": {"acRate": 64.80793060718712, "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": 523, "totalSubmissionRaw": 807}, "2756": {"acRate": 63.34056399132321, "difficulty": "Hard", "likes": 14, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2756", "paidOnly": true, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 292, "totalSubmissionRaw": 461}, "2757": {"acRate": 71.66064981949458, "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": 397, "totalSubmissionRaw": 554}, "2758": {"acRate": 84.08091468777485, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2758", "paidOnly": true, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 956, "totalSubmissionRaw": 1137}, "2759": {"acRate": 62.45398773006134, "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": 509, "totalSubmissionRaw": 815}, "2760": {"acRate": 29.907338288273667, "difficulty": "Easy", "likes": 295, "dislikes": 271, "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": 36859, "totalSubmissionRaw": 123244}, "2761": {"acRate": 34.49852507374631, "difficulty": "Medium", "likes": 363, "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": 30407, "totalSubmissionRaw": 88140}, "2762": {"acRate": 41.46977383430685, "difficulty": "Medium", "likes": 703, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2762", "paidOnly": false, "title": "Continuous Subarrays", "titleSlug": "continuous-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20518, "totalSubmissionRaw": 49477}, "2763": {"acRate": 46.848564279756935, "difficulty": "Hard", "likes": 306, "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": 7864, "totalSubmissionRaw": 16786}, "2764": {"acRate": 66.22325043377674, "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": 1145, "totalSubmissionRaw": 1729}, "2765": {"acRate": 34.23727446287881, "difficulty": "Easy", "likes": 215, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "2765", "paidOnly": false, "title": "Longest Alternating Subarray", "titleSlug": "longest-alternating-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25465, "totalSubmissionRaw": 74378}, "2766": {"acRate": 51.987313414050895, "difficulty": "Medium", "likes": 196, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2766", "paidOnly": false, "title": "Relocate Marbles", "titleSlug": "relocate-marbles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20653, "totalSubmissionRaw": 39727}, "2767": {"acRate": 53.662974431002006, "difficulty": "Medium", "likes": 354, "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": 16811, "totalSubmissionRaw": 31327}, "2768": {"acRate": 36.698925210721136, "difficulty": "Medium", "likes": 227, "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": 8229, "totalSubmissionRaw": 22423}, "2769": {"acRate": 90.79674300581377, "difficulty": "Easy", "likes": 354, "dislikes": 522, "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": 113068, "totalSubmissionRaw": 124529}, "2770": {"acRate": 31.422958563755493, "difficulty": "Medium", "likes": 426, "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": 27672, "totalSubmissionRaw": 88063}, "2771": {"acRate": 29.70928664407257, "difficulty": "Medium", "likes": 591, "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": 25333, "totalSubmissionRaw": 85272}, "2772": {"acRate": 33.375200964630224, "difficulty": "Medium", "likes": 388, "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": 13286, "totalSubmissionRaw": 39808}, "2773": {"acRate": 75.30747398297068, "difficulty": "Medium", "likes": 10, "dislikes": 37, "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": 796, "totalSubmissionRaw": 1057}, "2774": {"acRate": 81.92911098198722, "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": 1410, "totalSubmissionRaw": 1721}, "2775": {"acRate": 68.8701923076923, "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": 573, "totalSubmissionRaw": 832}, "2776": {"acRate": 91.76755447941889, "difficulty": "Medium", "likes": 17, "dislikes": 9, "categoryTitle": "JavaScript", "frontendQuestionId": "2776", "paidOnly": true, "title": "Convert Callback Based Function to Promise Based Function", "titleSlug": "convert-callback-based-function-to-promise-based-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 758, "totalSubmissionRaw": 826}, "2777": {"acRate": 81.12033195020747, "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": 391, "totalSubmissionRaw": 482}, "2778": {"acRate": 81.72639683039935, "difficulty": "Easy", "likes": 277, "dislikes": 111, "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": 72609, "totalSubmissionRaw": 88844}, "2779": {"acRate": 38.60268382407697, "difficulty": "Medium", "likes": 612, "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": 25919, "totalSubmissionRaw": 67143}, "2780": {"acRate": 62.34340073816084, "difficulty": "Medium", "likes": 336, "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": 23986, "totalSubmissionRaw": 38474}, "2781": {"acRate": 38.00899593041243, "difficulty": "Hard", "likes": 558, "dislikes": 24, "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": 31942, "totalSubmissionRaw": 84038}, "2782": {"acRate": 83.46953937592868, "difficulty": "Medium", "likes": 33, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2782", "paidOnly": true, "title": "Number of Unique Categories", "titleSlug": "number-of-unique-categories", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2247, "totalSubmissionRaw": 2692}, "2783": {"acRate": 37.5597413550745, "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": 2672, "totalSubmissionRaw": 7114}, "2784": {"acRate": 49.332734567961495, "difficulty": "Easy", "likes": 272, "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": 50533, "totalSubmissionRaw": 102433}, "2785": {"acRate": 81.30180983026113, "difficulty": "Medium", "likes": 1001, "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": 135935, "totalSubmissionRaw": 167198}, "2786": {"acRate": 36.26903414776139, "difficulty": "Medium", "likes": 478, "dislikes": 27, "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": 19936, "totalSubmissionRaw": 54967}, "2787": {"acRate": 33.99925877556783, "difficulty": "Medium", "likes": 403, "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": 19265, "totalSubmissionRaw": 56663}, "2788": {"acRate": 74.57030685802071, "difficulty": "Easy", "likes": 310, "dislikes": 12, "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": 56792, "totalSubmissionRaw": 76159}, "2789": {"acRate": 47.338023409419066, "difficulty": "Medium", "likes": 465, "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": 30818, "totalSubmissionRaw": 65102}, "2790": {"acRate": 20.289792387543255, "difficulty": "Hard", "likes": 402, "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": 9382, "totalSubmissionRaw": 46240}, "2791": {"acRate": 48.59109018471568, "difficulty": "Hard", "likes": 386, "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": 6708, "totalSubmissionRaw": 13805}, "2792": {"acRate": 58.55487389229721, "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": 859, "totalSubmissionRaw": 1467}, "2793": {"acRate": 75.1628664495114, "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": 1846, "totalSubmissionRaw": 2456}, "2794": {"acRate": 64.06443618339529, "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": 1034, "totalSubmissionRaw": 1614}, "2795": {"acRate": 88.1559220389805, "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": 588, "totalSubmissionRaw": 667}, "2796": {"acRate": 92.82617264485613, "difficulty": "Easy", "likes": 25, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2796", "paidOnly": true, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2355, "totalSubmissionRaw": 2537}, "2797": {"acRate": 90.69973427812224, "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": 1024, "totalSubmissionRaw": 1129}, "2798": {"acRate": 87.80231443792957, "difficulty": "Easy", "likes": 500, "dislikes": 69, "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": 170411, "totalSubmissionRaw": 194084}, "2799": {"acRate": 65.43616821845903, "difficulty": "Medium", "likes": 563, "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": 41887, "totalSubmissionRaw": 64012}, "2800": {"acRate": 30.753146176185865, "difficulty": "Medium", "likes": 323, "dislikes": 264, "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": 15884, "totalSubmissionRaw": 51650}, "2801": {"acRate": 28.130824687884648, "difficulty": "Hard", "likes": 332, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2801", "paidOnly": false, "title": "Count Stepping Numbers in Range", "titleSlug": "count-stepping-numbers-in-range", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7999, "totalSubmissionRaw": 28435}, "2802": {"acRate": 77.04732218758855, "difficulty": "Medium", "likes": 59, "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": 5438, "totalSubmissionRaw": 7058}, "2803": {"acRate": 86.52007648183556, "difficulty": "Easy", "likes": 18, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2803", "paidOnly": true, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 905, "totalSubmissionRaw": 1046}, "2804": {"acRate": 89.4, "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": 894, "totalSubmissionRaw": 1000}, "2805": {"acRate": 81.96078431372548, "difficulty": "Medium", "likes": 16, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2805", "paidOnly": true, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 418, "totalSubmissionRaw": 510}, "2806": {"acRate": 52.979740661145044, "difficulty": "Easy", "likes": 253, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2806", "paidOnly": false, "title": "Account Balance After Rounded Purchase", "titleSlug": "account-balance-after-rounded-purchase", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43881, "totalSubmissionRaw": 82826}, "2807": {"acRate": 88.83078602620087, "difficulty": "Medium", "likes": 544, "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": 81369, "totalSubmissionRaw": 91601}, "2808": {"acRate": 27.02917588495575, "difficulty": "Medium", "likes": 514, "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": 15638, "totalSubmissionRaw": 57856}, "2809": {"acRate": 26.72717774585347, "difficulty": "Hard", "likes": 233, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2809", "paidOnly": false, "title": "Minimum Time to Make Array Sum At Most x", "titleSlug": "minimum-time-to-make-array-sum-at-most-x", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4093, "totalSubmissionRaw": 15314}, "2810": {"acRate": 84.10855431221887, "difficulty": "Easy", "likes": 431, "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": 83958, "totalSubmissionRaw": 99821}, "2811": {"acRate": 33.84819873498946, "difficulty": "Medium", "likes": 499, "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": 29540, "totalSubmissionRaw": 87272}, "2812": {"acRate": 48.96236279443503, "difficulty": "Medium", "likes": 1599, "dislikes": 294, "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": 95057, "totalSubmissionRaw": 194143}, "2813": {"acRate": 33.338332333533295, "difficulty": "Hard", "likes": 307, "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": 6669, "totalSubmissionRaw": 20004}, "2814": {"acRate": 63.91394864677308, "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": 921, "totalSubmissionRaw": 1441}, "2815": {"acRate": 58.41225417926484, "difficulty": "Easy", "likes": 376, "dislikes": 123, "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": 46752, "totalSubmissionRaw": 80035}, "2816": {"acRate": 61.57871180668003, "difficulty": "Medium", "likes": 1143, "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": 169230, "totalSubmissionRaw": 274819}, "2817": {"acRate": 34.191662071530246, "difficulty": "Medium", "likes": 675, "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": 26663, "totalSubmissionRaw": 77981}, "2818": {"acRate": 32.6235812775537, "difficulty": "Hard", "likes": 326, "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": 6956, "totalSubmissionRaw": 21322}, "2819": {"acRate": 52.5965379494008, "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": 395, "totalSubmissionRaw": 751}, "2820": {"acRate": 66.30080094927321, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2820", "paidOnly": true, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2235, "totalSubmissionRaw": 3371}, "2821": {"acRate": 66.41468682505399, "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": 615, "totalSubmissionRaw": 926}, "2822": {"acRate": 58.48375451263538, "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": 810, "totalSubmissionRaw": 1385}, "2823": {"acRate": 53.20970042796006, "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": 373, "totalSubmissionRaw": 701}, "2824": {"acRate": 87.38870314056656, "difficulty": "Easy", "likes": 603, "dislikes": 67, "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": 167538, "totalSubmissionRaw": 191716}, "2825": {"acRate": 49.5397290215914, "difficulty": "Medium", "likes": 322, "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": 35357, "totalSubmissionRaw": 71371}, "2826": {"acRate": 42.32552337789235, "difficulty": "Medium", "likes": 495, "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": 20359, "totalSubmissionRaw": 48101}, "2827": {"acRate": 18.31540734161083, "difficulty": "Hard", "likes": 351, "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": 9485, "totalSubmissionRaw": 51787}, "2828": {"acRate": 83.16610830028715, "difficulty": "Easy", "likes": 320, "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": 97311, "totalSubmissionRaw": 117008}, "2829": {"acRate": 61.52438067676644, "difficulty": "Medium", "likes": 329, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2829", "paidOnly": false, "title": "Determine the Minimum Sum of a k-avoiding Array", "titleSlug": "determine-the-minimum-sum-of-a-k-avoiding-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35291, "totalSubmissionRaw": 57361}, "2830": {"acRate": 36.55548777471848, "difficulty": "Medium", "likes": 665, "dislikes": 22, "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": 22172, "totalSubmissionRaw": 60653}, "2831": {"acRate": 36.04173913043478, "difficulty": "Medium", "likes": 677, "dislikes": 17, "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": 20724, "totalSubmissionRaw": 57499}, "2832": {"acRate": 73.93645665051157, "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": 1373, "totalSubmissionRaw": 1857}, "2833": {"acRate": 64.99733191035219, "difficulty": "Easy", "likes": 239, "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": 48722, "totalSubmissionRaw": 74960}, "2834": {"acRate": 37.91129653083017, "difficulty": "Medium", "likes": 295, "dislikes": 53, "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": 30533, "totalSubmissionRaw": 80538}, "2835": {"acRate": 32.594817874577544, "difficulty": "Hard", "likes": 522, "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": 12152, "totalSubmissionRaw": 37282}, "2836": {"acRate": 31.45761833840575, "difficulty": "Hard", "likes": 292, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "2836", "paidOnly": false, "title": "Maximize Value of Function in a Ball Passing Game", "titleSlug": "maximize-value-of-function-in-a-ball-passing-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4858, "totalSubmissionRaw": 15443}, "2837": {"acRate": 75.7528148730034, "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": 2892, "totalSubmissionRaw": 3818}, "2838": {"acRate": 69.08616187989556, "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": 1323, "totalSubmissionRaw": 1915}, "2839": {"acRate": 47.29959574048511, "difficulty": "Easy", "likes": 182, "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": 38377, "totalSubmissionRaw": 81136}, "2840": {"acRate": 56.03704928878598, "difficulty": "Medium", "likes": 255, "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": 27104, "totalSubmissionRaw": 48368}, "2841": {"acRate": 38.252631578947366, "difficulty": "Medium", "likes": 276, "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": 25438, "totalSubmissionRaw": 66499}, "2842": {"acRate": 29.533179918283004, "difficulty": "Hard", "likes": 335, "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": 12577, "totalSubmissionRaw": 42586}, "2843": {"acRate": 74.5955530449246, "difficulty": "Easy", "likes": 254, "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": 47539, "totalSubmissionRaw": 63729}, "2844": {"acRate": 38.31444655114129, "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": 26068, "totalSubmissionRaw": 68037}, "2845": {"acRate": 35.78131982720095, "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": 14412, "totalSubmissionRaw": 40278}, "2846": {"acRate": 44.722706155632984, "difficulty": "Hard", "likes": 301, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2846", "paidOnly": false, "title": "Minimum Edge Weight Equilibrium Queries in a Tree", "titleSlug": "minimum-edge-weight-equilibrium-queries-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6161, "totalSubmissionRaw": 13776}, "2847": {"acRate": 43.688868188169536, "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": 938, "totalSubmissionRaw": 2147}, "2848": {"acRate": 75.4559790532298, "difficulty": "Easy", "likes": 273, "dislikes": 27, "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": 50720, "totalSubmissionRaw": 67218}, "2849": {"acRate": 35.7024256425065, "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": 98910, "totalSubmissionRaw": 277040}, "2850": {"acRate": 44.82349046868002, "difficulty": "Medium", "likes": 504, "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": 23020, "totalSubmissionRaw": 51357}, "2851": {"acRate": 29.861864468069722, "difficulty": "Hard", "likes": 165, "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": 4129, "totalSubmissionRaw": 13827}, "2852": {"acRate": 64.78260869565217, "difficulty": "Medium", "likes": 29, "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": 1192, "totalSubmissionRaw": 1840}, "2853": {"acRate": 73.7294201861131, "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": 3090, "totalSubmissionRaw": 4191}, "2854": {"acRate": 67.70626594839807, "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": 2388, "totalSubmissionRaw": 3527}, "2855": {"acRate": 58.15092504067495, "difficulty": "Easy", "likes": 216, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2855", "paidOnly": false, "title": "Minimum Right Shifts to Sort the Array", "titleSlug": "minimum-right-shifts-to-sort-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34668, "totalSubmissionRaw": 59617}, "2856": {"acRate": 22.88885001846345, "difficulty": "Medium", "likes": 370, "dislikes": 98, "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": 23554, "totalSubmissionRaw": 102906}, "2857": {"acRate": 32.249139022164655, "difficulty": "Medium", "likes": 266, "dislikes": 41, "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": 10956, "totalSubmissionRaw": 33973}, "2858": {"acRate": 58.79386849536103, "difficulty": "Hard", "likes": 304, "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": 8745, "totalSubmissionRaw": 14874}, "2859": {"acRate": 86.70795168240363, "difficulty": "Easy", "likes": 266, "dislikes": 43, "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": 73648, "totalSubmissionRaw": 84938}, "2860": {"acRate": 52.32280835638653, "difficulty": "Medium", "likes": 163, "dislikes": 294, "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": 21940, "totalSubmissionRaw": 41932}, "2861": {"acRate": 38.62313202586323, "difficulty": "Medium", "likes": 270, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2861", "paidOnly": false, "title": "Maximum Number of Alloys", "titleSlug": "maximum-number-of-alloys", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14396, "totalSubmissionRaw": 37273}, "2862": {"acRate": 44.273367294373536, "difficulty": "Hard", "likes": 208, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2862", "paidOnly": false, "title": "Maximum Element-Sum of a Complete Subset of Indices", "titleSlug": "maximum-element-sum-of-a-complete-subset-of-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7735, "totalSubmissionRaw": 17471}, "2863": {"acRate": 70.99342332987193, "difficulty": "Medium", "likes": 125, "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": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12306, "totalSubmissionRaw": 17334}, "2864": {"acRate": 83.18059277369841, "difficulty": "Easy", "likes": 768, "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": 205491, "totalSubmissionRaw": 247042}, "2865": {"acRate": 43.62855533652492, "difficulty": "Medium", "likes": 289, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2865", "paidOnly": false, "title": "Beautiful Towers I", "titleSlug": "beautiful-towers-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24788, "totalSubmissionRaw": 56816}, "2866": {"acRate": 34.954917173411616, "difficulty": "Medium", "likes": 403, "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": 13336, "totalSubmissionRaw": 38152}, "2867": {"acRate": 35.856493178372915, "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": 7096, "totalSubmissionRaw": 19790}, "2868": {"acRate": 59.16030534351145, "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": 465, "totalSubmissionRaw": 786}, "2869": {"acRate": 60.56220017086154, "difficulty": "Easy", "likes": 171, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2869", "paidOnly": false, "title": "Minimum Operations to Collect Elements", "titleSlug": "minimum-operations-to-collect-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36863, "totalSubmissionRaw": 60868}, "2870": {"acRate": 62.021363281476404, "difficulty": "Medium", "likes": 1388, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2870", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Empty", "titleSlug": "minimum-number-of-operations-to-make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 181912, "totalSubmissionRaw": 293306}, "2871": {"acRate": 44.1107549761629, "difficulty": "Medium", "likes": 223, "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": 16377, "totalSubmissionRaw": 37127}, "2872": {"acRate": 57.73141001756533, "difficulty": "Hard", "likes": 188, "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": 10846, "totalSubmissionRaw": 18787}, "2873": {"acRate": 45.926394575688484, "difficulty": "Easy", "likes": 164, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2873", "paidOnly": false, "title": "Maximum Value of an Ordered Triplet I", "titleSlug": "maximum-value-of-an-ordered-triplet-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38473, "totalSubmissionRaw": 83771}, "2874": {"acRate": 41.49928263988522, "difficulty": "Medium", "likes": 277, "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": 26611, "totalSubmissionRaw": 64124}, "2875": {"acRate": 30.942391984971824, "difficulty": "Medium", "likes": 369, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2875", "paidOnly": false, "title": "Minimum Size Subarray in Infinite Array", "titleSlug": "minimum-size-subarray-in-infinite-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19766, "totalSubmissionRaw": 63880}, "2876": {"acRate": 33.03869141239383, "difficulty": "Hard", "likes": 321, "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": 10503, "totalSubmissionRaw": 31790}, "2877": {"acRate": 81.20889979215646, "difficulty": "Easy", "likes": 190, "dislikes": 8, "categoryTitle": "pandas", "frontendQuestionId": "2877", "paidOnly": false, "title": "Create a DataFrame from List", "titleSlug": "create-a-dataframe-from-list", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119170, "totalSubmissionRaw": 146745}, "2878": {"acRate": 84.95152284959747, "difficulty": "Easy", "likes": 98, "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": 92960, "totalSubmissionRaw": 109428}, "2879": {"acRate": 92.9151150577676, "difficulty": "Easy", "likes": 81, "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": 97311, "totalSubmissionRaw": 104731}, "2880": {"acRate": 79.25732670612742, "difficulty": "Easy", "likes": 82, "dislikes": 8, "categoryTitle": "pandas", "frontendQuestionId": "2880", "paidOnly": false, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76856, "totalSubmissionRaw": 96971}, "2881": {"acRate": 90.13795164222216, "difficulty": "Easy", "likes": 72, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2881", "paidOnly": false, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72396, "totalSubmissionRaw": 80317}, "2882": {"acRate": 85.47265526695718, "difficulty": "Easy", "likes": 85, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2882", "paidOnly": false, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64529, "totalSubmissionRaw": 75497}, "2883": {"acRate": 63.971792635452786, "difficulty": "Easy", "likes": 66, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2883", "paidOnly": false, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60145, "totalSubmissionRaw": 94018}, "2884": {"acRate": 92.02163154089973, "difficulty": "Easy", "likes": 65, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2884", "paidOnly": false, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66191, "totalSubmissionRaw": 71930}, "2885": {"acRate": 85.29653851334162, "difficulty": "Easy", "likes": 55, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2885", "paidOnly": false, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56991, "totalSubmissionRaw": 66814}, "2886": {"acRate": 87.20707720299903, "difficulty": "Easy", "likes": 60, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2886", "paidOnly": false, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55595, "totalSubmissionRaw": 63751}, "2887": {"acRate": 71.8523010578802, "difficulty": "Easy", "likes": 58, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2887", "paidOnly": false, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53317, "totalSubmissionRaw": 74203}, "2888": {"acRate": 90.63354198004107, "difficulty": "Easy", "likes": 60, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2888", "paidOnly": false, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56034, "totalSubmissionRaw": 61825}, "2889": {"acRate": 82.19130191581597, "difficulty": "Easy", "likes": 82, "dislikes": 13, "categoryTitle": "pandas", "frontendQuestionId": "2889", "paidOnly": false, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47020, "totalSubmissionRaw": 57208}, "2890": {"acRate": 85.85258185056826, "difficulty": "Easy", "likes": 72, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2890", "paidOnly": false, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44342, "totalSubmissionRaw": 51649}, "2891": {"acRate": 76.25176943081937, "difficulty": "Easy", "likes": 66, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2891", "paidOnly": false, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46327, "totalSubmissionRaw": 60755}, "2892": {"acRate": 40.18058690744921, "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": 890, "totalSubmissionRaw": 2214}, "2893": {"acRate": 68.38466373350094, "difficulty": "Medium", "likes": 19, "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": 2176, "totalSubmissionRaw": 3182}, "2894": {"acRate": 89.2281594571671, "difficulty": "Easy", "likes": 218, "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": 91524, "totalSubmissionRaw": 102573}, "2895": {"acRate": 69.37025039219282, "difficulty": "Medium", "likes": 257, "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": 34049, "totalSubmissionRaw": 49083}, "2896": {"acRate": 27.121013172942522, "difficulty": "Medium", "likes": 353, "dislikes": 69, "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": 12806, "totalSubmissionRaw": 47218}, "2897": {"acRate": 47.20433751270755, "difficulty": "Hard", "likes": 182, "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": 6965, "totalSubmissionRaw": 14755}, "2898": {"acRate": 68.15834767641996, "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": 792, "totalSubmissionRaw": 1162}, "2899": {"acRate": 66.17621899059026, "difficulty": "Easy", "likes": 153, "dislikes": 208, "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": 27076, "totalSubmissionRaw": 40915}, "2900": {"acRate": 62.21331598715823, "difficulty": "Easy", "likes": 181, "dislikes": 82, "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": 29649, "totalSubmissionRaw": 47657}, "2901": {"acRate": 27.316619307465988, "difficulty": "Medium", "likes": 194, "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": 10863, "totalSubmissionRaw": 39767}, "2902": {"acRate": 21.335982120685372, "difficulty": "Hard", "likes": 150, "dislikes": 23, "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": 4296, "totalSubmissionRaw": 20135}, "2903": {"acRate": 61.80811808118081, "difficulty": "Easy", "likes": 137, "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": 40535, "totalSubmissionRaw": 65582}, "2904": {"acRate": 39.37753105519406, "difficulty": "Medium", "likes": 182, "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": 25962, "totalSubmissionRaw": 65931}, "2905": {"acRate": 32.277088284482, "difficulty": "Medium", "likes": 259, "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": 18335, "totalSubmissionRaw": 56805}, "2906": {"acRate": 30.939629378190137, "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": 12305, "totalSubmissionRaw": 39771}, "2907": {"acRate": 56.9835111542192, "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": 1175, "totalSubmissionRaw": 2062}, "2908": {"acRate": 65.24288418005715, "difficulty": "Easy", "likes": 156, "dislikes": 10, "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": 35162, "totalSubmissionRaw": 53894}, "2909": {"acRate": 54.18396822531143, "difficulty": "Medium", "likes": 190, "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": 24010, "totalSubmissionRaw": 44312}, "2910": {"acRate": 25.121085554052197, "difficulty": "Medium", "likes": 368, "dislikes": 179, "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": 12811, "totalSubmissionRaw": 50995}, "2911": {"acRate": 36.69164585067999, "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": 3966, "totalSubmissionRaw": 10809}, "2912": {"acRate": 61.384083044982695, "difficulty": "Hard", "likes": 15, "dislikes": 4, "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": 887, "totalSubmissionRaw": 1445}, "2913": {"acRate": 82.847718526663, "difficulty": "Easy", "likes": 148, "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": 34661, "totalSubmissionRaw": 41837}, "2914": {"acRate": 60.24906291626654, "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": 19449, "totalSubmissionRaw": 32281}, "2915": {"acRate": 36.11786701080392, "difficulty": "Medium", "likes": 224, "dislikes": 26, "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": 21828, "totalSubmissionRaw": 60437}, "2916": {"acRate": 21.525684816824057, "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": 3214, "totalSubmissionRaw": 14931}, "2917": {"acRate": 74.75548580556568, "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": 26675, "totalSubmissionRaw": 35683}, "2918": {"acRate": 35.565363544219345, "difficulty": "Medium", "likes": 178, "dislikes": 20, "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": 27720, "totalSubmissionRaw": 77941}, "2919": {"acRate": 34.52946826589168, "difficulty": "Medium", "likes": 317, "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": 14020, "totalSubmissionRaw": 40603}, "2920": {"acRate": 37.61095733511502, "difficulty": "Hard", "likes": 199, "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": 7881, "totalSubmissionRaw": 20954}, "2921": {"acRate": 49.140893470790374, "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": 429, "totalSubmissionRaw": 873}, "2922": {"acRate": 41.189142610943556, "difficulty": "Medium", "likes": 13, "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": 1912, "totalSubmissionRaw": 4642}, "2923": {"acRate": 73.69746122652931, "difficulty": "Easy", "likes": 140, "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": 38347, "totalSubmissionRaw": 52033}, "2924": {"acRate": 58.84193026206413, "difficulty": "Medium", "likes": 155, "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": 26899, "totalSubmissionRaw": 45714}, "2925": {"acRate": 49.75812547241119, "difficulty": "Medium", "likes": 321, "dislikes": 67, "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": 13166, "totalSubmissionRaw": 26460}, "2926": {"acRate": 24.34710743801653, "difficulty": "Hard", "likes": 195, "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": 5892, "totalSubmissionRaw": 24200}, "2927": {"acRate": 44.0, "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": 539, "totalSubmissionRaw": 1225}, "2928": {"acRate": 76.06731518632913, "difficulty": "Easy", "likes": 103, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2928", "paidOnly": false, "title": "Distribute Candies Among Children I", "titleSlug": "distribute-candies-among-children-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26352, "totalSubmissionRaw": 34643}, "2929": {"acRate": 35.46125356930819, "difficulty": "Medium", "likes": 92, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "2929", "paidOnly": false, "title": "Distribute Candies Among Children II", "titleSlug": "distribute-candies-among-children-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12543, "totalSubmissionRaw": 35371}, "2930": {"acRate": 56.58976398833201, "difficulty": "Medium", "likes": 167, "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": 6402, "totalSubmissionRaw": 11313}, "2931": {"acRate": 65.57317952415285, "difficulty": "Hard", "likes": 93, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2931", "paidOnly": false, "title": "Maximum Spending After Buying Items", "titleSlug": "maximum-spending-after-buying-items", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10914, "totalSubmissionRaw": 16644}, "2932": {"acRate": 76.37702446755054, "difficulty": "Easy", "likes": 145, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2932", "paidOnly": false, "title": "Maximum Strong Pair XOR I", "titleSlug": "maximum-strong-pair-xor-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39519, "totalSubmissionRaw": 51742}, "2933": {"acRate": 44.63863765990385, "difficulty": "Medium", "likes": 190, "dislikes": 20, "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": 21912, "totalSubmissionRaw": 49090}, "2934": {"acRate": 45.15472904256865, "difficulty": "Medium", "likes": 181, "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": 12432, "totalSubmissionRaw": 27532}, "2935": {"acRate": 30.6688654993452, "difficulty": "Hard", "likes": 175, "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": 6323, "totalSubmissionRaw": 20617}, "2936": {"acRate": 66.40855457227138, "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": 1801, "totalSubmissionRaw": 2712}, "2937": {"acRate": 43.51027193919962, "difficulty": "Easy", "likes": 297, "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": 29312, "totalSubmissionRaw": 67368}, "2938": {"acRate": 53.55798725172406, "difficulty": "Medium", "likes": 188, "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": 24619, "totalSubmissionRaw": 45967}, "2939": {"acRate": 26.557964828410448, "difficulty": "Medium", "likes": 202, "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": 9333, "totalSubmissionRaw": 35142}, "2940": {"acRate": 35.710688022564725, "difficulty": "Hard", "likes": 231, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2940", "paidOnly": false, "title": "Find Building Where Alice and Bob Can Meet", "titleSlug": "find-building-where-alice-and-bob-can-meet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7090, "totalSubmissionRaw": 19854}, "2941": {"acRate": 46.500593119810205, "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": 392, "totalSubmissionRaw": 843}, "2942": {"acRate": 88.6839669534812, "difficulty": "Easy", "likes": 347, "dislikes": 28, "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": 155220, "totalSubmissionRaw": 175026}, "2943": {"acRate": 37.129568523930736, "difficulty": "Medium", "likes": 224, "dislikes": 148, "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": 11815, "totalSubmissionRaw": 31821}, "2944": {"acRate": 46.413707987715625, "difficulty": "Medium", "likes": 257, "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": 16171, "totalSubmissionRaw": 34841}, "2945": {"acRate": 16.56446540880503, "difficulty": "Hard", "likes": 165, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2945", "paidOnly": false, "title": "Find Maximum Non-decreasing Array Length", "titleSlug": "find-maximum-non-decreasing-array-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4214, "totalSubmissionRaw": 25440}, "2946": {"acRate": 58.46929102429777, "difficulty": "Easy", "likes": 172, "dislikes": 64, "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": 23438, "totalSubmissionRaw": 40086}, "2947": {"acRate": 62.11937741811631, "difficulty": "Medium", "likes": 139, "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": 21033, "totalSubmissionRaw": 33859}, "2948": {"acRate": 39.929589707927676, "difficulty": "Medium", "likes": 260, "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": 9187, "totalSubmissionRaw": 23008}, "2949": {"acRate": 25.39907942415043, "difficulty": "Hard", "likes": 180, "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": 5185, "totalSubmissionRaw": 20420}, "2950": {"acRate": 76.21878715814506, "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": 1282, "totalSubmissionRaw": 1682}, "2951": {"acRate": 75.78058441073163, "difficulty": "Easy", "likes": 157, "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": 50701, "totalSubmissionRaw": 66905}, "2952": {"acRate": 57.59410895030138, "difficulty": "Medium", "likes": 352, "dislikes": 56, "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": 20257, "totalSubmissionRaw": 35169}, "2953": {"acRate": 28.17243949319421, "difficulty": "Hard", "likes": 201, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2953", "paidOnly": false, "title": "Count Complete Substrings", "titleSlug": "count-complete-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7182, "totalSubmissionRaw": 25493}, "2954": {"acRate": 37.05709772060483, "difficulty": "Hard", "likes": 115, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2954", "paidOnly": false, "title": "Count the Number of Infection Sequences", "titleSlug": "count-the-number-of-infection-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3284, "totalSubmissionRaw": 8862}, "2955": {"acRate": 57.10966542750929, "difficulty": "Medium", "likes": 34, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2955", "paidOnly": true, "title": "Number of Same-End Substrings", "titleSlug": "number-of-same-end-substrings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2458, "totalSubmissionRaw": 4304}, "2956": {"acRate": 83.84193484437984, "difficulty": "Easy", "likes": 221, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2956", "paidOnly": false, "title": "Find Common Elements Between Two Arrays", "titleSlug": "find-common-elements-between-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63439, "totalSubmissionRaw": 75665}, "2957": {"acRate": 52.87621676940286, "difficulty": "Medium", "likes": 166, "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": 22217, "totalSubmissionRaw": 42017}, "2958": {"acRate": 55.82611477049991, "difficulty": "Medium", "likes": 1036, "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": 150098, "totalSubmissionRaw": 268867}, "2959": {"acRate": 51.56543067378445, "difficulty": "Hard", "likes": 159, "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": 7148, "totalSubmissionRaw": 13862}, "2960": {"acRate": 80.79953983318953, "difficulty": "Easy", "likes": 141, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2960", "paidOnly": false, "title": "Count Tested Devices After Test Operations", "titleSlug": "count-tested-devices-after-test-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42141, "totalSubmissionRaw": 52155}, "2961": {"acRate": 48.20626284062944, "difficulty": "Medium", "likes": 112, "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": 21352, "totalSubmissionRaw": 44293}, "2962": {"acRate": 58.91010852864209, "difficulty": "Medium", "likes": 1219, "dislikes": 60, "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": 133042, "totalSubmissionRaw": 225839}, "2963": {"acRate": 49.976811056488266, "difficulty": "Hard", "likes": 241, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2963", "paidOnly": false, "title": "Count the Number of Good Partitions", "titleSlug": "count-the-number-of-good-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10776, "totalSubmissionRaw": 21562}, "2964": {"acRate": 66.51340996168582, "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": 1736, "totalSubmissionRaw": 2610}, "2965": {"acRate": 76.0527978857865, "difficulty": "Easy", "likes": 202, "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": 52951, "totalSubmissionRaw": 69624}, "2966": {"acRate": 71.74381815100097, "difficulty": "Medium", "likes": 831, "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": 152381, "totalSubmissionRaw": 212396}, "2967": {"acRate": 22.34665395874464, "difficulty": "Medium", "likes": 224, "dislikes": 88, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13130, "totalSubmissionRaw": 58756}, "2968": {"acRate": 38.672292880066564, "difficulty": "Hard", "likes": 240, "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": 6507, "totalSubmissionRaw": 16826}, "2969": {"acRate": 53.562005277044854, "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": 609, "totalSubmissionRaw": 1137}, "2970": {"acRate": 52.36937078299074, "difficulty": "Easy", "likes": 148, "dislikes": 94, "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": 20025, "totalSubmissionRaw": 38238}, "2971": {"acRate": 66.10376896720508, "difficulty": "Medium", "likes": 783, "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": 135050, "totalSubmissionRaw": 204300}, "2972": {"acRate": 40.231824118415325, "difficulty": "Hard", "likes": 195, "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": 7393, "totalSubmissionRaw": 18376}, "2973": {"acRate": 37.32234350634885, "difficulty": "Hard", "likes": 176, "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": 8377, "totalSubmissionRaw": 22445}, "2974": {"acRate": 85.99519824259568, "difficulty": "Easy", "likes": 231, "dislikes": 18, "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": 88469, "totalSubmissionRaw": 102873}, "2975": {"acRate": 23.087975964992488, "difficulty": "Medium", "likes": 136, "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": 14140, "totalSubmissionRaw": 61244}, "2976": {"acRate": 58.55858994008639, "difficulty": "Medium", "likes": 863, "dislikes": 60, "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": 100866, "totalSubmissionRaw": 172248}, "2977": {"acRate": 25.87192531599098, "difficulty": "Hard", "likes": 95, "dislikes": 74, "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": 4933, "totalSubmissionRaw": 19067}, "2978": {"acRate": 42.223572296476306, "difficulty": "Medium", "likes": 9, "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": 1390, "totalSubmissionRaw": 3292}, "2979": {"acRate": 77.58221398795739, "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": 1675, "totalSubmissionRaw": 2159}, "2980": {"acRate": 70.98543909582148, "difficulty": "Easy", "likes": 107, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2980", "paidOnly": false, "title": "Check if Bitwise OR Has Trailing Zeros", "titleSlug": "check-if-bitwise-or-has-trailing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34418, "totalSubmissionRaw": 48486}, "2981": {"acRate": 43.43345406519521, "difficulty": "Medium", "likes": 165, "dislikes": 12, "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": 21702, "totalSubmissionRaw": 49955}, "2982": {"acRate": 34.111230154865105, "difficulty": "Medium", "likes": 250, "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": 17511, "totalSubmissionRaw": 51335}, "2983": {"acRate": 26.1563651248465, "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": 3195, "totalSubmissionRaw": 12215}, "2984": {"acRate": 61.05752054305109, "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": 1709, "totalSubmissionRaw": 2799}, "2985": {"acRate": 87.40219092331768, "difficulty": "Easy", "likes": 7, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2985", "paidOnly": true, "title": "Calculate Compressed Mean", "titleSlug": "calculate-compressed-mean", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2234, "totalSubmissionRaw": 2556}, "2986": {"acRate": 52.17016384018396, "difficulty": "Medium", "likes": 7, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2986", "paidOnly": true, "title": "Find Third Transaction", "titleSlug": "find-third-transaction", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1815, "totalSubmissionRaw": 3479}, "2987": {"acRate": 79.7464016449623, "difficulty": "Easy", "likes": 8, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2987", "paidOnly": true, "title": "Find Expensive Cities", "titleSlug": "find-expensive-cities", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2327, "totalSubmissionRaw": 2918}, "2988": {"acRate": 80.13117283950618, "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": 2077, "totalSubmissionRaw": 2592}, "2989": {"acRate": 89.02654867256638, "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": 2515, "totalSubmissionRaw": 2825}, "2990": {"acRate": 61.79493607420407, "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": 2465, "totalSubmissionRaw": 3989}, "2991": {"acRate": 53.96694214876033, "difficulty": "Hard", "likes": 9, "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": 1306, "totalSubmissionRaw": 2420}, "2992": {"acRate": 72.63936291240046, "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": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1277, "totalSubmissionRaw": 1758}, "2993": {"acRate": 80.72986203827325, "difficulty": "Medium", "likes": 10, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2993", "paidOnly": true, "title": "Friday Purchases I", "titleSlug": "friday-purchases-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1814, "totalSubmissionRaw": 2247}, "2994": {"acRate": 74.33290978398983, "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": 1170, "totalSubmissionRaw": 1574}, "2995": {"acRate": 42.52158894645942, "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": 1231, "totalSubmissionRaw": 2895}, "2996": {"acRate": 32.77081859419867, "difficulty": "Easy", "likes": 111, "dislikes": 238, "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": 31498, "totalSubmissionRaw": 96116}, "2997": {"acRate": 86.39170571916681, "difficulty": "Medium", "likes": 574, "dislikes": 55, "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": 110241, "totalSubmissionRaw": 127606}, "2998": {"acRate": 47.11022748289255, "difficulty": "Medium", "likes": 246, "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": 20378, "totalSubmissionRaw": 43256}, "2999": {"acRate": 26.37241379310345, "difficulty": "Hard", "likes": 106, "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": 4780, "totalSubmissionRaw": 18125}, "3000": {"acRate": 36.34515909391165, "difficulty": "Easy", "likes": 103, "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": 35764, "totalSubmissionRaw": 98401}, "3001": {"acRate": 21.109524540058295, "difficulty": "Medium", "likes": 152, "dislikes": 196, "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": 17888, "totalSubmissionRaw": 84739}, "3002": {"acRate": 45.986488033894425, "difficulty": "Medium", "likes": 281, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3002", "paidOnly": false, "title": "Maximum Size of a Set After Removals", "titleSlug": "maximum-size-of-a-set-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16064, "totalSubmissionRaw": 34932}, "3003": {"acRate": 28.51145999496264, "difficulty": "Hard", "likes": 134, "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": 3396, "totalSubmissionRaw": 11911}, "3004": {"acRate": 64.65686274509804, "difficulty": "Medium", "likes": 18, "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": 1319, "totalSubmissionRaw": 2040}, "3005": {"acRate": 78.72049492034044, "difficulty": "Easy", "likes": 643, "dislikes": 69, "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": 213009, "totalSubmissionRaw": 270589}, "3006": {"acRate": 36.58522988585843, "difficulty": "Medium", "likes": 154, "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": 26251, "totalSubmissionRaw": 71753}, "3007": {"acRate": 36.81892138576928, "difficulty": "Medium", "likes": 293, "dislikes": 116, "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": 9278, "totalSubmissionRaw": 25199}, "3008": {"acRate": 24.74489189124902, "difficulty": "Hard", "likes": 164, "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": 10403, "totalSubmissionRaw": 42041}, "3009": {"acRate": 45.87305569493226, "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": 3657, "totalSubmissionRaw": 7972}, "3010": {"acRate": 66.60077879464727, "difficulty": "Easy", "likes": 93, "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": 33694, "totalSubmissionRaw": 50591}, "3011": {"acRate": 51.62640543248358, "difficulty": "Medium", "likes": 120, "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": 23188, "totalSubmissionRaw": 44915}, "3012": {"acRate": 35.50532251131508, "difficulty": "Medium", "likes": 164, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3012", "paidOnly": false, "title": "Minimize Length of Array Using Operations", "titleSlug": "minimize-length-of-array-using-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14042, "totalSubmissionRaw": 39549}, "3013": {"acRate": 32.375, "difficulty": "Hard", "likes": 115, "dislikes": 18, "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": 5180, "totalSubmissionRaw": 16000}, "3014": {"acRate": 66.61847363462101, "difficulty": "Easy", "likes": 162, "dislikes": 27, "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": 41009, "totalSubmissionRaw": 61558}, "3015": {"acRate": 56.60781476121562, "difficulty": "Medium", "likes": 151, "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": 19558, "totalSubmissionRaw": 34550}, "3016": {"acRate": 80.74853560592958, "difficulty": "Medium", "likes": 731, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "3016", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word II", "titleSlug": "minimum-number-of-pushes-to-type-word-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172730, "totalSubmissionRaw": 213911}, "3017": {"acRate": 22.166355408705645, "difficulty": "Hard", "likes": 80, "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": 3086, "totalSubmissionRaw": 13922}, "3018": {"acRate": 44.04040404040404, "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": 436, "totalSubmissionRaw": 990}, "3019": {"acRate": 81.05717232971773, "difficulty": "Easy", "likes": 114, "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": 51860, "totalSubmissionRaw": 63980}, "3020": {"acRate": 24.823209651830624, "difficulty": "Medium", "likes": 172, "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": 20184, "totalSubmissionRaw": 81311}, "3021": {"acRate": 47.910937424615234, "difficulty": "Medium", "likes": 90, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "3021", "paidOnly": false, "title": "Alice and Bob Playing Flower Game", "titleSlug": "alice-and-bob-playing-flower-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19861, "totalSubmissionRaw": 41454}, "3022": {"acRate": 34.31750578384929, "difficulty": "Hard", "likes": 90, "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": 3115, "totalSubmissionRaw": 9077}, "3023": {"acRate": 59.154929577464785, "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": 924, "totalSubmissionRaw": 1562}, "3024": {"acRate": 38.3584385146847, "difficulty": "Easy", "likes": 93, "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": 47136, "totalSubmissionRaw": 122883}, "3025": {"acRate": 41.37523280219943, "difficulty": "Medium", "likes": 83, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "3025", "paidOnly": false, "title": "Find the Number of Ways to Place People I", "titleSlug": "find-the-number-of-ways-to-place-people-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13996, "totalSubmissionRaw": 33827}, "3026": {"acRate": 18.595016690510253, "difficulty": "Medium", "likes": 326, "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": 18716, "totalSubmissionRaw": 100652}, "3027": {"acRate": 47.88251001335114, "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": 8966, "totalSubmissionRaw": 18725}, "3028": {"acRate": 74.80373369598813, "difficulty": "Easy", "likes": 105, "dislikes": 37, "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": 48404, "totalSubmissionRaw": 64708}, "3029": {"acRate": 41.06373373825256, "difficulty": "Medium", "likes": 141, "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": 20012, "totalSubmissionRaw": 48734}, "3030": {"acRate": 44.41151376352778, "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": 9890, "totalSubmissionRaw": 22269}, "3031": {"acRate": 35.628829880361835, "difficulty": "Hard", "likes": 130, "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": 10989, "totalSubmissionRaw": 30843}, "3032": {"acRate": 87.48730448913264, "difficulty": "Easy", "likes": 23, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3032", "paidOnly": true, "title": "Count Numbers With Unique Digits II", "titleSlug": "count-numbers-with-unique-digits-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4306, "totalSubmissionRaw": 4922}, "3033": {"acRate": 68.5752647053825, "difficulty": "Easy", "likes": 110, "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": 40349, "totalSubmissionRaw": 58839}, "3034": {"acRate": 66.92961786702182, "difficulty": "Medium", "likes": 91, "dislikes": 9, "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": 26132, "totalSubmissionRaw": 39044}, "3035": {"acRate": 42.80762060125845, "difficulty": "Medium", "likes": 210, "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": 14695, "totalSubmissionRaw": 34328}, "3036": {"acRate": 32.75177725118483, "difficulty": "Hard", "likes": 142, "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": 11057, "totalSubmissionRaw": 33760}, "3037": {"acRate": 71.15384615384616, "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": 814, "totalSubmissionRaw": 1144}, "3038": {"acRate": 52.23124510691862, "difficulty": "Easy", "likes": 75, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3038", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score I", "titleSlug": "maximum-number-of-operations-with-the-same-score-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34024, "totalSubmissionRaw": 65142}, "3039": {"acRate": 56.898760285720485, "difficulty": "Medium", "likes": 131, "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": 26207, "totalSubmissionRaw": 46059}, "3040": {"acRate": 33.494698403658354, "difficulty": "Medium", "likes": 153, "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": 19996, "totalSubmissionRaw": 59699}, "3041": {"acRate": 32.373527809212455, "difficulty": "Hard", "likes": 150, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3041", "paidOnly": false, "title": "Maximize Consecutive Elements in an Array After Modification", "titleSlug": "maximize-consecutive-elements-in-an-array-after-modification", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7724, "totalSubmissionRaw": 23859}, "3042": {"acRate": 65.54932298462947, "difficulty": "Easy", "likes": 103, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3042", "paidOnly": false, "title": "Count Prefix and Suffix Pairs I", "titleSlug": "count-prefix-and-suffix-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38679, "totalSubmissionRaw": 59008}, "3043": {"acRate": 35.940420310738894, "difficulty": "Medium", "likes": 168, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3043", "paidOnly": false, "title": "Find the Length of the Longest Common Prefix", "titleSlug": "find-the-length-of-the-longest-common-prefix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25190, "totalSubmissionRaw": 70090}, "3044": {"acRate": 48.49040193824936, "difficulty": "Medium", "likes": 87, "dislikes": 65, "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": 15611, "totalSubmissionRaw": 32194}, "3045": {"acRate": 25.201809633637893, "difficulty": "Hard", "likes": 155, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3045", "paidOnly": false, "title": "Count Prefix and Suffix Pairs II", "titleSlug": "count-prefix-and-suffix-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8523, "totalSubmissionRaw": 33819}, "3046": {"acRate": 58.78810949233484, "difficulty": "Easy", "likes": 107, "dislikes": 10, "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": 50964, "totalSubmissionRaw": 86691}, "3047": {"acRate": 45.59725231662902, "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": 19781, "totalSubmissionRaw": 43382}, "3048": {"acRate": 36.23588240365549, "difficulty": "Medium", "likes": 173, "dislikes": 81, "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": 8406, "totalSubmissionRaw": 23198}, "3049": {"acRate": 22.890778286461742, "difficulty": "Hard", "likes": 74, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3049", "paidOnly": false, "title": "Earliest Second to Mark Indices II", "titleSlug": "earliest-second-to-mark-indices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2450, "totalSubmissionRaw": 10703}, "3050": {"acRate": 68.90120967741935, "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": 1367, "totalSubmissionRaw": 1984}, "3051": {"acRate": 74.53255963894262, "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": 2312, "totalSubmissionRaw": 3102}, "3052": {"acRate": 74.00921658986175, "difficulty": "Hard", "likes": 4, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "3052", "paidOnly": true, "title": "Maximize Items", "titleSlug": "maximize-items", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 803, "totalSubmissionRaw": 1085}, "3053": {"acRate": 49.74763406940063, "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": 1577, "totalSubmissionRaw": 3170}, "3054": {"acRate": 80.29014507253626, "difficulty": "Medium", "likes": 10, "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": 1605, "totalSubmissionRaw": 1999}, "3055": {"acRate": 60.485754320411026, "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": 1295, "totalSubmissionRaw": 2141}, "3056": {"acRate": 59.022887323943664, "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": 1341, "totalSubmissionRaw": 2272}, "3057": {"acRate": 68.42105263157895, "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": 1027, "totalSubmissionRaw": 1501}, "3058": {"acRate": 51.187335092348285, "difficulty": "Medium", "likes": 10, "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": 1164, "totalSubmissionRaw": 2274}, "3059": {"acRate": 67.65714285714286, "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": 1776, "totalSubmissionRaw": 2625}, "3060": {"acRate": 39.83157894736842, "difficulty": "Hard", "likes": 3, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "3060", "paidOnly": true, "title": "User Activities within Time Bounds", "titleSlug": "user-activities-within-time-bounds", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 946, "totalSubmissionRaw": 2375}, "3061": {"acRate": 77.88461538461539, "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": 648, "totalSubmissionRaw": 832}, "3062": {"acRate": 80.19266055045871, "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": 8741, "totalSubmissionRaw": 10900}, "3063": {"acRate": 86.14999135994469, "difficulty": "Easy", "likes": 37, "dislikes": 19, "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": 9971, "totalSubmissionRaw": 11574}, "3064": {"acRate": 90.9090909090909, "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": 1150, "totalSubmissionRaw": 1265}, "3065": {"acRate": 86.27961149177894, "difficulty": "Easy", "likes": 87, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3065", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value I", "titleSlug": "minimum-operations-to-exceed-threshold-value-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63337, "totalSubmissionRaw": 73409}, "3066": {"acRate": 27.868128416775445, "difficulty": "Medium", "likes": 86, "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": 28394, "totalSubmissionRaw": 101887}, "3067": {"acRate": 58.081093823668084, "difficulty": "Medium", "likes": 191, "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": 12319, "totalSubmissionRaw": 21210}, "3068": {"acRate": 66.83963638756498, "difficulty": "Hard", "likes": 636, "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": 71102, "totalSubmissionRaw": 106377}, "3069": {"acRate": 72.91167465388712, "difficulty": "Easy", "likes": 76, "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": 43817, "totalSubmissionRaw": 60096}, "3070": {"acRate": 59.591137505710364, "difficulty": "Medium", "likes": 137, "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": 26089, "totalSubmissionRaw": 43780}, "3071": {"acRate": 63.0307792163427, "difficulty": "Medium", "likes": 92, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3071", "paidOnly": false, "title": "Minimum Operations to Write the Letter Y on a Grid", "titleSlug": "minimum-operations-to-write-the-letter-y-on-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18451, "totalSubmissionRaw": 29273}, "3072": {"acRate": 27.883705206220423, "difficulty": "Hard", "likes": 131, "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": 10310, "totalSubmissionRaw": 36975}, "3073": {"acRate": 41.00227790432802, "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": 720, "totalSubmissionRaw": 1756}, "3074": {"acRate": 67.2781442860183, "difficulty": "Easy", "likes": 91, "dislikes": 5, "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": 47421, "totalSubmissionRaw": 70485}, "3075": {"acRate": 55.01999406179523, "difficulty": "Medium", "likes": 644, "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": 174190, "totalSubmissionRaw": 316594}, "3076": {"acRate": 46.01211562244534, "difficulty": "Medium", "likes": 129, "dislikes": 17, "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": 21949, "totalSubmissionRaw": 47705}, "3077": {"acRate": 28.02316841314056, "difficulty": "Hard", "likes": 134, "dislikes": 74, "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": 6338, "totalSubmissionRaw": 22617}, "3078": {"acRate": 68.17073170731707, "difficulty": "Medium", "likes": 8, "dislikes": 3, "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": 559, "totalSubmissionRaw": 820}, "3079": {"acRate": 74.5941005400914, "difficulty": "Easy", "likes": 99, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3079", "paidOnly": false, "title": "Find the Sum of Encrypted Integers", "titleSlug": "find-the-sum-of-encrypted-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44887, "totalSubmissionRaw": 60175}, "3080": {"acRate": 49.470396523628466, "difficulty": "Medium", "likes": 112, "dislikes": 21, "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": 18215, "totalSubmissionRaw": 36820}, "3081": {"acRate": 27.57691443970357, "difficulty": "Medium", "likes": 161, "dislikes": 26, "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": 13508, "totalSubmissionRaw": 48983}, "3082": {"acRate": 39.2939411796218, "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": 7335, "totalSubmissionRaw": 18667}, "3083": {"acRate": 66.26640811455847, "difficulty": "Easy", "likes": 89, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3083", "paidOnly": false, "title": "Existence of a Substring in a String and Its Reverse", "titleSlug": "existence-of-a-substring-in-a-string-and-its-reverse", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44425, "totalSubmissionRaw": 67040}, "3084": {"acRate": 48.90440773924771, "difficulty": "Medium", "likes": 110, "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": 36625, "totalSubmissionRaw": 74891}, "3085": {"acRate": 44.146357808206936, "difficulty": "Medium", "likes": 197, "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": 19763, "totalSubmissionRaw": 44767}, "3086": {"acRate": 23.36021914472683, "difficulty": "Hard", "likes": 50, "dislikes": 48, "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": 3070, "totalSubmissionRaw": 13142}, "3087": {"acRate": 62.61904761904762, "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": 1052, "totalSubmissionRaw": 1680}, "3088": {"acRate": 53.558052434456926, "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": 429, "totalSubmissionRaw": 801}, "3089": {"acRate": 39.946260635915806, "difficulty": "Medium", "likes": 7, "dislikes": 16, "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": 892, "totalSubmissionRaw": 2233}, "3090": {"acRate": 63.92743979721166, "difficulty": "Easy", "likes": 169, "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": 40350, "totalSubmissionRaw": 63118}, "3091": {"acRate": 44.657719852893734, "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": 27686, "totalSubmissionRaw": 61996}, "3092": {"acRate": 42.740782461765086, "difficulty": "Medium", "likes": 224, "dislikes": 29, "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": 19730, "totalSubmissionRaw": 46162}, "3093": {"acRate": 41.45904362269429, "difficulty": "Hard", "likes": 125, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3093", "paidOnly": false, "title": "Longest Common Suffix Queries", "titleSlug": "longest-common-suffix-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9485, "totalSubmissionRaw": 22878}, "3094": {"acRate": 81.35338345864662, "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": 541, "totalSubmissionRaw": 665}, "3095": {"acRate": 41.16196663221615, "difficulty": "Easy", "likes": 86, "dislikes": 12, "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": 27879, "totalSubmissionRaw": 67730}, "3096": {"acRate": 40.7479878904231, "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": 22074, "totalSubmissionRaw": 54172}, "3097": {"acRate": 30.485284205796447, "difficulty": "Medium", "likes": 189, "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": 13569, "totalSubmissionRaw": 44507}, "3098": {"acRate": 24.592329184658368, "difficulty": "Hard", "likes": 123, "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": 4841, "totalSubmissionRaw": 19684}, "3099": {"acRate": 83.07675540176017, "difficulty": "Easy", "likes": 122, "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": 60980, "totalSubmissionRaw": 73402}, "3100": {"acRate": 63.83890160183066, "difficulty": "Medium", "likes": 137, "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": 34872, "totalSubmissionRaw": 54625}, "3101": {"acRate": 57.26597762804998, "difficulty": "Medium", "likes": 207, "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": 35017, "totalSubmissionRaw": 61148}, "3102": {"acRate": 32.73504602703848, "difficulty": "Hard", "likes": 164, "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": 8499, "totalSubmissionRaw": 25963}, "3103": {"acRate": 65.34883720930232, "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": 562, "totalSubmissionRaw": 860}, "3104": {"acRate": 57.271702367531006, "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": 508, "totalSubmissionRaw": 887}, "3105": {"acRate": 57.08056420178907, "difficulty": "Easy", "likes": 114, "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": 40711, "totalSubmissionRaw": 71322}, "3106": {"acRate": 63.599727980253384, "difficulty": "Medium", "likes": 144, "dislikes": 19, "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": 25251, "totalSubmissionRaw": 39703}, "3107": {"acRate": 48.583443564786485, "difficulty": "Medium", "likes": 133, "dislikes": 179, "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": 24608, "totalSubmissionRaw": 50651}, "3108": {"acRate": 45.88468729728699, "difficulty": "Hard", "likes": 181, "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": 12025, "totalSubmissionRaw": 26207}, "3109": {"acRate": 41.743589743589745, "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": 407, "totalSubmissionRaw": 975}, "3110": {"acRate": 93.07756434988701, "difficulty": "Easy", "likes": 581, "dislikes": 37, "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": 270186, "totalSubmissionRaw": 290281}, "3111": {"acRate": 63.89975373026221, "difficulty": "Medium", "likes": 88, "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": 26466, "totalSubmissionRaw": 41418}, "3112": {"acRate": 34.78468372554058, "difficulty": "Medium", "likes": 157, "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": 18950, "totalSubmissionRaw": 54478}, "3113": {"acRate": 30.205439726487377, "difficulty": "Hard", "likes": 204, "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": 9895, "totalSubmissionRaw": 32759}, "3114": {"acRate": 35.66471800479455, "difficulty": "Easy", "likes": 92, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3114", "paidOnly": false, "title": "Latest Time You Can Obtain After Replacing Characters", "titleSlug": "latest-time-you-can-obtain-after-replacing-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33920, "totalSubmissionRaw": 95108}, "3115": {"acRate": 58.353926827798205, "difficulty": "Medium", "likes": 103, "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": 38726, "totalSubmissionRaw": 66364}, "3116": {"acRate": 16.75303986610474, "difficulty": "Hard", "likes": 212, "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": 8308, "totalSubmissionRaw": 49591}, "3117": {"acRate": 28.14174589455488, "difficulty": "Hard", "likes": 113, "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": 4884, "totalSubmissionRaw": 17355}, "3118": {"acRate": 60.70901033973413, "difficulty": "Medium", "likes": 3, "dislikes": 5, "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": 822, "totalSubmissionRaw": 1354}, "3119": {"acRate": 60.4635761589404, "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": 913, "totalSubmissionRaw": 1510}, "3120": {"acRate": 65.71943483275663, "difficulty": "Easy", "likes": 126, "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": 45583, "totalSubmissionRaw": 69360}, "3121": {"acRate": 41.57654409997596, "difficulty": "Medium", "likes": 145, "dislikes": 13, "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": 31140, "totalSubmissionRaw": 74898}, "3122": {"acRate": 41.28992001815191, "difficulty": "Medium", "likes": 214, "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": 14558, "totalSubmissionRaw": 35258}, "3123": {"acRate": 48.57902269474545, "difficulty": "Hard", "likes": 230, "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": 11879, "totalSubmissionRaw": 24454}, "3124": {"acRate": 69.20923722883136, "difficulty": "Medium", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3124", "paidOnly": true, "title": "Find Longest Calls", "titleSlug": "find-longest-calls", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 989, "totalSubmissionRaw": 1429}, "3125": {"acRate": 69.81541802388708, "difficulty": "Medium", "likes": 10, "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": 643, "totalSubmissionRaw": 921}, "3126": {"acRate": 58.032240133407456, "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": 1044, "totalSubmissionRaw": 1799}, "3127": {"acRate": 51.315005363314924, "difficulty": "Easy", "likes": 68, "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": 25832, "totalSubmissionRaw": 50340}, "3128": {"acRate": 47.73357061141477, "difficulty": "Medium", "likes": 104, "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": 18776, "totalSubmissionRaw": 39335}, "3129": {"acRate": 27.05715373697511, "difficulty": "Medium", "likes": 113, "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": 7816, "totalSubmissionRaw": 28887}, "3130": {"acRate": 28.440709617180204, "difficulty": "Hard", "likes": 59, "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": 3046, "totalSubmissionRaw": 10710}, "3131": {"acRate": 82.28787700974064, "difficulty": "Easy", "likes": 119, "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": 56094, "totalSubmissionRaw": 68168}, "3132": {"acRate": 31.331771280543713, "difficulty": "Medium", "likes": 152, "dislikes": 37, "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": 21529, "totalSubmissionRaw": 68713}, "3133": {"acRate": 38.139522199192754, "difficulty": "Medium", "likes": 199, "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": 13985, "totalSubmissionRaw": 36668}, "3134": {"acRate": 28.863942956253613, "difficulty": "Hard", "likes": 144, "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": 5991, "totalSubmissionRaw": 20756}, "3135": {"acRate": 55.63636363636364, "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": 612, "totalSubmissionRaw": 1100}, "3136": {"acRate": 37.805894935286226, "difficulty": "Easy", "likes": 100, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "3136", "paidOnly": false, "title": "Valid Word", "titleSlug": "valid-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41712, "totalSubmissionRaw": 110332}, "3137": {"acRate": 62.73021629322627, "difficulty": "Medium", "likes": 112, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3137", "paidOnly": false, "title": "Minimum Number of Operations to Make Word K-Periodic", "titleSlug": "minimum-number-of-operations-to-make-word-k-periodic", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24217, "totalSubmissionRaw": 38605}, "3138": {"acRate": 41.91957169067886, "difficulty": "Medium", "likes": 167, "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": 27874, "totalSubmissionRaw": 66494}, "3139": {"acRate": 16.76894812961732, "difficulty": "Hard", "likes": 116, "dislikes": 21, "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": 4290, "totalSubmissionRaw": 25580}, "3140": {"acRate": 62.60504201680672, "difficulty": "Medium", "likes": 5, "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": 894, "totalSubmissionRaw": 1428}, "3141": {"acRate": 71.66666666666667, "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": 430, "totalSubmissionRaw": 600}, "3142": {"acRate": 43.337177183619836, "difficulty": "Easy", "likes": 68, "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": 32320, "totalSubmissionRaw": 74578}, "3143": {"acRate": 38.97631537116516, "difficulty": "Medium", "likes": 146, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3143", "paidOnly": false, "title": "Maximum Points Inside the Square", "titleSlug": "maximum-points-inside-the-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17164, "totalSubmissionRaw": 44037}, "3144": {"acRate": 41.0409658817876, "difficulty": "Medium", "likes": 131, "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": 13665, "totalSubmissionRaw": 33296}, "3145": {"acRate": 25.315179021684315, "difficulty": "Hard", "likes": 55, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3145", "paidOnly": false, "title": "Find Products of Elements of Big Array", "titleSlug": "find-products-of-elements-of-big-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2008, "totalSubmissionRaw": 7932}, "3146": {"acRate": 89.19679774786663, "difficulty": "Easy", "likes": 122, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3146", "paidOnly": false, "title": "Permutation Difference between Two Strings", "titleSlug": "permutation-difference-between-two-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70973, "totalSubmissionRaw": 79569}, "3147": {"acRate": 40.644310213150035, "difficulty": "Medium", "likes": 148, "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": 29268, "totalSubmissionRaw": 72013}, "3148": {"acRate": 47.96701964271279, "difficulty": "Medium", "likes": 224, "dislikes": 20, "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": 17802, "totalSubmissionRaw": 37113}, "3149": {"acRate": 23.116226536868716, "difficulty": "Hard", "likes": 103, "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": 4298, "totalSubmissionRaw": 18593}, "3150": {"acRate": 87.9287598944591, "difficulty": "Easy", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3150", "paidOnly": true, "title": "Invalid Tweets II", "titleSlug": "invalid-tweets-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1333, "totalSubmissionRaw": 1516}, "3151": {"acRate": 75.70338516401395, "difficulty": "Easy", "likes": 91, "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": 57742, "totalSubmissionRaw": 76274}, "3152": {"acRate": 30.070010993461782, "difficulty": "Medium", "likes": 184, "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": 31182, "totalSubmissionRaw": 103698}, "3153": {"acRate": 43.75210824182002, "difficulty": "Medium", "likes": 170, "dislikes": 18, "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": 23347, "totalSubmissionRaw": 53362}, "3154": {"acRate": 36.64308046733586, "difficulty": "Hard", "likes": 132, "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": 11134, "totalSubmissionRaw": 30385}, "3155": {"acRate": 49.42528735632184, "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": 860, "totalSubmissionRaw": 1740}, "3156": {"acRate": 57.95454545454546, "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": 510, "totalSubmissionRaw": 880}, "3157": {"acRate": 69.48383437322745, "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": 1225, "totalSubmissionRaw": 1763}, "3158": {"acRate": 82.10505753658191, "difficulty": "Easy", "likes": 92, "dislikes": 9, "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": 46235, "totalSubmissionRaw": 56312}, "3159": {"acRate": 73.62877088007978, "difficulty": "Medium", "likes": 113, "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": 35439, "totalSubmissionRaw": 48132}, "3160": {"acRate": 41.26640579007515, "difficulty": "Medium", "likes": 107, "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": 23833, "totalSubmissionRaw": 57754}, "3161": {"acRate": 14.012609314622736, "difficulty": "Hard", "likes": 96, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3161", "paidOnly": false, "title": "Block Placement Queries", "titleSlug": "block-placement-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4823, "totalSubmissionRaw": 34419}, "3162": {"acRate": 86.77220284411055, "difficulty": "Easy", "likes": 101, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3162", "paidOnly": false, "title": "Find the Number of Good Pairs I", "titleSlug": "find-the-number-of-good-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64679, "totalSubmissionRaw": 74539}, "3163": {"acRate": 55.93348662441815, "difficulty": "Medium", "likes": 106, "dislikes": 9, "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": 39894, "totalSubmissionRaw": 71324}, "3164": {"acRate": 25.678059650679348, "difficulty": "Medium", "likes": 204, "dislikes": 35, "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": 24890, "totalSubmissionRaw": 96931}, "3165": {"acRate": 16.967414155571127, "difficulty": "Hard", "likes": 108, "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": 5811, "totalSubmissionRaw": 34248}, "3166": {"acRate": 58.53324194653873, "difficulty": "Medium", "likes": 5, "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": 854, "totalSubmissionRaw": 1459}, "3167": {"acRate": 75.43179414874868, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3167", "paidOnly": true, "title": "Better Compression of String", "titleSlug": "better-compression-of-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2137, "totalSubmissionRaw": 2834}, "3168": {"acRate": 80.47072821013454, "difficulty": "Easy", "likes": 109, "dislikes": 10, "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": 52755, "totalSubmissionRaw": 65558}, "3169": {"acRate": 33.78639215055493, "difficulty": "Medium", "likes": 196, "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": 37809, "totalSubmissionRaw": 111905}, "3170": {"acRate": 35.87393583095311, "difficulty": "Medium", "likes": 192, "dislikes": 26, "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": 25873, "totalSubmissionRaw": 72122}, "3171": {"acRate": 31.047781746648027, "difficulty": "Hard", "likes": 165, "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": 11995, "totalSubmissionRaw": 38634}, "3172": {"acRate": 73.41430499325237, "difficulty": "Easy", "likes": 4, "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": 1088, "totalSubmissionRaw": 1482}, "3173": {"acRate": 95.35276721588508, "difficulty": "Easy", "likes": 9, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3173", "paidOnly": true, "title": "Bitwise OR of Adjacent Elements", "titleSlug": "bitwise-or-of-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2257, "totalSubmissionRaw": 2367}, "3174": {"acRate": 72.62386396951041, "difficulty": "Easy", "likes": 81, "dislikes": 2, "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": 49542, "totalSubmissionRaw": 68217}, "3175": {"acRate": 39.503182415543584, "difficulty": "Medium", "likes": 114, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3175", "paidOnly": false, "title": "Find The First Player to win K Games in a Row", "titleSlug": "find-the-first-player-to-win-k-games-in-a-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30660, "totalSubmissionRaw": 77614}, "3176": {"acRate": 30.49626975472123, "difficulty": "Medium", "likes": 128, "dislikes": 70, "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": 17618, "totalSubmissionRaw": 57771}, "3177": {"acRate": 24.22693774765767, "difficulty": "Hard", "likes": 103, "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": 6542, "totalSubmissionRaw": 27003}, "3178": {"acRate": 61.96706671898467, "difficulty": "Easy", "likes": 132, "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": 45798, "totalSubmissionRaw": 73907}, "3179": {"acRate": 54.608975296009355, "difficulty": "Medium", "likes": 96, "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": 37358, "totalSubmissionRaw": 68410}, "3180": {"acRate": 29.433005352092927, "difficulty": "Medium", "likes": 163, "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": 25187, "totalSubmissionRaw": 85574}, "3181": {"acRate": 20.906012395374095, "difficulty": "Hard", "likes": 111, "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": 6544, "totalSubmissionRaw": 31302}, "3182": {"acRate": 54.87728130899937, "difficulty": "Medium", "likes": 7, "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": 872, "totalSubmissionRaw": 1589}, "3183": {"acRate": 58.1640331075997, "difficulty": "Medium", "likes": 12, "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": 773, "totalSubmissionRaw": 1329}, "3184": {"acRate": 79.21283586760167, "difficulty": "Easy", "likes": 102, "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": 55689, "totalSubmissionRaw": 70303}, "3185": {"acRate": 42.99335796556544, "difficulty": "Medium", "likes": 148, "dislikes": 10, "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": 39679, "totalSubmissionRaw": 92291}, "3186": {"acRate": 26.222851852264995, "difficulty": "Medium", "likes": 226, "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": 23507, "totalSubmissionRaw": 89644}, "3187": {"acRate": 26.944792016357923, "difficulty": "Hard", "likes": 109, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3187", "paidOnly": false, "title": "Peaks in Array", "titleSlug": "peaks-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8829, "totalSubmissionRaw": 32767}, "3188": {"acRate": 42.09780297661233, "difficulty": "Hard", "likes": 4, "dislikes": 4, "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": 594, "totalSubmissionRaw": 1411}, "3189": {"acRate": 77.08451503119682, "difficulty": "Medium", "likes": 52, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3189", "paidOnly": true, "title": "Minimum Moves to Get a Peaceful Board", "titleSlug": "minimum-moves-to-get-a-peaceful-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4077, "totalSubmissionRaw": 5289}, "3190": {"acRate": 89.8974652578983, "difficulty": "Easy", "likes": 130, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3190", "paidOnly": false, "title": "Find Minimum Operations to Make All Elements Divisible by Three", "titleSlug": "find-minimum-operations-to-make-all-elements-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86359, "totalSubmissionRaw": 96064}, "3191": {"acRate": 70.97731125309689, "difficulty": "Medium", "likes": 138, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3191", "paidOnly": false, "title": "Minimum Operations to Make Binary Array Elements Equal to One I", "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43546, "totalSubmissionRaw": 61352}, "3192": {"acRate": 65.23581015220815, "difficulty": "Medium", "likes": 116, "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": 34802, "totalSubmissionRaw": 53348}, "3193": {"acRate": 33.49247535028542, "difficulty": "Hard", "likes": 90, "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": 6454, "totalSubmissionRaw": 19270}, "3194": {"acRate": 85.30601419004044, "difficulty": "Easy", "likes": 104, "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": 64323, "totalSubmissionRaw": 75403}, "3195": {"acRate": 73.95631067961165, "difficulty": "Medium", "likes": 102, "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": 39608, "totalSubmissionRaw": 53557}, "3196": {"acRate": 28.490596540389074, "difficulty": "Medium", "likes": 159, "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": 21148, "totalSubmissionRaw": 74228}, "3197": {"acRate": 37.46530989824237, "difficulty": "Hard", "likes": 67, "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": 4455, "totalSubmissionRaw": 11891}, "3198": {"acRate": 82.19056099732859, "difficulty": "Easy", "likes": 4, "dislikes": 2, "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": 922, "totalSubmissionRaw": 1122}, "3199": {"acRate": 84.26966292134831, "difficulty": "Easy", "likes": 7, "dislikes": 2, "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": 675, "totalSubmissionRaw": 801}, "3200": {"acRate": 42.61882505213202, "difficulty": "Easy", "likes": 128, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3200", "paidOnly": false, "title": "Maximum Height of a Triangle", "titleSlug": "maximum-height-of-a-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35562, "totalSubmissionRaw": 83442}, "3201": {"acRate": 37.69359065999524, "difficulty": "Medium", "likes": 124, "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": 25312, "totalSubmissionRaw": 67152}, "3202": {"acRate": 39.30273923870509, "difficulty": "Medium", "likes": 178, "dislikes": 12, "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": 16572, "totalSubmissionRaw": 42165}, "3203": {"acRate": 35.82522261337751, "difficulty": "Hard", "likes": 127, "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": 8650, "totalSubmissionRaw": 24145}, "3204": {"acRate": 94.42446043165468, "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": 525, "totalSubmissionRaw": 556}, "3205": {"acRate": 80.01555209953344, "difficulty": "Medium", "likes": 18, "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": 1029, "totalSubmissionRaw": 1286}, "3206": {"acRate": 67.01194177296104, "difficulty": "Easy", "likes": 84, "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": 46126, "totalSubmissionRaw": 68833}, "3207": {"acRate": 31.794328388333838, "difficulty": "Medium", "likes": 93, "dislikes": 37, "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": 25204, "totalSubmissionRaw": 79272}, "3208": {"acRate": 40.50118403845474, "difficulty": "Medium", "likes": 140, "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": 22917, "totalSubmissionRaw": 56583}, "3209": {"acRate": 34.22573678861789, "difficulty": "Hard", "likes": 136, "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": 10777, "totalSubmissionRaw": 31488}, "3210": {"acRate": 69.24303424084187, "difficulty": "Easy", "likes": 84, "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": 52113, "totalSubmissionRaw": 75261}, "3211": {"acRate": 86.35059238306071, "difficulty": "Medium", "likes": 144, "dislikes": 22, "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": 42127, "totalSubmissionRaw": 48786}, "3212": {"acRate": 51.910893580037964, "difficulty": "Medium", "likes": 132, "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": 22697, "totalSubmissionRaw": 43723}, "3213": {"acRate": 20.248925501432666, "difficulty": "Hard", "likes": 140, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3213", "paidOnly": false, "title": "Construct String with Minimum Cost", "titleSlug": "construct-string-with-minimum-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11307, "totalSubmissionRaw": 55840}, "3214": {"acRate": 51.88284518828452, "difficulty": "Hard", "likes": 1, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3214", "paidOnly": true, "title": "Year on Year Growth Rate", "titleSlug": "year-on-year-growth-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 496, "totalSubmissionRaw": 956}, "3215": {"acRate": 73.48484848484848, "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": 388, "totalSubmissionRaw": 528}, "3216": {"acRate": 53.581630410898704, "difficulty": "Easy", "likes": 75, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3216", "paidOnly": false, "title": "Lexicographically Smallest String After a Swap", "titleSlug": "lexicographically-smallest-string-after-a-swap", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43892, "totalSubmissionRaw": 81917}, "3217": {"acRate": 61.1480853161657, "difficulty": "Medium", "likes": 125, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3217", "paidOnly": false, "title": "Delete Nodes From Linked List Present in Array", "titleSlug": "delete-nodes-from-linked-list-present-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42172, "totalSubmissionRaw": 68967}, "3218": {"acRate": 57.87549115355788, "difficulty": "Medium", "likes": 153, "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": 25482, "totalSubmissionRaw": 44029}, "3219": {"acRate": 56.02352810609844, "difficulty": "Hard", "likes": 97, "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": 20192, "totalSubmissionRaw": 36042}, "3220": {"acRate": 71.07260726072607, "difficulty": "Medium", "likes": 22, "dislikes": 7, "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": 4307, "totalSubmissionRaw": 6060}, "3221": {"acRate": 68.5374149659864, "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": 403, "totalSubmissionRaw": 588}, "3222": {"acRate": 51.32564761825772, "difficulty": "Easy", "likes": 81, "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": 37130, "totalSubmissionRaw": 72342}, "3223": {"acRate": 55.05911492095436, "difficulty": "Medium", "likes": 88, "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": 28454, "totalSubmissionRaw": 51679}, "3224": {"acRate": 22.878552875002338, "difficulty": "Medium", "likes": 197, "dislikes": 19, "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": 12243, "totalSubmissionRaw": 53513}, "3225": {"acRate": 27.06151209293468, "difficulty": "Hard", "likes": 52, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3225", "paidOnly": false, "title": "Maximum Score From Grid Operations", "titleSlug": "maximum-score-from-grid-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1421, "totalSubmissionRaw": 5251}, "3226": {"acRate": 64.48066474912113, "difficulty": "Easy", "likes": 82, "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": 40352, "totalSubmissionRaw": 62580}, "3227": {"acRate": 62.51060514241191, "difficulty": "Medium", "likes": 123, "dislikes": 26, "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": 36103, "totalSubmissionRaw": 57755}, "3228": {"acRate": 53.91160577465924, "difficulty": "Medium", "likes": 146, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3228", "paidOnly": false, "title": "Maximum Number of Operations to Move Ones to the End", "titleSlug": "maximum-number-of-operations-to-move-ones-to-the-end", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26738, "totalSubmissionRaw": 49596}, "3229": {"acRate": 38.14857205144975, "difficulty": "Hard", "likes": 186, "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": 13999, "totalSubmissionRaw": 36696}, "3230": {"acRate": 41.27358490566038, "difficulty": "Medium", "likes": 4, "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": 525, "totalSubmissionRaw": 1272}, "3231": {"acRate": 56.236786469344615, "difficulty": "Hard", "likes": 6, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3231", "paidOnly": true, "title": "Minimum Number of Increasing Subsequence to Be Removed", "titleSlug": "minimum-number-of-increasing-subsequence-to-be-removed", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 266, "totalSubmissionRaw": 473}, "3232": {"acRate": 83.21887928850863, "difficulty": "Easy", "likes": 91, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3232", "paidOnly": false, "title": "Find if Digit Game Can Be Won", "titleSlug": "find-if-digit-game-can-be-won", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59136, "totalSubmissionRaw": 71061}, "3233": {"acRate": 26.628447500483343, "difficulty": "Medium", "likes": 163, "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": 31678, "totalSubmissionRaw": 118963}, "3234": {"acRate": 15.295798667926528, "difficulty": "Medium", "likes": 218, "dislikes": 38, "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": 6635, "totalSubmissionRaw": 43387}, "3235": {"acRate": 28.497433724160665, "difficulty": "Hard", "likes": 92, "dislikes": 23, "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": 6052, "totalSubmissionRaw": 21237}, "3236": {"acRate": 79.41176470588235, "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": 324, "totalSubmissionRaw": 408}, "3237": {"acRate": 81.57099697885197, "difficulty": "Medium", "likes": 12, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3237", "paidOnly": true, "title": "Alt and Tab Simulation", "titleSlug": "alt-and-tab-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 540, "totalSubmissionRaw": 662}, "3238": {"acRate": 61.09881098810989, "difficulty": "Easy", "likes": 67, "dislikes": 12, "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": 37251, "totalSubmissionRaw": 60969}, "3239": {"acRate": 78.13719883637087, "difficulty": "Medium", "likes": 56, "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": 31426, "totalSubmissionRaw": 40219}, "3240": {"acRate": 22.815162365724166, "difficulty": "Medium", "likes": 112, "dislikes": 46, "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": 9239, "totalSubmissionRaw": 40495}, "3241": {"acRate": 23.209131461558645, "difficulty": "Hard", "likes": 75, "dislikes": 3, "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": 3537, "totalSubmissionRaw": 15243}, "3242": {"acRate": 83.33539435609526, "difficulty": "Easy", "likes": 76, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3242", "paidOnly": false, "title": "Design Neighbor Sum Service", "titleSlug": "design-neighbor-sum-service", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33694, "totalSubmissionRaw": 40432}, "3243": {"acRate": 47.23672469766294, "difficulty": "Medium", "likes": 96, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3243", "paidOnly": false, "title": "Shortest Distance After Road Addition Queries I", "titleSlug": "shortest-distance-after-road-addition-queries-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24881, "totalSubmissionRaw": 52673}, "3244": {"acRate": 23.038427167113497, "difficulty": "Hard", "likes": 147, "dislikes": 5, "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": 10312, "totalSubmissionRaw": 44760}, "3245": {"acRate": 13.920579201404124, "difficulty": "Hard", "likes": 50, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3245", "paidOnly": false, "title": "Alternating Groups III", "titleSlug": "alternating-groups-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1269, "totalSubmissionRaw": 9116}, "3246": {"acRate": 88.66666666666667, "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": 665, "totalSubmissionRaw": 750}, "3247": {"acRate": 55.38881309686221, "difficulty": "Medium", "likes": 7, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3247", "paidOnly": true, "title": "Number of Subsequences with Odd Sum", "titleSlug": "number-of-subsequences-with-odd-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 406, "totalSubmissionRaw": 733}, "3248": {"acRate": 81.92718741854202, "difficulty": "Easy", "likes": 96, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3248", "paidOnly": false, "title": "Snake in Matrix", "titleSlug": "snake-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47145, "totalSubmissionRaw": 57545}, "3249": {"acRate": 55.60227553796686, "difficulty": "Medium", "likes": 137, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3249", "paidOnly": false, "title": "Count the Number of Good Nodes", "titleSlug": "count-the-number-of-good-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24728, "totalSubmissionRaw": 44473}, "3250": {"acRate": 45.645868049126705, "difficulty": "Hard", "likes": 112, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3250", "paidOnly": false, "title": "Find the Count of Monotonic Pairs I", "titleSlug": "find-the-count-of-monotonic-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14792, "totalSubmissionRaw": 32406}, "3251": {"acRate": 22.07792207792208, "difficulty": "Hard", "likes": 76, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3251", "paidOnly": false, "title": "Find the Count of Monotonic Pairs II", "titleSlug": "find-the-count-of-monotonic-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5440, "totalSubmissionRaw": 24640}, "3252": {"acRate": 66.16541353383458, "difficulty": "Medium", "likes": 2, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "3252", "paidOnly": true, "title": "Premier League Table Ranking II", "titleSlug": "premier-league-table-ranking-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 352, "totalSubmissionRaw": 532}, "3253": {"acRate": 53.355704697986575, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3253", "paidOnly": true, "title": "Construct String with Minimum Cost (Easy)", "titleSlug": "construct-string-with-minimum-cost-easy", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 318, "totalSubmissionRaw": 596}, "3254": {"acRate": 53.462363099032274, "difficulty": "Medium", "likes": 59, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3254", "paidOnly": false, "title": "Find the Power of K-Size Subarrays I", "titleSlug": "find-the-power-of-k-size-subarrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36904, "totalSubmissionRaw": 69028}, "3255": {"acRate": 26.148582046430473, "difficulty": "Medium", "likes": 107, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3255", "paidOnly": false, "title": "Find the Power of K-Size Subarrays II", "titleSlug": "find-the-power-of-k-size-subarrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23079, "totalSubmissionRaw": 88261}, "3256": {"acRate": 13.75158811785347, "difficulty": "Hard", "likes": 85, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3256", "paidOnly": false, "title": "Maximum Value Sum by Placing Three Rooks I", "titleSlug": "maximum-value-sum-by-placing-three-rooks-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6819, "totalSubmissionRaw": 49587}, "3257": {"acRate": 27.74558303886926, "difficulty": "Hard", "likes": 41, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3257", "paidOnly": false, "title": "Maximum Value Sum by Placing Three Rooks II", "titleSlug": "maximum-value-sum-by-placing-three-rooks-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3926, "totalSubmissionRaw": 14150}, "3258": {"acRate": 79.70771706306347, "difficulty": "Easy", "likes": 84, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3258", "paidOnly": false, "title": "Count Substrings That Satisfy K-Constraint I", "titleSlug": "count-substrings-that-satisfy-k-constraint-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36161, "totalSubmissionRaw": 45367}, "3259": {"acRate": 48.605850168350166, "difficulty": "Medium", "likes": 120, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3259", "paidOnly": false, "title": "Maximum Energy Boost From Two Drinks", "titleSlug": "maximum-energy-boost-from-two-drinks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27717, "totalSubmissionRaw": 57023}, "3260": {"acRate": 13.816869810578902, "difficulty": "Hard", "likes": 79, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "3260", "paidOnly": false, "title": "Find the Largest Palindrome Divisible by K", "titleSlug": "find-the-largest-palindrome-divisible-by-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"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": 5974, "totalSubmissionRaw": 43237}, "3261": {"acRate": 20.211871531864805, "difficulty": "Hard", "likes": 99, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3261", "paidOnly": false, "title": "Count Substrings That Satisfy K-Constraint II", "titleSlug": "count-substrings-that-satisfy-k-constraint-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3606, "totalSubmissionRaw": 17841}, "3262": {"acRate": 76.04456824512535, "difficulty": "Medium", "likes": 5, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3262", "paidOnly": true, "title": "Find Overlapping Shifts", "titleSlug": "find-overlapping-shifts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 273, "totalSubmissionRaw": 359}, "3263": {"acRate": 95.50802139037432, "difficulty": "Easy", "likes": 3, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3263", "paidOnly": true, "title": "Convert Doubly Linked List to Array I", "titleSlug": "convert-doubly-linked-list-to-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 891, "totalSubmissionRaw": 933}, "3264": {"acRate": 81.43280970674375, "difficulty": "Easy", "likes": 79, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3264", "paidOnly": false, "title": "Final Array State After K Multiplication Operations I", "titleSlug": "final-array-state-after-k-multiplication-operations-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42819, "totalSubmissionRaw": 52582}, "3265": {"acRate": 36.414748745719514, "difficulty": "Medium", "likes": 119, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3265", "paidOnly": false, "title": "Count Almost Equal Pairs I", "titleSlug": "count-almost-equal-pairs-i", "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"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22862, "totalSubmissionRaw": 62783}, "3266": {"acRate": 9.50294102944362, "difficulty": "Hard", "likes": 123, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3266", "paidOnly": false, "title": "Final Array State After K Multiplication Operations II", "titleSlug": "final-array-state-after-k-multiplication-operations-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": 5702, "totalSubmissionRaw": 60011}, "3267": {"acRate": 19.83149708360337, "difficulty": "Hard", "likes": 60, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3267", "paidOnly": false, "title": "Count Almost Equal Pairs II", "titleSlug": "count-almost-equal-pairs-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"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4590, "totalSubmissionRaw": 23144}, "3268": {"acRate": 84.80392156862744, "difficulty": "Hard", "likes": 2, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3268", "paidOnly": true, "title": "Find Overlapping Shifts II", "titleSlug": "find-overlapping-shifts-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 173, "totalSubmissionRaw": 204}, "3269": {"acRate": 70.18867924528301, "difficulty": "Hard", "likes": 5, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3269", "paidOnly": true, "title": "Constructing Two Increasing Arrays", "titleSlug": "constructing-two-increasing-arrays", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 186, "totalSubmissionRaw": 265}, "3270": {"acRate": 75.97842980266566, "difficulty": "Easy", "likes": 33, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3270", "paidOnly": false, "title": "Find the Key of the Numbers", "titleSlug": "find-the-key-of-the-numbers", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32268, "totalSubmissionRaw": 42469}, "3271": {"acRate": 83.7991718426501, "difficulty": "Medium", "likes": 42, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3271", "paidOnly": false, "title": "Hash Divided String", "titleSlug": "hash-divided-string", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29140, "totalSubmissionRaw": 34774}, "3272": {"acRate": 24.787084351625566, "difficulty": "Hard", "likes": 50, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3272", "paidOnly": false, "title": "Find the Count of Good Integers", "titleSlug": "find-the-count-of-good-integers", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3347, "totalSubmissionRaw": 13502}, "3273": {"acRate": 35.416581622239455, "difficulty": "Hard", "likes": 103, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3273", "paidOnly": false, "title": "Minimum Amount of Damage Dealt to Bob", "titleSlug": "minimum-amount-of-damage-dealt-to-bob", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8673, "totalSubmissionRaw": 24494}, "3274": {"acRate": 69.49363672223721, "difficulty": "Easy", "likes": 53, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3274", "paidOnly": false, "title": "Check if Two Chessboard Squares Have the Same Color", "titleSlug": "check-if-two-chessboard-squares-have-the-same-color", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33460, "totalSubmissionRaw": 48150}, "3275": {"acRate": 46.330460156265, "difficulty": "Medium", "likes": 54, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3275", "paidOnly": false, "title": "K-th Nearest Obstacle Queries", "titleSlug": "k-th-nearest-obstacle-queries", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24134, "totalSubmissionRaw": 52091}, "3276": {"acRate": 9.838296653116775, "difficulty": "Hard", "likes": 126, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3276", "paidOnly": false, "title": "Select Cells in Grid With Maximum Score", "titleSlug": "select-cells-in-grid-with-maximum-score", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5494, "totalSubmissionRaw": 55838}, "3277": {"acRate": 35.94154642989271, "difficulty": "Hard", "likes": 47, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3277", "paidOnly": false, "title": "Maximum XOR Score Subarray Queries", "titleSlug": "maximum-xor-score-subarray-queries", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1942, "totalSubmissionRaw": 5405}, "3278": {"acRate": 80.0, "difficulty": "Medium", "likes": 2, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3278", "paidOnly": true, "title": "Find Candidates for Data Scientist Position II", "titleSlug": "find-candidates-for-data-scientist-position-ii", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104, "totalSubmissionRaw": 129}}
\ No newline at end of file
+{"1": {"acRate": 53.59731503105072, "difficulty": "Easy", "likes": 57858, "dislikes": 2037, "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": 14364000, "totalSubmissionRaw": 26799853}, "2": {"acRate": 43.93496495253922, "difficulty": "Medium", "likes": 31553, "dislikes": 6321, "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": 4916498, "totalSubmissionRaw": 11190398}, "3": {"acRate": 35.3496916794391, "difficulty": "Medium", "likes": 40084, "dislikes": 1920, "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": 6238047, "totalSubmissionRaw": 17646678}, "4": {"acRate": 41.27003212160573, "difficulty": "Hard", "likes": 28609, "dislikes": 3204, "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": 2821431, "totalSubmissionRaw": 6836516}, "5": {"acRate": 34.3527076302006, "difficulty": "Medium", "likes": 29584, "dislikes": 1808, "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": 3276845, "totalSubmissionRaw": 9538836}, "6": {"acRate": 49.12339904040384, "difficulty": "Medium", "likes": 7798, "dislikes": 14817, "categoryTitle": "Algorithms", "frontendQuestionId": "6", "paidOnly": false, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1454235, "totalSubmissionRaw": 2960386}, "7": {"acRate": 29.077769015998474, "difficulty": "Medium", "likes": 13256, "dislikes": 13588, "categoryTitle": "Algorithms", "frontendQuestionId": "7", "paidOnly": false, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3464710, "totalSubmissionRaw": 11915347}, "8": {"acRate": 17.83220374234668, "difficulty": "Medium", "likes": 4689, "dislikes": 13903, "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": 1659889, "totalSubmissionRaw": 9308382}, "9": {"acRate": 57.37145226119984, "difficulty": "Easy", "likes": 12891, "dislikes": 2752, "categoryTitle": "Algorithms", "frontendQuestionId": "9", "paidOnly": false, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 5134172, "totalSubmissionRaw": 8949003}, "10": {"acRate": 28.346145646003627, "difficulty": "Hard", "likes": 12239, "dislikes": 2185, "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": 1011774, "totalSubmissionRaw": 3569353}, "11": {"acRate": 56.04581271597638, "difficulty": "Medium", "likes": 29434, "dislikes": 1821, "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": 3268380, "totalSubmissionRaw": 5831622}, "12": {"acRate": 66.09140795198162, "difficulty": "Medium", "likes": 7269, "dislikes": 5573, "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": 1430100, "totalSubmissionRaw": 2163827}, "13": {"acRate": 62.4804538626431, "difficulty": "Easy", "likes": 14516, "dislikes": 968, "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": 3982078, "totalSubmissionRaw": 6373340}, "14": {"acRate": 43.66460170515491, "difficulty": "Easy", "likes": 17841, "dislikes": 4587, "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": 3669797, "totalSubmissionRaw": 8404508}, "15": {"acRate": 35.24031978912258, "difficulty": "Medium", "likes": 31205, "dislikes": 2908, "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": 3859865, "totalSubmissionRaw": 10952971}, "16": {"acRate": 46.027231497661106, "difficulty": "Medium", "likes": 10526, "dislikes": 572, "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": 1291734, "totalSubmissionRaw": 2806454}, "17": {"acRate": 61.5614228782221, "difficulty": "Medium", "likes": 18778, "dislikes": 1014, "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": 2176829, "totalSubmissionRaw": 3536032}, "18": {"acRate": 36.65979073673131, "difficulty": "Medium", "likes": 11433, "dislikes": 1409, "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": 1046237, "totalSubmissionRaw": 2853914}, "19": {"acRate": 46.53906463975974, "difficulty": "Medium", "likes": 19029, "dislikes": 818, "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": 2942992, "totalSubmissionRaw": 6323698}, "20": {"acRate": 40.95064857888789, "difficulty": "Easy", "likes": 24303, "dislikes": 1799, "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": 5019451, "totalSubmissionRaw": 12257314}, "21": {"acRate": 65.14187101525695, "difficulty": "Easy", "likes": 22008, "dislikes": 2149, "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": 4484377, "totalSubmissionRaw": 6884017}, "22": {"acRate": 75.39809324541544, "difficulty": "Medium", "likes": 21283, "dislikes": 970, "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": 1974729, "totalSubmissionRaw": 2619077}, "23": {"acRate": 53.9599098618999, "difficulty": "Hard", "likes": 19604, "dislikes": 722, "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": 2126347, "totalSubmissionRaw": 3940605}, "24": {"acRate": 65.14967116652493, "difficulty": "Medium", "likes": 12018, "dislikes": 452, "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": 1439463, "totalSubmissionRaw": 2209471}, "25": {"acRate": 60.2034944982608, "difficulty": "Hard", "likes": 13842, "dislikes": 716, "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": 1017007, "totalSubmissionRaw": 1689283}, "26": {"acRate": 57.40071478179733, "difficulty": "Easy", "likes": 14997, "dislikes": 18895, "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": 4894395, "totalSubmissionRaw": 8526733}, "27": {"acRate": 58.01715448546053, "difficulty": "Easy", "likes": 2780, "dislikes": 3861, "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": 3294594, "totalSubmissionRaw": 5678665}, "28": {"acRate": 43.30260072003458, "difficulty": "Easy", "likes": 5996, "dislikes": 432, "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": 2716376, "totalSubmissionRaw": 6273017}, "29": {"acRate": 17.728500570472047, "difficulty": "Medium", "likes": 5233, "dislikes": 14863, "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": 798987, "totalSubmissionRaw": 4506792}, "30": {"acRate": 32.55825994803406, "difficulty": "Hard", "likes": 1910, "dislikes": 277, "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": 484183, "totalSubmissionRaw": 1487122}, "31": {"acRate": 40.94899178828454, "difficulty": "Medium", "likes": 18607, "dislikes": 4728, "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": 1478987, "totalSubmissionRaw": 3611779}, "32": {"acRate": 34.66726949552976, "difficulty": "Hard", "likes": 12419, "dislikes": 412, "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": 782103, "totalSubmissionRaw": 2256025}, "33": {"acRate": 41.42189625976691, "difficulty": "Medium", "likes": 26525, "dislikes": 1601, "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": 2982810, "totalSubmissionRaw": 7201047}, "34": {"acRate": 45.08656651240719, "difficulty": "Medium", "likes": 20679, "dislikes": 533, "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": 2213598, "totalSubmissionRaw": 4909672}, "35": {"acRate": 46.9935803477889, "difficulty": "Easy", "likes": 16359, "dislikes": 758, "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": 3147097, "totalSubmissionRaw": 6696873}, "36": {"acRate": 60.478598023858524, "difficulty": "Medium", "likes": 10834, "dislikes": 1143, "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": 1652061, "totalSubmissionRaw": 2731649}, "37": {"acRate": 62.62846620514129, "difficulty": "Hard", "likes": 9618, "dislikes": 265, "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": 640769, "totalSubmissionRaw": 1023128}, "38": {"acRate": 56.25928214281628, "difficulty": "Medium", "likes": 4059, "dislikes": 8388, "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": 983398, "totalSubmissionRaw": 1747974}, "39": {"acRate": 72.58764053971095, "difficulty": "Medium", "likes": 19010, "dislikes": 429, "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": 2114125, "totalSubmissionRaw": 2912515}, "40": {"acRate": 56.35259043725811, "difficulty": "Medium", "likes": 11046, "dislikes": 322, "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": 1165127, "totalSubmissionRaw": 2067566}, "41": {"acRate": 39.90036556073082, "difficulty": "Hard", "likes": 16940, "dislikes": 1869, "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": 1282047, "totalSubmissionRaw": 3213129}, "42": {"acRate": 62.9745785234397, "difficulty": "Hard", "likes": 32343, "dislikes": 533, "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": 2305570, "totalSubmissionRaw": 3661114}, "43": {"acRate": 40.89450252142985, "difficulty": "Medium", "likes": 7111, "dislikes": 3378, "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": 843132, "totalSubmissionRaw": 2061726}, "44": {"acRate": 28.538845410798363, "difficulty": "Hard", "likes": 8329, "dislikes": 357, "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": 615114, "totalSubmissionRaw": 2155354}, "45": {"acRate": 40.68911382189253, "difficulty": "Medium", "likes": 14725, "dislikes": 594, "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": 1381416, "totalSubmissionRaw": 3395051}, "46": {"acRate": 79.13923174152711, "difficulty": "Medium", "likes": 19207, "dislikes": 330, "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": 2226433, "totalSubmissionRaw": 2813313}, "47": {"acRate": 59.94217991291432, "difficulty": "Medium", "likes": 8561, "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": 977815, "totalSubmissionRaw": 1631265}, "48": {"acRate": 75.70998882488091, "difficulty": "Medium", "likes": 17774, "dislikes": 825, "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": 1888829, "totalSubmissionRaw": 2494821}, "49": {"acRate": 69.29891052256451, "difficulty": "Medium", "likes": 19435, "dislikes": 635, "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": 3123931, "totalSubmissionRaw": 4507907}, "50": {"acRate": 35.44422814122864, "difficulty": "Medium", "likes": 9892, "dislikes": 9630, "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": 1813242, "totalSubmissionRaw": 5115762}, "51": {"acRate": 69.79713842175164, "difficulty": "Hard", "likes": 12514, "dislikes": 292, "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": 796708, "totalSubmissionRaw": 1141463}, "52": {"acRate": 74.842288155845, "difficulty": "Hard", "likes": 3895, "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": 416537, "totalSubmissionRaw": 556553}, "53": {"acRate": 51.108009618042104, "difficulty": "Medium", "likes": 34301, "dislikes": 1455, "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": 4192117, "totalSubmissionRaw": 8202471}, "54": {"acRate": 51.035990292319624, "difficulty": "Medium", "likes": 15021, "dislikes": 1336, "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": 1564977, "totalSubmissionRaw": 3066425}, "55": {"acRate": 38.74173268092401, "difficulty": "Medium", "likes": 19570, "dislikes": 1266, "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": 2109080, "totalSubmissionRaw": 5443955}, "56": {"acRate": 47.878192078406926, "difficulty": "Medium", "likes": 22378, "dislikes": 790, "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": 2599254, "totalSubmissionRaw": 5428885}, "57": {"acRate": 42.09824760956884, "difficulty": "Medium", "likes": 10489, "dislikes": 826, "categoryTitle": "Algorithms", "frontendQuestionId": "57", "paidOnly": false, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1208036, "totalSubmissionRaw": 2869565}, "58": {"acRate": 53.43193690463997, "difficulty": "Easy", "likes": 5307, "dislikes": 292, "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": 2217025, "totalSubmissionRaw": 4149259}, "59": {"acRate": 71.93860163956151, "difficulty": "Medium", "likes": 6435, "dislikes": 265, "categoryTitle": "Algorithms", "frontendQuestionId": "59", "paidOnly": false, "title": "Spiral Matrix II", "titleSlug": "spiral-matrix-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 607956, "totalSubmissionRaw": 845104}, "60": {"acRate": 47.95469744560765, "difficulty": "Hard", "likes": 6718, "dislikes": 483, "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": 420918, "totalSubmissionRaw": 877742}, "61": {"acRate": 38.5342912814427, "difficulty": "Medium", "likes": 9799, "dislikes": 1460, "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": 1057243, "totalSubmissionRaw": 2743641}, "62": {"acRate": 64.75494540112288, "difficulty": "Medium", "likes": 16773, "dislikes": 451, "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": 1979503, "totalSubmissionRaw": 3056918}, "63": {"acRate": 42.124801358535564, "difficulty": "Medium", "likes": 8823, "dislikes": 513, "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": 1016050, "totalSubmissionRaw": 2412002}, "64": {"acRate": 64.84146062561939, "difficulty": "Medium", "likes": 12556, "dislikes": 172, "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": 1275852, "totalSubmissionRaw": 1967649}, "65": {"acRate": 20.272779285015595, "difficulty": "Hard", "likes": 1274, "dislikes": 2025, "categoryTitle": "Algorithms", "frontendQuestionId": "65", "paidOnly": false, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 384454, "totalSubmissionRaw": 1896405}, "66": {"acRate": 46.035372034491594, "difficulty": "Easy", "likes": 9488, "dislikes": 5411, "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": 2437595, "totalSubmissionRaw": 5295064}, "67": {"acRate": 54.235808582906174, "difficulty": "Easy", "likes": 9498, "dislikes": 989, "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": 1573131, "totalSubmissionRaw": 2900542}, "68": {"acRate": 44.8946374682655, "difficulty": "Hard", "likes": 3770, "dislikes": 4792, "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": 449870, "totalSubmissionRaw": 1002061}, "69": {"acRate": 39.289996891417836, "difficulty": "Easy", "likes": 8285, "dislikes": 4518, "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": 2137279, "totalSubmissionRaw": 5439756}, "70": {"acRate": 53.09478880483303, "difficulty": "Easy", "likes": 22125, "dislikes": 862, "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": 3539881, "totalSubmissionRaw": 6667106}, "71": {"acRate": 43.94425193452734, "difficulty": "Medium", "likes": 5666, "dislikes": 1293, "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": 835078, "totalSubmissionRaw": 1900325}, "72": {"acRate": 57.23811742439787, "difficulty": "Medium", "likes": 14975, "dislikes": 239, "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": 948413, "totalSubmissionRaw": 1656961}, "73": {"acRate": 57.224605702389006, "difficulty": "Medium", "likes": 14683, "dislikes": 752, "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": 1584317, "totalSubmissionRaw": 2768594}, "74": {"acRate": 50.924655937888744, "difficulty": "Medium", "likes": 15925, "dislikes": 424, "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": 1955540, "totalSubmissionRaw": 3840064}, "75": {"acRate": 64.8303872088017, "difficulty": "Medium", "likes": 18735, "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": 2317410, "totalSubmissionRaw": 3574576}, "76": {"acRate": 43.61076253354021, "difficulty": "Hard", "likes": 18030, "dislikes": 745, "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": 1458233, "totalSubmissionRaw": 3343745}, "77": {"acRate": 71.17218553334659, "difficulty": "Medium", "likes": 8283, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "77", "paidOnly": false, "title": "Combinations", "titleSlug": "combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 962070, "totalSubmissionRaw": 1351752}, "78": {"acRate": 79.11102560903944, "difficulty": "Medium", "likes": 17403, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "78", "paidOnly": false, "title": "Subsets", "titleSlug": "subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2105454, "totalSubmissionRaw": 2661393}, "79": {"acRate": 43.51043709304926, "difficulty": "Medium", "likes": 16006, "dislikes": 678, "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": 1787733, "totalSubmissionRaw": 4108749}, "80": {"acRate": 59.94333107959654, "difficulty": "Medium", "likes": 7035, "dislikes": 1360, "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": 1129485, "totalSubmissionRaw": 1884257}, "81": {"acRate": 38.09373299925676, "difficulty": "Medium", "likes": 8573, "dislikes": 1051, "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": 795451, "totalSubmissionRaw": 2088143}, "82": {"acRate": 48.18971655412789, "difficulty": "Medium", "likes": 8878, "dislikes": 246, "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": 787108, "totalSubmissionRaw": 1633355}, "83": {"acRate": 53.295547132611944, "difficulty": "Easy", "likes": 8769, "dislikes": 311, "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": 1639220, "totalSubmissionRaw": 3075718}, "84": {"acRate": 45.36727334098051, "difficulty": "Hard", "likes": 17407, "dislikes": 298, "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": 978469, "totalSubmissionRaw": 2156774}, "85": {"acRate": 51.51924885616399, "difficulty": "Hard", "likes": 10660, "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": 518192, "totalSubmissionRaw": 1005823}, "86": {"acRate": 57.088663659466874, "difficulty": "Medium", "likes": 7389, "dislikes": 884, "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": 663805, "totalSubmissionRaw": 1162762}, "87": {"acRate": 40.65005771254048, "difficulty": "Hard", "likes": 3348, "dislikes": 1283, "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": 238776, "totalSubmissionRaw": 587394}, "88": {"acRate": 50.85464230867446, "difficulty": "Easy", "likes": 15271, "dislikes": 2018, "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": 3574728, "totalSubmissionRaw": 7029305}, "89": {"acRate": 59.95537408883948, "difficulty": "Medium", "likes": 2265, "dislikes": 2728, "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": 311153, "totalSubmissionRaw": 518976}, "90": {"acRate": 58.00036458216526, "difficulty": "Medium", "likes": 9846, "dislikes": 327, "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": 1008611, "totalSubmissionRaw": 1738969}, "91": {"acRate": 35.387920234320326, "difficulty": "Medium", "likes": 11998, "dislikes": 4529, "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": 1310632, "totalSubmissionRaw": 3703633}, "92": {"acRate": 48.238368956118, "difficulty": "Medium", "likes": 11708, "dislikes": 629, "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": 928915, "totalSubmissionRaw": 1925679}, "93": {"acRate": 50.90514342927811, "difficulty": "Medium", "likes": 5258, "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": 479948, "totalSubmissionRaw": 942831}, "94": {"acRate": 76.96169398882235, "difficulty": "Easy", "likes": 13579, "dislikes": 804, "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": 2705641, "totalSubmissionRaw": 3515567}, "95": {"acRate": 58.55489274780401, "difficulty": "Medium", "likes": 7592, "dislikes": 528, "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": 467829, "totalSubmissionRaw": 798958}, "96": {"acRate": 61.49129344806559, "difficulty": "Medium", "likes": 10401, "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": 689737, "totalSubmissionRaw": 1121683}, "97": {"acRate": 40.518288911687875, "difficulty": "Medium", "likes": 8262, "dislikes": 492, "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": 556844, "totalSubmissionRaw": 1374316}, "98": {"acRate": 33.35534792650106, "difficulty": "Medium", "likes": 16946, "dislikes": 1383, "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": 2491908, "totalSubmissionRaw": 7470786}, "99": {"acRate": 54.13541131794406, "difficulty": "Medium", "likes": 7954, "dislikes": 260, "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": 479702, "totalSubmissionRaw": 886115}, "100": {"acRate": 63.16754077884402, "difficulty": "Easy", "likes": 11657, "dislikes": 243, "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": 2351599, "totalSubmissionRaw": 3722798}, "101": {"acRate": 57.424026734294465, "difficulty": "Easy", "likes": 15409, "dislikes": 387, "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": 2126635, "totalSubmissionRaw": 3703396}, "102": {"acRate": 68.3561023719818, "difficulty": "Medium", "likes": 15458, "dislikes": 320, "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": 2408457, "totalSubmissionRaw": 3523404}, "103": {"acRate": 59.88441671694675, "difficulty": "Medium", "likes": 10926, "dislikes": 308, "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": 1261476, "totalSubmissionRaw": 2106518}, "104": {"acRate": 76.01916243933604, "difficulty": "Easy", "likes": 12949, "dislikes": 235, "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": 3356636, "totalSubmissionRaw": 4415513}, "105": {"acRate": 64.86322592111212, "difficulty": "Medium", "likes": 15145, "dislikes": 518, "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": 1328476, "totalSubmissionRaw": 2048117}, "106": {"acRate": 64.09950245049187, "difficulty": "Medium", "likes": 8078, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "106", "paidOnly": false, "title": "Construct Binary Tree from Inorder and Postorder Traversal", "titleSlug": "construct-binary-tree-from-inorder-and-postorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 688211, "totalSubmissionRaw": 1073661}, "107": {"acRate": 64.19269650186179, "difficulty": "Medium", "likes": 4891, "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": 671131, "totalSubmissionRaw": 1045496}, "108": {"acRate": 72.50297625452951, "difficulty": "Easy", "likes": 11035, "dislikes": 568, "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": 1280141, "totalSubmissionRaw": 1765640}, "109": {"acRate": 62.646591710480294, "difficulty": "Medium", "likes": 7485, "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": 546318, "totalSubmissionRaw": 872063}, "110": {"acRate": 53.247789245075175, "difficulty": "Easy", "likes": 10835, "dislikes": 707, "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": 1626014, "totalSubmissionRaw": 3053672}, "111": {"acRate": 48.82946501136076, "difficulty": "Easy", "likes": 7328, "dislikes": 1313, "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": 1264708, "totalSubmissionRaw": 2590050}, "112": {"acRate": 51.246813494101815, "difficulty": "Easy", "likes": 9768, "dislikes": 1120, "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": 1557383, "totalSubmissionRaw": 3038986}, "113": {"acRate": 59.0930732419765, "difficulty": "Medium", "likes": 7995, "dislikes": 156, "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": 899831, "totalSubmissionRaw": 1522740}, "114": {"acRate": 66.19802764512133, "difficulty": "Medium", "likes": 12371, "dislikes": 565, "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": 1021175, "totalSubmissionRaw": 1542608}, "115": {"acRate": 48.13827173294366, "difficulty": "Hard", "likes": 6701, "dislikes": 292, "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": 445701, "totalSubmissionRaw": 925882}, "116": {"acRate": 63.52755043692709, "difficulty": "Medium", "likes": 9781, "dislikes": 307, "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": 1086546, "totalSubmissionRaw": 1710354}, "117": {"acRate": 53.425688150250835, "difficulty": "Medium", "likes": 5870, "dislikes": 323, "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": 663249, "totalSubmissionRaw": 1241443}, "118": {"acRate": 75.24999498673155, "difficulty": "Easy", "likes": 13012, "dislikes": 464, "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": 1801201, "totalSubmissionRaw": 2393626}, "119": {"acRate": 64.59483144132459, "difficulty": "Easy", "likes": 4866, "dislikes": 345, "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": 930225, "totalSubmissionRaw": 1440092}, "120": {"acRate": 57.58669596817212, "difficulty": "Medium", "likes": 9614, "dislikes": 561, "categoryTitle": "Algorithms", "frontendQuestionId": "120", "paidOnly": false, "title": "Triangle", "titleSlug": "triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 829094, "totalSubmissionRaw": 1439734}, "121": {"acRate": 54.08155901685821, "difficulty": "Easy", "likes": 31343, "dislikes": 1185, "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": 5148536, "totalSubmissionRaw": 9519979}, "122": {"acRate": 67.5205483702883, "difficulty": "Medium", "likes": 13756, "dislikes": 2713, "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": 2088849, "totalSubmissionRaw": 3093656}, "123": {"acRate": 49.063768008040796, "difficulty": "Hard", "likes": 9743, "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": 659000, "totalSubmissionRaw": 1343150}, "124": {"acRate": 40.35243822893821, "difficulty": "Hard", "likes": 16808, "dislikes": 741, "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": 1331933, "totalSubmissionRaw": 3300762}, "125": {"acRate": 48.582151415819936, "difficulty": "Easy", "likes": 9515, "dislikes": 8404, "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": 3328772, "totalSubmissionRaw": 6851841}, "126": {"acRate": 27.171389929958995, "difficulty": "Hard", "likes": 6043, "dislikes": 758, "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": 377495, "totalSubmissionRaw": 1389322}, "127": {"acRate": 40.2469365550479, "difficulty": "Hard", "likes": 12159, "dislikes": 1887, "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": 1141905, "totalSubmissionRaw": 2837247}, "128": {"acRate": 47.39997018853379, "difficulty": "Medium", "likes": 20254, "dislikes": 1039, "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": 1996998, "totalSubmissionRaw": 4213089}, "129": {"acRate": 66.58583516206016, "difficulty": "Medium", "likes": 8091, "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": 936067, "totalSubmissionRaw": 1405805}, "130": {"acRate": 40.61830860279971, "difficulty": "Medium", "likes": 8747, "dislikes": 1895, "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": 777748, "totalSubmissionRaw": 1914772}, "131": {"acRate": 70.16626269108681, "difficulty": "Medium", "likes": 12974, "dislikes": 506, "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": 955581, "totalSubmissionRaw": 1361881}, "132": {"acRate": 34.2835566002222, "difficulty": "Hard", "likes": 5493, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "132", "paidOnly": false, "title": "Palindrome Partitioning II", "titleSlug": "palindrome-partitioning-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 298714, "totalSubmissionRaw": 871304}, "133": {"acRate": 58.856835752812884, "difficulty": "Medium", "likes": 9584, "dislikes": 3869, "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": 1329510, "totalSubmissionRaw": 2258888}, "134": {"acRate": 45.58768747658948, "difficulty": "Medium", "likes": 12100, "dislikes": 1187, "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": 888457, "totalSubmissionRaw": 1948897}, "135": {"acRate": 43.779470465774224, "difficulty": "Hard", "likes": 7943, "dislikes": 675, "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": 590499, "totalSubmissionRaw": 1348805}, "136": {"acRate": 73.94683225346346, "difficulty": "Easy", "likes": 16626, "dislikes": 739, "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": 3043245, "totalSubmissionRaw": 4115454}, "137": {"acRate": 63.64494408619623, "difficulty": "Medium", "likes": 7987, "dislikes": 699, "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": 634528, "totalSubmissionRaw": 996981}, "138": {"acRate": 57.456297504457474, "difficulty": "Medium", "likes": 13994, "dislikes": 1495, "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": 1342147, "totalSubmissionRaw": 2335951}, "139": {"acRate": 47.17756062914431, "difficulty": "Medium", "likes": 17308, "dislikes": 803, "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": 1781465, "totalSubmissionRaw": 3776092}, "140": {"acRate": 51.59643650466823, "difficulty": "Hard", "likes": 7229, "dislikes": 539, "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": 680347, "totalSubmissionRaw": 1318593}, "141": {"acRate": 51.03417913287432, "difficulty": "Easy", "likes": 15653, "dislikes": 1396, "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": 3237594, "totalSubmissionRaw": 6343983}, "142": {"acRate": 52.45828797405079, "difficulty": "Medium", "likes": 13686, "dislikes": 973, "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": 1393107, "totalSubmissionRaw": 2655647}, "143": {"acRate": 59.93478663606131, "difficulty": "Medium", "likes": 11219, "dislikes": 413, "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": 1061141, "totalSubmissionRaw": 1770494}, "144": {"acRate": 70.66599046688239, "difficulty": "Easy", "likes": 8045, "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": 1740350, "totalSubmissionRaw": 2462783}, "145": {"acRate": 73.27860258522153, "difficulty": "Easy", "likes": 7161, "dislikes": 202, "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": 1395029, "totalSubmissionRaw": 1903736}, "146": {"acRate": 43.145700773287835, "difficulty": "Medium", "likes": 20884, "dislikes": 1054, "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": 1748490, "totalSubmissionRaw": 4052530}, "147": {"acRate": 54.43948591047849, "difficulty": "Medium", "likes": 3126, "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": 386093, "totalSubmissionRaw": 709214}, "148": {"acRate": 59.322678006448726, "difficulty": "Medium", "likes": 11736, "dislikes": 355, "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": 863247, "totalSubmissionRaw": 1455170}, "149": {"acRate": 27.422078837412794, "difficulty": "Hard", "likes": 4209, "dislikes": 505, "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": 412416, "totalSubmissionRaw": 1503956}, "150": {"acRate": 52.55576664735314, "difficulty": "Medium", "likes": 7730, "dislikes": 1101, "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": 1144697, "totalSubmissionRaw": 2178068}, "151": {"acRate": 45.79554322829625, "difficulty": "Medium", "likes": 8604, "dislikes": 5212, "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": 1763371, "totalSubmissionRaw": 3850527}, "152": {"acRate": 33.843783564745195, "difficulty": "Medium", "likes": 18655, "dislikes": 719, "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": 1367205, "totalSubmissionRaw": 4039752}, "153": {"acRate": 51.21142051586223, "difficulty": "Medium", "likes": 13382, "dislikes": 596, "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": 1989259, "totalSubmissionRaw": 3884406}, "154": {"acRate": 43.72425122277722, "difficulty": "Hard", "likes": 4713, "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": 471647, "totalSubmissionRaw": 1078689}, "155": {"acRate": 54.88971946147031, "difficulty": "Medium", "likes": 14288, "dislikes": 884, "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": 1818996, "totalSubmissionRaw": 3313911}, "156": {"acRate": 63.16294550666893, "difficulty": "Medium", "likes": 263, "dislikes": 353, "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": 103994, "totalSubmissionRaw": 164644}, "157": {"acRate": 41.744639983499376, "difficulty": "Easy", "likes": 580, "dislikes": 3509, "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": 194295, "totalSubmissionRaw": 465436}, "158": {"acRate": 42.491622332223926, "difficulty": "Hard", "likes": 869, "dislikes": 1805, "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": 186016, "totalSubmissionRaw": 437771}, "159": {"acRate": 55.65500185327507, "difficulty": "Medium", "likes": 2216, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "159", "paidOnly": true, "title": "Longest Substring with At Most Two Distinct Characters", "titleSlug": "longest-substring-with-at-most-two-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 265770, "totalSubmissionRaw": 477532}, "160": {"acRate": 58.69093156148581, "difficulty": "Easy", "likes": 15088, "dislikes": 1367, "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": 1688713, "totalSubmissionRaw": 2877298}, "161": {"acRate": 34.38184714411105, "difficulty": "Medium", "likes": 1391, "dislikes": 188, "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": 211524, "totalSubmissionRaw": 615220}, "162": {"acRate": 45.994281778429794, "difficulty": "Medium", "likes": 12225, "dislikes": 4709, "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": 1521176, "totalSubmissionRaw": 3307311}, "163": {"acRate": 34.11495474585555, "difficulty": "Easy", "likes": 1101, "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": 251636, "totalSubmissionRaw": 737612}, "164": {"acRate": 47.0569320196232, "difficulty": "Medium", "likes": 3295, "dislikes": 407, "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": 228292, "totalSubmissionRaw": 485140}, "165": {"acRate": 41.25340696621764, "difficulty": "Medium", "likes": 2650, "dislikes": 2738, "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": 509010, "totalSubmissionRaw": 1233866}, "166": {"acRate": 25.32739283137606, "difficulty": "Medium", "likes": 2100, "dislikes": 3683, "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": 234152, "totalSubmissionRaw": 924501}, "167": {"acRate": 61.993984624893294, "difficulty": "Medium", "likes": 11843, "dislikes": 1428, "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": 2220701, "totalSubmissionRaw": 3582131}, "168": {"acRate": 41.50914950860347, "difficulty": "Easy", "likes": 5599, "dislikes": 824, "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": 553417, "totalSubmissionRaw": 1333241}, "169": {"acRate": 65.16648465592813, "difficulty": "Easy", "likes": 19452, "dislikes": 647, "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": 3277820, "totalSubmissionRaw": 5029914}, "170": {"acRate": 38.278805120910384, "difficulty": "Easy", "likes": 670, "dislikes": 449, "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": 158769, "totalSubmissionRaw": 414770}, "171": {"acRate": 64.3855272207463, "difficulty": "Easy", "likes": 4794, "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": 716157, "totalSubmissionRaw": 1112295}, "172": {"acRate": 43.786094856874854, "difficulty": "Medium", "likes": 3230, "dislikes": 1958, "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": 481746, "totalSubmissionRaw": 1100226}, "173": {"acRate": 72.95959222508223, "difficulty": "Medium", "likes": 8609, "dislikes": 513, "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": 832769, "totalSubmissionRaw": 1141412}, "174": {"acRate": 38.42389519994747, "difficulty": "Hard", "likes": 5833, "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": 234063, "totalSubmissionRaw": 609160}, "175": {"acRate": 76.63309411477121, "difficulty": "Easy", "likes": 3548, "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": 1084697, "totalSubmissionRaw": 1415442}, "176": {"acRate": 41.44745745229045, "difficulty": "Medium", "likes": 3633, "dislikes": 962, "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": 940265, "totalSubmissionRaw": 2268571}, "177": {"acRate": 37.953568435596026, "difficulty": "Medium", "likes": 1997, "dislikes": 1035, "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": 418921, "totalSubmissionRaw": 1103774}, "178": {"acRate": 63.272309652630156, "difficulty": "Medium", "likes": 2182, "dislikes": 275, "categoryTitle": "Database", "frontendQuestionId": "178", "paidOnly": false, "title": "Rank Scores", "titleSlug": "rank-scores", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 417606, "totalSubmissionRaw": 660015}, "179": {"acRate": 36.848846357930945, "difficulty": "Medium", "likes": 8095, "dislikes": 676, "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": 503475, "totalSubmissionRaw": 1366324}, "180": {"acRate": 43.880676646894514, "difficulty": "Medium", "likes": 2150, "dislikes": 326, "categoryTitle": "Database", "frontendQuestionId": "180", "paidOnly": false, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 419451, "totalSubmissionRaw": 955875}, "181": {"acRate": 70.13765571248204, "difficulty": "Easy", "likes": 2625, "dislikes": 258, "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": 686057, "totalSubmissionRaw": 978160}, "182": {"acRate": 71.4851981685147, "difficulty": "Easy", "likes": 2097, "dislikes": 71, "categoryTitle": "Database", "frontendQuestionId": "182", "paidOnly": false, "title": "Duplicate Emails", "titleSlug": "duplicate-emails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 712711, "totalSubmissionRaw": 997005}, "183": {"acRate": 69.55971099210194, "difficulty": "Easy", "likes": 2649, "dislikes": 138, "categoryTitle": "Database", "frontendQuestionId": "183", "paidOnly": false, "title": "Customers Who Never Order", "titleSlug": "customers-who-never-order", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 860105, "totalSubmissionRaw": 1236501}, "184": {"acRate": 52.56607242815775, "difficulty": "Medium", "likes": 2080, "dislikes": 188, "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": 412249, "totalSubmissionRaw": 784251}, "185": {"acRate": 54.836589671695826, "difficulty": "Hard", "likes": 2132, "dislikes": 245, "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": 369631, "totalSubmissionRaw": 674061}, "186": {"acRate": 55.100187904285214, "difficulty": "Medium", "likes": 1075, "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": 165672, "totalSubmissionRaw": 300678}, "187": {"acRate": 49.53620758682815, "difficulty": "Medium", "likes": 3346, "dislikes": 539, "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": 395933, "totalSubmissionRaw": 799280}, "188": {"acRate": 44.35884917672339, "difficulty": "Hard", "likes": 7471, "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": 497913, "totalSubmissionRaw": 1122466}, "189": {"acRate": 41.43090903147999, "difficulty": "Medium", "likes": 18217, "dislikes": 1990, "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": 2459010, "totalSubmissionRaw": 5935209}, "190": {"acRate": 60.01164127946963, "difficulty": "Easy", "likes": 5147, "dislikes": 1460, "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": 851611, "totalSubmissionRaw": 1419071}, "191": {"acRate": 72.26617581909498, "difficulty": "Easy", "likes": 6559, "dislikes": 1341, "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": 1569241, "totalSubmissionRaw": 2171476}, "192": {"acRate": 25.973378026215087, "difficulty": "Medium", "likes": 544, "dislikes": 308, "categoryTitle": "Shell", "frontendQuestionId": "192", "paidOnly": false, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53621, "totalSubmissionRaw": 206446}, "193": {"acRate": 26.26924073362695, "difficulty": "Easy", "likes": 425, "dislikes": 968, "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": 88215, "totalSubmissionRaw": 335811}, "194": {"acRate": 26.79002017617243, "difficulty": "Medium", "likes": 147, "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": 27220, "totalSubmissionRaw": 101605}, "195": {"acRate": 33.590050398503266, "difficulty": "Easy", "likes": 392, "dislikes": 468, "categoryTitle": "Shell", "frontendQuestionId": "195", "paidOnly": false, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 112570, "totalSubmissionRaw": 335129}, "196": {"acRate": 62.766051743483416, "difficulty": "Easy", "likes": 1638, "dislikes": 335, "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": 580647, "totalSubmissionRaw": 925098}, "197": {"acRate": 48.65463231307497, "difficulty": "Easy", "likes": 3051, "dislikes": 630, "categoryTitle": "Database", "frontendQuestionId": "197", "paidOnly": false, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 774431, "totalSubmissionRaw": 1591699}, "198": {"acRate": 51.43863685843938, "difficulty": "Medium", "likes": 21239, "dislikes": 434, "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": 2409903, "totalSubmissionRaw": 4685019}, "199": {"acRate": 63.76336672361019, "difficulty": "Medium", "likes": 12115, "dislikes": 984, "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": 1451945, "totalSubmissionRaw": 2277075}, "200": {"acRate": 60.287759043827606, "difficulty": "Medium", "likes": 22949, "dislikes": 524, "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": 2915636, "totalSubmissionRaw": 4836199}, "201": {"acRate": 47.209754766580566, "difficulty": "Medium", "likes": 4027, "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": 411797, "totalSubmissionRaw": 872271}, "202": {"acRate": 56.726705685010906, "difficulty": "Easy", "likes": 10471, "dislikes": 1480, "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": 1576256, "totalSubmissionRaw": 2778685}, "203": {"acRate": 49.7563215906635, "difficulty": "Easy", "likes": 8366, "dislikes": 251, "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": 1197151, "totalSubmissionRaw": 2406023}, "204": {"acRate": 33.944192204364874, "difficulty": "Medium", "likes": 8027, "dislikes": 1462, "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": 922482, "totalSubmissionRaw": 2717645}, "205": {"acRate": 45.647988062015074, "difficulty": "Easy", "likes": 9120, "dislikes": 2118, "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": 1467702, "totalSubmissionRaw": 3215250}, "206": {"acRate": 77.50642419963557, "difficulty": "Easy", "likes": 21765, "dislikes": 456, "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": 4479034, "totalSubmissionRaw": 5778921}, "207": {"acRate": 47.39730395976206, "difficulty": "Medium", "likes": 16332, "dislikes": 734, "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": 1700252, "totalSubmissionRaw": 3587229}, "208": {"acRate": 66.15646992661942, "difficulty": "Medium", "likes": 11617, "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": 1118735, "totalSubmissionRaw": 1691045}, "209": {"acRate": 47.75485881655781, "difficulty": "Medium", "likes": 12723, "dislikes": 445, "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": 1153196, "totalSubmissionRaw": 2414830}, "210": {"acRate": 51.359802290193336, "difficulty": "Medium", "likes": 10859, "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": 1125963, "totalSubmissionRaw": 2192304}, "211": {"acRate": 45.82080785750121, "difficulty": "Medium", "likes": 7623, "dislikes": 458, "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": 674019, "totalSubmissionRaw": 1470991}, "212": {"acRate": 36.5495098894346, "difficulty": "Hard", "likes": 9480, "dislikes": 468, "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": 693497, "totalSubmissionRaw": 1897419}, "213": {"acRate": 42.47237296939087, "difficulty": "Medium", "likes": 9936, "dislikes": 158, "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": 829971, "totalSubmissionRaw": 1954149}, "214": {"acRate": 33.96143867142183, "difficulty": "Hard", "likes": 3640, "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": 189406, "totalSubmissionRaw": 557709}, "215": {"acRate": 67.06308812151234, "difficulty": "Medium", "likes": 17197, "dislikes": 892, "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": 2482394, "totalSubmissionRaw": 3701573}, "216": {"acRate": 70.45932831717808, "difficulty": "Medium", "likes": 6055, "dislikes": 113, "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": 557454, "totalSubmissionRaw": 791173}, "217": {"acRate": 62.17346570232759, "difficulty": "Easy", "likes": 12129, "dislikes": 1304, "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": 4301859, "totalSubmissionRaw": 6919131}, "218": {"acRate": 43.015955260430836, "difficulty": "Hard", "likes": 5918, "dislikes": 267, "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": 297211, "totalSubmissionRaw": 690932}, "219": {"acRate": 46.28651016707277, "difficulty": "Easy", "likes": 6220, "dislikes": 3111, "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": 1039851, "totalSubmissionRaw": 2246549}, "220": {"acRate": 22.963142151859845, "difficulty": "Hard", "likes": 1023, "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": 260098, "totalSubmissionRaw": 1132675}, "221": {"acRate": 47.209871960914384, "difficulty": "Medium", "likes": 10180, "dislikes": 230, "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": 717367, "totalSubmissionRaw": 1519531}, "222": {"acRate": 66.9924936801521, "difficulty": "Easy", "likes": 8716, "dislikes": 524, "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": 795284, "totalSubmissionRaw": 1187127}, "223": {"acRate": 46.57804416276032, "difficulty": "Medium", "likes": 1999, "dislikes": 1649, "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": 230025, "totalSubmissionRaw": 493852}, "224": {"acRate": 43.85336773576805, "difficulty": "Hard", "likes": 6356, "dislikes": 505, "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": 495436, "totalSubmissionRaw": 1129760}, "225": {"acRate": 65.042203137299, "difficulty": "Easy", "likes": 6139, "dislikes": 1212, "categoryTitle": "Algorithms", "frontendQuestionId": "225", "paidOnly": false, "title": "Implement Stack using Queues", "titleSlug": "implement-stack-using-queues", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 740378, "totalSubmissionRaw": 1138304}, "226": {"acRate": 77.7234257751852, "difficulty": "Easy", "likes": 14048, "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": 2226174, "totalSubmissionRaw": 2864230}, "227": {"acRate": 44.13716048984195, "difficulty": "Medium", "likes": 6168, "dislikes": 853, "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": 669983, "totalSubmissionRaw": 1517953}, "228": {"acRate": 51.463448341672006, "difficulty": "Easy", "likes": 4006, "dislikes": 2191, "categoryTitle": "Algorithms", "frontendQuestionId": "228", "paidOnly": false, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 625596, "totalSubmissionRaw": 1215612}, "229": {"acRate": 52.50708074958575, "difficulty": "Medium", "likes": 9774, "dislikes": 433, "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": 768427, "totalSubmissionRaw": 1463473}, "230": {"acRate": 73.53486293107954, "difficulty": "Medium", "likes": 11569, "dislikes": 233, "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": 1561234, "totalSubmissionRaw": 2123121}, "231": {"acRate": 47.94458855500912, "difficulty": "Easy", "likes": 6875, "dislikes": 438, "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": 1427621, "totalSubmissionRaw": 2977649}, "232": {"acRate": 66.89573054613547, "difficulty": "Easy", "likes": 7711, "dislikes": 439, "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": 1009573, "totalSubmissionRaw": 1509175}, "233": {"acRate": 34.84550774842403, "difficulty": "Hard", "likes": 1576, "dislikes": 1481, "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": 98779, "totalSubmissionRaw": 283476}, "234": {"acRate": 54.027512912586005, "difficulty": "Easy", "likes": 16613, "dislikes": 888, "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": 2069558, "totalSubmissionRaw": 3830563}, "235": {"acRate": 65.91760223046806, "difficulty": "Medium", "likes": 11222, "dislikes": 324, "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": 1611953, "totalSubmissionRaw": 2445406}, "236": {"acRate": 63.67370718847184, "difficulty": "Medium", "likes": 16717, "dislikes": 423, "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": 1769407, "totalSubmissionRaw": 2778866}, "237": {"acRate": 80.6457762459672, "difficulty": "Medium", "likes": 5170, "dislikes": 1589, "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": 1493312, "totalSubmissionRaw": 1851693}, "238": {"acRate": 66.64178086370876, "difficulty": "Medium", "likes": 22830, "dislikes": 1437, "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": 2916202, "totalSubmissionRaw": 4375944}, "239": {"acRate": 46.80022064091536, "difficulty": "Hard", "likes": 18362, "dislikes": 696, "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": 1107214, "totalSubmissionRaw": 2365826}, "240": {"acRate": 53.42714092597207, "difficulty": "Medium", "likes": 11992, "dislikes": 207, "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": 988454, "totalSubmissionRaw": 1850098}, "241": {"acRate": 65.91830407204681, "difficulty": "Medium", "likes": 5396, "dislikes": 281, "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": 227490, "totalSubmissionRaw": 345109}, "242": {"acRate": 65.22051066765027, "difficulty": "Easy", "likes": 12265, "dislikes": 408, "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": 3865251, "totalSubmissionRaw": 5926446}, "243": {"acRate": 65.46630148176177, "difficulty": "Easy", "likes": 1268, "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": 217991, "totalSubmissionRaw": 332982}, "244": {"acRate": 61.38475270026383, "difficulty": "Medium", "likes": 1053, "dislikes": 339, "categoryTitle": "Algorithms", "frontendQuestionId": "244", "paidOnly": true, "title": "Shortest Word Distance II", "titleSlug": "shortest-word-distance-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 156118, "totalSubmissionRaw": 254327}, "245": {"acRate": 58.607538927244505, "difficulty": "Medium", "likes": 505, "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": 83446, "totalSubmissionRaw": 142381}, "246": {"acRate": 47.68818201116208, "difficulty": "Easy", "likes": 597, "dislikes": 1018, "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": 177473, "totalSubmissionRaw": 372153}, "247": {"acRate": 52.61234276385791, "difficulty": "Medium", "likes": 926, "dislikes": 252, "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": 144383, "totalSubmissionRaw": 274428}, "248": {"acRate": 42.200633870745484, "difficulty": "Hard", "likes": 301, "dislikes": 189, "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": 36750, "totalSubmissionRaw": 87084}, "249": {"acRate": 66.01103082736516, "difficulty": "Medium", "likes": 1673, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "249", "paidOnly": true, "title": "Group Shifted Strings", "titleSlug": "group-shifted-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 248585, "totalSubmissionRaw": 376581}, "250": {"acRate": 56.610898887430984, "difficulty": "Medium", "likes": 1205, "dislikes": 431, "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": 155753, "totalSubmissionRaw": 275129}, "251": {"acRate": 49.65058823078427, "difficulty": "Medium", "likes": 717, "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": 129522, "totalSubmissionRaw": 260867}, "252": {"acRate": 58.34810673849461, "difficulty": "Easy", "likes": 2040, "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": 416343, "totalSubmissionRaw": 713551}, "253": {"acRate": 51.48225152495412, "difficulty": "Medium", "likes": 6960, "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": 928310, "totalSubmissionRaw": 1803164}, "254": {"acRate": 49.70994337172582, "difficulty": "Medium", "likes": 1135, "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": 129387, "totalSubmissionRaw": 260284}, "255": {"acRate": 50.19755397782533, "difficulty": "Medium", "likes": 1204, "dislikes": 90, "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": 82581, "totalSubmissionRaw": 164512}, "256": {"acRate": 62.858041807932864, "difficulty": "Medium", "likes": 2299, "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": 213767, "totalSubmissionRaw": 340079}, "257": {"acRate": 64.579400660689, "difficulty": "Easy", "likes": 6617, "dislikes": 301, "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": 766325, "totalSubmissionRaw": 1186640}, "258": {"acRate": 67.08097711743804, "difficulty": "Easy", "likes": 4866, "dislikes": 1938, "categoryTitle": "Algorithms", "frontendQuestionId": "258", "paidOnly": false, "title": "Add Digits", "titleSlug": "add-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 839503, "totalSubmissionRaw": 1251477}, "259": {"acRate": 50.84017181373919, "difficulty": "Medium", "likes": 1559, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "259", "paidOnly": true, "title": "3Sum Smaller", "titleSlug": "3sum-smaller", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154697, "totalSubmissionRaw": 304282}, "260": {"acRate": 70.77325661741651, "difficulty": "Medium", "likes": 6379, "dislikes": 267, "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": 476275, "totalSubmissionRaw": 672959}, "261": {"acRate": 48.46191192780454, "difficulty": "Medium", "likes": 3293, "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": 421229, "totalSubmissionRaw": 869196}, "262": {"acRate": 36.56470905808716, "difficulty": "Hard", "likes": 1251, "dislikes": 671, "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": 195056, "totalSubmissionRaw": 533434}, "263": {"acRate": 42.139881105915265, "difficulty": "Easy", "likes": 3419, "dislikes": 1722, "categoryTitle": "Algorithms", "frontendQuestionId": "263", "paidOnly": false, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 555461, "totalSubmissionRaw": 1318133}, "264": {"acRate": 49.12545000064982, "difficulty": "Medium", "likes": 6522, "dislikes": 393, "categoryTitle": "Algorithms", "frontendQuestionId": "264", "paidOnly": false, "title": "Ugly Number II", "titleSlug": "ugly-number-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 453590, "totalSubmissionRaw": 923331}, "265": {"acRate": 55.071172044983875, "difficulty": "Hard", "likes": 1307, "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": 126048, "totalSubmissionRaw": 228882}, "266": {"acRate": 67.65722720739619, "difficulty": "Easy", "likes": 1057, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "266", "paidOnly": true, "title": "Palindrome Permutation", "titleSlug": "palindrome-permutation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209002, "totalSubmissionRaw": 308914}, "267": {"acRate": 41.82262532551118, "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": 70505, "totalSubmissionRaw": 168580}, "268": {"acRate": 67.9504041311989, "difficulty": "Easy", "likes": 12273, "dislikes": 3345, "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": 2454581, "totalSubmissionRaw": 3612314}, "269": {"acRate": 35.952200452305824, "difficulty": "Hard", "likes": 4439, "dislikes": 998, "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": 394093, "totalSubmissionRaw": 1096158}, "270": {"acRate": 51.13602551234686, "difficulty": "Easy", "likes": 1813, "dislikes": 143, "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": 359182, "totalSubmissionRaw": 702404}, "271": {"acRate": 47.53157923768548, "difficulty": "Medium", "likes": 1468, "dislikes": 412, "categoryTitle": "Algorithms", "frontendQuestionId": "271", "paidOnly": true, "title": "Encode and Decode Strings", "titleSlug": "encode-and-decode-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 215424, "totalSubmissionRaw": 453224}, "272": {"acRate": 59.4267759455697, "difficulty": "Hard", "likes": 1296, "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": 121233, "totalSubmissionRaw": 204004}, "273": {"acRate": 33.97942539600622, "difficulty": "Hard", "likes": 3613, "dislikes": 6707, "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": 504339, "totalSubmissionRaw": 1484251}, "274": {"acRate": 39.30559900360222, "difficulty": "Medium", "likes": 1354, "dislikes": 615, "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": 541529, "totalSubmissionRaw": 1377742}, "275": {"acRate": 38.4075737781198, "difficulty": "Medium", "likes": 358, "dislikes": 100, "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": 214610, "totalSubmissionRaw": 558770}, "276": {"acRate": 46.99956641718771, "difficulty": "Medium", "likes": 1562, "dislikes": 389, "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": 115986, "totalSubmissionRaw": 246781}, "277": {"acRate": 47.535766680055644, "difficulty": "Medium", "likes": 2846, "dislikes": 282, "categoryTitle": "Algorithms", "frontendQuestionId": "277", "paidOnly": true, "title": "Find the Celebrity", "titleSlug": "find-the-celebrity", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 275744, "totalSubmissionRaw": 580078}, "278": {"acRate": 44.8168331083545, "difficulty": "Easy", "likes": 8408, "dislikes": 3316, "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": 1751339, "totalSubmissionRaw": 3907771}, "279": {"acRate": 55.075427292719624, "difficulty": "Medium", "likes": 11243, "dislikes": 475, "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": 885046, "totalSubmissionRaw": 1606974}, "280": {"acRate": 67.82775065768186, "difficulty": "Medium", "likes": 1213, "dislikes": 103, "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": 144642, "totalSubmissionRaw": 213249}, "281": {"acRate": 64.29903532663384, "difficulty": "Medium", "likes": 682, "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": 95848, "totalSubmissionRaw": 149066}, "282": {"acRate": 40.24286057770191, "difficulty": "Hard", "likes": 3418, "dislikes": 631, "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": 235988, "totalSubmissionRaw": 586411}, "283": {"acRate": 62.04785425644895, "difficulty": "Easy", "likes": 16900, "dislikes": 474, "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": 3280502, "totalSubmissionRaw": 5287061}, "284": {"acRate": 59.85297327222302, "difficulty": "Medium", "likes": 1858, "dislikes": 1039, "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": 224876, "totalSubmissionRaw": 375714}, "285": {"acRate": 50.077112847709515, "difficulty": "Medium", "likes": 2572, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "285", "paidOnly": true, "title": "Inorder Successor in BST", "titleSlug": "inorder-successor-in-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 338982, "totalSubmissionRaw": 676924}, "286": {"acRate": 61.80587636153149, "difficulty": "Medium", "likes": 3145, "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": 333134, "totalSubmissionRaw": 539002}, "287": {"acRate": 61.48865789480619, "difficulty": "Medium", "likes": 23445, "dislikes": 4740, "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": 1866651, "totalSubmissionRaw": 3035766}, "288": {"acRate": 26.495236807362044, "difficulty": "Medium", "likes": 204, "dislikes": 1823, "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": 74454, "totalSubmissionRaw": 281009}, "289": {"acRate": 69.95744919489951, "difficulty": "Medium", "likes": 6386, "dislikes": 577, "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": 498982, "totalSubmissionRaw": 713265}, "290": {"acRate": 42.36269514310494, "difficulty": "Easy", "likes": 7304, "dislikes": 1040, "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": 781506, "totalSubmissionRaw": 1844796}, "291": {"acRate": 48.35787932553321, "difficulty": "Medium", "likes": 919, "dislikes": 75, "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": 77950, "totalSubmissionRaw": 161194}, "292": {"acRate": 57.20481580275395, "difficulty": "Easy", "likes": 1739, "dislikes": 2701, "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": 396744, "totalSubmissionRaw": 693550}, "293": {"acRate": 64.68719346522104, "difficulty": "Easy", "likes": 227, "dislikes": 467, "categoryTitle": "Algorithms", "frontendQuestionId": "293", "paidOnly": true, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74519, "totalSubmissionRaw": 115199}, "294": {"acRate": 52.160707392219564, "difficulty": "Medium", "likes": 621, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "294", "paidOnly": true, "title": "Flip Game II", "titleSlug": "flip-game-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71613, "totalSubmissionRaw": 137293}, "295": {"acRate": 52.283060382485935, "difficulty": "Hard", "likes": 12004, "dislikes": 244, "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": 844975, "totalSubmissionRaw": 1616157}, "296": {"acRate": 60.98520628111616, "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": 85869, "totalSubmissionRaw": 140803}, "297": {"acRate": 57.43857363020135, "difficulty": "Hard", "likes": 10236, "dislikes": 401, "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": 916841, "totalSubmissionRaw": 1596212}, "298": {"acRate": 53.70048564302204, "difficulty": "Medium", "likes": 1140, "dislikes": 238, "categoryTitle": "Algorithms", "frontendQuestionId": "298", "paidOnly": true, "title": "Binary Tree Longest Consecutive Sequence", "titleSlug": "binary-tree-longest-consecutive-sequence", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150493, "totalSubmissionRaw": 280246}, "299": {"acRate": 50.59250464819336, "difficulty": "Medium", "likes": 2444, "dislikes": 1783, "categoryTitle": "Algorithms", "frontendQuestionId": "299", "paidOnly": false, "title": "Bulls and Cows", "titleSlug": "bulls-and-cows", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 383943, "totalSubmissionRaw": 758895}, "300": {"acRate": 56.17785981565506, "difficulty": "Medium", "likes": 21006, "dislikes": 453, "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": 1823644, "totalSubmissionRaw": 3246197}, "301": {"acRate": 48.50205421910062, "difficulty": "Hard", "likes": 5867, "dislikes": 287, "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": 442233, "totalSubmissionRaw": 911782}, "302": {"acRate": 59.094993057257206, "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": 50645, "totalSubmissionRaw": 85701}, "303": {"acRate": 64.74902512015962, "difficulty": "Easy", "likes": 3269, "dislikes": 1916, "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": 571193, "totalSubmissionRaw": 882163}, "304": {"acRate": 55.18114821798462, "difficulty": "Medium", "likes": 4986, "dislikes": 345, "categoryTitle": "Algorithms", "frontendQuestionId": "304", "paidOnly": false, "title": "Range Sum Query 2D - Immutable", "titleSlug": "range-sum-query-2d-immutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 380149, "totalSubmissionRaw": 688911}, "305": {"acRate": 39.90789315606103, "difficulty": "Hard", "likes": 1871, "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": 149481, "totalSubmissionRaw": 374565}, "306": {"acRate": 31.950110617223814, "difficulty": "Medium", "likes": 1180, "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": 94445, "totalSubmissionRaw": 295604}, "307": {"acRate": 41.24899249844178, "difficulty": "Medium", "likes": 4775, "dislikes": 256, "categoryTitle": "Algorithms", "frontendQuestionId": "307", "paidOnly": false, "title": "Range Sum Query - Mutable", "titleSlug": "range-sum-query-mutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 279939, "totalSubmissionRaw": 678658}, "308": {"acRate": 44.25994782027992, "difficulty": "Hard", "likes": 801, "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": 78206, "totalSubmissionRaw": 176697}, "309": {"acRate": 59.02335638378193, "difficulty": "Medium", "likes": 9438, "dislikes": 324, "categoryTitle": "Algorithms", "frontendQuestionId": "309", "paidOnly": false, "title": "Best Time to Buy and Sell Stock with Cooldown", "titleSlug": "best-time-to-buy-and-sell-stock-with-cooldown", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 551124, "totalSubmissionRaw": 933742}, "310": {"acRate": 41.84784250106786, "difficulty": "Medium", "likes": 8286, "dislikes": 384, "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": 387968, "totalSubmissionRaw": 927092}, "311": {"acRate": 68.25101986457881, "difficulty": "Medium", "likes": 1066, "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": 194742, "totalSubmissionRaw": 285332}, "312": {"acRate": 59.72757034842934, "difficulty": "Hard", "likes": 9035, "dislikes": 254, "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": 306498, "totalSubmissionRaw": 513160}, "313": {"acRate": 45.33337422978352, "difficulty": "Medium", "likes": 2181, "dislikes": 391, "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": 133019, "totalSubmissionRaw": 293424}, "314": {"acRate": 55.02453960673627, "difficulty": "Medium", "likes": 3265, "dislikes": 334, "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": 436684, "totalSubmissionRaw": 793616}, "315": {"acRate": 42.576009713981506, "difficulty": "Hard", "likes": 8854, "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": 330300, "totalSubmissionRaw": 775789}, "316": {"acRate": 50.08045740396575, "difficulty": "Medium", "likes": 8695, "dislikes": 634, "categoryTitle": "Algorithms", "frontendQuestionId": "316", "paidOnly": false, "title": "Remove Duplicate Letters", "titleSlug": "remove-duplicate-letters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 345458, "totalSubmissionRaw": 689806}, "317": {"acRate": 43.440460629883695, "difficulty": "Hard", "likes": 1877, "dislikes": 303, "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": 182125, "totalSubmissionRaw": 419252}, "318": {"acRate": 60.149356343990554, "difficulty": "Medium", "likes": 3520, "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": 222222, "totalSubmissionRaw": 369451}, "319": {"acRate": 53.068945832071805, "difficulty": "Medium", "likes": 2687, "dislikes": 3124, "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": 229615, "totalSubmissionRaw": 432673}, "320": {"acRate": 59.70971754297811, "difficulty": "Medium", "likes": 704, "dislikes": 229, "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": 72486, "totalSubmissionRaw": 121398}, "321": {"acRate": 30.67746679155727, "difficulty": "Hard", "likes": 1940, "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": 63210, "totalSubmissionRaw": 206047}, "322": {"acRate": 44.71472185648642, "difficulty": "Medium", "likes": 19068, "dislikes": 460, "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": 1942214, "totalSubmissionRaw": 4343579}, "323": {"acRate": 63.19281213507566, "difficulty": "Medium", "likes": 2677, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "323", "paidOnly": true, "title": "Number of Connected Components in an Undirected Graph", "titleSlug": "number-of-connected-components-in-an-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 421011, "totalSubmissionRaw": 666233}, "324": {"acRate": 34.724738176885424, "difficulty": "Medium", "likes": 3084, "dislikes": 961, "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": 164855, "totalSubmissionRaw": 474748}, "325": {"acRate": 49.610848005202676, "difficulty": "Medium", "likes": 2045, "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": 189186, "totalSubmissionRaw": 381341}, "326": {"acRate": 46.98385906918915, "difficulty": "Easy", "likes": 3112, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "326", "paidOnly": false, "title": "Power of Three", "titleSlug": "power-of-three", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 884637, "totalSubmissionRaw": 1882853}, "327": {"acRate": 36.098142445614386, "difficulty": "Hard", "likes": 2317, "dislikes": 245, "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": 79947, "totalSubmissionRaw": 221473}, "328": {"acRate": 61.58443843614469, "difficulty": "Medium", "likes": 10069, "dislikes": 538, "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": 1014281, "totalSubmissionRaw": 1646978}, "329": {"acRate": 54.02745716214328, "difficulty": "Hard", "likes": 9000, "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": 549067, "totalSubmissionRaw": 1016272}, "330": {"acRate": 53.15442044528691, "difficulty": "Hard", "likes": 2313, "dislikes": 194, "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": 159838, "totalSubmissionRaw": 300705}, "331": {"acRate": 45.4839966566744, "difficulty": "Medium", "likes": 2340, "dislikes": 125, "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": 144751, "totalSubmissionRaw": 318246}, "332": {"acRate": 43.28316283138532, "difficulty": "Hard", "likes": 5913, "dislikes": 1875, "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": 445306, "totalSubmissionRaw": 1028822}, "333": {"acRate": 44.26300606784044, "difficulty": "Medium", "likes": 1493, "dislikes": 133, "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": 111244, "totalSubmissionRaw": 251325}, "334": {"acRate": 39.46776132780435, "difficulty": "Medium", "likes": 8171, "dislikes": 557, "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": 633203, "totalSubmissionRaw": 1604363}, "335": {"acRate": 30.886634773123532, "difficulty": "Hard", "likes": 387, "dislikes": 512, "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": 35961, "totalSubmissionRaw": 116429}, "336": {"acRate": 35.57200175326208, "difficulty": "Hard", "likes": 4474, "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": 211006, "totalSubmissionRaw": 593180}, "337": {"acRate": 54.412257292215784, "difficulty": "Medium", "likes": 8553, "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": 396365, "totalSubmissionRaw": 728445}, "338": {"acRate": 78.78869256729135, "difficulty": "Easy", "likes": 11172, "dislikes": 545, "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": 1185283, "totalSubmissionRaw": 1504384}, "339": {"acRate": 84.16247606208206, "difficulty": "Medium", "likes": 1736, "dislikes": 427, "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": 298403, "totalSubmissionRaw": 354557}, "340": {"acRate": 48.99762826114093, "difficulty": "Medium", "likes": 2834, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "340", "paidOnly": true, "title": "Longest Substring with At Most K Distinct Characters", "titleSlug": "longest-substring-with-at-most-k-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 353268, "totalSubmissionRaw": 720990}, "341": {"acRate": 64.74651763766623, "difficulty": "Medium", "likes": 4898, "dislikes": 1759, "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": 462261, "totalSubmissionRaw": 713955}, "342": {"acRate": 48.36443965932653, "difficulty": "Easy", "likes": 3937, "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": 702565, "totalSubmissionRaw": 1452649}, "343": {"acRate": 60.595756279133916, "difficulty": "Medium", "likes": 5121, "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": 369053, "totalSubmissionRaw": 609041}, "344": {"acRate": 78.9573631092689, "difficulty": "Easy", "likes": 8696, "dislikes": 1183, "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": 2812370, "totalSubmissionRaw": 3561885}, "345": {"acRate": 54.12269368676238, "difficulty": "Easy", "likes": 4622, "dislikes": 2797, "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": 969369, "totalSubmissionRaw": 1791059}, "346": {"acRate": 78.75796054675365, "difficulty": "Easy", "likes": 1664, "dislikes": 173, "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": 405633, "totalSubmissionRaw": 515038}, "347": {"acRate": 63.21697797923228, "difficulty": "Medium", "likes": 17478, "dislikes": 671, "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": 2302029, "totalSubmissionRaw": 3641476}, "348": {"acRate": 58.1778144530846, "difficulty": "Medium", "likes": 2072, "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": 253102, "totalSubmissionRaw": 435049}, "349": {"acRate": 75.12378784128958, "difficulty": "Easy", "likes": 6122, "dislikes": 2295, "categoryTitle": "Algorithms", "frontendQuestionId": "349", "paidOnly": false, "title": "Intersection of Two Arrays", "titleSlug": "intersection-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1296134, "totalSubmissionRaw": 1725331}, "350": {"acRate": 58.638916568903696, "difficulty": "Easy", "likes": 7707, "dislikes": 976, "categoryTitle": "Algorithms", "frontendQuestionId": "350", "paidOnly": false, "title": "Intersection of Two Arrays II", "titleSlug": "intersection-of-two-arrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1420541, "totalSubmissionRaw": 2422524}, "351": {"acRate": 52.9030883333448, "difficulty": "Medium", "likes": 186, "dislikes": 211, "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": 76965, "totalSubmissionRaw": 145483}, "352": {"acRate": 60.15624156435921, "difficulty": "Hard", "likes": 1741, "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": 111425, "totalSubmissionRaw": 185226}, "353": {"acRate": 38.85295250723456, "difficulty": "Medium", "likes": 947, "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": 86733, "totalSubmissionRaw": 223231}, "354": {"acRate": 37.07015513001622, "difficulty": "Hard", "likes": 6002, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "354", "paidOnly": false, "title": "Russian Doll Envelopes", "titleSlug": "russian-doll-envelopes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226727, "totalSubmissionRaw": 611616}, "355": {"acRate": 40.47456535868478, "difficulty": "Medium", "likes": 3967, "dislikes": 542, "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": 198648, "totalSubmissionRaw": 490797}, "356": {"acRate": 35.709279266958426, "difficulty": "Medium", "likes": 300, "dislikes": 622, "categoryTitle": "Algorithms", "frontendQuestionId": "356", "paidOnly": true, "title": "Line Reflection", "titleSlug": "line-reflection", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41777, "totalSubmissionRaw": 116992}, "357": {"acRate": 53.333431388050315, "difficulty": "Medium", "likes": 1541, "dislikes": 1499, "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": 145044, "totalSubmissionRaw": 271957}, "358": {"acRate": 38.963728131581114, "difficulty": "Hard", "likes": 965, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "358", "paidOnly": true, "title": "Rearrange String k Distance Apart", "titleSlug": "rearrange-string-k-distance-apart", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66236, "totalSubmissionRaw": 169994}, "359": {"acRate": 76.07384277528051, "difficulty": "Easy", "likes": 1742, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "359", "paidOnly": true, "title": "Logger Rate Limiter", "titleSlug": "logger-rate-limiter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 332551, "totalSubmissionRaw": 437143}, "360": {"acRate": 56.03658074458321, "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": 66544, "totalSubmissionRaw": 118751}, "361": {"acRate": 51.85651765971826, "difficulty": "Medium", "likes": 962, "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": 79034, "totalSubmissionRaw": 152409}, "362": {"acRate": 68.81389640700847, "difficulty": "Medium", "likes": 2037, "dislikes": 234, "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": 251201, "totalSubmissionRaw": 365044}, "363": {"acRate": 44.258354951930414, "difficulty": "Hard", "likes": 3462, "dislikes": 173, "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": 127611, "totalSubmissionRaw": 288332}, "364": {"acRate": 64.77128305982541, "difficulty": "Medium", "likes": 1128, "dislikes": 456, "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": 139643, "totalSubmissionRaw": 215594}, "365": {"acRate": 41.43293954666697, "difficulty": "Medium", "likes": 1522, "dislikes": 1476, "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": 108268, "totalSubmissionRaw": 261309}, "366": {"acRate": 80.72062540410275, "difficulty": "Medium", "likes": 3229, "dislikes": 59, "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": 260927, "totalSubmissionRaw": 323247}, "367": {"acRate": 43.82341921850149, "difficulty": "Easy", "likes": 4268, "dislikes": 310, "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": 653859, "totalSubmissionRaw": 1492031}, "368": {"acRate": 45.63026755072024, "difficulty": "Medium", "likes": 5979, "dislikes": 283, "categoryTitle": "Algorithms", "frontendQuestionId": "368", "paidOnly": false, "title": "Largest Divisible Subset", "titleSlug": "largest-divisible-subset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 312715, "totalSubmissionRaw": 685326}, "369": {"acRate": 61.11829833323304, "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": 81258, "totalSubmissionRaw": 132952}, "370": {"acRate": 71.78929954506147, "difficulty": "Medium", "likes": 1640, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "370", "paidOnly": true, "title": "Range Addition", "titleSlug": "range-addition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95469, "totalSubmissionRaw": 132985}, "371": {"acRate": 52.437806669695, "difficulty": "Medium", "likes": 4241, "dislikes": 5567, "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": 512545, "totalSubmissionRaw": 977434}, "372": {"acRate": 35.07890291814814, "difficulty": "Medium", "likes": 948, "dislikes": 1443, "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": 75179, "totalSubmissionRaw": 214314}, "373": {"acRate": 40.11569226110873, "difficulty": "Medium", "likes": 6314, "dislikes": 454, "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": 317965, "totalSubmissionRaw": 792619}, "374": {"acRate": 54.14194069465981, "difficulty": "Easy", "likes": 3781, "dislikes": 549, "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": 702517, "totalSubmissionRaw": 1297548}, "375": {"acRate": 49.78333785907973, "difficulty": "Medium", "likes": 2164, "dislikes": 2128, "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": 130167, "totalSubmissionRaw": 261467}, "376": {"acRate": 48.58746513655691, "difficulty": "Medium", "likes": 5125, "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": 252425, "totalSubmissionRaw": 519527}, "377": {"acRate": 54.264276224119634, "difficulty": "Medium", "likes": 7418, "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": 502771, "totalSubmissionRaw": 926519}, "378": {"acRate": 62.73145095414776, "difficulty": "Medium", "likes": 9962, "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": 637408, "totalSubmissionRaw": 1016090}, "379": {"acRate": 51.91427976332822, "difficulty": "Medium", "likes": 354, "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": 67297, "totalSubmissionRaw": 129631}, "380": {"acRate": 54.60868207021967, "difficulty": "Medium", "likes": 9270, "dislikes": 631, "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": 978939, "totalSubmissionRaw": 1792651}, "381": {"acRate": 35.57087182448037, "difficulty": "Hard", "likes": 2298, "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": 147861, "totalSubmissionRaw": 415680}, "382": {"acRate": 63.3755409929773, "difficulty": "Medium", "likes": 3085, "dislikes": 706, "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": 248351, "totalSubmissionRaw": 391872}, "383": {"acRate": 62.4751491296635, "difficulty": "Easy", "likes": 5039, "dislikes": 506, "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": 1278056, "totalSubmissionRaw": 2045703}, "384": {"acRate": 58.50465031597647, "difficulty": "Medium", "likes": 1354, "dislikes": 930, "categoryTitle": "Algorithms", "frontendQuestionId": "384", "paidOnly": false, "title": "Shuffle an Array", "titleSlug": "shuffle-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343830, "totalSubmissionRaw": 587694}, "385": {"acRate": 38.7094869439706, "difficulty": "Medium", "likes": 458, "dislikes": 1391, "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": 59000, "totalSubmissionRaw": 152419}, "386": {"acRate": 64.65137897411802, "difficulty": "Medium", "likes": 1980, "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": 127969, "totalSubmissionRaw": 197937}, "387": {"acRate": 62.505656598387105, "difficulty": "Easy", "likes": 9009, "dislikes": 298, "categoryTitle": "Algorithms", "frontendQuestionId": "387", "paidOnly": false, "title": "First Unique Character in a String", "titleSlug": "first-unique-character-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1790103, "totalSubmissionRaw": 2863908}, "388": {"acRate": 47.76227371643111, "difficulty": "Medium", "likes": 1297, "dislikes": 2502, "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": 159782, "totalSubmissionRaw": 334536}, "389": {"acRate": 59.56839018471079, "difficulty": "Easy", "likes": 5019, "dislikes": 483, "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": 777600, "totalSubmissionRaw": 1305390}, "390": {"acRate": 45.79406340092039, "difficulty": "Medium", "likes": 1564, "dislikes": 711, "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": 76722, "totalSubmissionRaw": 167537}, "391": {"acRate": 34.04149463866694, "difficulty": "Hard", "likes": 883, "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": 45843, "totalSubmissionRaw": 134667}, "392": {"acRate": 48.08454189299549, "difficulty": "Easy", "likes": 9721, "dislikes": 541, "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": 1614458, "totalSubmissionRaw": 3357530}, "393": {"acRate": 45.24301927580616, "difficulty": "Medium", "likes": 905, "dislikes": 2865, "categoryTitle": "Algorithms", "frontendQuestionId": "393", "paidOnly": false, "title": "UTF-8 Validation", "titleSlug": "utf-8-validation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125572, "totalSubmissionRaw": 277550}, "394": {"acRate": 59.75601097574727, "difficulty": "Medium", "likes": 12791, "dislikes": 625, "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": 858458, "totalSubmissionRaw": 1436609}, "395": {"acRate": 45.07081093172685, "difficulty": "Medium", "likes": 6256, "dislikes": 518, "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": 233721, "totalSubmissionRaw": 518564}, "396": {"acRate": 42.929438982070565, "difficulty": "Medium", "likes": 1565, "dislikes": 268, "categoryTitle": "Algorithms", "frontendQuestionId": "396", "paidOnly": false, "title": "Rotate Function", "titleSlug": "rotate-function", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 89069, "totalSubmissionRaw": 207479}, "397": {"acRate": 36.026345183085745, "difficulty": "Medium", "likes": 1335, "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": 124820, "totalSubmissionRaw": 346474}, "398": {"acRate": 63.732971855748964, "difficulty": "Medium", "likes": 1295, "dislikes": 1287, "categoryTitle": "Algorithms", "frontendQuestionId": "398", "paidOnly": false, "title": "Random Pick Index", "titleSlug": "random-pick-index", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 237430, "totalSubmissionRaw": 372538}, "399": {"acRate": 62.14906532386011, "difficulty": "Medium", "likes": 9363, "dislikes": 951, "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": 504542, "totalSubmissionRaw": 811826}, "400": {"acRate": 35.06919993027715, "difficulty": "Medium", "likes": 1083, "dislikes": 2061, "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": 100596, "totalSubmissionRaw": 286850}, "401": {"acRate": 55.05152974930383, "difficulty": "Easy", "likes": 1407, "dislikes": 2584, "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": 150049, "totalSubmissionRaw": 272561}, "402": {"acRate": 33.87746159414886, "difficulty": "Medium", "likes": 9566, "dislikes": 494, "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": 513355, "totalSubmissionRaw": 1515328}, "403": {"acRate": 46.18819177042873, "difficulty": "Hard", "likes": 5602, "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": 275164, "totalSubmissionRaw": 595750}, "404": {"acRate": 60.94244131348968, "difficulty": "Easy", "likes": 5497, "dislikes": 311, "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": 645183, "totalSubmissionRaw": 1058676}, "405": {"acRate": 49.16888881792198, "difficulty": "Easy", "likes": 1317, "dislikes": 221, "categoryTitle": "Algorithms", "frontendQuestionId": "405", "paidOnly": false, "title": "Convert a Number to Hexadecimal", "titleSlug": "convert-a-number-to-hexadecimal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 153965, "totalSubmissionRaw": 313135}, "406": {"acRate": 73.69202377138923, "difficulty": "Medium", "likes": 7092, "dislikes": 720, "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": 308267, "totalSubmissionRaw": 418318}, "407": {"acRate": 48.22324050979999, "difficulty": "Hard", "likes": 3767, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "407", "paidOnly": false, "title": "Trapping Rain Water II", "titleSlug": "trapping-rain-water-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91452, "totalSubmissionRaw": 189643}, "408": {"acRate": 36.06484077002714, "difficulty": "Easy", "likes": 750, "dislikes": 2231, "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": 209699, "totalSubmissionRaw": 581462}, "409": {"acRate": 55.36486035263862, "difficulty": "Easy", "likes": 5933, "dislikes": 412, "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": 817441, "totalSubmissionRaw": 1476463}, "410": {"acRate": 56.28220588235294, "difficulty": "Hard", "likes": 9914, "dislikes": 227, "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": 382711, "totalSubmissionRaw": 679989}, "411": {"acRate": 39.84768851228145, "difficulty": "Hard", "likes": 182, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "411", "paidOnly": true, "title": "Minimum Unique Word Abbreviation", "titleSlug": "minimum-unique-word-abbreviation", "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 14860, "totalSubmissionRaw": 37292}, "412": {"acRate": 72.88828073713164, "difficulty": "Easy", "likes": 2798, "dislikes": 383, "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": 1315710, "totalSubmissionRaw": 1805105}, "413": {"acRate": 65.0253636424017, "difficulty": "Medium", "likes": 5358, "dislikes": 296, "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": 313287, "totalSubmissionRaw": 481792}, "414": {"acRate": 35.51563786772674, "difficulty": "Easy", "likes": 3058, "dislikes": 3195, "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": 573574, "totalSubmissionRaw": 1614990}, "415": {"acRate": 51.65014167938619, "difficulty": "Easy", "likes": 5057, "dislikes": 756, "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": 704867, "totalSubmissionRaw": 1364696}, "416": {"acRate": 46.68467557176913, "difficulty": "Medium", "likes": 12361, "dislikes": 254, "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": 914740, "totalSubmissionRaw": 1959399}, "417": {"acRate": 55.8936366220205, "difficulty": "Medium", "likes": 7460, "dislikes": 1497, "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": 505392, "totalSubmissionRaw": 904185}, "418": {"acRate": 36.25292194264165, "difficulty": "Medium", "likes": 1120, "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": 102669, "totalSubmissionRaw": 283202}, "419": {"acRate": 75.62835446228823, "difficulty": "Medium", "likes": 2309, "dislikes": 972, "categoryTitle": "Algorithms", "frontendQuestionId": "419", "paidOnly": false, "title": "Battleships in a Board", "titleSlug": "battleships-in-a-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 216015, "totalSubmissionRaw": 285627}, "420": {"acRate": 13.997911187248052, "difficulty": "Hard", "likes": 884, "dislikes": 1734, "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": 43961, "totalSubmissionRaw": 314054}, "421": {"acRate": 53.3312308552194, "difficulty": "Medium", "likes": 5549, "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": 170797, "totalSubmissionRaw": 320257}, "422": {"acRate": 41.39866296184214, "difficulty": "Easy", "likes": 430, "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": 60192, "totalSubmissionRaw": 145396}, "423": {"acRate": 51.223924612935, "difficulty": "Medium", "likes": 830, "dislikes": 2735, "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": 82679, "totalSubmissionRaw": 161407}, "424": {"acRate": 55.10181379609138, "difficulty": "Medium", "likes": 10842, "dislikes": 559, "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": 847032, "totalSubmissionRaw": 1537212}, "425": {"acRate": 53.53597663008026, "difficulty": "Hard", "likes": 1094, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "425", "paidOnly": true, "title": "Word Squares", "titleSlug": "word-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75505, "totalSubmissionRaw": 141036}, "426": {"acRate": 64.90919716970349, "difficulty": "Medium", "likes": 2616, "dislikes": 215, "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": 300982, "totalSubmissionRaw": 463697}, "427": {"acRate": 75.89100923080431, "difficulty": "Medium", "likes": 1530, "dislikes": 1848, "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": 133105, "totalSubmissionRaw": 175390}, "428": {"acRate": 67.507846265627, "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": 90125, "totalSubmissionRaw": 133503}, "429": {"acRate": 70.97547197726081, "difficulty": "Medium", "likes": 3638, "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": 316621, "totalSubmissionRaw": 446100}, "430": {"acRate": 60.4008116346214, "difficulty": "Medium", "likes": 5051, "dislikes": 328, "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": 337861, "totalSubmissionRaw": 559365}, "431": {"acRate": 79.65992251399054, "difficulty": "Hard", "likes": 520, "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": 22206, "totalSubmissionRaw": 27876}, "432": {"acRate": 37.0921398761414, "difficulty": "Hard", "likes": 1578, "dislikes": 176, "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": 85589, "totalSubmissionRaw": 230747}, "433": {"acRate": 54.33298544485869, "difficulty": "Medium", "likes": 2997, "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": 183771, "totalSubmissionRaw": 338231}, "434": {"acRate": 36.35774562145547, "difficulty": "Easy", "likes": 793, "dislikes": 1267, "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": 194699, "totalSubmissionRaw": 535509}, "435": {"acRate": 53.995992321480436, "difficulty": "Medium", "likes": 8224, "dislikes": 224, "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": 628387, "totalSubmissionRaw": 1163766}, "436": {"acRate": 52.59445843828715, "difficulty": "Medium", "likes": 2165, "dislikes": 362, "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": 120060, "totalSubmissionRaw": 228275}, "437": {"acRate": 46.09968048360571, "difficulty": "Medium", "likes": 11016, "dislikes": 524, "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": 598177, "totalSubmissionRaw": 1297578}, "438": {"acRate": 51.223676048933534, "difficulty": "Medium", "likes": 12380, "dislikes": 342, "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": 910047, "totalSubmissionRaw": 1776611}, "439": {"acRate": 61.1547461408696, "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": 33714, "totalSubmissionRaw": 55129}, "440": {"acRate": 32.67650999445129, "difficulty": "Hard", "likes": 771, "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": 24145, "totalSubmissionRaw": 73891}, "441": {"acRate": 46.815145080388575, "difficulty": "Easy", "likes": 3897, "dislikes": 1333, "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": 464517, "totalSubmissionRaw": 992240}, "442": {"acRate": 75.91473728650072, "difficulty": "Medium", "likes": 10493, "dislikes": 407, "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": 814575, "totalSubmissionRaw": 1073013}, "443": {"acRate": 55.58115593067478, "difficulty": "Medium", "likes": 5111, "dislikes": 8019, "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": 653262, "totalSubmissionRaw": 1175330}, "444": {"acRate": 28.513251650148362, "difficulty": "Medium", "likes": 573, "dislikes": 1515, "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": 56503, "totalSubmissionRaw": 198164}, "445": {"acRate": 61.35817518724196, "difficulty": "Medium", "likes": 5905, "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": 489248, "totalSubmissionRaw": 797364}, "446": {"acRate": 54.57810597544025, "difficulty": "Hard", "likes": 3360, "dislikes": 157, "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": 151958, "totalSubmissionRaw": 278423}, "447": {"acRate": 55.69050611902857, "difficulty": "Medium", "likes": 842, "dislikes": 1016, "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": 102343, "totalSubmissionRaw": 183771}, "448": {"acRate": 61.31696161762639, "difficulty": "Easy", "likes": 9463, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "448", "paidOnly": false, "title": "Find All Numbers Disappeared in an Array", "titleSlug": "find-all-numbers-disappeared-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 933628, "totalSubmissionRaw": 1522626}, "449": {"acRate": 57.93137790265506, "difficulty": "Medium", "likes": 3497, "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": 240819, "totalSubmissionRaw": 415697}, "450": {"acRate": 51.899294067691656, "difficulty": "Medium", "likes": 9217, "dislikes": 290, "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": 557345, "totalSubmissionRaw": 1073894}, "451": {"acRate": 72.97352594819988, "difficulty": "Medium", "likes": 8360, "dislikes": 294, "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": 788225, "totalSubmissionRaw": 1080152}, "452": {"acRate": 59.304526762093346, "difficulty": "Medium", "likes": 7502, "dislikes": 244, "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": 557951, "totalSubmissionRaw": 940825}, "453": {"acRate": 56.94980818619069, "difficulty": "Medium", "likes": 2587, "dislikes": 1894, "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": 177844, "totalSubmissionRaw": 312282}, "454": {"acRate": 57.35949233282539, "difficulty": "Medium", "likes": 4920, "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": 334259, "totalSubmissionRaw": 582744}, "455": {"acRate": 53.066001614338646, "difficulty": "Easy", "likes": 4011, "dislikes": 378, "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": 512799, "totalSubmissionRaw": 966342}, "456": {"acRate": 33.793675239936874, "difficulty": "Medium", "likes": 7235, "dislikes": 438, "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": 266160, "totalSubmissionRaw": 787603}, "457": {"acRate": 34.48012984457997, "difficulty": "Medium", "likes": 695, "dislikes": 793, "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": 84126, "totalSubmissionRaw": 243984}, "458": {"acRate": 59.52966764755091, "difficulty": "Hard", "likes": 1791, "dislikes": 3358, "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": 120975, "totalSubmissionRaw": 203218}, "459": {"acRate": 46.25427808381207, "difficulty": "Easy", "likes": 6420, "dislikes": 524, "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": 470047, "totalSubmissionRaw": 1016224}, "460": {"acRate": 44.806452104709486, "difficulty": "Hard", "likes": 5712, "dislikes": 331, "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": 264501, "totalSubmissionRaw": 590318}, "461": {"acRate": 75.57354839206309, "difficulty": "Easy", "likes": 3849, "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": 589049, "totalSubmissionRaw": 779436}, "462": {"acRate": 60.33558453280895, "difficulty": "Medium", "likes": 3363, "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": 187164, "totalSubmissionRaw": 310205}, "463": {"acRate": 73.04171018175448, "difficulty": "Easy", "likes": 6860, "dislikes": 390, "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": 658824, "totalSubmissionRaw": 901984}, "464": {"acRate": 29.7957848639121, "difficulty": "Medium", "likes": 2670, "dislikes": 403, "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": 98383, "totalSubmissionRaw": 330191}, "465": {"acRate": 49.62276699886726, "difficulty": "Hard", "likes": 1461, "dislikes": 152, "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": 95501, "totalSubmissionRaw": 192454}, "466": {"acRate": 30.656708091858555, "difficulty": "Hard", "likes": 407, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "466", "paidOnly": false, "title": "Count The Repetitions", "titleSlug": "count-the-repetitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19784, "totalSubmissionRaw": 64534}, "467": {"acRate": 40.1399148344486, "difficulty": "Medium", "likes": 1444, "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": 46189, "totalSubmissionRaw": 115070}, "468": {"acRate": 27.349927595410563, "difficulty": "Medium", "likes": 1027, "dislikes": 2714, "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": 169790, "totalSubmissionRaw": 620801}, "469": {"acRate": 39.64173887715721, "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": 10888, "totalSubmissionRaw": 27466}, "470": {"acRate": 45.801401386557075, "difficulty": "Medium", "likes": 1111, "dislikes": 376, "categoryTitle": "Algorithms", "frontendQuestionId": "470", "paidOnly": false, "title": "Implement Rand10() Using Rand7()", "titleSlug": "implement-rand10-using-rand7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Rejection Sampling", "id": "VG9waWNUYWdOb2RlOjU0NTY5", "slug": "rejection-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86479, "totalSubmissionRaw": 188813}, "471": {"acRate": 50.47694882753465, "difficulty": "Hard", "likes": 625, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "471", "paidOnly": true, "title": "Encode String with Shortest Length", "titleSlug": "encode-string-with-shortest-length", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31062, "totalSubmissionRaw": 61537}, "472": {"acRate": 49.34891243272807, "difficulty": "Hard", "likes": 3879, "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": 230984, "totalSubmissionRaw": 468063}, "473": {"acRate": 40.41454346767392, "difficulty": "Medium", "likes": 3835, "dislikes": 298, "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": 170111, "totalSubmissionRaw": 420929}, "474": {"acRate": 47.94451455842761, "difficulty": "Medium", "likes": 5456, "dislikes": 462, "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": 213880, "totalSubmissionRaw": 446099}, "475": {"acRate": 38.46785495989973, "difficulty": "Medium", "likes": 2120, "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": 124612, "totalSubmissionRaw": 323938}, "476": {"acRate": 70.30114041075011, "difficulty": "Easy", "likes": 3072, "dislikes": 135, "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": 472756, "totalSubmissionRaw": 672474}, "477": {"acRate": 52.98240843194989, "difficulty": "Medium", "likes": 2220, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "477", "paidOnly": false, "title": "Total Hamming Distance", "titleSlug": "total-hamming-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 113003, "totalSubmissionRaw": 213284}, "478": {"acRate": 40.077116925933645, "difficulty": "Medium", "likes": 456, "dislikes": 772, "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": 42303, "totalSubmissionRaw": 105554}, "479": {"acRate": 33.694078903687576, "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": 25374, "totalSubmissionRaw": 75307}, "480": {"acRate": 38.894574718051, "difficulty": "Hard", "likes": 3232, "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": 155434, "totalSubmissionRaw": 399629}, "481": {"acRate": 51.61919888015506, "difficulty": "Medium", "likes": 320, "dislikes": 1305, "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": 38351, "totalSubmissionRaw": 74296}, "482": {"acRate": 44.04206207494554, "difficulty": "Easy", "likes": 1114, "dislikes": 1419, "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": 291545, "totalSubmissionRaw": 661972}, "483": {"acRate": 41.466849696040505, "difficulty": "Hard", "likes": 390, "dislikes": 506, "categoryTitle": "Algorithms", "frontendQuestionId": "483", "paidOnly": false, "title": "Smallest Good Base", "titleSlug": "smallest-good-base", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23260, "totalSubmissionRaw": 56093}, "484": {"acRate": 66.94980824867119, "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": 39803, "totalSubmissionRaw": 59452}, "485": {"acRate": 60.3519375249681, "difficulty": "Easy", "likes": 5816, "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": 1311310, "totalSubmissionRaw": 2172772}, "486": {"acRate": 55.44364892375964, "difficulty": "Medium", "likes": 5865, "dislikes": 285, "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": 242383, "totalSubmissionRaw": 437170}, "487": {"acRate": 50.51902998319012, "difficulty": "Medium", "likes": 1545, "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": 150867, "totalSubmissionRaw": 298634}, "488": {"acRate": 32.564346741419314, "difficulty": "Hard", "likes": 456, "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": 24279, "totalSubmissionRaw": 74557}, "489": {"acRate": 76.85708996835058, "difficulty": "Hard", "likes": 2778, "dislikes": 178, "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": 170229, "totalSubmissionRaw": 221487}, "490": {"acRate": 58.382000611285115, "difficulty": "Medium", "likes": 1849, "dislikes": 185, "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": 177641, "totalSubmissionRaw": 304275}, "491": {"acRate": 61.02011181806065, "difficulty": "Medium", "likes": 3655, "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": 173972, "totalSubmissionRaw": 285106}, "492": {"acRate": 58.607686114995126, "difficulty": "Easy", "likes": 704, "dislikes": 391, "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": 124488, "totalSubmissionRaw": 212409}, "493": {"acRate": 30.972146086914385, "difficulty": "Hard", "likes": 6226, "dislikes": 272, "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": 204530, "totalSubmissionRaw": 660369}, "494": {"acRate": 47.42814265138387, "difficulty": "Medium", "likes": 10975, "dislikes": 364, "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": 651666, "totalSubmissionRaw": 1374007}, "495": {"acRate": 56.685181370703674, "difficulty": "Easy", "likes": 1159, "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": 159612, "totalSubmissionRaw": 281574}, "496": {"acRate": 72.97255174863447, "difficulty": "Easy", "likes": 8127, "dislikes": 784, "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": 805327, "totalSubmissionRaw": 1103603}, "497": {"acRate": 40.23212301380011, "difficulty": "Medium", "likes": 484, "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": 42360, "totalSubmissionRaw": 105289}, "498": {"acRate": 60.83104810064699, "difficulty": "Medium", "likes": 3466, "dislikes": 690, "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": 318543, "totalSubmissionRaw": 523652}, "499": {"acRate": 49.26035278976455, "difficulty": "Hard", "likes": 484, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "499", "paidOnly": true, "title": "The Maze III", "titleSlug": "the-maze-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 32534, "totalSubmissionRaw": 66045}, "500": {"acRate": 71.17013813148137, "difficulty": "Easy", "likes": 1616, "dislikes": 1137, "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": 241439, "totalSubmissionRaw": 339242}, "501": {"acRate": 56.55662051828186, "difficulty": "Easy", "likes": 3906, "dislikes": 785, "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": 318638, "totalSubmissionRaw": 563395}, "502": {"acRate": 53.17204349714121, "difficulty": "Hard", "likes": 3806, "dislikes": 258, "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": 235097, "totalSubmissionRaw": 442144}, "503": {"acRate": 64.6164858763284, "difficulty": "Medium", "likes": 8046, "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": 445930, "totalSubmissionRaw": 690118}, "504": {"acRate": 50.627211898041345, "difficulty": "Easy", "likes": 808, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "504", "paidOnly": false, "title": "Base 7", "titleSlug": "base-7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 141337, "totalSubmissionRaw": 279172}, "505": {"acRate": 53.60050581197413, "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": 110208, "totalSubmissionRaw": 205610}, "506": {"acRate": 72.07240033124334, "difficulty": "Easy", "likes": 1924, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "506", "paidOnly": false, "title": "Relative Ranks", "titleSlug": "relative-ranks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 304613, "totalSubmissionRaw": 422649}, "507": {"acRate": 41.89487487706261, "difficulty": "Easy", "likes": 1096, "dislikes": 1236, "categoryTitle": "Algorithms", "frontendQuestionId": "507", "paidOnly": false, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210859, "totalSubmissionRaw": 503303}, "508": {"acRate": 66.99223721048612, "difficulty": "Medium", "likes": 2265, "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": 147399, "totalSubmissionRaw": 220024}, "509": {"acRate": 71.69568525809879, "difficulty": "Easy", "likes": 8242, "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": 1967317, "totalSubmissionRaw": 2743984}, "510": {"acRate": 60.89192891420899, "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": 67123, "totalSubmissionRaw": 110233}, "511": {"acRate": 74.95180201693869, "difficulty": "Easy", "likes": 864, "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": 299738, "totalSubmissionRaw": 399908}, "512": {"acRate": 53.10962075183138, "difficulty": "Easy", "likes": 267, "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": 89247, "totalSubmissionRaw": 168043}, "513": {"acRate": 71.35203338088883, "difficulty": "Medium", "likes": 3807, "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": 372098, "totalSubmissionRaw": 521496}, "514": {"acRate": 59.00574248205809, "difficulty": "Hard", "likes": 1489, "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": 110254, "totalSubmissionRaw": 186853}, "515": {"acRate": 65.69850821296036, "difficulty": "Medium", "likes": 3622, "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": 355489, "totalSubmissionRaw": 541092}, "516": {"acRate": 63.101022016806915, "difficulty": "Medium", "likes": 9615, "dislikes": 331, "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": 527953, "totalSubmissionRaw": 836679}, "517": {"acRate": 41.55615696887686, "difficulty": "Hard", "likes": 772, "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": 30710, "totalSubmissionRaw": 73900}, "518": {"acRate": 64.62567491183563, "difficulty": "Medium", "likes": 9412, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "518", "paidOnly": false, "title": "Coin Change II", "titleSlug": "coin-change-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 679136, "totalSubmissionRaw": 1050876}, "519": {"acRate": 42.36219583341175, "difficulty": "Medium", "likes": 433, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "519", "paidOnly": false, "title": "Random Flip Matrix", "titleSlug": "random-flip-matrix", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22510, "totalSubmissionRaw": 53137}, "520": {"acRate": 56.405302542422106, "difficulty": "Easy", "likes": 3412, "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": 446686, "totalSubmissionRaw": 791922}, "521": {"acRate": 60.925055423269555, "difficulty": "Easy", "likes": 43, "dislikes": 143, "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": 118721, "totalSubmissionRaw": 194864}, "522": {"acRate": 42.015030891709955, "difficulty": "Medium", "likes": 517, "dislikes": 1311, "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": 54675, "totalSubmissionRaw": 130132}, "523": {"acRate": 30.3398869339363, "difficulty": "Medium", "likes": 6301, "dislikes": 655, "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": 594679, "totalSubmissionRaw": 1960079}, "524": {"acRate": 51.34362733966977, "difficulty": "Medium", "likes": 1799, "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": 158277, "totalSubmissionRaw": 308270}, "525": {"acRate": 48.950406864468526, "difficulty": "Medium", "likes": 8005, "dislikes": 386, "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": 480340, "totalSubmissionRaw": 981279}, "526": {"acRate": 64.3462555817856, "difficulty": "Medium", "likes": 3229, "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": 180988, "totalSubmissionRaw": 281272}, "527": {"acRate": 61.25384953805544, "difficulty": "Hard", "likes": 387, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "527", "paidOnly": true, "title": "Word Abbreviation", "titleSlug": "word-abbreviation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27846, "totalSubmissionRaw": 45460}, "528": {"acRate": 47.15048465376459, "difficulty": "Medium", "likes": 1932, "dislikes": 853, "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": 485170, "totalSubmissionRaw": 1028982}, "529": {"acRate": 67.03604162922542, "difficulty": "Medium", "likes": 1968, "dislikes": 1065, "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": 164121, "totalSubmissionRaw": 244826}, "530": {"acRate": 58.500741672151435, "difficulty": "Easy", "likes": 4412, "dislikes": 229, "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": 416860, "totalSubmissionRaw": 712575}, "531": {"acRate": 62.38350668013602, "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": 43845, "totalSubmissionRaw": 70283}, "532": {"acRate": 43.364010239830186, "difficulty": "Medium", "likes": 3891, "dislikes": 2256, "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": 353016, "totalSubmissionRaw": 814076}, "533": {"acRate": 48.67564046895354, "difficulty": "Medium", "likes": 87, "dislikes": 776, "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": 13452, "totalSubmissionRaw": 27636}, "534": {"acRate": 80.98210272545255, "difficulty": "Medium", "likes": 401, "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": 79274, "totalSubmissionRaw": 97891}, "535": {"acRate": 86.4875265993571, "difficulty": "Medium", "likes": 2029, "dislikes": 3785, "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": 267435, "totalSubmissionRaw": 309218}, "536": {"acRate": 57.22642199238145, "difficulty": "Medium", "likes": 1064, "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": 97047, "totalSubmissionRaw": 169585}, "537": {"acRate": 72.02869153658465, "difficulty": "Medium", "likes": 716, "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": 98008, "totalSubmissionRaw": 136068}, "538": {"acRate": 69.71840348272048, "difficulty": "Medium", "likes": 5248, "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": 309403, "totalSubmissionRaw": 443788}, "539": {"acRate": 57.03121553866286, "difficulty": "Medium", "likes": 1875, "dislikes": 265, "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": 155149, "totalSubmissionRaw": 272043}, "540": {"acRate": 59.25250273720912, "difficulty": "Medium", "likes": 11339, "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": 724630, "totalSubmissionRaw": 1222954}, "541": {"acRate": 51.05640677224878, "difficulty": "Easy", "likes": 2010, "dislikes": 3869, "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": 261515, "totalSubmissionRaw": 512208}, "542": {"acRate": 49.39057945659227, "difficulty": "Medium", "likes": 9580, "dislikes": 424, "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": 611199, "totalSubmissionRaw": 1237482}, "543": {"acRate": 61.35135851695901, "difficulty": "Easy", "likes": 13986, "dislikes": 1045, "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": 1642961, "totalSubmissionRaw": 2677953}, "544": {"acRate": 77.20496894409938, "difficulty": "Medium", "likes": 390, "dislikes": 135, "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": 27346, "totalSubmissionRaw": 35420}, "545": {"acRate": 45.83101446970901, "difficulty": "Medium", "likes": 1332, "dislikes": 2206, "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": 138351, "totalSubmissionRaw": 301872}, "546": {"acRate": 48.02536177532427, "difficulty": "Hard", "likes": 2302, "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": 48022, "totalSubmissionRaw": 99993}, "547": {"acRate": 67.05163154930193, "difficulty": "Medium", "likes": 9837, "dislikes": 366, "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": 980896, "totalSubmissionRaw": 1462898}, "548": {"acRate": 50.141560496294446, "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": 24086, "totalSubmissionRaw": 48036}, "549": {"acRate": 49.536530444297746, "difficulty": "Medium", "likes": 1158, "dislikes": 96, "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": 54777, "totalSubmissionRaw": 110579}, "550": {"acRate": 37.5594353502748, "difficulty": "Medium", "likes": 955, "dislikes": 198, "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": 202694, "totalSubmissionRaw": 539657}, "551": {"acRate": 49.27975347642145, "difficulty": "Easy", "likes": 774, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "551", "paidOnly": false, "title": "Student Attendance Record I", "titleSlug": "student-attendance-record-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229004, "totalSubmissionRaw": 464702}, "552": {"acRate": 55.271678899480584, "difficulty": "Hard", "likes": 2284, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "552", "paidOnly": false, "title": "Student Attendance Record II", "titleSlug": "student-attendance-record-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140143, "totalSubmissionRaw": 253553}, "553": {"acRate": 61.125707946517196, "difficulty": "Medium", "likes": 380, "dislikes": 1602, "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": 41876, "totalSubmissionRaw": 68508}, "554": {"acRate": 55.29785072650695, "difficulty": "Medium", "likes": 2536, "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": 145341, "totalSubmissionRaw": 262833}, "555": {"acRate": 43.49750268698236, "difficulty": "Medium", "likes": 76, "dislikes": 261, "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": 6880, "totalSubmissionRaw": 15817}, "556": {"acRate": 34.18100587939422, "difficulty": "Medium", "likes": 3698, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "556", "paidOnly": false, "title": "Next Greater Element III", "titleSlug": "next-greater-element-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161737, "totalSubmissionRaw": 473178}, "557": {"acRate": 83.26491875194014, "difficulty": "Easy", "likes": 5942, "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": 936125, "totalSubmissionRaw": 1124273}, "558": {"acRate": 50.07692055906517, "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": 15299, "totalSubmissionRaw": 30551}, "559": {"acRate": 72.38398656491566, "difficulty": "Easy", "likes": 2777, "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": 293089, "totalSubmissionRaw": 404909}, "560": {"acRate": 44.037138863135425, "difficulty": "Medium", "likes": 21812, "dislikes": 674, "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": 1373171, "totalSubmissionRaw": 3118211}, "561": {"acRate": 79.27377308723783, "difficulty": "Easy", "likes": 2076, "dislikes": 264, "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": 502212, "totalSubmissionRaw": 633517}, "562": {"acRate": 50.44833545273729, "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": 77360, "totalSubmissionRaw": 153345}, "563": {"acRate": 62.50528412266541, "difficulty": "Easy", "likes": 2248, "dislikes": 2187, "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": 220313, "totalSubmissionRaw": 352471}, "564": {"acRate": 31.770089267561417, "difficulty": "Hard", "likes": 1223, "dislikes": 1685, "categoryTitle": "Algorithms", "frontendQuestionId": "564", "paidOnly": false, "title": "Find the Closest Palindrome", "titleSlug": "find-the-closest-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 117197, "totalSubmissionRaw": 368891}, "565": {"acRate": 56.34235385194617, "difficulty": "Medium", "likes": 2212, "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": 133186, "totalSubmissionRaw": 236387}, "566": {"acRate": 63.303781660183944, "difficulty": "Easy", "likes": 3518, "dislikes": 413, "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": 389298, "totalSubmissionRaw": 614968}, "567": {"acRate": 44.72778875289464, "difficulty": "Medium", "likes": 11359, "dislikes": 425, "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": 920355, "totalSubmissionRaw": 2057683}, "568": {"acRate": 45.84822066599971, "difficulty": "Hard", "likes": 570, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "568", "paidOnly": true, "title": "Maximum Vacation Days", "titleSlug": "maximum-vacation-days", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38496, "totalSubmissionRaw": 83964}, "569": {"acRate": 65.83071113908119, "difficulty": "Hard", "likes": 324, "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": 41841, "totalSubmissionRaw": 63559}, "570": {"acRate": 49.650320707015545, "difficulty": "Medium", "likes": 1180, "dislikes": 130, "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": 431855, "totalSubmissionRaw": 869795}, "571": {"acRate": 42.40557420231975, "difficulty": "Hard", "likes": 308, "dislikes": 79, "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": 29943, "totalSubmissionRaw": 70611}, "572": {"acRate": 48.57527137624759, "difficulty": "Easy", "likes": 8262, "dislikes": 521, "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": 913372, "totalSubmissionRaw": 1880322}, "573": {"acRate": 57.15658993169745, "difficulty": "Medium", "likes": 412, "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": 22594, "totalSubmissionRaw": 39530}, "574": {"acRate": 61.08700658652296, "difficulty": "Medium", "likes": 174, "dislikes": 413, "categoryTitle": "Database", "frontendQuestionId": "574", "paidOnly": true, "title": "Winning Candidate", "titleSlug": "winning-candidate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66313, "totalSubmissionRaw": 108555}, "575": {"acRate": 68.22947879830367, "difficulty": "Easy", "likes": 1535, "dislikes": 1373, "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": 298287, "totalSubmissionRaw": 437182}, "576": {"acRate": 48.10619694822739, "difficulty": "Medium", "likes": 3889, "dislikes": 294, "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": 211166, "totalSubmissionRaw": 438958}, "577": {"acRate": 76.15376771358272, "difficulty": "Easy", "likes": 983, "dislikes": 225, "categoryTitle": "Database", "frontendQuestionId": "577", "paidOnly": false, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 463016, "totalSubmissionRaw": 608003}, "578": {"acRate": 40.237924729014715, "difficulty": "Medium", "likes": 130, "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": 57873, "totalSubmissionRaw": 143827}, "579": {"acRate": 47.41701760351547, "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": 36256, "totalSubmissionRaw": 76462}, "580": {"acRate": 59.176560474559395, "difficulty": "Medium", "likes": 246, "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": 68933, "totalSubmissionRaw": 116487}, "581": {"acRate": 37.03491529793073, "difficulty": "Medium", "likes": 7765, "dislikes": 263, "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": 336170, "totalSubmissionRaw": 907711}, "582": {"acRate": 69.62336027032627, "difficulty": "Medium", "likes": 1108, "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": 87362, "totalSubmissionRaw": 125478}, "583": {"acRate": 62.53191176740683, "difficulty": "Medium", "likes": 5804, "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": 272374, "totalSubmissionRaw": 435576}, "584": {"acRate": 70.7133456908241, "difficulty": "Easy", "likes": 2144, "dislikes": 371, "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": 1062821, "totalSubmissionRaw": 1503000}, "585": {"acRate": 48.67201509466573, "difficulty": "Medium", "likes": 592, "dislikes": 498, "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": 135161, "totalSubmissionRaw": 277704}, "586": {"acRate": 64.68353643515438, "difficulty": "Easy", "likes": 996, "dislikes": 75, "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": 280951, "totalSubmissionRaw": 434347}, "587": {"acRate": 51.97645005772908, "difficulty": "Hard", "likes": 1479, "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": 58973, "totalSubmissionRaw": 113461}, "588": {"acRate": 48.065900044228215, "difficulty": "Hard", "likes": 1494, "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": 108677, "totalSubmissionRaw": 226100}, "589": {"acRate": 75.77534974524039, "difficulty": "Easy", "likes": 3169, "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": 439763, "totalSubmissionRaw": 580351}, "590": {"acRate": 80.35696253118104, "difficulty": "Easy", "likes": 2679, "dislikes": 119, "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": 374002, "totalSubmissionRaw": 465426}, "591": {"acRate": 39.17982146766229, "difficulty": "Hard", "likes": 170, "dislikes": 649, "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": 16108, "totalSubmissionRaw": 41113}, "592": {"acRate": 66.03765675028428, "difficulty": "Medium", "likes": 850, "dislikes": 687, "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": 126019, "totalSubmissionRaw": 190829}, "593": {"acRate": 44.133514749274205, "difficulty": "Medium", "likes": 1055, "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": 111581, "totalSubmissionRaw": 252826}, "594": {"acRate": 55.24506578947368, "difficulty": "Easy", "likes": 2171, "dislikes": 253, "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": 167941, "totalSubmissionRaw": 303994}, "595": {"acRate": 68.1150197814478, "difficulty": "Easy", "likes": 2760, "dislikes": 1324, "categoryTitle": "Database", "frontendQuestionId": "595", "paidOnly": false, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1360474, "totalSubmissionRaw": 1997318}, "596": {"acRate": 56.98884925311722, "difficulty": "Easy", "likes": 1064, "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": 469525, "totalSubmissionRaw": 823889}, "597": {"acRate": 41.77779706811055, "difficulty": "Easy", "likes": 306, "dislikes": 767, "categoryTitle": "Database", "frontendQuestionId": "597", "paidOnly": true, "title": "Friend Requests I: Overall Acceptance Rate", "titleSlug": "friend-requests-i-overall-acceptance-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77004, "totalSubmissionRaw": 184318}, "598": {"acRate": 56.40961442163245, "difficulty": "Easy", "likes": 944, "dislikes": 969, "categoryTitle": "Algorithms", "frontendQuestionId": "598", "paidOnly": false, "title": "Range Addition II", "titleSlug": "range-addition-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105891, "totalSubmissionRaw": 187718}, "599": {"acRate": 56.16771318614543, "difficulty": "Easy", "likes": 1953, "dislikes": 399, "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": 241251, "totalSubmissionRaw": 429519}, "600": {"acRate": 40.07364493322859, "difficulty": "Hard", "likes": 1537, "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": 40811, "totalSubmissionRaw": 101840}, "601": {"acRate": 48.860146892452455, "difficulty": "Hard", "likes": 684, "dislikes": 569, "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": 108835, "totalSubmissionRaw": 222748}, "602": {"acRate": 58.14120302942033, "difficulty": "Medium", "likes": 657, "dislikes": 132, "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": 159679, "totalSubmissionRaw": 274639}, "603": {"acRate": 65.95728936970002, "difficulty": "Easy", "likes": 643, "dislikes": 76, "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": 89136, "totalSubmissionRaw": 135142}, "604": {"acRate": 39.989728265944535, "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": 34260, "totalSubmissionRaw": 85672}, "605": {"acRate": 28.941048102575174, "difficulty": "Easy", "likes": 6613, "dislikes": 1193, "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": 887489, "totalSubmissionRaw": 3066537}, "606": {"acRate": 69.49208436209146, "difficulty": "Medium", "likes": 80, "dislikes": 40, "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": 324518, "totalSubmissionRaw": 466985}, "607": {"acRate": 65.77202093248331, "difficulty": "Easy", "likes": 1176, "dislikes": 102, "categoryTitle": "Database", "frontendQuestionId": "607", "paidOnly": false, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230379, "totalSubmissionRaw": 350269}, "608": {"acRate": 72.77253010796443, "difficulty": "Medium", "likes": 1246, "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": 168106, "totalSubmissionRaw": 231002}, "609": {"acRate": 67.64976390704143, "difficulty": "Medium", "likes": 1516, "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": 153728, "totalSubmissionRaw": 227241}, "610": {"acRate": 72.33850035334756, "difficulty": "Easy", "likes": 603, "dislikes": 173, "categoryTitle": "Database", "frontendQuestionId": "610", "paidOnly": false, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219050, "totalSubmissionRaw": 302814}, "611": {"acRate": 51.42028750430852, "difficulty": "Medium", "likes": 3825, "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": 202887, "totalSubmissionRaw": 394567}, "612": {"acRate": 61.29332673670731, "difficulty": "Medium", "likes": 219, "dislikes": 70, "categoryTitle": "Database", "frontendQuestionId": "612", "paidOnly": true, "title": "Shortest Distance in a Plane", "titleSlug": "shortest-distance-in-a-plane", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42122, "totalSubmissionRaw": 68722}, "613": {"acRate": 80.20401519262073, "difficulty": "Easy", "likes": 330, "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": 73908, "totalSubmissionRaw": 92150}, "614": {"acRate": 38.970509383378015, "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": 54510, "totalSubmissionRaw": 139875}, "615": {"acRate": 56.273792864773775, "difficulty": "Hard", "likes": 237, "dislikes": 75, "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": 37399, "totalSubmissionRaw": 66459}, "616": {"acRate": 49.98890806681131, "difficulty": "Medium", "likes": 1082, "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": 92389, "totalSubmissionRaw": 184819}, "617": {"acRate": 79.08790096970823, "difficulty": "Easy", "likes": 8797, "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": 791848, "totalSubmissionRaw": 1001226}, "618": {"acRate": 63.431427551384715, "difficulty": "Hard", "likes": 187, "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": 24874, "totalSubmissionRaw": 39214}, "619": {"acRate": 65.73692760820467, "difficulty": "Easy", "likes": 660, "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": 248856, "totalSubmissionRaw": 378564}, "620": {"acRate": 74.18515997812668, "difficulty": "Easy", "likes": 1159, "dislikes": 542, "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": 565711, "totalSubmissionRaw": 762567}, "621": {"acRate": 60.30427675182904, "difficulty": "Medium", "likes": 10566, "dislikes": 2086, "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": 671024, "totalSubmissionRaw": 1112731}, "622": {"acRate": 51.73941638146534, "difficulty": "Medium", "likes": 3544, "dislikes": 294, "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": 331986, "totalSubmissionRaw": 641647}, "623": {"acRate": 64.05857567366165, "difficulty": "Medium", "likes": 3556, "dislikes": 267, "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": 278519, "totalSubmissionRaw": 434788}, "624": {"acRate": 45.871161969610995, "difficulty": "Medium", "likes": 1396, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "624", "paidOnly": false, "title": "Maximum Distance in Arrays", "titleSlug": "maximum-distance-in-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 174615, "totalSubmissionRaw": 380664}, "625": {"acRate": 33.68946287056061, "difficulty": "Medium", "likes": 129, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "625", "paidOnly": true, "title": "Minimum Factorization", "titleSlug": "minimum-factorization", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 11478, "totalSubmissionRaw": 34070}, "626": {"acRate": 70.74939519159594, "difficulty": "Medium", "likes": 1476, "dislikes": 589, "categoryTitle": "Database", "frontendQuestionId": "626", "paidOnly": false, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249452, "totalSubmissionRaw": 352586}, "627": {"acRate": 83.45078917379476, "difficulty": "Easy", "likes": 1728, "dislikes": 565, "categoryTitle": "Database", "frontendQuestionId": "627", "paidOnly": false, "title": "Swap Salary", "titleSlug": "swap-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 425463, "totalSubmissionRaw": 509837}, "628": {"acRate": 45.19051877770307, "difficulty": "Easy", "likes": 4232, "dislikes": 680, "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": 346129, "totalSubmissionRaw": 765932}, "629": {"acRate": 49.421652658733464, "difficulty": "Hard", "likes": 2684, "dislikes": 325, "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": 130658, "totalSubmissionRaw": 264374}, "630": {"acRate": 40.29655657062544, "difficulty": "Hard", "likes": 3801, "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": 114684, "totalSubmissionRaw": 284600}, "631": {"acRate": 44.173646337147574, "difficulty": "Hard", "likes": 239, "dislikes": 277, "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": 18723, "totalSubmissionRaw": 42385}, "632": {"acRate": 63.14313066322328, "difficulty": "Hard", "likes": 3484, "dislikes": 76, "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": 113448, "totalSubmissionRaw": 179668}, "633": {"acRate": 36.58736050381779, "difficulty": "Medium", "likes": 3215, "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": 358799, "totalSubmissionRaw": 980666}, "634": {"acRate": 41.8787411406118, "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": 11404, "totalSubmissionRaw": 27231}, "635": {"acRate": 60.31648696066908, "difficulty": "Medium", "likes": 473, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "635", "paidOnly": true, "title": "Design Log Storage System", "titleSlug": "design-log-storage-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35410, "totalSubmissionRaw": 58707}, "636": {"acRate": 62.43867530495686, "difficulty": "Medium", "likes": 1956, "dislikes": 2798, "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": 229469, "totalSubmissionRaw": 367510}, "637": {"acRate": 73.1527041188142, "difficulty": "Easy", "likes": 5286, "dislikes": 328, "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": 550082, "totalSubmissionRaw": 751964}, "638": {"acRate": 51.86042488694119, "difficulty": "Medium", "likes": 1509, "dislikes": 761, "categoryTitle": "Algorithms", "frontendQuestionId": "638", "paidOnly": false, "title": "Shopping Offers", "titleSlug": "shopping-offers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62957, "totalSubmissionRaw": 121397}, "639": {"acRate": 30.83485434473221, "difficulty": "Hard", "likes": 1577, "dislikes": 819, "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": 76698, "totalSubmissionRaw": 248738}, "640": {"acRate": 44.04685631300188, "difficulty": "Medium", "likes": 508, "dislikes": 839, "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": 41249, "totalSubmissionRaw": 93646}, "641": {"acRate": 57.25342299769781, "difficulty": "Medium", "likes": 1182, "dislikes": 77, "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": 75602, "totalSubmissionRaw": 132048}, "642": {"acRate": 49.09257944346667, "difficulty": "Hard", "likes": 2114, "dislikes": 181, "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": 145880, "totalSubmissionRaw": 297153}, "643": {"acRate": 43.77543650928628, "difficulty": "Easy", "likes": 3546, "dislikes": 328, "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": 553386, "totalSubmissionRaw": 1264147}, "644": {"acRate": 36.915995397008054, "difficulty": "Hard", "likes": 623, "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": 20852, "totalSubmissionRaw": 56485}, "645": {"acRate": 44.54409298319836, "difficulty": "Easy", "likes": 4769, "dislikes": 1164, "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": 471693, "totalSubmissionRaw": 1058932}, "646": {"acRate": 60.15834655718771, "difficulty": "Medium", "likes": 4609, "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": 247933, "totalSubmissionRaw": 412134}, "647": {"acRate": 70.60126460757375, "difficulty": "Medium", "likes": 10835, "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": 864114, "totalSubmissionRaw": 1223933}, "648": {"acRate": 68.06854974872375, "difficulty": "Medium", "likes": 2942, "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": 274142, "totalSubmissionRaw": 402744}, "649": {"acRate": 47.94440359708162, "difficulty": "Medium", "likes": 2399, "dislikes": 1831, "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": 169539, "totalSubmissionRaw": 353617}, "650": {"acRate": 59.59815963673151, "difficulty": "Medium", "likes": 4193, "dislikes": 243, "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": 258034, "totalSubmissionRaw": 432957}, "651": {"acRate": 55.79155527886622, "difficulty": "Medium", "likes": 710, "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": 30470, "totalSubmissionRaw": 54614}, "652": {"acRate": 59.61292931246278, "difficulty": "Medium", "likes": 5853, "dislikes": 476, "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": 271274, "totalSubmissionRaw": 455059}, "653": {"acRate": 61.53067511662705, "difficulty": "Easy", "likes": 6784, "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": 573220, "totalSubmissionRaw": 931600}, "654": {"acRate": 85.5702208031659, "difficulty": "Medium", "likes": 5232, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "654", "paidOnly": false, "title": "Maximum Binary Tree", "titleSlug": "maximum-binary-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 304452, "totalSubmissionRaw": 355792}, "655": {"acRate": 64.5058638443936, "difficulty": "Medium", "likes": 496, "dislikes": 455, "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": 72164, "totalSubmissionRaw": 111872}, "656": {"acRate": 32.167063153642445, "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": 14333, "totalSubmissionRaw": 44558}, "657": {"acRate": 75.91016994370328, "difficulty": "Easy", "likes": 2437, "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": 446723, "totalSubmissionRaw": 588489}, "658": {"acRate": 47.75419161234538, "difficulty": "Medium", "likes": 8254, "dislikes": 708, "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": 582112, "totalSubmissionRaw": 1218976}, "659": {"acRate": 51.172624574435154, "difficulty": "Medium", "likes": 4436, "dislikes": 805, "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": 132271, "totalSubmissionRaw": 258480}, "660": {"acRate": 57.398675496688746, "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": 10834, "totalSubmissionRaw": 18875}, "661": {"acRate": 67.54469195008951, "difficulty": "Easy", "likes": 1138, "dislikes": 2914, "categoryTitle": "Algorithms", "frontendQuestionId": "661", "paidOnly": false, "title": "Image Smoother", "titleSlug": "image-smoother", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 170139, "totalSubmissionRaw": 251891}, "662": {"acRate": 43.18811218118141, "difficulty": "Medium", "likes": 8823, "dislikes": 1221, "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": 410147, "totalSubmissionRaw": 949677}, "663": {"acRate": 41.59566739317086, "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": 31490, "totalSubmissionRaw": 75705}, "664": {"acRate": 61.20291006397124, "difficulty": "Hard", "likes": 2637, "dislikes": 280, "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": 146378, "totalSubmissionRaw": 239169}, "665": {"acRate": 24.8258077658486, "difficulty": "Medium", "likes": 5730, "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": 268115, "totalSubmissionRaw": 1079984}, "666": {"acRate": 62.463062185419716, "difficulty": "Medium", "likes": 415, "dislikes": 517, "categoryTitle": "Algorithms", "frontendQuestionId": "666", "paidOnly": true, "title": "Path Sum IV", "titleSlug": "path-sum-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38471, "totalSubmissionRaw": 61590}, "667": {"acRate": 60.27695351137488, "difficulty": "Medium", "likes": 795, "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": 54846, "totalSubmissionRaw": 90990}, "668": {"acRate": 52.10782797029702, "difficulty": "Hard", "likes": 2163, "dislikes": 59, "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": 67365, "totalSubmissionRaw": 129280}, "669": {"acRate": 66.28698942892473, "difficulty": "Medium", "likes": 5863, "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": 301804, "totalSubmissionRaw": 455299}, "670": {"acRate": 48.970774150368115, "difficulty": "Medium", "likes": 3394, "dislikes": 209, "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": 263404, "totalSubmissionRaw": 537880}, "671": {"acRate": 44.72658482628157, "difficulty": "Easy", "likes": 1862, "dislikes": 1880, "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": 199548, "totalSubmissionRaw": 446152}, "672": {"acRate": 50.16160852957226, "difficulty": "Medium", "likes": 164, "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": 23900, "totalSubmissionRaw": 47646}, "673": {"acRate": 48.678802462515115, "difficulty": "Medium", "likes": 6830, "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": 245992, "totalSubmissionRaw": 505337}, "674": {"acRate": 50.48958218902193, "difficulty": "Easy", "likes": 2350, "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": 275764, "totalSubmissionRaw": 546178}, "675": {"acRate": 34.57954417873583, "difficulty": "Hard", "likes": 1233, "dislikes": 675, "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": 70840, "totalSubmissionRaw": 204861}, "676": {"acRate": 57.68208258097186, "difficulty": "Medium", "likes": 1409, "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": 86571, "totalSubmissionRaw": 150083}, "677": {"acRate": 56.872377539955686, "difficulty": "Medium", "likes": 1660, "dislikes": 158, "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": 120632, "totalSubmissionRaw": 212110}, "678": {"acRate": 38.18892880081833, "difficulty": "Medium", "likes": 6211, "dislikes": 193, "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": 401337, "totalSubmissionRaw": 1050910}, "679": {"acRate": 49.448576558091816, "difficulty": "Hard", "likes": 1473, "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": 80976, "totalSubmissionRaw": 163758}, "680": {"acRate": 41.25165000353944, "difficulty": "Easy", "likes": 8279, "dislikes": 447, "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": 792526, "totalSubmissionRaw": 1921199}, "681": {"acRate": 46.801527653833304, "difficulty": "Medium", "likes": 731, "dislikes": 1066, "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": 110656, "totalSubmissionRaw": 236438}, "682": {"acRate": 77.17476574850967, "difficulty": "Easy", "likes": 2881, "dislikes": 1918, "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": 387596, "totalSubmissionRaw": 502233}, "683": {"acRate": 37.16876919470872, "difficulty": "Hard", "likes": 801, "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": 61844, "totalSubmissionRaw": 166387}, "684": {"acRate": 63.38998644516184, "difficulty": "Medium", "likes": 6237, "dislikes": 406, "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": 387213, "totalSubmissionRaw": 610844}, "685": {"acRate": 34.61672687486441, "difficulty": "Hard", "likes": 2344, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "685", "paidOnly": false, "title": "Redundant Connection II", "titleSlug": "redundant-connection-ii", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73401, "totalSubmissionRaw": 212041}, "686": {"acRate": 35.52680133798374, "difficulty": "Medium", "likes": 2574, "dislikes": 985, "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": 179070, "totalSubmissionRaw": 504042}, "687": {"acRate": 41.827769569025776, "difficulty": "Medium", "likes": 4254, "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": 189100, "totalSubmissionRaw": 452092}, "688": {"acRate": 56.31225095230572, "difficulty": "Medium", "likes": 3854, "dislikes": 478, "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": 160397, "totalSubmissionRaw": 284835}, "689": {"acRate": 50.31174937394592, "difficulty": "Hard", "likes": 1973, "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": 78756, "totalSubmissionRaw": 156536}, "690": {"acRate": 67.39938625849457, "difficulty": "Medium", "likes": 2108, "dislikes": 1338, "categoryTitle": "Algorithms", "frontendQuestionId": "690", "paidOnly": false, "title": "Employee Importance", "titleSlug": "employee-importance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 218097, "totalSubmissionRaw": 323589}, "691": {"acRate": 49.09987732898312, "difficulty": "Hard", "likes": 1233, "dislikes": 115, "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": 76448, "totalSubmissionRaw": 155700}, "692": {"acRate": 58.38818108086832, "difficulty": "Medium", "likes": 7676, "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": 637843, "totalSubmissionRaw": 1092418}, "693": {"acRate": 62.864347630305076, "difficulty": "Easy", "likes": 1365, "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": 139606, "totalSubmissionRaw": 222075}, "694": {"acRate": 61.586434424775625, "difficulty": "Medium", "likes": 2242, "dislikes": 143, "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": 173606, "totalSubmissionRaw": 281890}, "695": {"acRate": 72.45236347074275, "difficulty": "Medium", "likes": 10000, "dislikes": 204, "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": 922640, "totalSubmissionRaw": 1273444}, "696": {"acRate": 65.65931202756303, "difficulty": "Easy", "likes": 3991, "dislikes": 874, "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": 214203, "totalSubmissionRaw": 326234}, "697": {"acRate": 56.718387218852605, "difficulty": "Easy", "likes": 3046, "dislikes": 1737, "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": 221812, "totalSubmissionRaw": 391076}, "698": {"acRate": 38.17296674182095, "difficulty": "Medium", "likes": 7163, "dislikes": 517, "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": 277498, "totalSubmissionRaw": 726949}, "699": {"acRate": 45.442176870748305, "difficulty": "Hard", "likes": 635, "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": 28056, "totalSubmissionRaw": 61740}, "700": {"acRate": 80.5216545927281, "difficulty": "Easy", "likes": 5986, "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": 959119, "totalSubmissionRaw": 1191132}, "701": {"acRate": 73.67250990321395, "difficulty": "Medium", "likes": 5887, "dislikes": 178, "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": 577283, "totalSubmissionRaw": 783581}, "702": {"acRate": 72.31012658227847, "difficulty": "Medium", "likes": 911, "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": 100083, "totalSubmissionRaw": 138408}, "703": {"acRate": 59.191185188949305, "difficulty": "Easy", "likes": 5852, "dislikes": 3737, "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": 698889, "totalSubmissionRaw": 1180732}, "704": {"acRate": 58.289125916674145, "difficulty": "Easy", "likes": 11939, "dislikes": 254, "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": 2632097, "totalSubmissionRaw": 4515602}, "705": {"acRate": 67.13612437262823, "difficulty": "Easy", "likes": 3789, "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": 438748, "totalSubmissionRaw": 653520}, "706": {"acRate": 65.5932977913176, "difficulty": "Easy", "likes": 5119, "dislikes": 468, "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": 602865, "totalSubmissionRaw": 919096}, "707": {"acRate": 28.428966226031083, "difficulty": "Medium", "likes": 2666, "dislikes": 1625, "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": 351301, "totalSubmissionRaw": 1235715}, "708": {"acRate": 36.53571170360612, "difficulty": "Medium", "likes": 1224, "dislikes": 780, "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": 181920, "totalSubmissionRaw": 497928}, "709": {"acRate": 83.63082652095737, "difficulty": "Easy", "likes": 1861, "dislikes": 2776, "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": 549774, "totalSubmissionRaw": 657382}, "710": {"acRate": 33.548792113278616, "difficulty": "Hard", "likes": 867, "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": 43287, "totalSubmissionRaw": 129027}, "711": {"acRate": 53.06056552424005, "difficulty": "Hard", "likes": 263, "dislikes": 274, "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": 11503, "totalSubmissionRaw": 21679}, "712": {"acRate": 65.22631507998973, "difficulty": "Medium", "likes": 3992, "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": 149999, "totalSubmissionRaw": 229967}, "713": {"acRate": 51.73428789106433, "difficulty": "Medium", "likes": 6877, "dislikes": 220, "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": 427796, "totalSubmissionRaw": 826910}, "714": {"acRate": 69.23126160148499, "difficulty": "Medium", "likes": 7198, "dislikes": 215, "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": 400189, "totalSubmissionRaw": 578048}, "715": {"acRate": 43.87926860199682, "difficulty": "Hard", "likes": 1500, "dislikes": 127, "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": 76120, "totalSubmissionRaw": 173476}, "716": {"acRate": 45.074676133171955, "difficulty": "Hard", "likes": 1926, "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": 155667, "totalSubmissionRaw": 345356}, "717": {"acRate": 45.195991316037016, "difficulty": "Easy", "likes": 872, "dislikes": 2117, "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": 138857, "totalSubmissionRaw": 307233}, "718": {"acRate": 50.94917810975878, "difficulty": "Medium", "likes": 6818, "dislikes": 170, "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": 311408, "totalSubmissionRaw": 611213}, "719": {"acRate": 45.28606959024135, "difficulty": "Hard", "likes": 3720, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "719", "paidOnly": false, "title": "Find K-th Smallest Pair Distance", "titleSlug": "find-k-th-smallest-pair-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 183174, "totalSubmissionRaw": 404482}, "720": {"acRate": 52.71986676565604, "difficulty": "Medium", "likes": 1977, "dislikes": 1497, "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": 157644, "totalSubmissionRaw": 299022}, "721": {"acRate": 57.84644800099039, "difficulty": "Medium", "likes": 6826, "dislikes": 1175, "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": 420531, "totalSubmissionRaw": 726979}, "722": {"acRate": 38.93153738677216, "difficulty": "Medium", "likes": 720, "dislikes": 1813, "categoryTitle": "Algorithms", "frontendQuestionId": "722", "paidOnly": false, "title": "Remove Comments", "titleSlug": "remove-comments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74397, "totalSubmissionRaw": 191097}, "723": {"acRate": 76.92500889512128, "difficulty": "Medium", "likes": 1017, "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": 73508, "totalSubmissionRaw": 95558}, "724": {"acRate": 58.52612059149075, "difficulty": "Easy", "likes": 8418, "dislikes": 857, "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": 1175947, "totalSubmissionRaw": 2009269}, "725": {"acRate": 64.34969029895058, "difficulty": "Medium", "likes": 3968, "dislikes": 318, "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": 205910, "totalSubmissionRaw": 319986}, "726": {"acRate": 65.19787017186238, "difficulty": "Hard", "likes": 1881, "dislikes": 407, "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": 148405, "totalSubmissionRaw": 227623}, "727": {"acRate": 43.5367845626056, "difficulty": "Hard", "likes": 1457, "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": 93022, "totalSubmissionRaw": 213663}, "728": {"acRate": 78.96373217606943, "difficulty": "Easy", "likes": 1789, "dislikes": 376, "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": 254737, "totalSubmissionRaw": 322600}, "729": {"acRate": 56.58529662219699, "difficulty": "Medium", "likes": 4225, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "729", "paidOnly": false, "title": "My Calendar I", "titleSlug": "my-calendar-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 291051, "totalSubmissionRaw": 514358}, "730": {"acRate": 45.93203380227357, "difficulty": "Hard", "likes": 1932, "dislikes": 99, "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": 38102, "totalSubmissionRaw": 82953}, "731": {"acRate": 55.78610348378239, "difficulty": "Medium", "likes": 1754, "dislikes": 149, "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": 104021, "totalSubmissionRaw": 186464}, "732": {"acRate": 71.677650917417, "difficulty": "Hard", "likes": 1966, "dislikes": 270, "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": 92662, "totalSubmissionRaw": 129276}, "733": {"acRate": 64.75555210529144, "difficulty": "Easy", "likes": 8494, "dislikes": 885, "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": 975947, "totalSubmissionRaw": 1507125}, "734": {"acRate": 44.409903335798475, "difficulty": "Easy", "likes": 49, "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": 67857, "totalSubmissionRaw": 152797}, "735": {"acRate": 44.684997848518854, "difficulty": "Medium", "likes": 8084, "dislikes": 1106, "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": 582582, "totalSubmissionRaw": 1303753}, "736": {"acRate": 52.02493629413906, "difficulty": "Hard", "likes": 477, "dislikes": 363, "categoryTitle": "Algorithms", "frontendQuestionId": "736", "paidOnly": false, "title": "Parse Lisp Expression", "titleSlug": "parse-lisp-expression", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22866, "totalSubmissionRaw": 43952}, "737": {"acRate": 50.17833429511024, "difficulty": "Medium", "likes": 841, "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": 72172, "totalSubmissionRaw": 143831}, "738": {"acRate": 48.33493727295584, "difficulty": "Medium", "likes": 1327, "dislikes": 106, "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": 55750, "totalSubmissionRaw": 115341}, "739": {"acRate": 66.30464525052115, "difficulty": "Medium", "likes": 13284, "dislikes": 329, "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": 1066179, "totalSubmissionRaw": 1608001}, "740": {"acRate": 56.5316398046707, "difficulty": "Medium", "likes": 7568, "dislikes": 383, "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": 357486, "totalSubmissionRaw": 632365}, "741": {"acRate": 37.21950596964349, "difficulty": "Hard", "likes": 4303, "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": 84574, "totalSubmissionRaw": 227232}, "742": {"acRate": 46.47527031946399, "difficulty": "Medium", "likes": 862, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "742", "paidOnly": true, "title": "Closest Leaf in a Binary Tree", "titleSlug": "closest-leaf-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47237, "totalSubmissionRaw": 101639}, "743": {"acRate": 54.98025071243576, "difficulty": "Medium", "likes": 7495, "dislikes": 369, "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": 541749, "totalSubmissionRaw": 985352}, "744": {"acRate": 52.707848540570815, "difficulty": "Easy", "likes": 4464, "dislikes": 2198, "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": 513940, "totalSubmissionRaw": 975073}, "745": {"acRate": 41.16223972237053, "difficulty": "Hard", "likes": 2279, "dislikes": 485, "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": 98684, "totalSubmissionRaw": 239744}, "746": {"acRate": 66.18998154124813, "difficulty": "Easy", "likes": 11490, "dislikes": 1777, "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": 1262911, "totalSubmissionRaw": 1908016}, "747": {"acRate": 49.3762738877906, "difficulty": "Easy", "likes": 1212, "dislikes": 906, "categoryTitle": "Algorithms", "frontendQuestionId": "747", "paidOnly": false, "title": "Largest Number At Least Twice of Others", "titleSlug": "largest-number-at-least-twice-of-others", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 257756, "totalSubmissionRaw": 522024}, "748": {"acRate": 60.44149645010955, "difficulty": "Easy", "likes": 553, "dislikes": 1108, "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": 80279, "totalSubmissionRaw": 132821}, "749": {"acRate": 51.424805179699916, "difficulty": "Hard", "likes": 396, "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": 13264, "totalSubmissionRaw": 25793}, "750": {"acRate": 67.81096434670476, "difficulty": "Medium", "likes": 622, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "750", "paidOnly": true, "title": "Number Of Corner Rectangles", "titleSlug": "number-of-corner-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38914, "totalSubmissionRaw": 57386}, "751": {"acRate": 55.55751160794842, "difficulty": "Medium", "likes": 90, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "751", "paidOnly": true, "title": "IP to CIDR", "titleSlug": "ip-to-cidr", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25247, "totalSubmissionRaw": 45443}, "752": {"acRate": 60.35503829204952, "difficulty": "Medium", "likes": 4779, "dislikes": 221, "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": 328157, "totalSubmissionRaw": 543709}, "753": {"acRate": 57.15621369950985, "difficulty": "Hard", "likes": 567, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "753", "paidOnly": false, "title": "Cracking the Safe", "titleSlug": "cracking-the-safe", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Eulerian Circuit", "id": "VG9waWNUYWdOb2RlOjYxMDc0", "slug": "eulerian-circuit"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60521, "totalSubmissionRaw": 105887}, "754": {"acRate": 43.368281797653715, "difficulty": "Medium", "likes": 1823, "dislikes": 815, "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": 57041, "totalSubmissionRaw": 131527}, "755": {"acRate": 47.132779129003765, "difficulty": "Medium", "likes": 302, "dislikes": 764, "categoryTitle": "Algorithms", "frontendQuestionId": "755", "paidOnly": true, "title": "Pour Water", "titleSlug": "pour-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38951, "totalSubmissionRaw": 82641}, "756": {"acRate": 52.940995933399826, "difficulty": "Medium", "likes": 537, "dislikes": 480, "categoryTitle": "Algorithms", "frontendQuestionId": "756", "paidOnly": false, "title": "Pyramid Transition Matrix", "titleSlug": "pyramid-transition-matrix", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34499, "totalSubmissionRaw": 65165}, "757": {"acRate": 44.71845381899276, "difficulty": "Hard", "likes": 714, "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": 24063, "totalSubmissionRaw": 53810}, "758": {"acRate": 51.58233794121594, "difficulty": "Medium", "likes": 270, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "758", "paidOnly": true, "title": "Bold Words in String", "titleSlug": "bold-words-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19217, "totalSubmissionRaw": 37255}, "759": {"acRate": 72.25396496417754, "difficulty": "Hard", "likes": 1906, "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": 153391, "totalSubmissionRaw": 212295}, "760": {"acRate": 83.7092223879629, "difficulty": "Easy", "likes": 612, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "760", "paidOnly": true, "title": "Find Anagram Mappings", "titleSlug": "find-anagram-mappings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 103257, "totalSubmissionRaw": 123352}, "761": {"acRate": 61.548027156012644, "difficulty": "Hard", "likes": 708, "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": 18313, "totalSubmissionRaw": 29754}, "762": {"acRate": 69.9327798625631, "difficulty": "Easy", "likes": 719, "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": 102683, "totalSubmissionRaw": 146831}, "763": {"acRate": 79.99395106959997, "difficulty": "Medium", "likes": 10324, "dislikes": 401, "categoryTitle": "Algorithms", "frontendQuestionId": "763", "paidOnly": false, "title": "Partition Labels", "titleSlug": "partition-labels", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 558073, "totalSubmissionRaw": 697644}, "764": {"acRate": 48.39004521984542, "difficulty": "Medium", "likes": 1472, "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": 60354, "totalSubmissionRaw": 124724}, "765": {"acRate": 57.60933779695304, "difficulty": "Hard", "likes": 2361, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "765", "paidOnly": false, "title": "Couples Holding Hands", "titleSlug": "couples-holding-hands", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64360, "totalSubmissionRaw": 111718}, "766": {"acRate": 69.13405171122407, "difficulty": "Easy", "likes": 3547, "dislikes": 169, "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": 346130, "totalSubmissionRaw": 500665}, "767": {"acRate": 54.9609629576859, "difficulty": "Medium", "likes": 8544, "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": 416595, "totalSubmissionRaw": 757987}, "768": {"acRate": 53.45371513405789, "difficulty": "Hard", "likes": 1841, "dislikes": 57, "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": 66250, "totalSubmissionRaw": 123939}, "769": {"acRate": 58.56328694499668, "difficulty": "Medium", "likes": 2829, "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": 110465, "totalSubmissionRaw": 188625}, "770": {"acRate": 55.725033494795426, "difficulty": "Hard", "likes": 168, "dislikes": 1413, "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": 10814, "totalSubmissionRaw": 19406}, "771": {"acRate": 88.83997349658745, "difficulty": "Easy", "likes": 5124, "dislikes": 596, "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": 1096781, "totalSubmissionRaw": 1234558}, "772": {"acRate": 51.03757974988559, "difficulty": "Hard", "likes": 1136, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "772", "paidOnly": true, "title": "Basic Calculator III", "titleSlug": "basic-calculator-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130474, "totalSubmissionRaw": 255643}, "773": {"acRate": 65.08968009637263, "difficulty": "Hard", "likes": 2031, "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": 97256, "totalSubmissionRaw": 149419}, "774": {"acRate": 52.38673343787411, "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": 31069, "totalSubmissionRaw": 59307}, "775": {"acRate": 42.43309936389559, "difficulty": "Medium", "likes": 1833, "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": 77381, "totalSubmissionRaw": 182360}, "776": {"acRate": 82.60862963047325, "difficulty": "Medium", "likes": 1060, "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": 108803, "totalSubmissionRaw": 131709}, "777": {"acRate": 36.88629148083755, "difficulty": "Medium", "likes": 1225, "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": 78075, "totalSubmissionRaw": 211664}, "778": {"acRate": 61.456540003030014, "difficulty": "Hard", "likes": 3738, "dislikes": 250, "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": 178487, "totalSubmissionRaw": 290425}, "779": {"acRate": 46.76900107311155, "difficulty": "Medium", "likes": 3807, "dislikes": 397, "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": 210504, "totalSubmissionRaw": 450093}, "780": {"acRate": 33.346964005515666, "difficulty": "Hard", "likes": 1528, "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": 70132, "totalSubmissionRaw": 210310}, "781": {"acRate": 53.01745292360148, "difficulty": "Medium", "likes": 1349, "dislikes": 624, "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": 61575, "totalSubmissionRaw": 116141}, "782": {"acRate": 50.871548082034636, "difficulty": "Hard", "likes": 361, "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": 18182, "totalSubmissionRaw": 35741}, "783": {"acRate": 59.76991793556879, "difficulty": "Easy", "likes": 3498, "dislikes": 420, "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": 261543, "totalSubmissionRaw": 437583}, "784": {"acRate": 74.44281444219222, "difficulty": "Medium", "likes": 4664, "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": 311066, "totalSubmissionRaw": 417859}, "785": {"acRate": 56.32989372455047, "difficulty": "Medium", "likes": 8339, "dislikes": 387, "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": 605778, "totalSubmissionRaw": 1075411}, "786": {"acRate": 68.21372063775407, "difficulty": "Medium", "likes": 2020, "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": 151326, "totalSubmissionRaw": 221841}, "787": {"acRate": 39.583807289059905, "difficulty": "Medium", "likes": 10017, "dislikes": 417, "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": 608985, "totalSubmissionRaw": 1538470}, "788": {"acRate": 56.45446756991078, "difficulty": "Medium", "likes": 748, "dislikes": 1929, "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": 110045, "totalSubmissionRaw": 194927}, "789": {"acRate": 62.11082432650428, "difficulty": "Medium", "likes": 293, "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": 30802, "totalSubmissionRaw": 49592}, "790": {"acRate": 49.9282368937906, "difficulty": "Medium", "likes": 3483, "dislikes": 1119, "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": 145407, "totalSubmissionRaw": 291234}, "791": {"acRate": 70.95997724926664, "difficulty": "Medium", "likes": 3624, "dislikes": 415, "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": 451630, "totalSubmissionRaw": 636459}, "792": {"acRate": 50.842203296739086, "difficulty": "Medium", "likes": 5508, "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": 234198, "totalSubmissionRaw": 460637}, "793": {"acRate": 45.00379284187297, "difficulty": "Hard", "likes": 439, "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": 19578, "totalSubmissionRaw": 43503}, "794": {"acRate": 34.70878589971944, "difficulty": "Medium", "likes": 550, "dislikes": 1151, "categoryTitle": "Algorithms", "frontendQuestionId": "794", "paidOnly": false, "title": "Valid Tic-Tac-Toe State", "titleSlug": "valid-tic-tac-toe-state", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59629, "totalSubmissionRaw": 171798}, "795": {"acRate": 53.33875318724364, "difficulty": "Medium", "likes": 2302, "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": 72170, "totalSubmissionRaw": 135305}, "796": {"acRate": 59.12898069110181, "difficulty": "Easy", "likes": 3663, "dislikes": 187, "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": 361374, "totalSubmissionRaw": 611163}, "797": {"acRate": 82.64093022128212, "difficulty": "Medium", "likes": 7265, "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": 545407, "totalSubmissionRaw": 659972}, "798": {"acRate": 51.72747473299405, "difficulty": "Hard", "likes": 542, "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": 14433, "totalSubmissionRaw": 27902}, "799": {"acRate": 58.25112391094981, "difficulty": "Medium", "likes": 3658, "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": 156653, "totalSubmissionRaw": 268927}, "800": {"acRate": 67.58434547908232, "difficulty": "Easy", "likes": 108, "dislikes": 684, "categoryTitle": "Algorithms", "frontendQuestionId": "800", "paidOnly": true, "title": "Similar RGB Color", "titleSlug": "similar-rgb-color", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17528, "totalSubmissionRaw": 25935}, "801": {"acRate": 40.26350851221318, "difficulty": "Hard", "likes": 2820, "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": 81594, "totalSubmissionRaw": 202650}, "802": {"acRate": 63.98413948437253, "difficulty": "Medium", "likes": 5813, "dislikes": 462, "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": 278675, "totalSubmissionRaw": 435540}, "803": {"acRate": 34.95831741680336, "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": 31115, "totalSubmissionRaw": 89006}, "804": {"acRate": 82.96814232709289, "difficulty": "Easy", "likes": 2523, "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": 362028, "totalSubmissionRaw": 436346}, "805": {"acRate": 25.551241969285737, "difficulty": "Hard", "likes": 1275, "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": 37186, "totalSubmissionRaw": 145535}, "806": {"acRate": 69.0415945672402, "difficulty": "Easy", "likes": 605, "dislikes": 1335, "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": 84587, "totalSubmissionRaw": 122516}, "807": {"acRate": 86.22213367661783, "difficulty": "Medium", "likes": 2574, "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": 168785, "totalSubmissionRaw": 195756}, "808": {"acRate": 53.79971871493814, "difficulty": "Medium", "likes": 988, "dislikes": 2687, "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": 68090, "totalSubmissionRaw": 126562}, "809": {"acRate": 46.21290908739441, "difficulty": "Medium", "likes": 869, "dislikes": 1908, "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": 119532, "totalSubmissionRaw": 258655}, "810": {"acRate": 60.81729528920077, "difficulty": "Hard", "likes": 226, "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": 11787, "totalSubmissionRaw": 19381}, "811": {"acRate": 76.40029800150302, "difficulty": "Medium", "likes": 1559, "dislikes": 1300, "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": 234840, "totalSubmissionRaw": 307381}, "812": {"acRate": 61.07924747260595, "difficulty": "Easy", "likes": 532, "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": 54738, "totalSubmissionRaw": 89618}, "813": {"acRate": 53.68667398207402, "difficulty": "Medium", "likes": 2107, "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": 55286, "totalSubmissionRaw": 102979}, "814": {"acRate": 72.26373626373626, "difficulty": "Medium", "likes": 4532, "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": 249888, "totalSubmissionRaw": 345800}, "815": {"acRate": 47.528895706346965, "difficulty": "Hard", "likes": 4269, "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": 211936, "totalSubmissionRaw": 445911}, "816": {"acRate": 56.90725866428677, "difficulty": "Medium", "likes": 322, "dislikes": 662, "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": 30607, "totalSubmissionRaw": 53784}, "817": {"acRate": 56.93111917003305, "difficulty": "Medium", "likes": 1104, "dislikes": 2234, "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": 99215, "totalSubmissionRaw": 174272}, "818": {"acRate": 43.81445797146402, "difficulty": "Hard", "likes": 1911, "dislikes": 182, "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": 90405, "totalSubmissionRaw": 206336}, "819": {"acRate": 44.329421429832564, "difficulty": "Easy", "likes": 1712, "dislikes": 3062, "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": 369077, "totalSubmissionRaw": 832582}, "820": {"acRate": 60.46924925073688, "difficulty": "Medium", "likes": 1754, "dislikes": 654, "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": 97653, "totalSubmissionRaw": 161492}, "821": {"acRate": 71.76190352321248, "difficulty": "Easy", "likes": 3149, "dislikes": 180, "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": 193112, "totalSubmissionRaw": 269101}, "822": {"acRate": 48.04066985645933, "difficulty": "Medium", "likes": 175, "dislikes": 757, "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": 20081, "totalSubmissionRaw": 41800}, "823": {"acRate": 52.89520301674998, "difficulty": "Medium", "likes": 3302, "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": 150791, "totalSubmissionRaw": 285075}, "824": {"acRate": 68.474648107252, "difficulty": "Easy", "likes": 915, "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": 184179, "totalSubmissionRaw": 268974}, "825": {"acRate": 47.969047304103626, "difficulty": "Medium", "likes": 768, "dislikes": 1218, "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": 94287, "totalSubmissionRaw": 196558}, "826": {"acRate": 55.886629259177546, "difficulty": "Medium", "likes": 2373, "dislikes": 170, "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": 210254, "totalSubmissionRaw": 376216}, "827": {"acRate": 48.432162694680144, "difficulty": "Hard", "likes": 3955, "dislikes": 78, "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": 195659, "totalSubmissionRaw": 403991}, "828": {"acRate": 52.61553364864094, "difficulty": "Hard", "likes": 2160, "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": 73868, "totalSubmissionRaw": 140392}, "829": {"acRate": 41.88655507891389, "difficulty": "Hard", "likes": 1376, "dislikes": 1381, "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": 88562, "totalSubmissionRaw": 211433}, "830": {"acRate": 52.48741958086502, "difficulty": "Easy", "likes": 879, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "830", "paidOnly": false, "title": "Positions of Large Groups", "titleSlug": "positions-of-large-groups", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98880, "totalSubmissionRaw": 188388}, "831": {"acRate": 49.411963991869136, "difficulty": "Medium", "likes": 169, "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": 20419, "totalSubmissionRaw": 41324}, "832": {"acRate": 82.32725217216888, "difficulty": "Easy", "likes": 3461, "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": 451495, "totalSubmissionRaw": 548415}, "833": {"acRate": 52.18500049968468, "difficulty": "Medium", "likes": 1191, "dislikes": 1020, "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": 151432, "totalSubmissionRaw": 290183}, "834": {"acRate": 65.28493393220657, "difficulty": "Hard", "likes": 5598, "dislikes": 138, "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": 160031, "totalSubmissionRaw": 245127}, "835": {"acRate": 63.653753544865964, "difficulty": "Medium", "likes": 1335, "dislikes": 482, "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": 95168, "totalSubmissionRaw": 149510}, "836": {"acRate": 45.056911347560174, "difficulty": "Easy", "likes": 1997, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "836", "paidOnly": false, "title": "Rectangle Overlap", "titleSlug": "rectangle-overlap", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150582, "totalSubmissionRaw": 334204}, "837": {"acRate": 44.95572037095071, "difficulty": "Medium", "likes": 1988, "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": 77465, "totalSubmissionRaw": 172314}, "838": {"acRate": 57.24357639988777, "difficulty": "Medium", "likes": 3390, "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": 126498, "totalSubmissionRaw": 220982}, "839": {"acRate": 55.111691364837526, "difficulty": "Hard", "likes": 2349, "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": 122839, "totalSubmissionRaw": 222891}, "840": {"acRate": 51.72067929174059, "difficulty": "Medium", "likes": 807, "dislikes": 1826, "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": 142837, "totalSubmissionRaw": 276170}, "841": {"acRate": 73.55552897223781, "difficulty": "Medium", "likes": 6168, "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": 479603, "totalSubmissionRaw": 652030}, "842": {"acRate": 39.16611093392096, "difficulty": "Medium", "likes": 1136, "dislikes": 305, "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": 40524, "totalSubmissionRaw": 103467}, "843": {"acRate": 38.745531122329524, "difficulty": "Hard", "likes": 1547, "dislikes": 1791, "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": 147281, "totalSubmissionRaw": 380119}, "844": {"acRate": 49.25805348691837, "difficulty": "Easy", "likes": 7553, "dislikes": 355, "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": 855771, "totalSubmissionRaw": 1737322}, "845": {"acRate": 40.58391688738919, "difficulty": "Medium", "likes": 2787, "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": 134224, "totalSubmissionRaw": 330732}, "846": {"acRate": 56.75359417522762, "difficulty": "Medium", "likes": 3282, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "846", "paidOnly": false, "title": "Hand of Straights", "titleSlug": "hand-of-straights", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 318648, "totalSubmissionRaw": 561459}, "847": {"acRate": 65.40205374518654, "difficulty": "Hard", "likes": 4335, "dislikes": 171, "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": 126362, "totalSubmissionRaw": 193208}, "848": {"acRate": 44.82628733492866, "difficulty": "Medium", "likes": 1376, "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": 101155, "totalSubmissionRaw": 225660}, "849": {"acRate": 48.301109547072954, "difficulty": "Medium", "likes": 3226, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "849", "paidOnly": false, "title": "Maximize Distance to Closest Person", "titleSlug": "maximize-distance-to-closest-person", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233333, "totalSubmissionRaw": 483080}, "850": {"acRate": 54.297490604921805, "difficulty": "Hard", "likes": 971, "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": 35832, "totalSubmissionRaw": 65992}, "851": {"acRate": 60.09972693814556, "difficulty": "Medium", "likes": 1316, "dislikes": 816, "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": 50622, "totalSubmissionRaw": 84230}, "852": {"acRate": 68.2158718447153, "difficulty": "Medium", "likes": 7591, "dislikes": 1923, "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": 865377, "totalSubmissionRaw": 1268586}, "853": {"acRate": 51.80937247834263, "difficulty": "Medium", "likes": 3609, "dislikes": 1009, "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": 291492, "totalSubmissionRaw": 562625}, "854": {"acRate": 40.00523418768784, "difficulty": "Hard", "likes": 1138, "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": 47387, "totalSubmissionRaw": 118452}, "855": {"acRate": 43.56833898118302, "difficulty": "Medium", "likes": 1335, "dislikes": 487, "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": 63256, "totalSubmissionRaw": 145188}, "856": {"acRate": 64.02688232980192, "difficulty": "Medium", "likes": 5434, "dislikes": 210, "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": 192063, "totalSubmissionRaw": 299972}, "857": {"acRate": 63.51075887837069, "difficulty": "Hard", "likes": 2918, "dislikes": 395, "categoryTitle": "Algorithms", "frontendQuestionId": "857", "paidOnly": false, "title": "Minimum Cost to Hire K Workers", "titleSlug": "minimum-cost-to-hire-k-workers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141764, "totalSubmissionRaw": 223212}, "858": {"acRate": 62.44718907083603, "difficulty": "Medium", "likes": 1109, "dislikes": 2548, "categoryTitle": "Algorithms", "frontendQuestionId": "858", "paidOnly": false, "title": "Mirror Reflection", "titleSlug": "mirror-reflection", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80999, "totalSubmissionRaw": 129708}, "859": {"acRate": 33.18731991531045, "difficulty": "Easy", "likes": 3189, "dislikes": 1801, "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": 250170, "totalSubmissionRaw": 753812}, "860": {"acRate": 58.29207821745888, "difficulty": "Easy", "likes": 2877, "dislikes": 190, "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": 364192, "totalSubmissionRaw": 624770}, "861": {"acRate": 80.39395501532952, "difficulty": "Medium", "likes": 2299, "dislikes": 215, "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": 148154, "totalSubmissionRaw": 184285}, "862": {"acRate": 26.128370568402843, "difficulty": "Hard", "likes": 4290, "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": 103304, "totalSubmissionRaw": 395369}, "863": {"acRate": 64.96143671522783, "difficulty": "Medium", "likes": 11061, "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": 470745, "totalSubmissionRaw": 724653}, "864": {"acRate": 53.50307167235495, "difficulty": "Hard", "likes": 2344, "dislikes": 103, "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": 78382, "totalSubmissionRaw": 146500}, "865": {"acRate": 70.98349612664197, "difficulty": "Medium", "likes": 2654, "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": 143310, "totalSubmissionRaw": 201892}, "866": {"acRate": 26.14395637956335, "difficulty": "Medium", "likes": 440, "dislikes": 830, "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": 35098, "totalSubmissionRaw": 134249}, "867": {"acRate": 72.37871246513154, "difficulty": "Easy", "likes": 3774, "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": 423456, "totalSubmissionRaw": 585056}, "868": {"acRate": 63.85636629730295, "difficulty": "Easy", "likes": 642, "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": 85519, "totalSubmissionRaw": 133924}, "869": {"acRate": 62.56628824007107, "difficulty": "Medium", "likes": 2119, "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": 114796, "totalSubmissionRaw": 183479}, "870": {"acRate": 52.76434133406692, "difficulty": "Medium", "likes": 1620, "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": 69049, "totalSubmissionRaw": 130863}, "871": {"acRate": 40.153091960816226, "difficulty": "Hard", "likes": 4677, "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": 140634, "totalSubmissionRaw": 350246}, "872": {"acRate": 70.05581136335269, "difficulty": "Easy", "likes": 4135, "dislikes": 116, "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": 510745, "totalSubmissionRaw": 729056}, "873": {"acRate": 48.415087137173145, "difficulty": "Medium", "likes": 2026, "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": 65952, "totalSubmissionRaw": 136222}, "874": {"acRate": 40.84046751240829, "difficulty": "Medium", "likes": 208, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 43351, "totalSubmissionRaw": 106164}, "875": {"acRate": 48.39473512722315, "difficulty": "Medium", "likes": 10874, "dislikes": 699, "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": 772340, "totalSubmissionRaw": 1595923}, "876": {"acRate": 79.23114477165649, "difficulty": "Easy", "likes": 11764, "dislikes": 379, "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": 2080568, "totalSubmissionRaw": 2625948}, "877": {"acRate": 71.07608459526867, "difficulty": "Medium", "likes": 3322, "dislikes": 2906, "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": 258471, "totalSubmissionRaw": 363655}, "878": {"acRate": 35.57051723833254, "difficulty": "Hard", "likes": 1282, "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": 40258, "totalSubmissionRaw": 113178}, "879": {"acRate": 48.17126377283147, "difficulty": "Hard", "likes": 1844, "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": 65142, "totalSubmissionRaw": 135230}, "880": {"acRate": 36.51407877001466, "difficulty": "Medium", "likes": 2520, "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": 98607, "totalSubmissionRaw": 270052}, "881": {"acRate": 59.57931155027425, "difficulty": "Medium", "likes": 6443, "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": 429484, "totalSubmissionRaw": 720860}, "882": {"acRate": 50.52954533636096, "difficulty": "Hard", "likes": 816, "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": 29151, "totalSubmissionRaw": 57691}, "883": {"acRate": 73.15202842167152, "difficulty": "Easy", "likes": 588, "dislikes": 1416, "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": 58477, "totalSubmissionRaw": 79939}, "884": {"acRate": 67.7649673565773, "difficulty": "Easy", "likes": 1341, "dislikes": 170, "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"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146351, "totalSubmissionRaw": 215969}, "885": {"acRate": 84.5753415659485, "difficulty": "Medium", "likes": 1483, "dislikes": 1013, "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": 154509, "totalSubmissionRaw": 182688}, "886": {"acRate": 50.749938298447475, "difficulty": "Medium", "likes": 4681, "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": 215908, "totalSubmissionRaw": 425435}, "887": {"acRate": 27.989149412443627, "difficulty": "Hard", "likes": 3632, "dislikes": 192, "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": 76147, "totalSubmissionRaw": 272059}, "888": {"acRate": 62.129555007552476, "difficulty": "Easy", "likes": 2113, "dislikes": 382, "categoryTitle": "Algorithms", "frontendQuestionId": "888", "paidOnly": false, "title": "Fair Candy Swap", "titleSlug": "fair-candy-swap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128743, "totalSubmissionRaw": 207217}, "889": {"acRate": 71.6578883066815, "difficulty": "Medium", "likes": 2751, "dislikes": 116, "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": 105575, "totalSubmissionRaw": 147332}, "890": {"acRate": 76.79532492569685, "difficulty": "Medium", "likes": 3925, "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": 191205, "totalSubmissionRaw": 248980}, "891": {"acRate": 38.13948614046426, "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": 21836, "totalSubmissionRaw": 57253}, "892": {"acRate": 66.61647938887745, "difficulty": "Easy", "likes": 572, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "892", "paidOnly": false, "title": "Surface Area of 3D Shapes", "titleSlug": "surface-area-of-3d-shapes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42033, "totalSubmissionRaw": 63097}, "893": {"acRate": 72.0700614450173, "difficulty": "Medium", "likes": 535, "dislikes": 1482, "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": 51022, "totalSubmissionRaw": 70795}, "894": {"acRate": 82.77769276173403, "difficulty": "Medium", "likes": 5082, "dislikes": 355, "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": 189322, "totalSubmissionRaw": 228711}, "895": {"acRate": 66.46583747620544, "difficulty": "Hard", "likes": 4704, "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": 179819, "totalSubmissionRaw": 270544}, "896": {"acRate": 61.332767574998, "difficulty": "Easy", "likes": 3068, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "896", "paidOnly": false, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 452423, "totalSubmissionRaw": 737653}, "897": {"acRate": 78.41219041105771, "difficulty": "Easy", "likes": 4332, "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": 293518, "totalSubmissionRaw": 374327}, "898": {"acRate": 39.45248760614029, "difficulty": "Medium", "likes": 1471, "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": 37960, "totalSubmissionRaw": 96217}, "899": {"acRate": 65.99443224520172, "difficulty": "Hard", "likes": 1759, "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": 71829, "totalSubmissionRaw": 108841}, "900": {"acRate": 59.62971735354492, "difficulty": "Medium", "likes": 748, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "900", "paidOnly": false, "title": "RLE Iterator", "titleSlug": "rle-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75527, "totalSubmissionRaw": 126660}, "901": {"acRate": 66.48656425945349, "difficulty": "Medium", "likes": 6400, "dislikes": 419, "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": 351194, "totalSubmissionRaw": 528218}, "902": {"acRate": 42.63385963106124, "difficulty": "Hard", "likes": 1397, "dislikes": 98, "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": 45553, "totalSubmissionRaw": 106847}, "903": {"acRate": 57.27119980797586, "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": 16702, "totalSubmissionRaw": 29163}, "904": {"acRate": 44.83660292331325, "difficulty": "Medium", "likes": 4712, "dislikes": 352, "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": 435180, "totalSubmissionRaw": 970592}, "905": {"acRate": 76.24695021218515, "difficulty": "Easy", "likes": 5393, "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": 828462, "totalSubmissionRaw": 1086551}, "906": {"acRate": 39.03196461620502, "difficulty": "Hard", "likes": 363, "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": 24886, "totalSubmissionRaw": 63758}, "907": {"acRate": 37.260572027373485, "difficulty": "Medium", "likes": 8155, "dislikes": 635, "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": 279480, "totalSubmissionRaw": 750069}, "908": {"acRate": 70.57246549973117, "difficulty": "Easy", "likes": 716, "dislikes": 2043, "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": 94505, "totalSubmissionRaw": 133912}, "909": {"acRate": 43.87905748184846, "difficulty": "Medium", "likes": 2929, "dislikes": 1050, "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": 202999, "totalSubmissionRaw": 462628}, "910": {"acRate": 36.50437180043103, "difficulty": "Medium", "likes": 1655, "dislikes": 462, "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": 56404, "totalSubmissionRaw": 154513}, "911": {"acRate": 52.13027499683184, "difficulty": "Medium", "likes": 1019, "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": 61704, "totalSubmissionRaw": 118365}, "912": {"acRate": 57.896224248882824, "difficulty": "Medium", "likes": 6495, "dislikes": 798, "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": 786664, "totalSubmissionRaw": 1358750}, "913": {"acRate": 33.823359185090865, "difficulty": "Hard", "likes": 920, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "913", "paidOnly": false, "title": "Cat and Mouse", "titleSlug": "cat-and-mouse", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20454, "totalSubmissionRaw": 60473}, "914": {"acRate": 29.91492215907085, "difficulty": "Easy", "likes": 1821, "dislikes": 519, "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": 127110, "totalSubmissionRaw": 424905}, "915": {"acRate": 48.817784037775496, "difficulty": "Medium", "likes": 1662, "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": 84569, "totalSubmissionRaw": 173234}, "916": {"acRate": 51.85491329738038, "difficulty": "Medium", "likes": 2712, "dislikes": 234, "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": 116057, "totalSubmissionRaw": 223811}, "917": {"acRate": 65.38819565724829, "difficulty": "Easy", "likes": 2263, "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": 232508, "totalSubmissionRaw": 355581}, "918": {"acRate": 45.60447393659763, "difficulty": "Medium", "likes": 6665, "dislikes": 305, "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": 281497, "totalSubmissionRaw": 617260}, "919": {"acRate": 65.93925266000416, "difficulty": "Medium", "likes": 1111, "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": 57139, "totalSubmissionRaw": 86654}, "920": {"acRate": 60.37868937443167, "difficulty": "Hard", "likes": 2367, "dislikes": 198, "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": 71047, "totalSubmissionRaw": 117669}, "921": {"acRate": 74.8527587267873, "difficulty": "Medium", "likes": 4113, "dislikes": 208, "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": 377082, "totalSubmissionRaw": 503765}, "922": {"acRate": 70.85371424602423, "difficulty": "Easy", "likes": 2616, "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": 265226, "totalSubmissionRaw": 374329}, "923": {"acRate": 45.52436852751509, "difficulty": "Medium", "likes": 2618, "dislikes": 318, "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": 105325, "totalSubmissionRaw": 231360}, "924": {"acRate": 42.040916254800855, "difficulty": "Hard", "likes": 1004, "dislikes": 600, "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": 54950, "totalSubmissionRaw": 130706}, "925": {"acRate": 32.296347430437066, "difficulty": "Easy", "likes": 2440, "dislikes": 382, "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": 148777, "totalSubmissionRaw": 460657}, "926": {"acRate": 61.518796944963206, "difficulty": "Medium", "likes": 4438, "dislikes": 179, "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": 194683, "totalSubmissionRaw": 316461}, "927": {"acRate": 40.025407968148365, "difficulty": "Hard", "likes": 834, "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": 30561, "totalSubmissionRaw": 76354}, "928": {"acRate": 44.08316744083167, "difficulty": "Hard", "likes": 673, "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": 23916, "totalSubmissionRaw": 54252}, "929": {"acRate": 67.28994911760917, "difficulty": "Easy", "likes": 2697, "dislikes": 344, "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": 501476, "totalSubmissionRaw": 745247}, "930": {"acRate": 63.671168874509846, "difficulty": "Medium", "likes": 3965, "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": 274736, "totalSubmissionRaw": 431492}, "931": {"acRate": 62.88328690659437, "difficulty": "Medium", "likes": 6396, "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": 472256, "totalSubmissionRaw": 751004}, "932": {"acRate": 66.00115657076768, "difficulty": "Medium", "likes": 1073, "dislikes": 1520, "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": 45653, "totalSubmissionRaw": 69170}, "933": {"acRate": 76.11870874086645, "difficulty": "Easy", "likes": 570, "dislikes": 875, "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": 297835, "totalSubmissionRaw": 391277}, "934": {"acRate": 57.91928036893578, "difficulty": "Medium", "likes": 5406, "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": 213381, "totalSubmissionRaw": 368411}, "935": {"acRate": 60.520069054812254, "difficulty": "Medium", "likes": 3043, "dislikes": 445, "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": 179487, "totalSubmissionRaw": 296575}, "936": {"acRate": 62.53117206982544, "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": 59177, "totalSubmissionRaw": 94636}, "937": {"acRate": 56.51028836620866, "difficulty": "Medium", "likes": 2108, "dislikes": 4387, "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": 371632, "totalSubmissionRaw": 657636}, "938": {"acRate": 87.03320827202491, "difficulty": "Easy", "likes": 6967, "dislikes": 379, "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": 1103734, "totalSubmissionRaw": 1268176}, "939": {"acRate": 54.16931428260199, "difficulty": "Medium", "likes": 1984, "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": 149185, "totalSubmissionRaw": 275405}, "940": {"acRate": 43.17010040286388, "difficulty": "Hard", "likes": 1730, "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": 41363, "totalSubmissionRaw": 95814}, "941": {"acRate": 33.545574825783845, "difficulty": "Easy", "likes": 2950, "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": 440652, "totalSubmissionRaw": 1313593}, "942": {"acRate": 79.16378162450066, "difficulty": "Easy", "likes": 2469, "dislikes": 1026, "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": 163493, "totalSubmissionRaw": 206525}, "943": {"acRate": 44.167366730040825, "difficulty": "Hard", "likes": 1450, "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": 29968, "totalSubmissionRaw": 67851}, "944": {"acRate": 74.65068095591373, "difficulty": "Easy", "likes": 1712, "dislikes": 2881, "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": 194203, "totalSubmissionRaw": 260149}, "945": {"acRate": 60.04256232161747, "difficulty": "Medium", "likes": 2656, "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": 240663, "totalSubmissionRaw": 400821}, "946": {"acRate": 69.56435525767881, "difficulty": "Medium", "likes": 5921, "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": 315738, "totalSubmissionRaw": 453879}, "947": {"acRate": 62.145088539245194, "difficulty": "Medium", "likes": 5873, "dislikes": 684, "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": 304761, "totalSubmissionRaw": 490400}, "948": {"acRate": 59.000862192482586, "difficulty": "Medium", "likes": 3269, "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": 234719, "totalSubmissionRaw": 397823}, "949": {"acRate": 35.391730354693316, "difficulty": "Medium", "likes": 713, "dislikes": 1060, "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": 90302, "totalSubmissionRaw": 255148}, "950": {"acRate": 83.02176907106296, "difficulty": "Medium", "likes": 3481, "dislikes": 661, "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": 201938, "totalSubmissionRaw": 243235}, "951": {"acRate": 67.08270052626003, "difficulty": "Medium", "likes": 2310, "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": 151945, "totalSubmissionRaw": 226504}, "952": {"acRate": 40.92588196896419, "difficulty": "Hard", "likes": 1639, "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": 55173, "totalSubmissionRaw": 134812}, "953": {"acRate": 55.181524611018695, "difficulty": "Easy", "likes": 4898, "dislikes": 1635, "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": 518786, "totalSubmissionRaw": 940142}, "954": {"acRate": 39.19056732325665, "difficulty": "Medium", "likes": 1527, "dislikes": 161, "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": 90308, "totalSubmissionRaw": 230433}, "955": {"acRate": 35.39182354831617, "difficulty": "Medium", "likes": 663, "dislikes": 88, "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": 20924, "totalSubmissionRaw": 59121}, "956": {"acRate": 52.14204408264634, "difficulty": "Hard", "likes": 2374, "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": 60466, "totalSubmissionRaw": 115964}, "957": {"acRate": 39.012721670003955, "difficulty": "Medium", "likes": 1494, "dislikes": 1756, "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": 162684, "totalSubmissionRaw": 417004}, "958": {"acRate": 57.22556966039566, "difficulty": "Medium", "likes": 4298, "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": 245412, "totalSubmissionRaw": 428851}, "959": {"acRate": 77.98405572397196, "difficulty": "Medium", "likes": 3831, "dislikes": 815, "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": 134793, "totalSubmissionRaw": 172848}, "960": {"acRate": 58.42115347767771, "difficulty": "Hard", "likes": 603, "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": 15245, "totalSubmissionRaw": 26095}, "961": {"acRate": 76.97598724529182, "difficulty": "Easy", "likes": 1351, "dislikes": 330, "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": 244301, "totalSubmissionRaw": 317373}, "962": {"acRate": 50.5866645088202, "difficulty": "Medium", "likes": 1692, "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": 50012, "totalSubmissionRaw": 98864}, "963": {"acRate": 55.25428126621692, "difficulty": "Medium", "likes": 383, "dislikes": 463, "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": 29813, "totalSubmissionRaw": 53956}, "964": {"acRate": 48.76174210076857, "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": 10277, "totalSubmissionRaw": 21077}, "965": {"acRate": 71.29317234109376, "difficulty": "Easy", "likes": 1901, "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": 229271, "totalSubmissionRaw": 321589}, "966": {"acRate": 51.38339920948617, "difficulty": "Medium", "likes": 424, "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": 42509, "totalSubmissionRaw": 82730}, "967": {"acRate": 58.24739619021516, "difficulty": "Medium", "likes": 2814, "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": 136010, "totalSubmissionRaw": 233504}, "968": {"acRate": 46.79974651457541, "difficulty": "Hard", "likes": 5364, "dislikes": 78, "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": 146223, "totalSubmissionRaw": 312444}, "969": {"acRate": 70.95843923185039, "difficulty": "Medium", "likes": 1505, "dislikes": 1536, "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": 97438, "totalSubmissionRaw": 137317}, "970": {"acRate": 43.8812251578209, "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": 56304, "totalSubmissionRaw": 128310}, "971": {"acRate": 50.72750935034177, "difficulty": "Medium", "likes": 955, "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": 43266, "totalSubmissionRaw": 85291}, "972": {"acRate": 44.25071225071225, "difficulty": "Hard", "likes": 95, "dislikes": 218, "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": 7766, "totalSubmissionRaw": 17550}, "973": {"acRate": 66.81061473924944, "difficulty": "Medium", "likes": 8445, "dislikes": 310, "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": 1276033, "totalSubmissionRaw": 1909932}, "974": {"acRate": 55.44468719821041, "difficulty": "Medium", "likes": 7236, "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": 361124, "totalSubmissionRaw": 651323}, "975": {"acRate": 40.25637541332608, "difficulty": "Hard", "likes": 2009, "dislikes": 507, "categoryTitle": "Algorithms", "frontendQuestionId": "975", "paidOnly": false, "title": "Odd Even Jump", "titleSlug": "odd-even-jump", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88874, "totalSubmissionRaw": 220770}, "976": {"acRate": 56.3423168535805, "difficulty": "Easy", "likes": 2979, "dislikes": 412, "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": 248131, "totalSubmissionRaw": 440399}, "977": {"acRate": 72.95051422202458, "difficulty": "Easy", "likes": 9373, "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": 1943912, "totalSubmissionRaw": 2664693}, "978": {"acRate": 47.61537872336591, "difficulty": "Medium", "likes": 1986, "dislikes": 235, "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": 105679, "totalSubmissionRaw": 221943}, "979": {"acRate": 77.11839363225018, "difficulty": "Medium", "likes": 5833, "dislikes": 233, "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": 200942, "totalSubmissionRaw": 260563}, "980": {"acRate": 81.95652088652524, "difficulty": "Hard", "likes": 5166, "dislikes": 191, "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": 208967, "totalSubmissionRaw": 254973}, "981": {"acRate": 49.28107368429704, "difficulty": "Medium", "likes": 4813, "dislikes": 596, "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": 479698, "totalSubmissionRaw": 973393}, "982": {"acRate": 58.4314207566305, "difficulty": "Hard", "likes": 443, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "982", "paidOnly": false, "title": "Triples with Bitwise AND Equal To Zero", "titleSlug": "triples-with-bitwise-and-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19013, "totalSubmissionRaw": 32539}, "983": {"acRate": 65.23145970274497, "difficulty": "Medium", "likes": 7911, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "983", "paidOnly": false, "title": "Minimum Cost For Tickets", "titleSlug": "minimum-cost-for-tickets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 307839, "totalSubmissionRaw": 471918}, "984": {"acRate": 44.101318528799446, "difficulty": "Medium", "likes": 816, "dislikes": 369, "categoryTitle": "Algorithms", "frontendQuestionId": "984", "paidOnly": false, "title": "String Without AAA or BBB", "titleSlug": "string-without-aaa-or-bbb", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49569, "totalSubmissionRaw": 112398}, "985": {"acRate": 68.24710149121283, "difficulty": "Medium", "likes": 2085, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "985", "paidOnly": false, "title": "Sum of Even Numbers After Queries", "titleSlug": "sum-of-even-numbers-after-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141509, "totalSubmissionRaw": 207348}, "986": {"acRate": 71.85827695775248, "difficulty": "Medium", "likes": 5575, "dislikes": 114, "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": 431038, "totalSubmissionRaw": 599845}, "987": {"acRate": 48.68505052059398, "difficulty": "Hard", "likes": 7681, "dislikes": 4334, "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": 468246, "totalSubmissionRaw": 961784}, "988": {"acRate": 60.576084339797845, "difficulty": "Medium", "likes": 2293, "dislikes": 330, "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": 193752, "totalSubmissionRaw": 319849}, "989": {"acRate": 45.116641887071715, "difficulty": "Easy", "likes": 3453, "dislikes": 294, "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": 270680, "totalSubmissionRaw": 599956}, "990": {"acRate": 50.63466878222928, "difficulty": "Medium", "likes": 3758, "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": 132756, "totalSubmissionRaw": 262184}, "991": {"acRate": 54.68484889871775, "difficulty": "Medium", "likes": 2712, "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": 104103, "totalSubmissionRaw": 190369}, "992": {"acRate": 64.06162548296999, "difficulty": "Hard", "likes": 6093, "dislikes": 100, "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": 236929, "totalSubmissionRaw": 369844}, "993": {"acRate": 56.63212107807514, "difficulty": "Easy", "likes": 4045, "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": 286775, "totalSubmissionRaw": 506383}, "994": {"acRate": 54.87994661097639, "difficulty": "Medium", "likes": 13024, "dislikes": 410, "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": 953913, "totalSubmissionRaw": 1738182}, "995": {"acRate": 62.72545599698969, "difficulty": "Hard", "likes": 1884, "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": 123354, "totalSubmissionRaw": 196657}, "996": {"acRate": 50.22219494230297, "difficulty": "Hard", "likes": 989, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "996", "paidOnly": false, "title": "Number of Squareful Arrays", "titleSlug": "number-of-squareful-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40911, "totalSubmissionRaw": 81460}, "997": {"acRate": 49.76000676289156, "difficulty": "Easy", "likes": 6648, "dislikes": 603, "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": 612167, "totalSubmissionRaw": 1230241}, "998": {"acRate": 69.74939669574903, "difficulty": "Medium", "likes": 535, "dislikes": 789, "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": 37574, "totalSubmissionRaw": 53870}, "999": {"acRate": 69.43686280805973, "difficulty": "Easy", "likes": 715, "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": 69198, "totalSubmissionRaw": 99656}, "1000": {"acRate": 43.43216759587768, "difficulty": "Hard", "likes": 2482, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1000", "paidOnly": false, "title": "Minimum Cost to Merge Stones", "titleSlug": "minimum-cost-to-merge-stones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41132, "totalSubmissionRaw": 94704}, "1001": {"acRate": 37.2764927472003, "difficulty": "Hard", "likes": 615, "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": 21869, "totalSubmissionRaw": 58667}, "1002": {"acRate": 74.59304129181838, "difficulty": "Easy", "likes": 4268, "dislikes": 412, "categoryTitle": "Algorithms", "frontendQuestionId": "1002", "paidOnly": false, "title": "Find Common Characters", "titleSlug": "find-common-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 365487, "totalSubmissionRaw": 489975}, "1003": {"acRate": 60.055133767172805, "difficulty": "Medium", "likes": 1004, "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": 66444, "totalSubmissionRaw": 110639}, "1004": {"acRate": 63.96058743090016, "difficulty": "Medium", "likes": 8716, "dislikes": 140, "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": 660411, "totalSubmissionRaw": 1032538}, "1005": {"acRate": 51.428098573503036, "difficulty": "Easy", "likes": 1559, "dislikes": 116, "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": 96331, "totalSubmissionRaw": 187312}, "1006": {"acRate": 57.78830578440422, "difficulty": "Medium", "likes": 375, "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": 33178, "totalSubmissionRaw": 57413}, "1007": {"acRate": 52.26550029218389, "difficulty": "Medium", "likes": 2844, "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": 206605, "totalSubmissionRaw": 395299}, "1008": {"acRate": 82.49072648817784, "difficulty": "Medium", "likes": 6200, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1008", "paidOnly": false, "title": "Construct Binary Search Tree from Preorder Traversal", "titleSlug": "construct-binary-search-tree-from-preorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 392283, "totalSubmissionRaw": 475548}, "1009": {"acRate": 60.75060688539061, "difficulty": "Easy", "likes": 2458, "dislikes": 115, "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": 264270, "totalSubmissionRaw": 435008}, "1010": {"acRate": 53.00717838348577, "difficulty": "Medium", "likes": 4214, "dislikes": 173, "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": 282744, "totalSubmissionRaw": 533407}, "1011": {"acRate": 70.29385012040625, "difficulty": "Medium", "likes": 9585, "dislikes": 232, "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": 429679, "totalSubmissionRaw": 611262}, "1012": {"acRate": 42.56801750380518, "difficulty": "Hard", "likes": 778, "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": 17899, "totalSubmissionRaw": 42048}, "1013": {"acRate": 42.01757276691903, "difficulty": "Easy", "likes": 1713, "dislikes": 160, "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": 98177, "totalSubmissionRaw": 233657}, "1014": {"acRate": 59.421024992242145, "difficulty": "Medium", "likes": 2586, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1014", "paidOnly": false, "title": "Best Sightseeing Pair", "titleSlug": "best-sightseeing-pair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 99573, "totalSubmissionRaw": 167572}, "1015": {"acRate": 46.60195591884396, "difficulty": "Medium", "likes": 1144, "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": 63854, "totalSubmissionRaw": 137020}, "1016": {"acRate": 57.45787362823018, "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": 39110, "totalSubmissionRaw": 68068}, "1017": {"acRate": 61.00064697002372, "difficulty": "Medium", "likes": 516, "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": 28286, "totalSubmissionRaw": 46370}, "1018": {"acRate": 46.81275546616492, "difficulty": "Easy", "likes": 734, "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": 57722, "totalSubmissionRaw": 123304}, "1019": {"acRate": 61.22571400006665, "difficulty": "Medium", "likes": 3312, "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": 165348, "totalSubmissionRaw": 270063}, "1020": {"acRate": 69.357548114362, "difficulty": "Medium", "likes": 4093, "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": 249382, "totalSubmissionRaw": 359560}, "1021": {"acRate": 83.75594458374722, "difficulty": "Easy", "likes": 2994, "dislikes": 1615, "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": 365093, "totalSubmissionRaw": 435901}, "1022": {"acRate": 73.15386473754144, "difficulty": "Easy", "likes": 3354, "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": 218019, "totalSubmissionRaw": 298028}, "1023": {"acRate": 62.707973339916066, "difficulty": "Medium", "likes": 909, "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": 50805, "totalSubmissionRaw": 81019}, "1024": {"acRate": 51.50244685234312, "difficulty": "Medium", "likes": 1768, "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": 71249, "totalSubmissionRaw": 138341}, "1025": {"acRate": 69.19676090066947, "difficulty": "Easy", "likes": 2206, "dislikes": 4141, "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": 274215, "totalSubmissionRaw": 396283}, "1026": {"acRate": 78.08691830632965, "difficulty": "Medium", "likes": 4940, "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": 334041, "totalSubmissionRaw": 427781}, "1027": {"acRate": 49.17619709494664, "difficulty": "Medium", "likes": 4698, "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": 181500, "totalSubmissionRaw": 369081}, "1028": {"acRate": 75.10704635210975, "difficulty": "Hard", "likes": 1637, "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": 54201, "totalSubmissionRaw": 72165}, "1029": {"acRate": 66.92876741808792, "difficulty": "Medium", "likes": 4731, "dislikes": 353, "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": 248801, "totalSubmissionRaw": 371740}, "1030": {"acRate": 71.61572556443049, "difficulty": "Easy", "likes": 758, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "1030", "paidOnly": false, "title": "Matrix Cells in Distance Order", "titleSlug": "matrix-cells-in-distance-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62045, "totalSubmissionRaw": 86636}, "1031": {"acRate": 59.87598045254815, "difficulty": "Medium", "likes": 2560, "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": 72902, "totalSubmissionRaw": 121755}, "1032": {"acRate": 52.12221200997882, "difficulty": "Hard", "likes": 1817, "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": 91303, "totalSubmissionRaw": 175171}, "1033": {"acRate": 48.71322160148976, "difficulty": "Medium", "likes": 226, "dislikes": 649, "categoryTitle": "Algorithms", "frontendQuestionId": "1033", "paidOnly": false, "title": "Moving Stones Until Consecutive", "titleSlug": "moving-stones-until-consecutive", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26159, "totalSubmissionRaw": 53700}, "1034": {"acRate": 49.219671957251016, "difficulty": "Medium", "likes": 744, "dislikes": 888, "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": 37120, "totalSubmissionRaw": 75417}, "1035": {"acRate": 63.441039242638375, "difficulty": "Medium", "likes": 3828, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1035", "paidOnly": false, "title": "Uncrossed Lines", "titleSlug": "uncrossed-lines", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163845, "totalSubmissionRaw": 258262}, "1036": {"acRate": 34.82193941455721, "difficulty": "Hard", "likes": 671, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "1036", "paidOnly": false, "title": "Escape a Large Maze", "titleSlug": "escape-a-large-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22519, "totalSubmissionRaw": 64669}, "1037": {"acRate": 37.29407264747921, "difficulty": "Easy", "likes": 421, "dislikes": 529, "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": 55576, "totalSubmissionRaw": 149021}, "1038": {"acRate": 88.24868630308454, "difficulty": "Medium", "likes": 4328, "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": 291878, "totalSubmissionRaw": 330745}, "1039": {"acRate": 59.65152636754356, "difficulty": "Medium", "likes": 1841, "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": 53990, "totalSubmissionRaw": 90509}, "1040": {"acRate": 57.08655210468233, "difficulty": "Medium", "likes": 375, "dislikes": 650, "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": 10863, "totalSubmissionRaw": 19029}, "1041": {"acRate": 55.9012942478643, "difficulty": "Medium", "likes": 3742, "dislikes": 703, "categoryTitle": "Algorithms", "frontendQuestionId": "1041", "paidOnly": false, "title": "Robot Bounded In Circle", "titleSlug": "robot-bounded-in-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241916, "totalSubmissionRaw": 432755}, "1042": {"acRate": 51.59451095620643, "difficulty": "Medium", "likes": 1459, "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": 82528, "totalSubmissionRaw": 159955}, "1043": {"acRate": 76.66284642239798, "difficulty": "Medium", "likes": 4735, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1043", "paidOnly": false, "title": "Partition Array for Maximum Sum", "titleSlug": "partition-array-for-maximum-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 202682, "totalSubmissionRaw": 264381}, "1044": {"acRate": 30.564888017698117, "difficulty": "Hard", "likes": 2234, "dislikes": 387, "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": 70324, "totalSubmissionRaw": 230081}, "1045": {"acRate": 62.23873352281366, "difficulty": "Medium", "likes": 759, "dislikes": 68, "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": 212848, "totalSubmissionRaw": 341985}, "1046": {"acRate": 65.58243254135284, "difficulty": "Easy", "likes": 6052, "dislikes": 127, "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": 659060, "totalSubmissionRaw": 1004936}, "1047": {"acRate": 70.02812119983786, "difficulty": "Easy", "likes": 6628, "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": 608112, "totalSubmissionRaw": 868383}, "1048": {"acRate": 61.340854479947616, "difficulty": "Medium", "likes": 7332, "dislikes": 255, "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": 425296, "totalSubmissionRaw": 693333}, "1049": {"acRate": 56.0134637383435, "difficulty": "Medium", "likes": 3135, "dislikes": 121, "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": 93524, "totalSubmissionRaw": 166967}, "1050": {"acRate": 70.21509681176299, "difficulty": "Easy", "likes": 658, "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": 192923, "totalSubmissionRaw": 274760}, "1051": {"acRate": 80.83918630827726, "difficulty": "Easy", "likes": 1609, "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": 514942, "totalSubmissionRaw": 636995}, "1052": {"acRate": 64.27366369079422, "difficulty": "Medium", "likes": 2451, "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": 198487, "totalSubmissionRaw": 308816}, "1053": {"acRate": 49.691950187689926, "difficulty": "Medium", "likes": 450, "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": 41699, "totalSubmissionRaw": 83915}, "1054": {"acRate": 46.750876168224295, "difficulty": "Medium", "likes": 1270, "dislikes": 51, "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": 44820, "totalSubmissionRaw": 95870}, "1055": {"acRate": 60.3985988488684, "difficulty": "Medium", "likes": 1274, "dislikes": 69, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92763, "totalSubmissionRaw": 153586}, "1056": {"acRate": 48.859850601113244, "difficulty": "Easy", "likes": 316, "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": 47225, "totalSubmissionRaw": 96654}, "1057": {"acRate": 58.65796665534695, "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": 72547, "totalSubmissionRaw": 123678}, "1058": {"acRate": 45.1801224547914, "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": 9519, "totalSubmissionRaw": 21069}, "1059": {"acRate": 37.491879004619285, "difficulty": "Medium", "likes": 712, "dislikes": 391, "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": 62902, "totalSubmissionRaw": 167775}, "1060": {"acRate": 57.402718984044284, "difficulty": "Medium", "likes": 1662, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1060", "paidOnly": true, "title": "Missing Element in Sorted Array", "titleSlug": "missing-element-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141027, "totalSubmissionRaw": 245680}, "1061": {"acRate": 76.68707097541265, "difficulty": "Medium", "likes": 2358, "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": 82559, "totalSubmissionRaw": 107657}, "1062": {"acRate": 62.42552544177674, "difficulty": "Medium", "likes": 706, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1062", "paidOnly": true, "title": "Longest Repeating Substring", "titleSlug": "longest-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49245, "totalSubmissionRaw": 78886}, "1063": {"acRate": 79.1994890355546, "difficulty": "Hard", "likes": 311, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1063", "paidOnly": true, "title": "Number of Valid Subarrays", "titleSlug": "number-of-valid-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14880, "totalSubmissionRaw": 18788}, "1064": {"acRate": 64.13743940690048, "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": 44986, "totalSubmissionRaw": 70140}, "1065": {"acRate": 67.60442289781004, "difficulty": "Easy", "likes": 378, "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": 28308, "totalSubmissionRaw": 41873}, "1066": {"acRate": 55.194582914357845, "difficulty": "Medium", "likes": 937, "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": 51597, "totalSubmissionRaw": 93482}, "1067": {"acRate": 46.34389541325061, "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": 4183, "totalSubmissionRaw": 9026}, "1068": {"acRate": 84.29636579454265, "difficulty": "Easy", "likes": 925, "dislikes": 218, "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": 592977, "totalSubmissionRaw": 703445}, "1069": {"acRate": 81.96850393700788, "difficulty": "Easy", "likes": 80, "dislikes": 181, "categoryTitle": "Database", "frontendQuestionId": "1069", "paidOnly": true, "title": "Product Sales Analysis II", "titleSlug": "product-sales-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55173, "totalSubmissionRaw": 67310}, "1070": {"acRate": 43.52759735036017, "difficulty": "Medium", "likes": 451, "dislikes": 912, "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": 189378, "totalSubmissionRaw": 435077}, "1071": {"acRate": 51.728993792815594, "difficulty": "Easy", "likes": 5221, "dislikes": 1375, "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": 540342, "totalSubmissionRaw": 1044571}, "1072": {"acRate": 64.1609533137447, "difficulty": "Medium", "likes": 746, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1072", "paidOnly": false, "title": "Flip Columns For Maximum Number of Equal Rows", "titleSlug": "flip-columns-for-maximum-number-of-equal-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23583, "totalSubmissionRaw": 36756}, "1073": {"acRate": 37.0491605751466, "difficulty": "Medium", "likes": 321, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1073", "paidOnly": false, "title": "Adding Two Negabinary Numbers", "titleSlug": "adding-two-negabinary-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18449, "totalSubmissionRaw": 49796}, "1074": {"acRate": 74.4328670663241, "difficulty": "Hard", "likes": 3729, "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": 156443, "totalSubmissionRaw": 210180}, "1075": {"acRate": 63.13811829698716, "difficulty": "Easy", "likes": 629, "dislikes": 171, "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": 296232, "totalSubmissionRaw": 469182}, "1076": {"acRate": 50.02760905577029, "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": 58890, "totalSubmissionRaw": 117715}, "1077": {"acRate": 76.6950569950853, "difficulty": "Medium", "likes": 271, "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": 59611, "totalSubmissionRaw": 77725}, "1078": {"acRate": 63.508078031775824, "difficulty": "Easy", "likes": 496, "dislikes": 361, "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": 75788, "totalSubmissionRaw": 119336}, "1079": {"acRate": 76.43827421684638, "difficulty": "Medium", "likes": 2498, "dislikes": 71, "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": 104777, "totalSubmissionRaw": 137074}, "1080": {"acRate": 56.00165150415012, "difficulty": "Medium", "likes": 702, "dislikes": 716, "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": 39335, "totalSubmissionRaw": 70239}, "1081": {"acRate": 61.203911955725154, "difficulty": "Medium", "likes": 2612, "dislikes": 193, "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": 72657, "totalSubmissionRaw": 118712}, "1082": {"acRate": 74.48223846087268, "difficulty": "Easy", "likes": 197, "dislikes": 76, "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": 60239, "totalSubmissionRaw": 80877}, "1083": {"acRate": 49.761024513722354, "difficulty": "Easy", "likes": 272, "dislikes": 47, "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": 59761, "totalSubmissionRaw": 120096}, "1084": {"acRate": 46.665975554050945, "difficulty": "Easy", "likes": 733, "dislikes": 155, "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": 144049, "totalSubmissionRaw": 308681}, "1085": {"acRate": 76.49343733358394, "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": 24419, "totalSubmissionRaw": 31923}, "1086": {"acRate": 74.52425792669214, "difficulty": "Easy", "likes": 800, "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": 106051, "totalSubmissionRaw": 142304}, "1087": {"acRate": 66.45282408961496, "difficulty": "Medium", "likes": 645, "dislikes": 52, "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": 53450, "totalSubmissionRaw": 80433}, "1088": {"acRate": 47.16149528485503, "difficulty": "Hard", "likes": 492, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "1088", "paidOnly": true, "title": "Confusing Number II", "titleSlug": "confusing-number-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37558, "totalSubmissionRaw": 79634}, "1089": {"acRate": 52.127246097915894, "difficulty": "Easy", "likes": 2623, "dislikes": 756, "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": 439906, "totalSubmissionRaw": 843908}, "1090": {"acRate": 62.42911447622609, "difficulty": "Medium", "likes": 454, "dislikes": 629, "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": 40072, "totalSubmissionRaw": 64188}, "1091": {"acRate": 48.03881019013796, "difficulty": "Medium", "likes": 6582, "dislikes": 242, "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": 516846, "totalSubmissionRaw": 1075892}, "1092": {"acRate": 59.53991639705162, "difficulty": "Hard", "likes": 4934, "dislikes": 71, "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": 133604, "totalSubmissionRaw": 224394}, "1093": {"acRate": 42.042213348545346, "difficulty": "Medium", "likes": 157, "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": 20636, "totalSubmissionRaw": 49084}, "1094": {"acRate": 55.97181252846881, "difficulty": "Medium", "likes": 4471, "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": 229785, "totalSubmissionRaw": 410537}, "1095": {"acRate": 40.26996750185783, "difficulty": "Hard", "likes": 3271, "dislikes": 133, "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": 145228, "totalSubmissionRaw": 360636}, "1096": {"acRate": 63.84383630429325, "difficulty": "Hard", "likes": 482, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "1096", "paidOnly": false, "title": "Brace Expansion II", "titleSlug": "brace-expansion-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25429, "totalSubmissionRaw": 39830}, "1097": {"acRate": 51.07626725193095, "difficulty": "Hard", "likes": 186, "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": 24203, "totalSubmissionRaw": 47386}, "1098": {"acRate": 43.2001512477943, "difficulty": "Medium", "likes": 202, "dislikes": 607, "categoryTitle": "Database", "frontendQuestionId": "1098", "paidOnly": true, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41130, "totalSubmissionRaw": 95208}, "1099": {"acRate": 61.851623826381406, "difficulty": "Easy", "likes": 1138, "dislikes": 130, "categoryTitle": "Algorithms", "frontendQuestionId": "1099", "paidOnly": true, "title": "Two Sum Less Than K", "titleSlug": "two-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 136629, "totalSubmissionRaw": 220898}, "1100": {"acRate": 74.7883414295628, "difficulty": "Medium", "likes": 573, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1100", "paidOnly": true, "title": "Find K-Length Substrings With No Repeated Characters", "titleSlug": "find-k-length-substrings-with-no-repeated-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43108, "totalSubmissionRaw": 57640}, "1101": {"acRate": 65.3469745161415, "difficulty": "Medium", "likes": 1044, "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": 101493, "totalSubmissionRaw": 155314}, "1102": {"acRate": 53.766934917451536, "difficulty": "Medium", "likes": 1298, "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": 63538, "totalSubmissionRaw": 118173}, "1103": {"acRate": 65.55357117137878, "difficulty": "Easy", "likes": 983, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1103", "paidOnly": false, "title": "Distribute Candies to People", "titleSlug": "distribute-candies-to-people", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91029, "totalSubmissionRaw": 138862}, "1104": {"acRate": 75.47809247155652, "difficulty": "Medium", "likes": 1494, "dislikes": 318, "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": 46770, "totalSubmissionRaw": 61965}, "1105": {"acRate": 68.82010416869868, "difficulty": "Medium", "likes": 2539, "dislikes": 243, "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": 141117, "totalSubmissionRaw": 205052}, "1106": {"acRate": 59.75886772671676, "difficulty": "Hard", "likes": 1199, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1106", "paidOnly": false, "title": "Parsing A Boolean Expression", "titleSlug": "parsing-a-boolean-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34200, "totalSubmissionRaw": 57230}, "1107": {"acRate": 44.5877808397213, "difficulty": "Medium", "likes": 150, "dislikes": 167, "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": 37052, "totalSubmissionRaw": 83099}, "1108": {"acRate": 89.30928443320842, "difficulty": "Easy", "likes": 2133, "dislikes": 1758, "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": 685689, "totalSubmissionRaw": 767769}, "1109": {"acRate": 62.51618787049703, "difficulty": "Medium", "likes": 1655, "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": 68551, "totalSubmissionRaw": 109652}, "1110": {"acRate": 72.4204076476038, "difficulty": "Medium", "likes": 4572, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "1110", "paidOnly": false, "title": "Delete Nodes And Return Forest", "titleSlug": "delete-nodes-and-return-forest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343939, "totalSubmissionRaw": 474920}, "1111": {"acRate": 72.03880497156531, "difficulty": "Medium", "likes": 441, "dislikes": 1777, "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": 27995, "totalSubmissionRaw": 38861}, "1112": {"acRate": 70.8772594557247, "difficulty": "Medium", "likes": 303, "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": 63601, "totalSubmissionRaw": 89734}, "1113": {"acRate": 64.92521106496186, "difficulty": "Easy", "likes": 113, "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": 47833, "totalSubmissionRaw": 73674}, "1114": {"acRate": 69.8563021068108, "difficulty": "Easy", "likes": 1484, "dislikes": 204, "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": 165816, "totalSubmissionRaw": 237369}, "1115": {"acRate": 66.81574306832252, "difficulty": "Medium", "likes": 686, "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": 89042, "totalSubmissionRaw": 133265}, "1116": {"acRate": 61.445356253000206, "difficulty": "Medium", "likes": 493, "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": 53761, "totalSubmissionRaw": 87494}, "1117": {"acRate": 56.741006387986104, "difficulty": "Medium", "likes": 520, "dislikes": 166, "categoryTitle": "Concurrency", "frontendQuestionId": "1117", "paidOnly": false, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55693, "totalSubmissionRaw": 98153}, "1118": {"acRate": 58.45216576287072, "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": 8731, "totalSubmissionRaw": 14937}, "1119": {"acRate": 91.17342149300029, "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": 111692, "totalSubmissionRaw": 122505}, "1120": {"acRate": 66.66730341264004, "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": 69800, "totalSubmissionRaw": 104699}, "1121": {"acRate": 61.44368388301182, "difficulty": "Hard", "likes": 122, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1121", "paidOnly": true, "title": "Divide Array Into Increasing Sequences", "titleSlug": "divide-array-into-increasing-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4937, "totalSubmissionRaw": 8035}, "1122": {"acRate": 74.80062605504104, "difficulty": "Easy", "likes": 3168, "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": 340755, "totalSubmissionRaw": 455551}, "1123": {"acRate": 72.60671957704945, "difficulty": "Medium", "likes": 1975, "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": 116459, "totalSubmissionRaw": 160397}, "1124": {"acRate": 35.34783998020884, "difficulty": "Medium", "likes": 1435, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "1124", "paidOnly": false, "title": "Longest Well-Performing Interval", "titleSlug": "longest-well-performing-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34292, "totalSubmissionRaw": 97013}, "1125": {"acRate": 55.49357368525262, "difficulty": "Hard", "likes": 2182, "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": 64463, "totalSubmissionRaw": 116163}, "1126": {"acRate": 65.70448496235251, "difficulty": "Medium", "likes": 273, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1126", "paidOnly": true, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46162, "totalSubmissionRaw": 70257}, "1127": {"acRate": 47.00320046552226, "difficulty": "Hard", "likes": 182, "dislikes": 134, "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": 16155, "totalSubmissionRaw": 34370}, "1128": {"acRate": 48.53921621768117, "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": 71640, "totalSubmissionRaw": 147592}, "1129": {"acRate": 47.09324508467977, "difficulty": "Medium", "likes": 3507, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "1129", "paidOnly": false, "title": "Shortest Path with Alternating Colors", "titleSlug": "shortest-path-with-alternating-colors", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120959, "totalSubmissionRaw": 256850}, "1130": {"acRate": 67.73356175132082, "difficulty": "Medium", "likes": 4287, "dislikes": 277, "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": 103589, "totalSubmissionRaw": 152936}, "1131": {"acRate": 48.50851043369555, "difficulty": "Medium", "likes": 648, "dislikes": 407, "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": 25222, "totalSubmissionRaw": 51995}, "1132": {"acRate": 32.24078924247115, "difficulty": "Medium", "likes": 156, "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": 38530, "totalSubmissionRaw": 119507}, "1133": {"acRate": 69.23933930250624, "difficulty": "Easy", "likes": 319, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1133", "paidOnly": true, "title": "Largest Unique Number", "titleSlug": "largest-unique-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67739, "totalSubmissionRaw": 97834}, "1134": {"acRate": 77.79223730143976, "difficulty": "Easy", "likes": 208, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1134", "paidOnly": true, "title": "Armstrong Number", "titleSlug": "armstrong-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37660, "totalSubmissionRaw": 48411}, "1135": {"acRate": 62.13474788920039, "difficulty": "Medium", "likes": 1122, "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": 76020, "totalSubmissionRaw": 122347}, "1136": {"acRate": 61.52264365049345, "difficulty": "Medium", "likes": 1170, "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": 89457, "totalSubmissionRaw": 145405}, "1137": {"acRate": 63.77468519920182, "difficulty": "Easy", "likes": 4458, "dislikes": 194, "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": 815607, "totalSubmissionRaw": 1278888}, "1138": {"acRate": 51.68260019454297, "difficulty": "Medium", "likes": 908, "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": 52601, "totalSubmissionRaw": 101777}, "1139": {"acRate": 50.34054409659069, "difficulty": "Medium", "likes": 712, "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": 26017, "totalSubmissionRaw": 51682}, "1140": {"acRate": 73.27398309020093, "difficulty": "Medium", "likes": 3301, "dislikes": 888, "categoryTitle": "Algorithms", "frontendQuestionId": "1140", "paidOnly": false, "title": "Stone Game II", "titleSlug": "stone-game-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 175149, "totalSubmissionRaw": 239033}, "1141": {"acRate": 48.882491785069654, "difficulty": "Easy", "likes": 700, "dislikes": 815, "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": 264048, "totalSubmissionRaw": 540170}, "1142": {"acRate": 35.74008705454486, "difficulty": "Easy", "likes": 99, "dislikes": 370, "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": 43436, "totalSubmissionRaw": 121533}, "1143": {"acRate": 57.74200471374352, "difficulty": "Medium", "likes": 13641, "dislikes": 199, "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": 1194590, "totalSubmissionRaw": 2068841}, "1144": {"acRate": 48.10169568268773, "difficulty": "Medium", "likes": 436, "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": 21247, "totalSubmissionRaw": 44171}, "1145": {"acRate": 52.15318923570885, "difficulty": "Medium", "likes": 1356, "dislikes": 215, "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": 47268, "totalSubmissionRaw": 90633}, "1146": {"acRate": 36.8759432289562, "difficulty": "Medium", "likes": 3721, "dislikes": 504, "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": 223577, "totalSubmissionRaw": 606295}, "1147": {"acRate": 58.746566093960986, "difficulty": "Hard", "likes": 674, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1147", "paidOnly": false, "title": "Longest Chunked Palindrome Decomposition", "titleSlug": "longest-chunked-palindrome-decomposition", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25234, "totalSubmissionRaw": 42954}, "1148": {"acRate": 76.33793779627426, "difficulty": "Easy", "likes": 1518, "dislikes": 89, "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": 763777, "totalSubmissionRaw": 1000525}, "1149": {"acRate": 47.075667637552385, "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": 38305, "totalSubmissionRaw": 81369}, "1150": {"acRate": 58.96839180270928, "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": 50931, "totalSubmissionRaw": 86370}, "1151": {"acRate": 60.2730133480877, "difficulty": "Medium", "likes": 1213, "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": 69719, "totalSubmissionRaw": 115672}, "1152": {"acRate": 42.76249740717694, "difficulty": "Medium", "likes": 495, "dislikes": 3757, "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": 103080, "totalSubmissionRaw": 241051}, "1153": {"acRate": 34.93297105068628, "difficulty": "Hard", "likes": 880, "dislikes": 337, "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": 52455, "totalSubmissionRaw": 150159}, "1154": {"acRate": 48.89831408670845, "difficulty": "Easy", "likes": 457, "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": 64447, "totalSubmissionRaw": 131798}, "1155": {"acRate": 61.1101458814103, "difficulty": "Medium", "likes": 5070, "dislikes": 173, "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": 298971, "totalSubmissionRaw": 489233}, "1156": {"acRate": 44.03559339961921, "difficulty": "Medium", "likes": 1022, "dislikes": 98, "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": 33305, "totalSubmissionRaw": 75632}, "1157": {"acRate": 41.91112401975022, "difficulty": "Hard", "likes": 633, "dislikes": 62, "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": 17316, "totalSubmissionRaw": 41316}, "1158": {"acRate": 57.15440707744454, "difficulty": "Medium", "likes": 650, "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": 110280, "totalSubmissionRaw": 192951}, "1159": {"acRate": 57.193392778833505, "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": 19563, "totalSubmissionRaw": 34205}, "1160": {"acRate": 70.6889043949068, "difficulty": "Easy", "likes": 2119, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1160", "paidOnly": false, "title": "Find Words That Can Be Formed by Characters", "titleSlug": "find-words-that-can-be-formed-by-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 269474, "totalSubmissionRaw": 381212}, "1161": {"acRate": 67.17610058723034, "difficulty": "Medium", "likes": 3549, "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": 303947, "totalSubmissionRaw": 452463}, "1162": {"acRate": 51.637381494555115, "difficulty": "Medium", "likes": 4141, "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": 158282, "totalSubmissionRaw": 306526}, "1163": {"acRate": 34.54518750611965, "difficulty": "Hard", "likes": 595, "dislikes": 450, "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": 35281, "totalSubmissionRaw": 102129}, "1164": {"acRate": 56.437297653709095, "difficulty": "Medium", "likes": 926, "dislikes": 255, "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": 152350, "totalSubmissionRaw": 269949}, "1165": {"acRate": 87.557719585928, "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": 87035, "totalSubmissionRaw": 99403}, "1166": {"acRate": 63.17520009652898, "difficulty": "Medium", "likes": 578, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1166", "paidOnly": true, "title": "Design File System", "titleSlug": "design-file-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62828, "totalSubmissionRaw": 99451}, "1167": {"acRate": 70.25530828002843, "difficulty": "Medium", "likes": 1315, "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": 126527, "totalSubmissionRaw": 180096}, "1168": {"acRate": 64.89049476279301, "difficulty": "Hard", "likes": 1161, "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": 49747, "totalSubmissionRaw": 76663}, "1169": {"acRate": 31.098519870715887, "difficulty": "Medium", "likes": 550, "dislikes": 2327, "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": 78706, "totalSubmissionRaw": 253086}, "1170": {"acRate": 62.45290156616478, "difficulty": "Medium", "likes": 712, "dislikes": 974, "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": 82544, "totalSubmissionRaw": 132170}, "1171": {"acRate": 52.745348556145366, "difficulty": "Medium", "likes": 3315, "dislikes": 216, "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": 168023, "totalSubmissionRaw": 318556}, "1172": {"acRate": 32.736308106429234, "difficulty": "Hard", "likes": 483, "dislikes": 65, "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": 18972, "totalSubmissionRaw": 57954}, "1173": {"acRate": 80.92128745092275, "difficulty": "Easy", "likes": 292, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1173", "paidOnly": true, "title": "Immediate Food Delivery I", "titleSlug": "immediate-food-delivery-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77080, "totalSubmissionRaw": 95223}, "1174": {"acRate": 52.19633764926266, "difficulty": "Medium", "likes": 756, "dislikes": 132, "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": 189752, "totalSubmissionRaw": 363535}, "1175": {"acRate": 57.92161436245406, "difficulty": "Easy", "likes": 411, "dislikes": 524, "categoryTitle": "Algorithms", "frontendQuestionId": "1175", "paidOnly": false, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32779, "totalSubmissionRaw": 56592}, "1176": {"acRate": 53.54396576686722, "difficulty": "Easy", "likes": 155, "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": 33284, "totalSubmissionRaw": 62162}, "1177": {"acRate": 39.391546995167765, "difficulty": "Medium", "likes": 808, "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": 28939, "totalSubmissionRaw": 73465}, "1178": {"acRate": 46.80781613970534, "difficulty": "Hard", "likes": 1271, "dislikes": 88, "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": 31548, "totalSubmissionRaw": 67399}, "1179": {"acRate": 76.95174688112498, "difficulty": "Easy", "likes": 743, "dislikes": 606, "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": 123673, "totalSubmissionRaw": 160715}, "1180": {"acRate": 80.0497327578815, "difficulty": "Easy", "likes": 356, "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": 28007, "totalSubmissionRaw": 34987}, "1181": {"acRate": 46.02275409526507, "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": 9749, "totalSubmissionRaw": 21183}, "1182": {"acRate": 55.4353331184677, "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": 36120, "totalSubmissionRaw": 65157}, "1183": {"acRate": 68.26011483509147, "difficulty": "Hard", "likes": 164, "dislikes": 29, "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": 5112, "totalSubmissionRaw": 7489}, "1184": {"acRate": 54.15977534284336, "difficulty": "Easy", "likes": 761, "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": 62873, "totalSubmissionRaw": 116088}, "1185": {"acRate": 57.76197815674771, "difficulty": "Easy", "likes": 405, "dislikes": 2453, "categoryTitle": "Algorithms", "frontendQuestionId": "1185", "paidOnly": false, "title": "Day of the Week", "titleSlug": "day-of-the-week", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69706, "totalSubmissionRaw": 120678}, "1186": {"acRate": 44.22723016821102, "difficulty": "Medium", "likes": 1830, "dislikes": 68, "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": 54794, "totalSubmissionRaw": 123892}, "1187": {"acRate": 58.147276362311274, "difficulty": "Hard", "likes": 2244, "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": 59041, "totalSubmissionRaw": 101537}, "1188": {"acRate": 72.46694803924308, "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": 51853, "totalSubmissionRaw": 71554}, "1189": {"acRate": 59.70203459045897, "difficulty": "Easy", "likes": 1717, "dislikes": 107, "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": 221925, "totalSubmissionRaw": 371721}, "1190": {"acRate": 71.72836679965988, "difficulty": "Medium", "likes": 2817, "dislikes": 118, "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": 219331, "totalSubmissionRaw": 305780}, "1191": {"acRate": 23.897375816971955, "difficulty": "Medium", "likes": 1449, "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": 36308, "totalSubmissionRaw": 151933}, "1192": {"acRate": 56.481183957760706, "difficulty": "Hard", "likes": 6236, "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": 244328, "totalSubmissionRaw": 432583}, "1193": {"acRate": 58.12395920066611, "difficulty": "Medium", "likes": 850, "dislikes": 85, "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": 223381, "totalSubmissionRaw": 384319}, "1194": {"acRate": 49.20726367700603, "difficulty": "Hard", "likes": 150, "dislikes": 55, "categoryTitle": "Database", "frontendQuestionId": "1194", "paidOnly": true, "title": "Tournament Winners", "titleSlug": "tournament-winners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21353, "totalSubmissionRaw": 43394}, "1195": {"acRate": 72.90925518098142, "difficulty": "Medium", "likes": 609, "dislikes": 411, "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": 51646, "totalSubmissionRaw": 70836}, "1196": {"acRate": 67.01749959449961, "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": 37186, "totalSubmissionRaw": 55487}, "1197": {"acRate": 40.69743293621849, "difficulty": "Medium", "likes": 1514, "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": 160693, "totalSubmissionRaw": 394848}, "1198": {"acRate": 76.47580038451893, "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": 45744, "totalSubmissionRaw": 59815}, "1199": {"acRate": 45.78304944486587, "difficulty": "Hard", "likes": 235, "dislikes": 31, "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": 6639, "totalSubmissionRaw": 14501}, "1200": {"acRate": 69.74008047832628, "difficulty": "Easy", "likes": 2358, "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": 202604, "totalSubmissionRaw": 290513}, "1201": {"acRate": 29.84747737566471, "difficulty": "Medium", "likes": 1241, "dislikes": 501, "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": 34070, "totalSubmissionRaw": 114147}, "1202": {"acRate": 58.58640467495958, "difficulty": "Medium", "likes": 3703, "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": 119204, "totalSubmissionRaw": 203467}, "1203": {"acRate": 66.22135357700421, "difficulty": "Hard", "likes": 1776, "dislikes": 303, "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": 55567, "totalSubmissionRaw": 83911}, "1204": {"acRate": 67.51770112666038, "difficulty": "Medium", "likes": 735, "dislikes": 34, "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": 149998, "totalSubmissionRaw": 222161}, "1205": {"acRate": 41.709776413853575, "difficulty": "Medium", "likes": 157, "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": 23785, "totalSubmissionRaw": 57025}, "1206": {"acRate": 61.7885363100464, "difficulty": "Hard", "likes": 668, "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": 24632, "totalSubmissionRaw": 39865}, "1207": {"acRate": 77.45341810399094, "difficulty": "Easy", "likes": 5106, "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": 689031, "totalSubmissionRaw": 889608}, "1208": {"acRate": 58.35340517441922, "difficulty": "Medium", "likes": 1795, "dislikes": 138, "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": 163047, "totalSubmissionRaw": 279413}, "1209": {"acRate": 58.245341587566536, "difficulty": "Medium", "likes": 5793, "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": 330803, "totalSubmissionRaw": 567949}, "1210": {"acRate": 50.03992414412616, "difficulty": "Hard", "likes": 270, "dislikes": 73, "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": 10027, "totalSubmissionRaw": 20038}, "1211": {"acRate": 44.83775276189094, "difficulty": "Easy", "likes": 652, "dislikes": 429, "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": 222487, "totalSubmissionRaw": 496203}, "1212": {"acRate": 55.40194711115324, "difficulty": "Medium", "likes": 311, "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": 40916, "totalSubmissionRaw": 73853}, "1213": {"acRate": 79.8116048541775, "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": 89049, "totalSubmissionRaw": 111574}, "1214": {"acRate": 67.23547655169637, "difficulty": "Medium", "likes": 550, "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": 50079, "totalSubmissionRaw": 74483}, "1215": {"acRate": 47.37638502464978, "difficulty": "Medium", "likes": 183, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1215", "paidOnly": true, "title": "Stepping Numbers", "titleSlug": "stepping-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9706, "totalSubmissionRaw": 20487}, "1216": {"acRate": 49.2382430335335, "difficulty": "Hard", "likes": 771, "dislikes": 14, "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": 72976, "totalSubmissionRaw": 148209}, "1217": {"acRate": 71.81479362397266, "difficulty": "Easy", "likes": 2308, "dislikes": 317, "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": 134303, "totalSubmissionRaw": 187013}, "1218": {"acRate": 54.64015361323437, "difficulty": "Medium", "likes": 3223, "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": 147971, "totalSubmissionRaw": 270810}, "1219": {"acRate": 68.02908718442349, "difficulty": "Medium", "likes": 3297, "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": 220502, "totalSubmissionRaw": 324129}, "1220": {"acRate": 61.78521465816391, "difficulty": "Hard", "likes": 3254, "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": 170036, "totalSubmissionRaw": 275205}, "1221": {"acRate": 86.38037638037638, "difficulty": "Easy", "likes": 2755, "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": 319927, "totalSubmissionRaw": 370370}, "1222": {"acRate": 71.99207817077762, "difficulty": "Medium", "likes": 948, "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": 43985, "totalSubmissionRaw": 61097}, "1223": {"acRate": 49.44198576101597, "difficulty": "Hard", "likes": 934, "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": 30834, "totalSubmissionRaw": 62364}, "1224": {"acRate": 37.397260273972606, "difficulty": "Hard", "likes": 541, "dislikes": 67, "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": 15834, "totalSubmissionRaw": 42340}, "1225": {"acRate": 57.36053719008265, "difficulty": "Hard", "likes": 323, "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": 24431, "totalSubmissionRaw": 42592}, "1226": {"acRate": 54.13853652629348, "difficulty": "Medium", "likes": 354, "dislikes": 333, "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": 35763, "totalSubmissionRaw": 66060}, "1227": {"acRate": 66.55825089217147, "difficulty": "Medium", "likes": 618, "dislikes": 973, "categoryTitle": "Algorithms", "frontendQuestionId": "1227", "paidOnly": false, "title": "Airplane Seat Assignment Probability", "titleSlug": "airplane-seat-assignment-probability", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44202, "totalSubmissionRaw": 66411}, "1228": {"acRate": 51.97323171298448, "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": 27959, "totalSubmissionRaw": 53795}, "1229": {"acRate": 54.99402058577522, "difficulty": "Medium", "likes": 885, "dislikes": 34, "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": 79556, "totalSubmissionRaw": 144663}, "1230": {"acRate": 58.21855918512636, "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": 21262, "totalSubmissionRaw": 36521}, "1231": {"acRate": 58.90985106914053, "difficulty": "Hard", "likes": 990, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1231", "paidOnly": true, "title": "Divide Chocolate", "titleSlug": "divide-chocolate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56643, "totalSubmissionRaw": 96152}, "1232": {"acRate": 39.5070288597328, "difficulty": "Easy", "likes": 2605, "dislikes": 279, "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": 263807, "totalSubmissionRaw": 667747}, "1233": {"acRate": 66.06693142192948, "difficulty": "Medium", "likes": 814, "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": 54566, "totalSubmissionRaw": 82592}, "1234": {"acRate": 38.611293464340676, "difficulty": "Medium", "likes": 1196, "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": 35878, "totalSubmissionRaw": 92921}, "1235": {"acRate": 54.30484553440454, "difficulty": "Hard", "likes": 6831, "dislikes": 109, "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": 320590, "totalSubmissionRaw": 590353}, "1236": {"acRate": 67.99930681916645, "difficulty": "Medium", "likes": 288, "dislikes": 327, "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": 39239, "totalSubmissionRaw": 57705}, "1237": {"acRate": 69.66317933154973, "difficulty": "Medium", "likes": 518, "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": 69783, "totalSubmissionRaw": 100172}, "1238": {"acRate": 70.52238805970148, "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": 18900, "totalSubmissionRaw": 26800}, "1239": {"acRate": 54.12333030255989, "difficulty": "Medium", "likes": 4428, "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": 292870, "totalSubmissionRaw": 541116}, "1240": {"acRate": 54.382586106507816, "difficulty": "Hard", "likes": 688, "dislikes": 569, "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": 24284, "totalSubmissionRaw": 44654}, "1241": {"acRate": 65.95051846461706, "difficulty": "Easy", "likes": 178, "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": 36253, "totalSubmissionRaw": 54970}, "1242": {"acRate": 49.4313718793757, "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": 57892, "totalSubmissionRaw": 117114}, "1243": {"acRate": 52.447632058287795, "difficulty": "Easy", "likes": 153, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1243", "paidOnly": true, "title": "Array Transformation", "titleSlug": "array-transformation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13821, "totalSubmissionRaw": 26352}, "1244": {"acRate": 67.91694032334973, "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": 75488, "totalSubmissionRaw": 111148}, "1245": {"acRate": 61.20429764798067, "difficulty": "Medium", "likes": 855, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1245", "paidOnly": true, "title": "Tree Diameter", "titleSlug": "tree-diameter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46085, "totalSubmissionRaw": 75297}, "1246": {"acRate": 46.31534391534392, "difficulty": "Hard", "likes": 310, "dislikes": 14, "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": 10942, "totalSubmissionRaw": 23625}, "1247": {"acRate": 64.44296507307406, "difficulty": "Medium", "likes": 1387, "dislikes": 243, "categoryTitle": "Algorithms", "frontendQuestionId": "1247", "paidOnly": false, "title": "Minimum Swaps to Make Strings Equal", "titleSlug": "minimum-swaps-to-make-strings-equal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41625, "totalSubmissionRaw": 64592}, "1248": {"acRate": 71.44745953149292, "difficulty": "Medium", "likes": 4595, "dislikes": 117, "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": 273427, "totalSubmissionRaw": 382699}, "1249": {"acRate": 69.22526616253215, "difficulty": "Medium", "likes": 6907, "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": 770246, "totalSubmissionRaw": 1112665}, "1250": {"acRate": 59.907700485659745, "difficulty": "Hard", "likes": 515, "dislikes": 379, "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": 24794, "totalSubmissionRaw": 41387}, "1251": {"acRate": 37.449145857982025, "difficulty": "Easy", "likes": 1230, "dislikes": 173, "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": 288670, "totalSubmissionRaw": 770833}, "1252": {"acRate": 78.81189698851661, "difficulty": "Easy", "likes": 1225, "dislikes": 1525, "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": 118526, "totalSubmissionRaw": 150391}, "1253": {"acRate": 46.827394573389995, "difficulty": "Medium", "likes": 464, "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": 28649, "totalSubmissionRaw": 61180}, "1254": {"acRate": 66.43584661192199, "difficulty": "Medium", "likes": 4555, "dislikes": 167, "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": 232269, "totalSubmissionRaw": 349615}, "1255": {"acRate": 82.02709715423778, "difficulty": "Hard", "likes": 1748, "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": 116967, "totalSubmissionRaw": 142596}, "1256": {"acRate": 69.88304093567251, "difficulty": "Medium", "likes": 78, "dislikes": 254, "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": 7887, "totalSubmissionRaw": 11286}, "1257": {"acRate": 66.1053887865501, "difficulty": "Medium", "likes": 438, "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": 25479, "totalSubmissionRaw": 38543}, "1258": {"acRate": 56.44804716285925, "difficulty": "Medium", "likes": 356, "dislikes": 163, "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": 23746, "totalSubmissionRaw": 42067}, "1259": {"acRate": 59.61452039746342, "difficulty": "Hard", "likes": 234, "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": 11939, "totalSubmissionRaw": 20027}, "1260": {"acRate": 67.44075331243546, "difficulty": "Easy", "likes": 1732, "dislikes": 343, "categoryTitle": "Algorithms", "frontendQuestionId": "1260", "paidOnly": false, "title": "Shift 2D Grid", "titleSlug": "shift-2d-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109078, "totalSubmissionRaw": 161739}, "1261": {"acRate": 77.5494602233239, "difficulty": "Medium", "likes": 994, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1261", "paidOnly": false, "title": "Find Elements in a Contaminated Binary Tree", "titleSlug": "find-elements-in-a-contaminated-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66950, "totalSubmissionRaw": 86332}, "1262": {"acRate": 50.59493470657503, "difficulty": "Medium", "likes": 1819, "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": 57574, "totalSubmissionRaw": 113794}, "1263": {"acRate": 49.10967254494565, "difficulty": "Hard", "likes": 850, "dislikes": 58, "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": 28600, "totalSubmissionRaw": 58237}, "1264": {"acRate": 65.22709021147497, "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": 43860, "totalSubmissionRaw": 67242}, "1265": {"acRate": 94.05852840162702, "difficulty": "Medium", "likes": 579, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1265", "paidOnly": true, "title": "Print Immutable Linked List in Reverse", "titleSlug": "print-immutable-linked-list-in-reverse", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59429, "totalSubmissionRaw": 63183}, "1266": {"acRate": 82.468064056518, "difficulty": "Easy", "likes": 2205, "dislikes": 230, "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": 236732, "totalSubmissionRaw": 287059}, "1267": {"acRate": 60.660821320651905, "difficulty": "Medium", "likes": 1304, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1267", "paidOnly": false, "title": "Count Servers that Communicate", "titleSlug": "count-servers-that-communicate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61228, "totalSubmissionRaw": 100935}, "1268": {"acRate": 65.10091326203165, "difficulty": "Medium", "likes": 4747, "dislikes": 243, "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": 326623, "totalSubmissionRaw": 501718}, "1269": {"acRate": 50.26679746030377, "difficulty": "Hard", "likes": 1550, "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": 93262, "totalSubmissionRaw": 185534}, "1270": {"acRate": 84.68743485123746, "difficulty": "Medium", "likes": 423, "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": 56871, "totalSubmissionRaw": 67154}, "1271": {"acRate": 58.15095111474739, "difficulty": "Easy", "likes": 78, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1271", "paidOnly": true, "title": "Hexspeak", "titleSlug": "hexspeak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11372, "totalSubmissionRaw": 19556}, "1272": {"acRate": 66.27879999286135, "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": 37138, "totalSubmissionRaw": 56033}, "1273": {"acRate": 61.23021204509609, "difficulty": "Medium", "likes": 226, "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": 10482, "totalSubmissionRaw": 17119}, "1274": {"acRate": 68.66682232080318, "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": 29410, "totalSubmissionRaw": 42830}, "1275": {"acRate": 53.95178454485921, "difficulty": "Easy", "likes": 1498, "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": 131815, "totalSubmissionRaw": 244320}, "1276": {"acRate": 51.18871853113761, "difficulty": "Medium", "likes": 331, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "1276", "paidOnly": false, "title": "Number of Burgers with No Waste of Ingredients", "titleSlug": "number-of-burgers-with-no-waste-of-ingredients", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27043, "totalSubmissionRaw": 52830}, "1277": {"acRate": 75.51630918656414, "difficulty": "Medium", "likes": 4883, "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": 233251, "totalSubmissionRaw": 308875}, "1278": {"acRate": 61.1703867222631, "difficulty": "Hard", "likes": 1149, "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": 29927, "totalSubmissionRaw": 48924}, "1279": {"acRate": 72.83205540440267, "difficulty": "Easy", "likes": 75, "dislikes": 354, "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": 14723, "totalSubmissionRaw": 20215}, "1280": {"acRate": 58.57819479674067, "difficulty": "Easy", "likes": 1828, "dislikes": 248, "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": 313148, "totalSubmissionRaw": 534583}, "1281": {"acRate": 86.5821298579312, "difficulty": "Easy", "likes": 2580, "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": 516194, "totalSubmissionRaw": 596190}, "1282": {"acRate": 87.4264392756474, "difficulty": "Medium", "likes": 3003, "dislikes": 712, "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": 215563, "totalSubmissionRaw": 246565}, "1283": {"acRate": 61.2231758439363, "difficulty": "Medium", "likes": 2953, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "1283", "paidOnly": false, "title": "Find the Smallest Divisor Given a Threshold", "titleSlug": "find-the-smallest-divisor-given-a-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 215857, "totalSubmissionRaw": 352574}, "1284": {"acRate": 72.18763235916984, "difficulty": "Hard", "likes": 971, "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": 34087, "totalSubmissionRaw": 47220}, "1285": {"acRate": 82.09249000629045, "difficulty": "Medium", "likes": 562, "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": 40456, "totalSubmissionRaw": 49281}, "1286": {"acRate": 73.32112692693875, "difficulty": "Medium", "likes": 1364, "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": 74484, "totalSubmissionRaw": 101586}, "1287": {"acRate": 60.998413683702324, "difficulty": "Easy", "likes": 1709, "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": 221104, "totalSubmissionRaw": 362475}, "1288": {"acRate": 56.275457259233185, "difficulty": "Medium", "likes": 2231, "dislikes": 59, "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": 123102, "totalSubmissionRaw": 218749}, "1289": {"acRate": 64.30079483358172, "difficulty": "Hard", "likes": 2261, "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": 144970, "totalSubmissionRaw": 225456}, "1290": {"acRate": 81.13659169338456, "difficulty": "Easy", "likes": 4168, "dislikes": 160, "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": 497274, "totalSubmissionRaw": 612885}, "1291": {"acRate": 65.2849587763874, "difficulty": "Medium", "likes": 2863, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "1291", "paidOnly": false, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [{"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220844, "totalSubmissionRaw": 338277}, "1292": {"acRate": 53.68960671988635, "difficulty": "Medium", "likes": 1088, "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": 34771, "totalSubmissionRaw": 64763}, "1293": {"acRate": 45.31235988797294, "difficulty": "Hard", "likes": 4534, "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": 217285, "totalSubmissionRaw": 479527}, "1294": {"acRate": 66.77096885756163, "difficulty": "Easy", "likes": 141, "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": 40544, "totalSubmissionRaw": 60721}, "1295": {"acRate": 77.43691096162493, "difficulty": "Easy", "likes": 2396, "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"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 709573, "totalSubmissionRaw": 916325}, "1296": {"acRate": 58.51366925835572, "difficulty": "Medium", "likes": 1868, "dislikes": 114, "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": 100018, "totalSubmissionRaw": 170931}, "1297": {"acRate": 52.183518668532294, "difficulty": "Medium", "likes": 1095, "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": 56688, "totalSubmissionRaw": 108632}, "1298": {"acRate": 57.77346905800614, "difficulty": "Hard", "likes": 345, "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": 17877, "totalSubmissionRaw": 30944}, "1299": {"acRate": 71.29042001372285, "difficulty": "Easy", "likes": 2604, "dislikes": 246, "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": 408328, "totalSubmissionRaw": 572767}, "1300": {"acRate": 44.71510962500842, "difficulty": "Medium", "likes": 1148, "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": 39851, "totalSubmissionRaw": 89122}, "1301": {"acRate": 39.811189782035264, "difficulty": "Hard", "likes": 515, "dislikes": 26, "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": 14338, "totalSubmissionRaw": 36015}, "1302": {"acRate": 86.31948552083465, "difficulty": "Medium", "likes": 4707, "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": 342940, "totalSubmissionRaw": 397290}, "1303": {"acRate": 89.57012332118428, "difficulty": "Easy", "likes": 335, "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": 71760, "totalSubmissionRaw": 80116}, "1304": {"acRate": 76.16163384587415, "difficulty": "Easy", "likes": 1997, "dislikes": 599, "categoryTitle": "Algorithms", "frontendQuestionId": "1304", "paidOnly": false, "title": "Find N Unique Integers Sum up to Zero", "titleSlug": "find-n-unique-integers-sum-up-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 226208, "totalSubmissionRaw": 297011}, "1305": {"acRate": 79.84937250458424, "difficulty": "Medium", "likes": 3074, "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": 223389, "totalSubmissionRaw": 279763}, "1306": {"acRate": 65.23428232502965, "difficulty": "Medium", "likes": 4163, "dislikes": 105, "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": 241967, "totalSubmissionRaw": 370920}, "1307": {"acRate": 34.66782081800476, "difficulty": "Hard", "likes": 504, "dislikes": 130, "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": 14418, "totalSubmissionRaw": 41589}, "1308": {"acRate": 86.38358660096891, "difficulty": "Medium", "likes": 216, "dislikes": 63, "categoryTitle": "Database", "frontendQuestionId": "1308", "paidOnly": true, "title": "Running Total for Different Genders", "titleSlug": "running-total-for-different-genders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41725, "totalSubmissionRaw": 48302}, "1309": {"acRate": 79.85548256069546, "difficulty": "Easy", "likes": 1542, "dislikes": 111, "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": 128969, "totalSubmissionRaw": 161503}, "1310": {"acRate": 73.25497634883665, "difficulty": "Medium", "likes": 1500, "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": 61017, "totalSubmissionRaw": 83294}, "1311": {"acRate": 47.776865977843265, "difficulty": "Medium", "likes": 408, "dislikes": 425, "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": 25615, "totalSubmissionRaw": 53615}, "1312": {"acRate": 71.2597440882444, "difficulty": "Hard", "likes": 5089, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1312", "paidOnly": false, "title": "Minimum Insertion Steps to Make a String Palindrome", "titleSlug": "minimum-insertion-steps-to-make-a-string-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190964, "totalSubmissionRaw": 267983}, "1313": {"acRate": 85.82455372495076, "difficulty": "Easy", "likes": 1273, "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": 274527, "totalSubmissionRaw": 319870}, "1314": {"acRate": 75.62914456233422, "difficulty": "Medium", "likes": 2402, "dislikes": 377, "categoryTitle": "Algorithms", "frontendQuestionId": "1314", "paidOnly": false, "title": "Matrix Block Sum", "titleSlug": "matrix-block-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91239, "totalSubmissionRaw": 120640}, "1315": {"acRate": 85.59611802659195, "difficulty": "Medium", "likes": 2754, "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": 159462, "totalSubmissionRaw": 186296}, "1316": {"acRate": 50.83027442754763, "difficulty": "Hard", "likes": 319, "dislikes": 205, "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": 17448, "totalSubmissionRaw": 34326}, "1317": {"acRate": 53.953218423530956, "difficulty": "Easy", "likes": 413, "dislikes": 315, "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": 49269, "totalSubmissionRaw": 91318}, "1318": {"acRate": 71.18057182727505, "difficulty": "Medium", "likes": 1988, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "1318", "paidOnly": false, "title": "Minimum Flips to Make a OR b Equal to c", "titleSlug": "minimum-flips-to-make-a-or-b-equal-to-c", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136703, "totalSubmissionRaw": 192051}, "1319": {"acRate": 63.34925781947335, "difficulty": "Medium", "likes": 5068, "dislikes": 73, "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": 237755, "totalSubmissionRaw": 375308}, "1320": {"acRate": 59.070639413188694, "difficulty": "Hard", "likes": 1005, "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": 32454, "totalSubmissionRaw": 54940}, "1321": {"acRate": 52.787078797610334, "difficulty": "Medium", "likes": 800, "dislikes": 296, "categoryTitle": "Database", "frontendQuestionId": "1321", "paidOnly": false, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 111773, "totalSubmissionRaw": 211739}, "1322": {"acRate": 59.37474722963682, "difficulty": "Easy", "likes": 260, "dislikes": 64, "categoryTitle": "Database", "frontendQuestionId": "1322", "paidOnly": true, "title": "Ads Performance", "titleSlug": "ads-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44043, "totalSubmissionRaw": 74178}, "1323": {"acRate": 82.43724691491535, "difficulty": "Easy", "likes": 2801, "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": 274427, "totalSubmissionRaw": 332892}, "1324": {"acRate": 64.61272674920818, "difficulty": "Medium", "likes": 786, "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": 42636, "totalSubmissionRaw": 65987}, "1325": {"acRate": 77.41079010638184, "difficulty": "Medium", "likes": 2751, "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": 216045, "totalSubmissionRaw": 279089}, "1326": {"acRate": 50.765745930575356, "difficulty": "Hard", "likes": 3417, "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": 136040, "totalSubmissionRaw": 267975}, "1327": {"acRate": 71.14599401143272, "difficulty": "Easy", "likes": 379, "dislikes": 36, "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": 141136, "totalSubmissionRaw": 198376}, "1328": {"acRate": 51.70148363527921, "difficulty": "Medium", "likes": 2337, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "1328", "paidOnly": false, "title": "Break a Palindrome", "titleSlug": "break-a-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173368, "totalSubmissionRaw": 335325}, "1329": {"acRate": 82.90836633687843, "difficulty": "Medium", "likes": 3398, "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": 167683, "totalSubmissionRaw": 202251}, "1330": {"acRate": 41.91500734999332, "difficulty": "Hard", "likes": 481, "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": 6273, "totalSubmissionRaw": 14966}, "1331": {"acRate": 62.57702167564509, "difficulty": "Easy", "likes": 1708, "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": 122783, "totalSubmissionRaw": 196211}, "1332": {"acRate": 76.50876488692627, "difficulty": "Easy", "likes": 1668, "dislikes": 1770, "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": 137220, "totalSubmissionRaw": 179352}, "1333": {"acRate": 61.72663013263442, "difficulty": "Medium", "likes": 307, "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": 31088, "totalSubmissionRaw": 50364}, "1334": {"acRate": 68.40175929628148, "difficulty": "Medium", "likes": 3184, "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": 213841, "totalSubmissionRaw": 312625}, "1335": {"acRate": 59.58930889880464, "difficulty": "Hard", "likes": 3420, "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": 199651, "totalSubmissionRaw": 335045}, "1336": {"acRate": 47.64430692157513, "difficulty": "Hard", "likes": 92, "dislikes": 316, "categoryTitle": "Database", "frontendQuestionId": "1336", "paidOnly": true, "title": "Number of Transactions per Visit", "titleSlug": "number-of-transactions-per-visit", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12934, "totalSubmissionRaw": 27147}, "1337": {"acRate": 73.62623025999775, "difficulty": "Easy", "likes": 4179, "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": 372467, "totalSubmissionRaw": 505889}, "1338": {"acRate": 68.9652196724933, "difficulty": "Medium", "likes": 3260, "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": 199795, "totalSubmissionRaw": 289704}, "1339": {"acRate": 47.71220445938679, "difficulty": "Medium", "likes": 3016, "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": 126872, "totalSubmissionRaw": 265911}, "1340": {"acRate": 63.532399134769115, "difficulty": "Hard", "likes": 1112, "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": 33777, "totalSubmissionRaw": 53165}, "1341": {"acRate": 40.309063991882496, "difficulty": "Medium", "likes": 606, "dislikes": 190, "categoryTitle": "Database", "frontendQuestionId": "1341", "paidOnly": false, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 121162, "totalSubmissionRaw": 300584}, "1342": {"acRate": 85.30281540658407, "difficulty": "Easy", "likes": 3975, "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": 707290, "totalSubmissionRaw": 829152}, "1343": {"acRate": 68.88919945622483, "difficulty": "Medium", "likes": 1609, "dislikes": 106, "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": 108445, "totalSubmissionRaw": 157419}, "1344": {"acRate": 63.90166389096854, "difficulty": "Medium", "likes": 1317, "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": 125469, "totalSubmissionRaw": 196347}, "1345": {"acRate": 46.17145899893504, "difficulty": "Hard", "likes": 3741, "dislikes": 131, "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": 147407, "totalSubmissionRaw": 319260}, "1346": {"acRate": 37.42413164003436, "difficulty": "Easy", "likes": 1930, "dislikes": 208, "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": 369033, "totalSubmissionRaw": 986077}, "1347": {"acRate": 82.02391935857044, "difficulty": "Medium", "likes": 2719, "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": 287160, "totalSubmissionRaw": 350093}, "1348": {"acRate": 44.72742748467237, "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": 33631, "totalSubmissionRaw": 75191}, "1349": {"acRate": 50.83237573293261, "difficulty": "Hard", "likes": 830, "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": 17252, "totalSubmissionRaw": 33939}, "1350": {"acRate": 89.75950469790305, "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": 57701, "totalSubmissionRaw": 64284}, "1351": {"acRate": 77.4255111976631, "difficulty": "Easy", "likes": 4980, "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": 437335, "totalSubmissionRaw": 564847}, "1352": {"acRate": 51.8150990338027, "difficulty": "Medium", "likes": 1484, "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": 91220, "totalSubmissionRaw": 176049}, "1353": {"acRate": 32.48128716334382, "difficulty": "Medium", "likes": 3059, "dislikes": 431, "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": 92864, "totalSubmissionRaw": 285900}, "1354": {"acRate": 36.211501184578935, "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": 67252, "totalSubmissionRaw": 185720}, "1355": {"acRate": 72.32385956532124, "difficulty": "Medium", "likes": 147, "dislikes": 48, "categoryTitle": "Database", "frontendQuestionId": "1355", "paidOnly": true, "title": "Activity Participants", "titleSlug": "activity-participants", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30281, "totalSubmissionRaw": 41869}, "1356": {"acRate": 78.32846470725623, "difficulty": "Easy", "likes": 2459, "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": 231405, "totalSubmissionRaw": 295428}, "1357": {"acRate": 71.41426403641881, "difficulty": "Medium", "likes": 195, "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": 23531, "totalSubmissionRaw": 32950}, "1358": {"acRate": 67.7179318134196, "difficulty": "Medium", "likes": 3287, "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": 132503, "totalSubmissionRaw": 195669}, "1359": {"acRate": 64.9970640352108, "difficulty": "Hard", "likes": 3037, "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": 125081, "totalSubmissionRaw": 192441}, "1360": {"acRate": 50.34487180661531, "difficulty": "Easy", "likes": 374, "dislikes": 1281, "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": 54962, "totalSubmissionRaw": 109171}, "1361": {"acRate": 43.823390036678695, "difficulty": "Medium", "likes": 2137, "dislikes": 510, "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": 117448, "totalSubmissionRaw": 268003}, "1362": {"acRate": 60.957054577556214, "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": 23477, "totalSubmissionRaw": 38514}, "1363": {"acRate": 32.68889914952561, "difficulty": "Hard", "likes": 605, "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": 21946, "totalSubmissionRaw": 67136}, "1364": {"acRate": 74.95291219936252, "difficulty": "Medium", "likes": 88, "dislikes": 388, "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": 20693, "totalSubmissionRaw": 27608}, "1365": {"acRate": 86.94218017794088, "difficulty": "Easy", "likes": 5491, "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": 594628, "totalSubmissionRaw": 683935}, "1366": {"acRate": 58.55630004406156, "difficulty": "Medium", "likes": 1458, "dislikes": 170, "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": 77080, "totalSubmissionRaw": 131634}, "1367": {"acRate": 44.065818713776814, "difficulty": "Medium", "likes": 2249, "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": 78921, "totalSubmissionRaw": 179098}, "1368": {"acRate": 62.39621148362622, "difficulty": "Hard", "likes": 1774, "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": 49673, "totalSubmissionRaw": 79609}, "1369": {"acRate": 67.68311183931064, "difficulty": "Hard", "likes": 162, "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": 22307, "totalSubmissionRaw": 32958}, "1370": {"acRate": 76.6029436643546, "difficulty": "Easy", "likes": 782, "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": 81504, "totalSubmissionRaw": 106398}, "1371": {"acRate": 64.18328402700932, "difficulty": "Medium", "likes": 1632, "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": 28421, "totalSubmissionRaw": 44281}, "1372": {"acRate": 65.90403820171707, "difficulty": "Medium", "likes": 3470, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1372", "paidOnly": false, "title": "Longest ZigZag Path in a Binary Tree", "titleSlug": "longest-zigzag-path-in-a-binary-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 184384, "totalSubmissionRaw": 279777}, "1373": {"acRate": 41.893100544487396, "difficulty": "Hard", "likes": 2682, "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": 80095, "totalSubmissionRaw": 191189}, "1374": {"acRate": 78.00028653751254, "difficulty": "Easy", "likes": 487, "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": 97998, "totalSubmissionRaw": 125638}, "1375": {"acRate": 65.8026735493925, "difficulty": "Medium", "likes": 943, "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": 54049, "totalSubmissionRaw": 82138}, "1376": {"acRate": 60.04441031479234, "difficulty": "Medium", "likes": 4101, "dislikes": 301, "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": 223627, "totalSubmissionRaw": 372436}, "1377": {"acRate": 35.55409643055257, "difficulty": "Hard", "likes": 792, "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": 31406, "totalSubmissionRaw": 88333}, "1378": {"acRate": 83.34604180945854, "difficulty": "Easy", "likes": 1284, "dislikes": 115, "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": 583687, "totalSubmissionRaw": 700318}, "1379": {"acRate": 85.90973099837515, "difficulty": "Easy", "likes": 1755, "dislikes": 2005, "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": 237927, "totalSubmissionRaw": 276950}, "1380": {"acRate": 79.90061283459816, "difficulty": "Easy", "likes": 2191, "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": 251631, "totalSubmissionRaw": 314930}, "1381": {"acRate": 77.20643815978106, "difficulty": "Medium", "likes": 1830, "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": 118481, "totalSubmissionRaw": 153460}, "1382": {"acRate": 84.69722704944054, "difficulty": "Medium", "likes": 3655, "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": 258800, "totalSubmissionRaw": 305559}, "1383": {"acRate": 47.68221689021752, "difficulty": "Hard", "likes": 3106, "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": 96976, "totalSubmissionRaw": 203382}, "1384": {"acRate": 61.14096884305324, "difficulty": "Hard", "likes": 229, "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": 16837, "totalSubmissionRaw": 27538}, "1385": {"acRate": 68.9321308120808, "difficulty": "Easy", "likes": 917, "dislikes": 3055, "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": 109143, "totalSubmissionRaw": 158334}, "1386": {"acRate": 42.26550521473943, "difficulty": "Medium", "likes": 906, "dislikes": 399, "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": 50170, "totalSubmissionRaw": 118702}, "1387": {"acRate": 70.18777103527219, "difficulty": "Medium", "likes": 1451, "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": 95654, "totalSubmissionRaw": 136283}, "1388": {"acRate": 52.1669738367122, "difficulty": "Hard", "likes": 1065, "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": 27456, "totalSubmissionRaw": 52631}, "1389": {"acRate": 85.98919381939182, "difficulty": "Easy", "likes": 2062, "dislikes": 1870, "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": 261003, "totalSubmissionRaw": 303530}, "1390": {"acRate": 43.250977993699294, "difficulty": "Medium", "likes": 418, "dislikes": 191, "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": 37480, "totalSubmissionRaw": 86657}, "1391": {"acRate": 48.206385843431434, "difficulty": "Medium", "likes": 829, "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": 30075, "totalSubmissionRaw": 62388}, "1392": {"acRate": 46.53024995943766, "difficulty": "Hard", "likes": 1369, "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": 48753, "totalSubmissionRaw": 104777}, "1393": {"acRate": 85.37485883068369, "difficulty": "Medium", "likes": 820, "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": 117930, "totalSubmissionRaw": 138132}, "1394": {"acRate": 67.72418077024908, "difficulty": "Easy", "likes": 1156, "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": 133012, "totalSubmissionRaw": 196403}, "1395": {"acRate": 70.13744997864701, "difficulty": "Medium", "likes": 3352, "dislikes": 229, "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": 221715, "totalSubmissionRaw": 316115}, "1396": {"acRate": 74.7148288973384, "difficulty": "Medium", "likes": 3508, "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": 234621, "totalSubmissionRaw": 314022}, "1397": {"acRate": 42.649145536430375, "difficulty": "Hard", "likes": 489, "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": 6913, "totalSubmissionRaw": 16209}, "1398": {"acRate": 72.4620271749286, "difficulty": "Medium", "likes": 305, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1398", "paidOnly": true, "title": "Customers Who Bought Products A and B but Not C", "titleSlug": "customers-who-bought-products-a-and-b-but-not-c", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54290, "totalSubmissionRaw": 74922}, "1399": {"acRate": 66.42466994208547, "difficulty": "Easy", "likes": 443, "dislikes": 985, "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": 48401, "totalSubmissionRaw": 72866}, "1400": {"acRate": 62.15754205224051, "difficulty": "Medium", "likes": 1056, "dislikes": 94, "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": 54542, "totalSubmissionRaw": 87748}, "1401": {"acRate": 46.79032985696468, "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": 17632, "totalSubmissionRaw": 37683}, "1402": {"acRate": 76.22411181595957, "difficulty": "Hard", "likes": 3316, "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": 152481, "totalSubmissionRaw": 200043}, "1403": {"acRate": 72.76766902892166, "difficulty": "Easy", "likes": 586, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "1403", "paidOnly": false, "title": "Minimum Subsequence in Non-Increasing Order", "titleSlug": "minimum-subsequence-in-non-increasing-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75984, "totalSubmissionRaw": 104420}, "1404": {"acRate": 61.490019160863206, "difficulty": "Medium", "likes": 1380, "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": 146658, "totalSubmissionRaw": 238507}, "1405": {"acRate": 57.518099682881584, "difficulty": "Medium", "likes": 2015, "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": 86517, "totalSubmissionRaw": 150417}, "1406": {"acRate": 63.622437116165834, "difficulty": "Hard", "likes": 2217, "dislikes": 72, "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": 93028, "totalSubmissionRaw": 146220}, "1407": {"acRate": 57.55529115341545, "difficulty": "Easy", "likes": 636, "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": 131576, "totalSubmissionRaw": 228608}, "1408": {"acRate": 64.09321604946716, "difficulty": "Easy", "likes": 904, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1408", "paidOnly": false, "title": "String Matching in an Array", "titleSlug": "string-matching-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93703, "totalSubmissionRaw": 146198}, "1409": {"acRate": 84.35890750277035, "difficulty": "Medium", "likes": 492, "dislikes": 628, "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": 51766, "totalSubmissionRaw": 61364}, "1410": {"acRate": 50.91361142902245, "difficulty": "Medium", "likes": 191, "dislikes": 324, "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": 25802, "totalSubmissionRaw": 50678}, "1411": {"acRate": 63.80596331115876, "difficulty": "Hard", "likes": 1085, "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": 34817, "totalSubmissionRaw": 54567}, "1412": {"acRate": 58.88532119846046, "difficulty": "Hard", "likes": 217, "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": 27692, "totalSubmissionRaw": 47027}, "1413": {"acRate": 65.38154223477484, "difficulty": "Easy", "likes": 1561, "dislikes": 336, "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": 153017, "totalSubmissionRaw": 234037}, "1414": {"acRate": 65.39609711621888, "difficulty": "Medium", "likes": 1018, "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": 44470, "totalSubmissionRaw": 68001}, "1415": {"acRate": 74.9722419410619, "difficulty": "Medium", "likes": 971, "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": 41189, "totalSubmissionRaw": 54939}, "1416": {"acRate": 47.41927583291855, "difficulty": "Hard", "likes": 1607, "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": 60020, "totalSubmissionRaw": 126573}, "1417": {"acRate": 52.63396911898274, "difficulty": "Easy", "likes": 593, "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": 60268, "totalSubmissionRaw": 114504}, "1418": {"acRate": 75.12115913065202, "difficulty": "Medium", "likes": 395, "dislikes": 480, "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": 30071, "totalSubmissionRaw": 40030}, "1419": {"acRate": 50.3649921892654, "difficulty": "Medium", "likes": 1039, "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": 51263, "totalSubmissionRaw": 101783}, "1420": {"acRate": 68.07922233196444, "difficulty": "Hard", "likes": 1356, "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": 65482, "totalSubmissionRaw": 96185}, "1421": {"acRate": 82.88258376094174, "difficulty": "Easy", "likes": 58, "dislikes": 295, "categoryTitle": "Database", "frontendQuestionId": "1421", "paidOnly": true, "title": "NPV Queries", "titleSlug": "npv-queries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27459, "totalSubmissionRaw": 33130}, "1422": {"acRate": 62.25397419113522, "difficulty": "Easy", "likes": 1555, "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": 166436, "totalSubmissionRaw": 267350}, "1423": {"acRate": 53.821875872679655, "difficulty": "Medium", "likes": 6225, "dislikes": 249, "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": 306443, "totalSubmissionRaw": 569366}, "1424": {"acRate": 57.099528103073524, "difficulty": "Medium", "likes": 2170, "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": 138182, "totalSubmissionRaw": 242002}, "1425": {"acRate": 56.54565299585524, "difficulty": "Hard", "likes": 2132, "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": 79264, "totalSubmissionRaw": 140177}, "1426": {"acRate": 60.28965688141598, "difficulty": "Easy", "likes": 156, "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": 131379, "totalSubmissionRaw": 217913}, "1427": {"acRate": 54.810212275374845, "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": 81773, "totalSubmissionRaw": 149193}, "1428": {"acRate": 54.59762657481244, "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": 185134, "totalSubmissionRaw": 339088}, "1429": {"acRate": 53.94999813796443, "difficulty": "Medium", "likes": 557, "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": 86919, "totalSubmissionRaw": 161112}, "1430": {"acRate": 46.995575081719096, "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": 44713, "totalSubmissionRaw": 95143}, "1431": {"acRate": 87.69676212304714, "difficulty": "Easy", "likes": 4486, "dislikes": 569, "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": 1010121, "totalSubmissionRaw": 1151834}, "1432": {"acRate": 41.04655187332353, "difficulty": "Medium", "likes": 232, "dislikes": 294, "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": 18975, "totalSubmissionRaw": 46228}, "1433": {"acRate": 69.8595286405494, "difficulty": "Medium", "likes": 759, "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": 44759, "totalSubmissionRaw": 64070}, "1434": {"acRate": 43.99876321115359, "difficulty": "Hard", "likes": 900, "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": 15653, "totalSubmissionRaw": 35576}, "1435": {"acRate": 75.16684675522787, "difficulty": "Easy", "likes": 153, "dislikes": 261, "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": 23652, "totalSubmissionRaw": 31466}, "1436": {"acRate": 79.49523301001368, "difficulty": "Easy", "likes": 2217, "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": 278409, "totalSubmissionRaw": 350221}, "1437": {"acRate": 58.069556740638795, "difficulty": "Easy", "likes": 631, "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": 81014, "totalSubmissionRaw": 139512}, "1438": {"acRate": 56.613590741847844, "difficulty": "Medium", "likes": 4073, "dislikes": 193, "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": 232956, "totalSubmissionRaw": 411484}, "1439": {"acRate": 61.92226344440207, "difficulty": "Hard", "likes": 1233, "dislikes": 18, "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": 35718, "totalSubmissionRaw": 57682}, "1440": {"acRate": 72.64885587636276, "difficulty": "Medium", "likes": 215, "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": 30320, "totalSubmissionRaw": 41735}, "1441": {"acRate": 80.02264571158534, "difficulty": "Medium", "likes": 993, "dislikes": 483, "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": 171030, "totalSubmissionRaw": 213727}, "1442": {"acRate": 84.9402593227604, "difficulty": "Medium", "likes": 1933, "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": 126826, "totalSubmissionRaw": 149312}, "1443": {"acRate": 62.45512379556033, "difficulty": "Medium", "likes": 3658, "dislikes": 322, "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": 124384, "totalSubmissionRaw": 199158}, "1444": {"acRate": 61.98716458999982, "difficulty": "Hard", "likes": 1840, "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": 69350, "totalSubmissionRaw": 111878}, "1445": {"acRate": 86.30517900590893, "difficulty": "Medium", "likes": 240, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1445", "paidOnly": true, "title": "Apples & Oranges", "titleSlug": "apples-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54624, "totalSubmissionRaw": 63286}, "1446": {"acRate": 60.29692389893901, "difficulty": "Easy", "likes": 1746, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1446", "paidOnly": false, "title": "Consecutive Characters", "titleSlug": "consecutive-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173789, "totalSubmissionRaw": 288222}, "1447": {"acRate": 67.22959311393964, "difficulty": "Medium", "likes": 416, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1447", "paidOnly": false, "title": "Simplified Fractions", "titleSlug": "simplified-fractions", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34913, "totalSubmissionRaw": 51931}, "1448": {"acRate": 73.04817738184914, "difficulty": "Medium", "likes": 5881, "dislikes": 175, "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": 557592, "totalSubmissionRaw": 763318}, "1449": {"acRate": 48.40743027683441, "difficulty": "Hard", "likes": 695, "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": 18815, "totalSubmissionRaw": 38868}, "1450": {"acRate": 75.70127633472526, "difficulty": "Easy", "likes": 880, "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": 128350, "totalSubmissionRaw": 169548}, "1451": {"acRate": 64.89681571733907, "difficulty": "Medium", "likes": 759, "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": 53743, "totalSubmissionRaw": 82813}, "1452": {"acRate": 58.207731888347524, "difficulty": "Medium", "likes": 355, "dislikes": 227, "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": 25566, "totalSubmissionRaw": 43922}, "1453": {"acRate": 38.36351837649696, "difficulty": "Hard", "likes": 147, "dislikes": 271, "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": 6503, "totalSubmissionRaw": 16951}, "1454": {"acRate": 36.610574947727876, "difficulty": "Medium", "likes": 407, "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": 40097, "totalSubmissionRaw": 109523}, "1455": {"acRate": 64.47470369375935, "difficulty": "Easy", "likes": 830, "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": 84046, "totalSubmissionRaw": 130355}, "1456": {"acRate": 58.961257141951485, "difficulty": "Medium", "likes": 3519, "dislikes": 133, "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": 372015, "totalSubmissionRaw": 630946}, "1457": {"acRate": 68.342647190277, "difficulty": "Medium", "likes": 3260, "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": 221722, "totalSubmissionRaw": 324427}, "1458": {"acRate": 62.45679928038253, "difficulty": "Hard", "likes": 1659, "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": 79154, "totalSubmissionRaw": 126734}, "1459": {"acRate": 68.57153971835369, "difficulty": "Medium", "likes": 97, "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": 17627, "totalSubmissionRaw": 25706}, "1460": {"acRate": 75.9694075765001, "difficulty": "Easy", "likes": 1452, "dislikes": 162, "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": 299185, "totalSubmissionRaw": 393823}, "1461": {"acRate": 56.54198581107865, "difficulty": "Medium", "likes": 2245, "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": 124091, "totalSubmissionRaw": 219467}, "1462": {"acRate": 50.141599220043645, "difficulty": "Medium", "likes": 1475, "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": 64802, "totalSubmissionRaw": 129235}, "1463": {"acRate": 71.85512900436383, "difficulty": "Hard", "likes": 4131, "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": 178657, "totalSubmissionRaw": 248635}, "1464": {"acRate": 82.88117624200648, "difficulty": "Easy", "likes": 2480, "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": 392449, "totalSubmissionRaw": 473508}, "1465": {"acRate": 41.08195147856633, "difficulty": "Medium", "likes": 2620, "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": 168641, "totalSubmissionRaw": 410499}, "1466": {"acRate": 64.53396182005129, "difficulty": "Medium", "likes": 4200, "dislikes": 125, "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": 208372, "totalSubmissionRaw": 322887}, "1467": {"acRate": 60.626916524701876, "difficulty": "Hard", "likes": 285, "dislikes": 173, "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": 8897, "totalSubmissionRaw": 14675}, "1468": {"acRate": 78.43815219761393, "difficulty": "Medium", "likes": 129, "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": 25181, "totalSubmissionRaw": 32103}, "1469": {"acRate": 83.74281000579658, "difficulty": "Easy", "likes": 508, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1469", "paidOnly": true, "title": "Find All The Lonely Nodes", "titleSlug": "find-all-the-lonely-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56343, "totalSubmissionRaw": 67281}, "1470": {"acRate": 88.61481364689331, "difficulty": "Easy", "likes": 5786, "dislikes": 310, "categoryTitle": "Algorithms", "frontendQuestionId": "1470", "paidOnly": false, "title": "Shuffle the Array", "titleSlug": "shuffle-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 730638, "totalSubmissionRaw": 824510}, "1471": {"acRate": 61.34492504300811, "difficulty": "Medium", "likes": 701, "dislikes": 156, "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": 39938, "totalSubmissionRaw": 65104}, "1472": {"acRate": 77.65717081623177, "difficulty": "Medium", "likes": 3872, "dislikes": 240, "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": 249184, "totalSubmissionRaw": 320877}, "1473": {"acRate": 61.01478739523197, "difficulty": "Hard", "likes": 2067, "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": 63625, "totalSubmissionRaw": 104278}, "1474": {"acRate": 73.25787688921827, "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": 32621, "totalSubmissionRaw": 44529}, "1475": {"acRate": 78.45522772954916, "difficulty": "Easy", "likes": 2137, "dislikes": 122, "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": 162764, "totalSubmissionRaw": 207461}, "1476": {"acRate": 88.23276030857188, "difficulty": "Medium", "likes": 634, "dislikes": 1443, "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": 112660, "totalSubmissionRaw": 127685}, "1477": {"acRate": 36.53913917065893, "difficulty": "Medium", "likes": 1702, "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": 48737, "totalSubmissionRaw": 133383}, "1478": {"acRate": 55.505006483981376, "difficulty": "Hard", "likes": 1116, "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": 26109, "totalSubmissionRaw": 47039}, "1479": {"acRate": 77.50159337157424, "difficulty": "Hard", "likes": 152, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1479", "paidOnly": true, "title": "Sales by Day of the Week", "titleSlug": "sales-by-day-of-the-week", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18240, "totalSubmissionRaw": 23535}, "1480": {"acRate": 86.85247944991576, "difficulty": "Easy", "likes": 7915, "dislikes": 347, "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": 1896690, "totalSubmissionRaw": 2183807}, "1481": {"acRate": 63.11817638281089, "difficulty": "Medium", "likes": 2250, "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": 251252, "totalSubmissionRaw": 398066}, "1482": {"acRate": 55.67764525614789, "difficulty": "Medium", "likes": 4670, "dislikes": 228, "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": 273977, "totalSubmissionRaw": 492078}, "1483": {"acRate": 34.89254922146442, "difficulty": "Hard", "likes": 1936, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1483", "paidOnly": false, "title": "Kth Ancestor of a Tree Node", "titleSlug": "kth-ancestor-of-a-tree-node", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37961, "totalSubmissionRaw": 108794}, "1484": {"acRate": 77.16503656652023, "difficulty": "Easy", "likes": 1433, "dislikes": 108, "categoryTitle": "Database", "frontendQuestionId": "1484", "paidOnly": false, "title": "Group Sold Products By The Date", "titleSlug": "group-sold-products-by-the-date", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235188, "totalSubmissionRaw": 304785}, "1485": {"acRate": 80.71512469611298, "difficulty": "Medium", "likes": 421, "dislikes": 87, "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": 29549, "totalSubmissionRaw": 36609}, "1486": {"acRate": 86.17084763553407, "difficulty": "Easy", "likes": 1393, "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": 203595, "totalSubmissionRaw": 236269}, "1487": {"acRate": 37.26026213141147, "difficulty": "Medium", "likes": 447, "dislikes": 722, "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": 34484, "totalSubmissionRaw": 92549}, "1488": {"acRate": 27.03939745075319, "difficulty": "Medium", "likes": 1535, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "1488", "paidOnly": false, "title": "Avoid Flood in The City", "titleSlug": "avoid-flood-in-the-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37336, "totalSubmissionRaw": 138080}, "1489": {"acRate": 67.45403365874108, "difficulty": "Hard", "likes": 1859, "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": 56313, "totalSubmissionRaw": 83484}, "1490": {"acRate": 83.14160275647437, "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": 29920, "totalSubmissionRaw": 35986}, "1491": {"acRate": 63.47577161677128, "difficulty": "Easy", "likes": 2228, "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": 347685, "totalSubmissionRaw": 547745}, "1492": {"acRate": 68.34428590059913, "difficulty": "Medium", "likes": 1789, "dislikes": 296, "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": 256773, "totalSubmissionRaw": 375707}, "1493": {"acRate": 67.83911692602157, "difficulty": "Medium", "likes": 3988, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1493", "paidOnly": false, "title": "Longest Subarray of 1's After Deleting One Element", "titleSlug": "longest-subarray-of-1s-after-deleting-one-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 310482, "totalSubmissionRaw": 457675}, "1494": {"acRate": 29.502254173266724, "difficulty": "Hard", "likes": 1043, "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": 19370, "totalSubmissionRaw": 65656}, "1495": {"acRate": 49.05288794010644, "difficulty": "Easy", "likes": 87, "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": 32629, "totalSubmissionRaw": 66518}, "1496": {"acRate": 62.47534701652031, "difficulty": "Easy", "likes": 1478, "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": 166623, "totalSubmissionRaw": 266702}, "1497": {"acRate": 38.481460106766704, "difficulty": "Medium", "likes": 1751, "dislikes": 93, "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": 53342, "totalSubmissionRaw": 138618}, "1498": {"acRate": 43.58840355516534, "difficulty": "Medium", "likes": 3923, "dislikes": 373, "categoryTitle": "Algorithms", "frontendQuestionId": "1498", "paidOnly": false, "title": "Number of Subsequences That Satisfy the Given Sum Condition", "titleSlug": "number-of-subsequences-that-satisfy-the-given-sum-condition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125105, "totalSubmissionRaw": 287015}, "1499": {"acRate": 44.11824967071564, "difficulty": "Hard", "likes": 1331, "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": 45219, "totalSubmissionRaw": 102495}, "1500": {"acRate": 43.19073595559384, "difficulty": "Medium", "likes": 49, "dislikes": 121, "categoryTitle": "Algorithms", "frontendQuestionId": "1500", "paidOnly": true, "title": "Design a File Sharing System", "titleSlug": "design-a-file-sharing-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4513, "totalSubmissionRaw": 10449}, "1501": {"acRate": 50.2723793614979, "difficulty": "Medium", "likes": 297, "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": 40328, "totalSubmissionRaw": 80219}, "1502": {"acRate": 69.55246900964387, "difficulty": "Easy", "likes": 2169, "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": 255235, "totalSubmissionRaw": 366968}, "1503": {"acRate": 68.52036575228595, "difficulty": "Medium", "likes": 1499, "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": 90673, "totalSubmissionRaw": 132330}, "1504": {"acRate": 57.24892786276643, "difficulty": "Medium", "likes": 2113, "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": 53664, "totalSubmissionRaw": 93738}, "1505": {"acRate": 39.83034943512367, "difficulty": "Hard", "likes": 488, "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": 10612, "totalSubmissionRaw": 26643}, "1506": {"acRate": 78.36921586756483, "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": 35600, "totalSubmissionRaw": 45426}, "1507": {"acRate": 66.58570761326483, "difficulty": "Easy", "likes": 474, "dislikes": 437, "categoryTitle": "Algorithms", "frontendQuestionId": "1507", "paidOnly": false, "title": "Reformat Date", "titleSlug": "reformat-date", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78408, "totalSubmissionRaw": 117755}, "1508": {"acRate": 63.19134078212291, "difficulty": "Medium", "likes": 1515, "dislikes": 253, "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": 171930, "totalSubmissionRaw": 272079}, "1509": {"acRate": 59.23884169141793, "difficulty": "Medium", "likes": 2475, "dislikes": 277, "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": 234151, "totalSubmissionRaw": 395266}, "1510": {"acRate": 59.62439822685457, "difficulty": "Hard", "likes": 1605, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1510", "paidOnly": false, "title": "Stone Game IV", "titleSlug": "stone-game-iv", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75054, "totalSubmissionRaw": 125878}, "1511": {"acRate": 67.7605760019777, "difficulty": "Easy", "likes": 318, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1511", "paidOnly": true, "title": "Customer Order Frequency", "titleSlug": "customer-order-frequency", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43856, "totalSubmissionRaw": 64722}, "1512": {"acRate": 89.2382885040828, "difficulty": "Easy", "likes": 5462, "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": 828930, "totalSubmissionRaw": 928895}, "1513": {"acRate": 47.02418465416732, "difficulty": "Medium", "likes": 876, "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": 47754, "totalSubmissionRaw": 101552}, "1514": {"acRate": 65.60858399973233, "difficulty": "Medium", "likes": 3637, "dislikes": 102, "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": 313733, "totalSubmissionRaw": 478183}, "1515": {"acRate": 35.01229348100829, "difficulty": "Hard", "likes": 235, "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": 15237, "totalSubmissionRaw": 43519}, "1516": {"acRate": 61.89967982924226, "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": 2320, "totalSubmissionRaw": 3748}, "1517": {"acRate": 44.11985998887762, "difficulty": "Easy", "likes": 471, "dislikes": 254, "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": 134868, "totalSubmissionRaw": 305684}, "1518": {"acRate": 71.00736440359083, "difficulty": "Easy", "likes": 1683, "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": 237771, "totalSubmissionRaw": 334854}, "1519": {"acRate": 54.98801793444651, "difficulty": "Medium", "likes": 2256, "dislikes": 808, "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": 85359, "totalSubmissionRaw": 155232}, "1520": {"acRate": 39.67540349772962, "difficulty": "Hard", "likes": 826, "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": 17650, "totalSubmissionRaw": 44486}, "1521": {"acRate": 45.52078694895357, "difficulty": "Hard", "likes": 386, "dislikes": 16, "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": 11245, "totalSubmissionRaw": 24703}, "1522": {"acRate": 74.50313155462986, "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": 50794, "totalSubmissionRaw": 68177}, "1523": {"acRate": 49.992563037284455, "difficulty": "Easy", "likes": 2747, "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": 346191, "totalSubmissionRaw": 692485}, "1524": {"acRate": 43.77264738429492, "difficulty": "Medium", "likes": 1354, "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": 40347, "totalSubmissionRaw": 92173}, "1525": {"acRate": 68.32195523328319, "difficulty": "Medium", "likes": 2054, "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": 106283, "totalSubmissionRaw": 155562}, "1526": {"acRate": 70.98980534530543, "difficulty": "Hard", "likes": 1506, "dislikes": 72, "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": 43799, "totalSubmissionRaw": 61698}, "1527": {"acRate": 40.377971589705005, "difficulty": "Easy", "likes": 660, "dislikes": 574, "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": 245788, "totalSubmissionRaw": 608719}, "1528": {"acRate": 84.86378601167787, "difficulty": "Easy", "likes": 2759, "dislikes": 525, "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": 405211, "totalSubmissionRaw": 477484}, "1529": {"acRate": 73.41594210444109, "difficulty": "Medium", "likes": 1027, "dislikes": 44, "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": 56404, "totalSubmissionRaw": 76828}, "1530": {"acRate": 71.89351414979619, "difficulty": "Medium", "likes": 2402, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1530", "paidOnly": false, "title": "Number of Good Leaf Nodes Pairs", "titleSlug": "number-of-good-leaf-nodes-pairs", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147803, "totalSubmissionRaw": 205586}, "1531": {"acRate": 52.50352757829118, "difficulty": "Hard", "likes": 2434, "dislikes": 215, "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": 99721, "totalSubmissionRaw": 189932}, "1532": {"acRate": 68.42200384050604, "difficulty": "Medium", "likes": 153, "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": 30286, "totalSubmissionRaw": 44264}, "1533": {"acRate": 56.254954812113525, "difficulty": "Medium", "likes": 247, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1533", "paidOnly": true, "title": "Find the Index of the Large Integer", "titleSlug": "find-the-index-of-the-large-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14192, "totalSubmissionRaw": 25228}, "1534": {"acRate": 81.43970229096406, "difficulty": "Easy", "likes": 769, "dislikes": 1201, "categoryTitle": "Algorithms", "frontendQuestionId": "1534", "paidOnly": false, "title": "Count Good Triplets", "titleSlug": "count-good-triplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 126054, "totalSubmissionRaw": 154782}, "1535": {"acRate": 57.03078382846355, "difficulty": "Medium", "likes": 1575, "dislikes": 82, "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": 116604, "totalSubmissionRaw": 204458}, "1536": {"acRate": 47.7105949420826, "difficulty": "Medium", "likes": 566, "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": 15734, "totalSubmissionRaw": 32978}, "1537": {"acRate": 39.55746218107925, "difficulty": "Hard", "likes": 996, "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": 28032, "totalSubmissionRaw": 70864}, "1538": {"acRate": 69.94096425057396, "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": 4265, "totalSubmissionRaw": 6098}, "1539": {"acRate": 60.630877212691594, "difficulty": "Easy", "likes": 6724, "dislikes": 461, "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": 474935, "totalSubmissionRaw": 783322}, "1540": {"acRate": 35.41438730853392, "difficulty": "Medium", "likes": 393, "dislikes": 316, "categoryTitle": "Algorithms", "frontendQuestionId": "1540", "paidOnly": false, "title": "Can Convert String in K Moves", "titleSlug": "can-convert-string-in-k-moves", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20716, "totalSubmissionRaw": 58496}, "1541": {"acRate": 52.72817818903267, "difficulty": "Medium", "likes": 1120, "dislikes": 265, "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": 65645, "totalSubmissionRaw": 124497}, "1542": {"acRate": 43.987932768280416, "difficulty": "Hard", "likes": 818, "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": 15310, "totalSubmissionRaw": 34805}, "1543": {"acRate": 59.34094005449592, "difficulty": "Easy", "likes": 89, "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": 20907, "totalSubmissionRaw": 35232}, "1544": {"acRate": 68.3382844099827, "difficulty": "Easy", "likes": 3036, "dislikes": 173, "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": 325743, "totalSubmissionRaw": 476663}, "1545": {"acRate": 59.035778057006816, "difficulty": "Medium", "likes": 928, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1545", "paidOnly": false, "title": "Find Kth Bit in Nth Binary String", "titleSlug": "find-kth-bit-in-nth-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44634, "totalSubmissionRaw": 75605}, "1546": {"acRate": 47.86575910419013, "difficulty": "Medium", "likes": 1066, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1546", "paidOnly": false, "title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "titleSlug": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29324, "totalSubmissionRaw": 61263}, "1547": {"acRate": 61.691255879544094, "difficulty": "Hard", "likes": 4302, "dislikes": 114, "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": 138232, "totalSubmissionRaw": 224072}, "1548": {"acRate": 59.25372627576139, "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": 17452, "totalSubmissionRaw": 29453}, "1549": {"acRate": 64.82350671896097, "difficulty": "Medium", "likes": 135, "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": 30246, "totalSubmissionRaw": 46659}, "1550": {"acRate": 68.30860170219029, "difficulty": "Easy", "likes": 1133, "dislikes": 95, "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": 278500, "totalSubmissionRaw": 407709}, "1551": {"acRate": 82.4262946261416, "difficulty": "Medium", "likes": 1445, "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": 101264, "totalSubmissionRaw": 122854}, "1552": {"acRate": 71.07234316318048, "difficulty": "Medium", "likes": 2897, "dislikes": 254, "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": 170128, "totalSubmissionRaw": 239373}, "1553": {"acRate": 35.50070965222278, "difficulty": "Hard", "likes": 995, "dislikes": 59, "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": 37269, "totalSubmissionRaw": 104981}, "1554": {"acRate": 41.624085762949605, "difficulty": "Medium", "likes": 376, "dislikes": 99, "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": 24927, "totalSubmissionRaw": 59886}, "1555": {"acRate": 51.301713786704504, "difficulty": "Medium", "likes": 141, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1555", "paidOnly": true, "title": "Bank Account Summary", "titleSlug": "bank-account-summary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18799, "totalSubmissionRaw": 36644}, "1556": {"acRate": 53.774852625280765, "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": 54824, "totalSubmissionRaw": 101951}, "1557": {"acRate": 81.02628220827265, "difficulty": "Medium", "likes": 3705, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1557", "paidOnly": false, "title": "Minimum Number of Vertices to Reach All Nodes", "titleSlug": "minimum-number-of-vertices-to-reach-all-nodes", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188583, "totalSubmissionRaw": 232743}, "1558": {"acRate": 63.751960085531, "difficulty": "Medium", "likes": 628, "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": 22361, "totalSubmissionRaw": 35075}, "1559": {"acRate": 48.8669778423935, "difficulty": "Medium", "likes": 1164, "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": 44703, "totalSubmissionRaw": 91480}, "1560": {"acRate": 58.985708191126285, "difficulty": "Easy", "likes": 317, "dislikes": 637, "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": 33182, "totalSubmissionRaw": 56255}, "1561": {"acRate": 84.49318987869937, "difficulty": "Medium", "likes": 1895, "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": 170100, "totalSubmissionRaw": 201318}, "1562": {"acRate": 43.01399255860668, "difficulty": "Medium", "likes": 649, "dislikes": 135, "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": 18844, "totalSubmissionRaw": 43809}, "1563": {"acRate": 41.21194549144679, "difficulty": "Hard", "likes": 658, "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": 21321, "totalSubmissionRaw": 51735}, "1564": {"acRate": 67.39499878611313, "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": 16656, "totalSubmissionRaw": 24714}, "1565": {"acRate": 82.14626274481039, "difficulty": "Easy", "likes": 78, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "1565", "paidOnly": true, "title": "Unique Orders and Customers Per Month", "titleSlug": "unique-orders-and-customers-per-month", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22398, "totalSubmissionRaw": 27266}, "1566": {"acRate": 43.34553308933821, "difficulty": "Easy", "likes": 658, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1566", "paidOnly": false, "title": "Detect Pattern of Length M Repeated K or More Times", "titleSlug": "detect-pattern-of-length-m-repeated-k-or-more-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36122, "totalSubmissionRaw": 83335}, "1567": {"acRate": 44.27980001357374, "difficulty": "Medium", "likes": 2416, "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": 97865, "totalSubmissionRaw": 221015}, "1568": {"acRate": 59.877298998117354, "difficulty": "Hard", "likes": 1230, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "1568", "paidOnly": false, "title": "Minimum Number of Days to Disconnect Island", "titleSlug": "minimum-number-of-days-to-disconnect-island", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90962, "totalSubmissionRaw": 151914}, "1569": {"acRate": 53.5209400535929, "difficulty": "Hard", "likes": 1790, "dislikes": 208, "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": 56524, "totalSubmissionRaw": 105611}, "1570": {"acRate": 89.85680970453936, "difficulty": "Medium", "likes": 1214, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "1570", "paidOnly": true, "title": "Dot Product of Two Sparse Vectors", "titleSlug": "dot-product-of-two-sparse-vectors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 275105, "totalSubmissionRaw": 306160}, "1571": {"acRate": 87.62988519661845, "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": 43432, "totalSubmissionRaw": 49563}, "1572": {"acRate": 83.19754062285828, "difficulty": "Easy", "likes": 3498, "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": 379963, "totalSubmissionRaw": 456700}, "1573": {"acRate": 33.52361800352459, "difficulty": "Medium", "likes": 740, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1573", "paidOnly": false, "title": "Number of Ways to Split a String", "titleSlug": "number-of-ways-to-split-a-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31007, "totalSubmissionRaw": 92493}, "1574": {"acRate": 38.098162407293685, "difficulty": "Medium", "likes": 1622, "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": 32260, "totalSubmissionRaw": 84676}, "1575": {"acRate": 65.20446178847408, "difficulty": "Hard", "likes": 1629, "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": 58982, "totalSubmissionRaw": 90457}, "1576": {"acRate": 46.19606163118786, "difficulty": "Easy", "likes": 566, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "1576", "paidOnly": false, "title": "Replace All ?'s to Avoid Consecutive Repeating Characters", "titleSlug": "replace-all-s-to-avoid-consecutive-repeating-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62543, "totalSubmissionRaw": 135386}, "1577": {"acRate": 41.52283488620742, "difficulty": "Medium", "likes": 377, "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": 21748, "totalSubmissionRaw": 52376}, "1578": {"acRate": 63.702926589344685, "difficulty": "Medium", "likes": 3826, "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": 262922, "totalSubmissionRaw": 412732}, "1579": {"acRate": 70.83335588523427, "difficulty": "Hard", "likes": 2543, "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": 130871, "totalSubmissionRaw": 184759}, "1580": {"acRate": 66.22412241224123, "difficulty": "Medium", "likes": 221, "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": 8829, "totalSubmissionRaw": 13332}, "1581": {"acRate": 67.94034334266381, "difficulty": "Easy", "likes": 2164, "dislikes": 298, "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": 527412, "totalSubmissionRaw": 776291}, "1582": {"acRate": 68.6583830381678, "difficulty": "Easy", "likes": 1452, "dislikes": 70, "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": 149413, "totalSubmissionRaw": 217618}, "1583": {"acRate": 61.67434391243714, "difficulty": "Medium", "likes": 286, "dislikes": 861, "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": 29188, "totalSubmissionRaw": 47326}, "1584": {"acRate": 67.45901444822951, "difficulty": "Medium", "likes": 5094, "dislikes": 130, "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": 312684, "totalSubmissionRaw": 463517}, "1585": {"acRate": 48.62520458265139, "difficulty": "Hard", "likes": 439, "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": 8913, "totalSubmissionRaw": 18330}, "1586": {"acRate": 62.973290924142745, "difficulty": "Medium", "likes": 261, "dislikes": 52, "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": 14453, "totalSubmissionRaw": 22951}, "1587": {"acRate": 83.37253893456572, "difficulty": "Easy", "likes": 481, "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": 110226, "totalSubmissionRaw": 132209}, "1588": {"acRate": 83.21221746314387, "difficulty": "Easy", "likes": 3717, "dislikes": 304, "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": 207488, "totalSubmissionRaw": 249348}, "1589": {"acRate": 38.39989824472145, "difficulty": "Medium", "likes": 773, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1589", "paidOnly": false, "title": "Maximum Sum Obtained of Any Permutation", "titleSlug": "maximum-sum-obtained-of-any-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21133, "totalSubmissionRaw": 55034}, "1590": {"acRate": 29.191815519627873, "difficulty": "Medium", "likes": 1551, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1590", "paidOnly": false, "title": "Make Sum Divisible by P", "titleSlug": "make-sum-divisible-by-p", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31002, "totalSubmissionRaw": 106201}, "1591": {"acRate": 59.50132413930945, "difficulty": "Hard", "likes": 634, "dislikes": 21, "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": 11908, "totalSubmissionRaw": 20013}, "1592": {"acRate": 43.33284132841329, "difficulty": "Easy", "likes": 458, "dislikes": 349, "categoryTitle": "Algorithms", "frontendQuestionId": "1592", "paidOnly": false, "title": "Rearrange Spaces Between Words", "titleSlug": "rearrange-spaces-between-words", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58716, "totalSubmissionRaw": 135500}, "1593": {"acRate": 56.82964721490041, "difficulty": "Medium", "likes": 844, "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": 32556, "totalSubmissionRaw": 57287}, "1594": {"acRate": 33.973701263635384, "difficulty": "Medium", "likes": 837, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1594", "paidOnly": false, "title": "Maximum Non Negative Product in a Matrix", "titleSlug": "maximum-non-negative-product-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25165, "totalSubmissionRaw": 74072}, "1595": {"acRate": 48.399064850579386, "difficulty": "Hard", "likes": 474, "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": 9523, "totalSubmissionRaw": 19676}, "1596": {"acRate": 78.39784994805547, "difficulty": "Medium", "likes": 243, "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": 34713, "totalSubmissionRaw": 44278}, "1597": {"acRate": 62.52636512772439, "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": 13340, "totalSubmissionRaw": 21335}, "1598": {"acRate": 71.75600266943076, "difficulty": "Easy", "likes": 1450, "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": 252678, "totalSubmissionRaw": 352135}, "1599": {"acRate": 44.23519848259044, "difficulty": "Medium", "likes": 109, "dislikes": 248, "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": 13060, "totalSubmissionRaw": 29524}, "1600": {"acRate": 65.65877781702578, "difficulty": "Medium", "likes": 294, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "1600", "paidOnly": false, "title": "Throne Inheritance", "titleSlug": "throne-inheritance", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18588, "totalSubmissionRaw": 28310}, "1601": {"acRate": 64.51973699075853, "difficulty": "Hard", "likes": 1418, "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": 57109, "totalSubmissionRaw": 88514}, "1602": {"acRate": 75.41538957896435, "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": 23375, "totalSubmissionRaw": 30995}, "1603": {"acRate": 87.98475752672725, "difficulty": "Easy", "likes": 1954, "dislikes": 449, "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": 290926, "totalSubmissionRaw": 330655}, "1604": {"acRate": 45.916727538349164, "difficulty": "Medium", "likes": 311, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1604", "paidOnly": false, "title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "titleSlug": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37716, "totalSubmissionRaw": 82140}, "1605": {"acRate": 83.11949061253955, "difficulty": "Medium", "likes": 2124, "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": 147379, "totalSubmissionRaw": 177310}, "1606": {"acRate": 43.68645538858305, "difficulty": "Hard", "likes": 611, "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": 17615, "totalSubmissionRaw": 40324}, "1607": {"acRate": 54.333436436746055, "difficulty": "Easy", "likes": 134, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "1607", "paidOnly": true, "title": "Sellers With No Sales", "titleSlug": "sellers-with-no-sales", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35132, "totalSubmissionRaw": 64660}, "1608": {"acRate": 66.87975282006207, "difficulty": "Easy", "likes": 2210, "dislikes": 430, "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": 200869, "totalSubmissionRaw": 300345}, "1609": {"acRate": 65.92104566215627, "difficulty": "Medium", "likes": 1781, "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": 161792, "totalSubmissionRaw": 245433}, "1610": {"acRate": 37.46339285714286, "difficulty": "Hard", "likes": 581, "dislikes": 750, "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": 41959, "totalSubmissionRaw": 111999}, "1611": {"acRate": 74.0492114810336, "difficulty": "Hard", "likes": 931, "dislikes": 1028, "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": 60008, "totalSubmissionRaw": 81038}, "1612": {"acRate": 70.6759163776132, "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": 7539, "totalSubmissionRaw": 10667}, "1613": {"acRate": 73.0043432679347, "difficulty": "Medium", "likes": 229, "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": 19498, "totalSubmissionRaw": 26708}, "1614": {"acRate": 83.9383400396236, "difficulty": "Easy", "likes": 2478, "dislikes": 506, "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": 369024, "totalSubmissionRaw": 439637}, "1615": {"acRate": 65.18431285412733, "difficulty": "Medium", "likes": 2358, "dislikes": 369, "categoryTitle": "Algorithms", "frontendQuestionId": "1615", "paidOnly": false, "title": "Maximal Network Rank", "titleSlug": "maximal-network-rank", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146681, "totalSubmissionRaw": 225025}, "1616": {"acRate": 31.093089362921912, "difficulty": "Medium", "likes": 735, "dislikes": 250, "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": 26033, "totalSubmissionRaw": 83726}, "1617": {"acRate": 66.35713018276454, "difficulty": "Hard", "likes": 547, "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": 11219, "totalSubmissionRaw": 16907}, "1618": {"acRate": 61.00861008610086, "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": 6944, "totalSubmissionRaw": 11382}, "1619": {"acRate": 69.02919565641459, "difficulty": "Easy", "likes": 502, "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": 63696, "totalSubmissionRaw": 92274}, "1620": {"acRate": 38.11490644748255, "difficulty": "Medium", "likes": 80, "dislikes": 267, "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": 9228, "totalSubmissionRaw": 24211}, "1621": {"acRate": 43.88392669937518, "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": 10465, "totalSubmissionRaw": 23847}, "1622": {"acRate": 17.515936952714537, "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": 12502, "totalSubmissionRaw": 71375}, "1623": {"acRate": 81.93155218338849, "difficulty": "Easy", "likes": 74, "dislikes": 139, "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": 20301, "totalSubmissionRaw": 24778}, "1624": {"acRate": 68.54719349114987, "difficulty": "Easy", "likes": 1345, "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": 158391, "totalSubmissionRaw": 231069}, "1625": {"acRate": 65.6646962646208, "difficulty": "Medium", "likes": 355, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "1625", "paidOnly": false, "title": "Lexicographically Smallest String After Applying Operations", "titleSlug": "lexicographically-smallest-string-after-applying-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15663, "totalSubmissionRaw": 23853}, "1626": {"acRate": 50.393305538167176, "difficulty": "Medium", "likes": 2954, "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": 85333, "totalSubmissionRaw": 169334}, "1627": {"acRate": 47.40435398686075, "difficulty": "Hard", "likes": 582, "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": 18400, "totalSubmissionRaw": 38815}, "1628": {"acRate": 82.52114748069143, "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": 26925, "totalSubmissionRaw": 32628}, "1629": {"acRate": 59.165138566930764, "difficulty": "Easy", "likes": 764, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "1629", "paidOnly": false, "title": "Slowest Key", "titleSlug": "slowest-key", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102603, "totalSubmissionRaw": 173418}, "1630": {"acRate": 83.75412093644368, "difficulty": "Medium", "likes": 1821, "dislikes": 204, "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": 140490, "totalSubmissionRaw": 167741}, "1631": {"acRate": 60.203117971719536, "difficulty": "Medium", "likes": 5955, "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": 282403, "totalSubmissionRaw": 469083}, "1632": {"acRate": 41.02921983758701, "difficulty": "Hard", "likes": 875, "dislikes": 56, "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": 22635, "totalSubmissionRaw": 55168}, "1633": {"acRate": 57.28815012215199, "difficulty": "Easy", "likes": 713, "dislikes": 76, "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": 227225, "totalSubmissionRaw": 396635}, "1634": {"acRate": 58.92785167271262, "difficulty": "Medium", "likes": 160, "dislikes": 12, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 13157, "totalSubmissionRaw": 22328}, "1635": {"acRate": 47.73978951960303, "difficulty": "Hard", "likes": 110, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1635", "paidOnly": true, "title": "Hopper Company Queries I", "titleSlug": "hopper-company-queries-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8755, "totalSubmissionRaw": 18339}, "1636": {"acRate": 79.8323196169936, "difficulty": "Easy", "likes": 3412, "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": 277470, "totalSubmissionRaw": 347566}, "1637": {"acRate": 87.35526802218115, "difficulty": "Easy", "likes": 936, "dislikes": 1734, "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": 177222, "totalSubmissionRaw": 202875}, "1638": {"acRate": 71.31485782578302, "difficulty": "Medium", "likes": 1156, "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": 31626, "totalSubmissionRaw": 44347}, "1639": {"acRate": 50.86832882573419, "difficulty": "Hard", "likes": 1579, "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": 58494, "totalSubmissionRaw": 114991}, "1640": {"acRate": 56.65836120627784, "difficulty": "Easy", "likes": 903, "dislikes": 141, "categoryTitle": "Algorithms", "frontendQuestionId": "1640", "paidOnly": false, "title": "Check Array Formation Through Concatenation", "titleSlug": "check-array-formation-through-concatenation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83681, "totalSubmissionRaw": 147694}, "1641": {"acRate": 78.60782250648285, "difficulty": "Medium", "likes": 3865, "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": 189764, "totalSubmissionRaw": 241406}, "1642": {"acRate": 49.88457210224532, "difficulty": "Medium", "likes": 5911, "dislikes": 141, "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": 232724, "totalSubmissionRaw": 466525}, "1643": {"acRate": 48.355593853224185, "difficulty": "Hard", "likes": 550, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1643", "paidOnly": false, "title": "Kth Smallest Instructions", "titleSlug": "kth-smallest-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13468, "totalSubmissionRaw": 27852}, "1644": {"acRate": 64.98398363629346, "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": 84190, "totalSubmissionRaw": 129555}, "1645": {"acRate": 39.19944389735272, "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": 6767, "totalSubmissionRaw": 17263}, "1646": {"acRate": 50.5575479737335, "difficulty": "Easy", "likes": 760, "dislikes": 945, "categoryTitle": "Algorithms", "frontendQuestionId": "1646", "paidOnly": false, "title": "Get Maximum in Generated Array", "titleSlug": "get-maximum-in-generated-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 110945, "totalSubmissionRaw": 219443}, "1647": {"acRate": 61.26380405947314, "difficulty": "Medium", "likes": 4939, "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": 278046, "totalSubmissionRaw": 453849}, "1648": {"acRate": 29.999921683491664, "difficulty": "Medium", "likes": 1079, "dislikes": 387, "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": 38306, "totalSubmissionRaw": 127687}, "1649": {"acRate": 39.2080836564446, "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": 26696, "totalSubmissionRaw": 68088}, "1650": {"acRate": 80.24953427574007, "difficulty": "Medium", "likes": 1393, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1650", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree III", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 256308, "totalSubmissionRaw": 319389}, "1651": {"acRate": 65.23979018358936, "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": 6965, "totalSubmissionRaw": 10676}, "1652": {"acRate": 66.601866251944, "difficulty": "Easy", "likes": 807, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1652", "paidOnly": false, "title": "Defuse the Bomb", "titleSlug": "defuse-the-bomb", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51389, "totalSubmissionRaw": 77159}, "1653": {"acRate": 65.80861893175292, "difficulty": "Medium", "likes": 2082, "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": 162007, "totalSubmissionRaw": 246179}, "1654": {"acRate": 29.586559051227145, "difficulty": "Medium", "likes": 1492, "dislikes": 273, "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": 44905, "totalSubmissionRaw": 151775}, "1655": {"acRate": 39.558776087549944, "difficulty": "Hard", "likes": 430, "dislikes": 27, "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": 15941, "totalSubmissionRaw": 40297}, "1656": {"acRate": 84.36505627153008, "difficulty": "Easy", "likes": 528, "dislikes": 3499, "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": 89880, "totalSubmissionRaw": 106537}, "1657": {"acRate": 54.45508250747943, "difficulty": "Medium", "likes": 3714, "dislikes": 298, "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": 372769, "totalSubmissionRaw": 684543}, "1658": {"acRate": 39.78643584480196, "difficulty": "Medium", "likes": 5475, "dislikes": 121, "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": 196730, "totalSubmissionRaw": 494465}, "1659": {"acRate": 39.69549413620465, "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": 5788, "totalSubmissionRaw": 14581}, "1660": {"acRate": 74.46768910065515, "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": 20005, "totalSubmissionRaw": 26864}, "1661": {"acRate": 68.14668957749258, "difficulty": "Easy", "likes": 1444, "dislikes": 144, "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": 331550, "totalSubmissionRaw": 486522}, "1662": {"acRate": 85.58752357270406, "difficulty": "Easy", "likes": 3002, "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": 512846, "totalSubmissionRaw": 599207}, "1663": {"acRate": 66.89127638121066, "difficulty": "Medium", "likes": 1876, "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": 96193, "totalSubmissionRaw": 143805}, "1664": {"acRate": 63.7314280306615, "difficulty": "Medium", "likes": 1318, "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": 40407, "totalSubmissionRaw": 63402}, "1665": {"acRate": 58.50610531671331, "difficulty": "Hard", "likes": 581, "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": 18399, "totalSubmissionRaw": 31448}, "1666": {"acRate": 74.07900577008432, "difficulty": "Medium", "likes": 64, "dislikes": 191, "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": 5007, "totalSubmissionRaw": 6759}, "1667": {"acRate": 61.44849248063636, "difficulty": "Easy", "likes": 885, "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": 252760, "totalSubmissionRaw": 411336}, "1668": {"acRate": 38.91394038771786, "difficulty": "Easy", "likes": 712, "dislikes": 267, "categoryTitle": "Algorithms", "frontendQuestionId": "1668", "paidOnly": false, "title": "Maximum Repeating Substring", "titleSlug": "maximum-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58855, "totalSubmissionRaw": 151244}, "1669": {"acRate": 81.756353613406, "difficulty": "Medium", "likes": 2097, "dislikes": 220, "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": 223351, "totalSubmissionRaw": 273191}, "1670": {"acRate": 56.670484917907594, "difficulty": "Medium", "likes": 748, "dislikes": 105, "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": 29684, "totalSubmissionRaw": 52380}, "1671": {"acRate": 42.05829786686897, "difficulty": "Hard", "likes": 1593, "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": 32708, "totalSubmissionRaw": 77768}, "1672": {"acRate": 88.23025662838508, "difficulty": "Easy", "likes": 4381, "dislikes": 367, "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": 933432, "totalSubmissionRaw": 1057950}, "1673": {"acRate": 50.777313341258576, "difficulty": "Medium", "likes": 2051, "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": 66206, "totalSubmissionRaw": 130385}, "1674": {"acRate": 40.41010681652439, "difficulty": "Medium", "likes": 668, "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": 9420, "totalSubmissionRaw": 23311}, "1675": {"acRate": 54.04276276684272, "difficulty": "Hard", "likes": 3039, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "1675", "paidOnly": false, "title": "Minimize Deviation in Array", "titleSlug": "minimize-deviation-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95466, "totalSubmissionRaw": 176649}, "1676": {"acRate": 78.50607931323427, "difficulty": "Medium", "likes": 474, "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": 45908, "totalSubmissionRaw": 58477}, "1677": {"acRate": 38.226286314315715, "difficulty": "Easy", "likes": 38, "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": 17474, "totalSubmissionRaw": 45712}, "1678": {"acRate": 87.38396624472574, "difficulty": "Easy", "likes": 1583, "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": 267159, "totalSubmissionRaw": 305730}, "1679": {"acRate": 55.206939329706074, "difficulty": "Medium", "likes": 3165, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1679", "paidOnly": false, "title": "Max Number of K-Sum Pairs", "titleSlug": "max-number-of-k-sum-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 339095, "totalSubmissionRaw": 614222}, "1680": {"acRate": 57.16209107760132, "difficulty": "Medium", "likes": 1421, "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": 91281, "totalSubmissionRaw": 159688}, "1681": {"acRate": 39.07367668097282, "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": 8739, "totalSubmissionRaw": 22366}, "1682": {"acRate": 50.18827326519634, "difficulty": "Medium", "likes": 151, "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": 5598, "totalSubmissionRaw": 11154}, "1683": {"acRate": 85.43736548836935, "difficulty": "Easy", "likes": 1013, "dislikes": 372, "categoryTitle": "Database", "frontendQuestionId": "1683", "paidOnly": false, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 637548, "totalSubmissionRaw": 746217}, "1684": {"acRate": 83.62346109481015, "difficulty": "Easy", "likes": 1726, "dislikes": 74, "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"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 190661, "totalSubmissionRaw": 228000}, "1685": {"acRate": 68.39616012123359, "difficulty": "Medium", "likes": 2070, "dislikes": 74, "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": 111931, "totalSubmissionRaw": 163651}, "1686": {"acRate": 57.848310198338616, "difficulty": "Medium", "likes": 843, "dislikes": 73, "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": 21379, "totalSubmissionRaw": 36957}, "1687": {"acRate": 39.40586155776029, "difficulty": "Hard", "likes": 379, "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": 6911, "totalSubmissionRaw": 17538}, "1688": {"acRate": 85.72244625941012, "difficulty": "Easy", "likes": 1761, "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": 252108, "totalSubmissionRaw": 294098}, "1689": {"acRate": 88.73876874488153, "difficulty": "Medium", "likes": 2425, "dislikes": 1493, "categoryTitle": "Algorithms", "frontendQuestionId": "1689", "paidOnly": false, "title": "Partitioning Into Minimum Number Of Deci-Binary Numbers", "titleSlug": "partitioning-into-minimum-number-of-deci-binary-numbers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226464, "totalSubmissionRaw": 255203}, "1690": {"acRate": 58.18190362804687, "difficulty": "Medium", "likes": 1001, "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": 37141, "totalSubmissionRaw": 63836}, "1691": {"acRate": 58.20652585358468, "difficulty": "Hard", "likes": 1162, "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": 30754, "totalSubmissionRaw": 52836}, "1692": {"acRate": 62.689035916824196, "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": 2653, "totalSubmissionRaw": 4232}, "1693": {"acRate": 86.55977409434655, "difficulty": "Easy", "likes": 557, "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": 134261, "totalSubmissionRaw": 155108}, "1694": {"acRate": 66.19431536427973, "difficulty": "Easy", "likes": 356, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "1694", "paidOnly": false, "title": "Reformat Phone Number", "titleSlug": "reformat-phone-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40313, "totalSubmissionRaw": 60901}, "1695": {"acRate": 58.49757425416547, "difficulty": "Medium", "likes": 2805, "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": 133237, "totalSubmissionRaw": 227765}, "1696": {"acRate": 45.656337699757664, "difficulty": "Medium", "likes": 3417, "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": 109651, "totalSubmissionRaw": 240166}, "1697": {"acRate": 62.59000563096792, "difficulty": "Hard", "likes": 1969, "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": 52242, "totalSubmissionRaw": 83467}, "1698": {"acRate": 64.36248444394163, "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": 11378, "totalSubmissionRaw": 17678}, "1699": {"acRate": 81.21205348828548, "difficulty": "Medium", "likes": 293, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "1699", "paidOnly": true, "title": "Number of Calls Between Two Persons", "titleSlug": "number-of-calls-between-two-persons", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43606, "totalSubmissionRaw": 53694}, "1700": {"acRate": 78.33723264554497, "difficulty": "Easy", "likes": 2412, "dislikes": 242, "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": 259496, "totalSubmissionRaw": 331255}, "1701": {"acRate": 73.04644267677422, "difficulty": "Medium", "likes": 1216, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1701", "paidOnly": false, "title": "Average Waiting Time", "titleSlug": "average-waiting-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 197343, "totalSubmissionRaw": 270161}, "1702": {"acRate": 47.04511973688718, "difficulty": "Medium", "likes": 499, "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": 13732, "totalSubmissionRaw": 29189}, "1703": {"acRate": 42.580022996179665, "difficulty": "Hard", "likes": 714, "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": 11480, "totalSubmissionRaw": 26961}, "1704": {"acRate": 78.6615153187667, "difficulty": "Easy", "likes": 2254, "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": 363427, "totalSubmissionRaw": 462013}, "1705": {"acRate": 39.45807939383956, "difficulty": "Medium", "likes": 832, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1705", "paidOnly": false, "title": "Maximum Number of Eaten Apples", "titleSlug": "maximum-number-of-eaten-apples", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23955, "totalSubmissionRaw": 60710}, "1706": {"acRate": 71.8890858445176, "difficulty": "Medium", "likes": 3094, "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": 141945, "totalSubmissionRaw": 197450}, "1707": {"acRate": 51.656608685362684, "difficulty": "Hard", "likes": 1228, "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": 26193, "totalSubmissionRaw": 50706}, "1708": {"acRate": 65.08766759982319, "difficulty": "Easy", "likes": 104, "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": 8835, "totalSubmissionRaw": 13574}, "1709": {"acRate": 70.40175226237824, "difficulty": "Medium", "likes": 211, "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": 24428, "totalSubmissionRaw": 34698}, "1710": {"acRate": 73.7824140413746, "difficulty": "Easy", "likes": 3833, "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": 314606, "totalSubmissionRaw": 426397}, "1711": {"acRate": 30.515300340007556, "difficulty": "Medium", "likes": 1048, "dislikes": 238, "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": 40387, "totalSubmissionRaw": 132350}, "1712": {"acRate": 33.0763102766604, "difficulty": "Medium", "likes": 1408, "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": 33631, "totalSubmissionRaw": 101677}, "1713": {"acRate": 47.73464003015454, "difficulty": "Hard", "likes": 721, "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": 12664, "totalSubmissionRaw": 26530}, "1714": {"acRate": 49.73767051416579, "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": 1422, "totalSubmissionRaw": 2859}, "1715": {"acRate": 75.63529075854193, "difficulty": "Medium", "likes": 83, "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": 15894, "totalSubmissionRaw": 21014}, "1716": {"acRate": 78.39819325635813, "difficulty": "Easy", "likes": 1438, "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": 163501, "totalSubmissionRaw": 208552}, "1717": {"acRate": 63.02981309323038, "difficulty": "Medium", "likes": 1408, "dislikes": 116, "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": 135666, "totalSubmissionRaw": 215241}, "1718": {"acRate": 54.05234354640557, "difficulty": "Medium", "likes": 567, "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": 14519, "totalSubmissionRaw": 26861}, "1719": {"acRate": 44.688298174250306, "difficulty": "Hard", "likes": 219, "dislikes": 154, "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": 4724, "totalSubmissionRaw": 10571}, "1720": {"acRate": 86.56085340926863, "difficulty": "Easy", "likes": 1597, "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": 160502, "totalSubmissionRaw": 185421}, "1721": {"acRate": 68.01893027746037, "difficulty": "Medium", "likes": 5373, "dislikes": 183, "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": 352985, "totalSubmissionRaw": 518951}, "1722": {"acRate": 48.97363019106269, "difficulty": "Medium", "likes": 844, "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": 18609, "totalSubmissionRaw": 37998}, "1723": {"acRate": 42.51816984176325, "difficulty": "Hard", "likes": 1051, "dislikes": 31, "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": 28724, "totalSubmissionRaw": 67557}, "1724": {"acRate": 51.28034585966079, "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": 3084, "totalSubmissionRaw": 6014}, "1725": {"acRate": 78.83120621821323, "difficulty": "Easy", "likes": 592, "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": 73935, "totalSubmissionRaw": 93789}, "1726": {"acRate": 61.23568146689534, "difficulty": "Medium", "likes": 629, "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": 28921, "totalSubmissionRaw": 47229}, "1727": {"acRate": 75.37496394577444, "difficulty": "Medium", "likes": 1917, "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": 73171, "totalSubmissionRaw": 97076}, "1728": {"acRate": 40.02478314745972, "difficulty": "Hard", "likes": 271, "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": 7429, "totalSubmissionRaw": 18561}, "1729": {"acRate": 69.16084427698723, "difficulty": "Easy", "likes": 586, "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": 226877, "totalSubmissionRaw": 328043}, "1730": {"acRate": 55.08811027196566, "difficulty": "Medium", "likes": 676, "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": 66742, "totalSubmissionRaw": 121155}, "1731": {"acRate": 49.264220920851216, "difficulty": "Easy", "likes": 549, "dislikes": 73, "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": 160592, "totalSubmissionRaw": 325981}, "1732": {"acRate": 83.46872605965022, "difficulty": "Easy", "likes": 2899, "dislikes": 349, "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": 445622, "totalSubmissionRaw": 533878}, "1733": {"acRate": 43.002222900231004, "difficulty": "Medium", "likes": 216, "dislikes": 398, "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": 9866, "totalSubmissionRaw": 22943}, "1734": {"acRate": 65.30505683415673, "difficulty": "Medium", "likes": 766, "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": 16259, "totalSubmissionRaw": 24897}, "1735": {"acRate": 51.96922058580176, "difficulty": "Hard", "likes": 291, "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": 6281, "totalSubmissionRaw": 12086}, "1736": {"acRate": 42.894202571621925, "difficulty": "Easy", "likes": 368, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1736", "paidOnly": false, "title": "Latest Time by Replacing Hidden Digits", "titleSlug": "latest-time-by-replacing-hidden-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38030, "totalSubmissionRaw": 88660}, "1737": {"acRate": 36.85978169605374, "difficulty": "Medium", "likes": 323, "dislikes": 342, "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": 14048, "totalSubmissionRaw": 38112}, "1738": {"acRate": 61.96119251608082, "difficulty": "Medium", "likes": 509, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1738", "paidOnly": false, "title": "Find Kth Largest XOR Coordinate Value", "titleSlug": "find-kth-largest-xor-coordinate-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23215, "totalSubmissionRaw": 37467}, "1739": {"acRate": 51.8896422098409, "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": 7730, "totalSubmissionRaw": 14897}, "1740": {"acRate": 73.57234915055653, "difficulty": "Medium", "likes": 461, "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": 31397, "totalSubmissionRaw": 42675}, "1741": {"acRate": 86.84927252311442, "difficulty": "Easy", "likes": 717, "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": 145410, "totalSubmissionRaw": 167428}, "1742": {"acRate": 73.60511485350823, "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": 67002, "totalSubmissionRaw": 91029}, "1743": {"acRate": 74.77566956640865, "difficulty": "Medium", "likes": 1958, "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": 109165, "totalSubmissionRaw": 145990}, "1744": {"acRate": 34.541717275530225, "difficulty": "Medium", "likes": 132, "dislikes": 330, "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": 11091, "totalSubmissionRaw": 32109}, "1745": {"acRate": 44.43256090314914, "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": 26173, "totalSubmissionRaw": 58905}, "1746": {"acRate": 62.346630908481394, "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": 9299, "totalSubmissionRaw": 14915}, "1747": {"acRate": 63.438505046024176, "difficulty": "Medium", "likes": 187, "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": 22881, "totalSubmissionRaw": 36068}, "1748": {"acRate": 78.17189223389794, "difficulty": "Easy", "likes": 1557, "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": 182855, "totalSubmissionRaw": 233914}, "1749": {"acRate": 60.377139373176355, "difficulty": "Medium", "likes": 1276, "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": 41592, "totalSubmissionRaw": 68887}, "1750": {"acRate": 55.9389172549691, "difficulty": "Medium", "likes": 1218, "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": 166636, "totalSubmissionRaw": 297886}, "1751": {"acRate": 61.40366396989047, "difficulty": "Hard", "likes": 2080, "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": 76353, "totalSubmissionRaw": 124346}, "1752": {"acRate": 51.47465571956794, "difficulty": "Easy", "likes": 3242, "dislikes": 189, "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": 300558, "totalSubmissionRaw": 583892}, "1753": {"acRate": 67.45408051891353, "difficulty": "Medium", "likes": 946, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1753", "paidOnly": false, "title": "Maximum Score From Removing Stones", "titleSlug": "maximum-score-from-removing-stones", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43261, "totalSubmissionRaw": 64134}, "1754": {"acRate": 48.791311219630806, "difficulty": "Medium", "likes": 547, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1754", "paidOnly": false, "title": "Largest Merge Of Two Strings", "titleSlug": "largest-merge-of-two-strings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24079, "totalSubmissionRaw": 49351}, "1755": {"acRate": 39.89567558472152, "difficulty": "Hard", "likes": 908, "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": 18967, "totalSubmissionRaw": 47543}, "1756": {"acRate": 75.74392110185343, "difficulty": "Medium", "likes": 290, "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": 17818, "totalSubmissionRaw": 23524}, "1757": {"acRate": 89.29890520986477, "difficulty": "Easy", "likes": 2424, "dislikes": 109, "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": 1240303, "totalSubmissionRaw": 1388935}, "1758": {"acRate": 63.7646938042195, "difficulty": "Easy", "likes": 1431, "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": 149064, "totalSubmissionRaw": 233772}, "1759": {"acRate": 57.65909817716661, "difficulty": "Medium", "likes": 1485, "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": 113589, "totalSubmissionRaw": 197001}, "1760": {"acRate": 60.36750426646266, "difficulty": "Medium", "likes": 1997, "dislikes": 50, "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": 41033, "totalSubmissionRaw": 67972}, "1761": {"acRate": 42.67434192938996, "difficulty": "Hard", "likes": 323, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "1761", "paidOnly": false, "title": "Minimum Degree of a Connected Trio in a Graph", "titleSlug": "minimum-degree-of-a-connected-trio-in-a-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23945, "totalSubmissionRaw": 56111}, "1762": {"acRate": 79.87134050508958, "difficulty": "Medium", "likes": 1218, "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": 229195, "totalSubmissionRaw": 286955}, "1763": {"acRate": 60.88218941125595, "difficulty": "Easy", "likes": 1344, "dislikes": 887, "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": 59129, "totalSubmissionRaw": 97121}, "1764": {"acRate": 53.75892620999736, "difficulty": "Medium", "likes": 332, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1764", "paidOnly": false, "title": "Form Array by Concatenating Subarrays of Another Array", "titleSlug": "form-array-by-concatenating-subarrays-of-another-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16261, "totalSubmissionRaw": 30248}, "1765": {"acRate": 62.90058326233699, "difficulty": "Medium", "likes": 830, "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": 28794, "totalSubmissionRaw": 45777}, "1766": {"acRate": 41.39531130210225, "difficulty": "Hard", "likes": 403, "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": 10259, "totalSubmissionRaw": 24783}, "1767": {"acRate": 77.48897921795385, "difficulty": "Hard", "likes": 174, "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": 13535, "totalSubmissionRaw": 17467}, "1768": {"acRate": 80.6122909900859, "difficulty": "Easy", "likes": 3941, "dislikes": 101, "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": 1035076, "totalSubmissionRaw": 1284019}, "1769": {"acRate": 85.95307707835464, "difficulty": "Medium", "likes": 2256, "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": 131999, "totalSubmissionRaw": 153571}, "1770": {"acRate": 40.81660840832546, "difficulty": "Hard", "likes": 2524, "dislikes": 512, "categoryTitle": "Algorithms", "frontendQuestionId": "1770", "paidOnly": false, "title": "Maximum Score from Performing Multiplication Operations", "titleSlug": "maximum-score-from-performing-multiplication-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115251, "totalSubmissionRaw": 282363}, "1771": {"acRate": 36.58482914715036, "difficulty": "Hard", "likes": 540, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1771", "paidOnly": false, "title": "Maximize Palindrome Length From Subsequences", "titleSlug": "maximize-palindrome-length-from-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11638, "totalSubmissionRaw": 31811}, "1772": {"acRate": 65.92943654555029, "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": 6260, "totalSubmissionRaw": 9495}, "1773": {"acRate": 84.67438018892885, "difficulty": "Easy", "likes": 1898, "dislikes": 233, "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": 236819, "totalSubmissionRaw": 279682}, "1774": {"acRate": 47.68956450784248, "difficulty": "Medium", "likes": 709, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1774", "paidOnly": false, "title": "Closest Dessert Cost", "titleSlug": "closest-dessert-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31560, "totalSubmissionRaw": 66178}, "1775": {"acRate": 53.80880391285016, "difficulty": "Medium", "likes": 923, "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": 30254, "totalSubmissionRaw": 56225}, "1776": {"acRate": 55.53754390340212, "difficulty": "Hard", "likes": 894, "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": 26723, "totalSubmissionRaw": 48117}, "1777": {"acRate": 82.27966365618188, "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": 21136, "totalSubmissionRaw": 25688}, "1778": {"acRate": 40.40168825498472, "difficulty": "Medium", "likes": 167, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1778", "paidOnly": true, "title": "Shortest Path in a Hidden Grid", "titleSlug": "shortest-path-in-a-hidden-grid", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8328, "totalSubmissionRaw": 20613}, "1779": {"acRate": 68.76109709372956, "difficulty": "Easy", "likes": 845, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1779", "paidOnly": false, "title": "Find Nearest Point That Has the Same X or Y Coordinate", "titleSlug": "find-nearest-point-that-has-the-same-x-or-y-coordinate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117729, "totalSubmissionRaw": 171215}, "1780": {"acRate": 68.02071133575788, "difficulty": "Medium", "likes": 976, "dislikes": 33, "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": 44140, "totalSubmissionRaw": 64892}, "1781": {"acRate": 67.45283018867924, "difficulty": "Medium", "likes": 1127, "dislikes": 179, "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": 67065, "totalSubmissionRaw": 99426}, "1782": {"acRate": 40.54824186470622, "difficulty": "Hard", "likes": 315, "dislikes": 164, "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": 7115, "totalSubmissionRaw": 17547}, "1783": {"acRate": 83.53467135926948, "difficulty": "Medium", "likes": 233, "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": 26346, "totalSubmissionRaw": 31539}, "1784": {"acRate": 39.242867655867606, "difficulty": "Easy", "likes": 338, "dislikes": 971, "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": 45860, "totalSubmissionRaw": 116862}, "1785": {"acRate": 43.733385457388586, "difficulty": "Medium", "likes": 266, "dislikes": 193, "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": 22374, "totalSubmissionRaw": 51160}, "1786": {"acRate": 39.316463104717606, "difficulty": "Medium", "likes": 1099, "dislikes": 212, "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": 25527, "totalSubmissionRaw": 64927}, "1787": {"acRate": 39.840810419681624, "difficulty": "Hard", "likes": 401, "dislikes": 23, "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": 5506, "totalSubmissionRaw": 13820}, "1788": {"acRate": 66.85912240184757, "difficulty": "Hard", "likes": 76, "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": 2316, "totalSubmissionRaw": 3464}, "1789": {"acRate": 65.22835768366527, "difficulty": "Easy", "likes": 520, "dislikes": 223, "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": 144563, "totalSubmissionRaw": 221626}, "1790": {"acRate": 45.8471707238433, "difficulty": "Easy", "likes": 1095, "dislikes": 60, "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": 113753, "totalSubmissionRaw": 248117}, "1791": {"acRate": 86.65656027437353, "difficulty": "Easy", "likes": 1801, "dislikes": 175, "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": 346407, "totalSubmissionRaw": 399747}, "1792": {"acRate": 54.226106837505064, "difficulty": "Medium", "likes": 728, "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": 22769, "totalSubmissionRaw": 41989}, "1793": {"acRate": 64.31016169007435, "difficulty": "Hard", "likes": 1862, "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": 76286, "totalSubmissionRaw": 118622}, "1794": {"acRate": 65.27465467394796, "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": 2032, "totalSubmissionRaw": 3113}, "1795": {"acRate": 85.36821344844267, "difficulty": "Easy", "likes": 858, "dislikes": 56, "categoryTitle": "Database", "frontendQuestionId": "1795", "paidOnly": false, "title": "Rearrange Products Table", "titleSlug": "rearrange-products-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137646, "totalSubmissionRaw": 161238}, "1796": {"acRate": 50.73305305239161, "difficulty": "Easy", "likes": 532, "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": 61422, "totalSubmissionRaw": 121069}, "1797": {"acRate": 57.69896193771626, "difficulty": "Medium", "likes": 377, "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": 32016, "totalSubmissionRaw": 55488}, "1798": {"acRate": 61.1839336179424, "difficulty": "Medium", "likes": 817, "dislikes": 60, "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": 20351, "totalSubmissionRaw": 33262}, "1799": {"acRate": 57.7284507672515, "difficulty": "Hard", "likes": 1633, "dislikes": 112, "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": 61922, "totalSubmissionRaw": 107264}, "1800": {"acRate": 62.00883780755985, "difficulty": "Easy", "likes": 724, "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": 59779, "totalSubmissionRaw": 96404}, "1801": {"acRate": 49.96702072008552, "difficulty": "Medium", "likes": 294, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1801", "paidOnly": false, "title": "Number of Orders in the Backlog", "titleSlug": "number-of-orders-in-the-backlog", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21969, "totalSubmissionRaw": 43967}, "1802": {"acRate": 39.196605076570286, "difficulty": "Medium", "likes": 2548, "dislikes": 453, "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": 74353, "totalSubmissionRaw": 189692}, "1803": {"acRate": 48.229291716686674, "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": 9642, "totalSubmissionRaw": 19992}, "1804": {"acRate": 61.47296859825187, "difficulty": "Medium", "likes": 321, "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": 18989, "totalSubmissionRaw": 30890}, "1805": {"acRate": 38.16992066703826, "difficulty": "Easy", "likes": 613, "dislikes": 102, "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": 49990, "totalSubmissionRaw": 130967}, "1806": {"acRate": 72.8752192900601, "difficulty": "Medium", "likes": 320, "dislikes": 171, "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": 19524, "totalSubmissionRaw": 26791}, "1807": {"acRate": 67.1198176137803, "difficulty": "Medium", "likes": 482, "dislikes": 42, "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": 31796, "totalSubmissionRaw": 47372}, "1808": {"acRate": 33.423266873971095, "difficulty": "Hard", "likes": 225, "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": 7309, "totalSubmissionRaw": 21868}, "1809": {"acRate": 58.565522200251664, "difficulty": "Easy", "likes": 90, "dislikes": 61, "categoryTitle": "Database", "frontendQuestionId": "1809", "paidOnly": true, "title": "Ad-Free Sessions", "titleSlug": "ad-free-sessions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16290, "totalSubmissionRaw": 27815}, "1810": {"acRate": 56.932495036399736, "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": 3441, "totalSubmissionRaw": 6044}, "1811": {"acRate": 60.92575548396994, "difficulty": "Medium", "likes": 198, "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": 15887, "totalSubmissionRaw": 26076}, "1812": {"acRate": 78.7112861127804, "difficulty": "Easy", "likes": 817, "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": 87755, "totalSubmissionRaw": 111489}, "1813": {"acRate": 33.696104781012224, "difficulty": "Medium", "likes": 404, "dislikes": 70, "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": 17803, "totalSubmissionRaw": 52834}, "1814": {"acRate": 48.70674367383756, "difficulty": "Medium", "likes": 1829, "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": 111235, "totalSubmissionRaw": 228377}, "1815": {"acRate": 40.06275531348055, "difficulty": "Hard", "likes": 341, "dislikes": 29, "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": 6767, "totalSubmissionRaw": 16891}, "1816": {"acRate": 85.56562354040167, "difficulty": "Easy", "likes": 1142, "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": 183196, "totalSubmissionRaw": 214100}, "1817": {"acRate": 80.50600411863817, "difficulty": "Medium", "likes": 828, "dislikes": 307, "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": 60204, "totalSubmissionRaw": 74782}, "1818": {"acRate": 30.8411214953271, "difficulty": "Medium", "likes": 1022, "dislikes": 77, "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": 26004, "totalSubmissionRaw": 84316}, "1819": {"acRate": 41.15665356541269, "difficulty": "Hard", "likes": 413, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1819", "paidOnly": false, "title": "Number of Different Subsequences GCDs", "titleSlug": "number-of-different-subsequences-gcds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9529, "totalSubmissionRaw": 23153}, "1820": {"acRate": 50.43493697851944, "difficulty": "Medium", "likes": 215, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1820", "paidOnly": true, "title": "Maximum Number of Accepted Invitations", "titleSlug": "maximum-number-of-accepted-invitations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8523, "totalSubmissionRaw": 16899}, "1821": {"acRate": 87.7163972598117, "difficulty": "Easy", "likes": 60, "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": 25992, "totalSubmissionRaw": 29632}, "1822": {"acRate": 65.32356828234892, "difficulty": "Easy", "likes": 2167, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "1822", "paidOnly": false, "title": "Sign of the Product of an Array", "titleSlug": "sign-of-the-product-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 350442, "totalSubmissionRaw": 536471}, "1823": {"acRate": 81.74840252900154, "difficulty": "Medium", "likes": 3781, "dislikes": 109, "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": 291178, "totalSubmissionRaw": 356187}, "1824": {"acRate": 50.3016937388754, "difficulty": "Medium", "likes": 1193, "dislikes": 49, "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": 44933, "totalSubmissionRaw": 89328}, "1825": {"acRate": 37.31448635343517, "difficulty": "Hard", "likes": 465, "dislikes": 130, "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": 20617, "totalSubmissionRaw": 55252}, "1826": {"acRate": 50.19975843166403, "difficulty": "Easy", "likes": 67, "dislikes": 78, "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": 5403, "totalSubmissionRaw": 10763}, "1827": {"acRate": 80.15496966285106, "difficulty": "Easy", "likes": 1234, "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": 102515, "totalSubmissionRaw": 127896}, "1828": {"acRate": 86.38009830128482, "difficulty": "Medium", "likes": 1144, "dislikes": 84, "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": 80139, "totalSubmissionRaw": 92775}, "1829": {"acRate": 77.21611169705189, "difficulty": "Medium", "likes": 777, "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": 30747, "totalSubmissionRaw": 39820}, "1830": {"acRate": 50.174299795648515, "difficulty": "Hard", "likes": 180, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1830", "paidOnly": false, "title": "Minimum Number of Operations to Make String Sorted", "titleSlug": "minimum-number-of-operations-to-make-string-sorted", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4174, "totalSubmissionRaw": 8319}, "1831": {"acRate": 81.8545778065351, "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": 20241, "totalSubmissionRaw": 24728}, "1832": {"acRate": 83.40078570222707, "difficulty": "Easy", "likes": 2779, "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": 365574, "totalSubmissionRaw": 438334}, "1833": {"acRate": 73.86178306227507, "difficulty": "Medium", "likes": 2177, "dislikes": 674, "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": 162134, "totalSubmissionRaw": 219510}, "1834": {"acRate": 45.72799356469777, "difficulty": "Medium", "likes": 3177, "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": 111419, "totalSubmissionRaw": 243656}, "1835": {"acRate": 61.623363064164906, "difficulty": "Hard", "likes": 604, "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": 20658, "totalSubmissionRaw": 33523}, "1836": {"acRate": 74.50573642098132, "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": 35197, "totalSubmissionRaw": 47241}, "1837": {"acRate": 77.58736019692834, "difficulty": "Easy", "likes": 510, "dislikes": 46, "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": 57995, "totalSubmissionRaw": 74748}, "1838": {"acRate": 44.16172581767571, "difficulty": "Medium", "likes": 4678, "dislikes": 219, "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": 158651, "totalSubmissionRaw": 359250}, "1839": {"acRate": 49.54194901824658, "difficulty": "Medium", "likes": 758, "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": 32826, "totalSubmissionRaw": 66259}, "1840": {"acRate": 36.46368660913411, "difficulty": "Hard", "likes": 377, "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": 7521, "totalSubmissionRaw": 20626}, "1841": {"acRate": 53.37095907241035, "difficulty": "Medium", "likes": 108, "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": 13899, "totalSubmissionRaw": 26041}, "1842": {"acRate": 53.33211277920176, "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": 5826, "totalSubmissionRaw": 10924}, "1843": {"acRate": 44.88161826679948, "difficulty": "Medium", "likes": 94, "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": 11715, "totalSubmissionRaw": 26102}, "1844": {"acRate": 81.59940631846774, "difficulty": "Easy", "likes": 835, "dislikes": 109, "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": 92364, "totalSubmissionRaw": 113192}, "1845": {"acRate": 69.45834803316282, "difficulty": "Medium", "likes": 1417, "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": 126003, "totalSubmissionRaw": 181408}, "1846": {"acRate": 65.87095690475746, "difficulty": "Medium", "likes": 1083, "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": 105879, "totalSubmissionRaw": 160737}, "1847": {"acRate": 38.67159264316119, "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": 9630, "totalSubmissionRaw": 24902}, "1848": {"acRate": 54.49151468368723, "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": 47297, "totalSubmissionRaw": 86797}, "1849": {"acRate": 36.09635139922069, "difficulty": "Medium", "likes": 526, "dislikes": 118, "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": 27513, "totalSubmissionRaw": 76221}, "1850": {"acRate": 71.34628773973036, "difficulty": "Medium", "likes": 776, "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": 22544, "totalSubmissionRaw": 31598}, "1851": {"acRate": 50.45934349416936, "difficulty": "Hard", "likes": 967, "dislikes": 36, "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": 38338, "totalSubmissionRaw": 75978}, "1852": {"acRate": 71.57627596578627, "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": 7615, "totalSubmissionRaw": 10639}, "1853": {"acRate": 85.80373115256836, "difficulty": "Easy", "likes": 64, "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": 13430, "totalSubmissionRaw": 15652}, "1854": {"acRate": 61.16234643127697, "difficulty": "Easy", "likes": 1317, "dislikes": 237, "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": 74278, "totalSubmissionRaw": 121444}, "1855": {"acRate": 53.55618924713278, "difficulty": "Medium", "likes": 1201, "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": 51460, "totalSubmissionRaw": 96086}, "1856": {"acRate": 38.27094450895711, "difficulty": "Medium", "likes": 1441, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "1856", "paidOnly": false, "title": "Maximum Subarray Min-Product", "titleSlug": "maximum-subarray-min-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29332, "totalSubmissionRaw": 76643}, "1857": {"acRate": 49.879108284964325, "difficulty": "Hard", "likes": 2134, "dislikes": 70, "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": 67459, "totalSubmissionRaw": 135245}, "1858": {"acRate": 68.71139327385038, "difficulty": "Medium", "likes": 180, "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": 8009, "totalSubmissionRaw": 11656}, "1859": {"acRate": 83.3350503877421, "difficulty": "Easy", "likes": 2206, "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": 177957, "totalSubmissionRaw": 213544}, "1860": {"acRate": 72.33676384538602, "difficulty": "Medium", "likes": 224, "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": 21016, "totalSubmissionRaw": 29053}, "1861": {"acRate": 67.87171364829719, "difficulty": "Medium", "likes": 985, "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": 55065, "totalSubmissionRaw": 81131}, "1862": {"acRate": 28.994011251587924, "difficulty": "Hard", "likes": 444, "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": 9586, "totalSubmissionRaw": 33062}, "1863": {"acRate": 87.76236552506323, "difficulty": "Easy", "likes": 2163, "dislikes": 254, "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": 184938, "totalSubmissionRaw": 210726}, "1864": {"acRate": 43.49467690022283, "difficulty": "Medium", "likes": 585, "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": 28108, "totalSubmissionRaw": 64624}, "1865": {"acRate": 51.06284746936498, "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": 26544, "totalSubmissionRaw": 51983}, "1866": {"acRate": 57.80563550977125, "difficulty": "Hard", "likes": 710, "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": 15263, "totalSubmissionRaw": 26404}, "1867": {"acRate": 71.1207265872676, "difficulty": "Medium", "likes": 73, "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": 16601, "totalSubmissionRaw": 23342}, "1868": {"acRate": 58.63168465980417, "difficulty": "Medium", "likes": 370, "dislikes": 68, "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": 46706, "totalSubmissionRaw": 79660}, "1869": {"acRate": 61.32380695605284, "difficulty": "Easy", "likes": 517, "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": 50039, "totalSubmissionRaw": 81598}, "1870": {"acRate": 46.865195956376674, "difficulty": "Medium", "likes": 2313, "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": 103521, "totalSubmissionRaw": 220891}, "1871": {"acRate": 24.97913382175647, "difficulty": "Medium", "likes": 1677, "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": 48483, "totalSubmissionRaw": 194094}, "1872": {"acRate": 53.23021885521886, "difficulty": "Hard", "likes": 449, "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": 10118, "totalSubmissionRaw": 19008}, "1873": {"acRate": 57.55860153261118, "difficulty": "Easy", "likes": 1081, "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": 249896, "totalSubmissionRaw": 434160}, "1874": {"acRate": 89.44763942757791, "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": 20064, "totalSubmissionRaw": 22431}, "1875": {"acRate": 67.40700218818381, "difficulty": "Medium", "likes": 75, "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": 12322, "totalSubmissionRaw": 18280}, "1876": {"acRate": 73.9902094463196, "difficulty": "Easy", "likes": 1514, "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": 132404, "totalSubmissionRaw": 178948}, "1877": {"acRate": 81.45307163022841, "difficulty": "Medium", "likes": 1954, "dislikes": 442, "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": 181475, "totalSubmissionRaw": 222797}, "1878": {"acRate": 48.137881161865735, "difficulty": "Medium", "likes": 208, "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": 15976, "totalSubmissionRaw": 33188}, "1879": {"acRate": 47.918859439288106, "difficulty": "Hard", "likes": 677, "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": 15024, "totalSubmissionRaw": 31353}, "1880": {"acRate": 74.33513629304343, "difficulty": "Easy", "likes": 575, "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": 69403, "totalSubmissionRaw": 93365}, "1881": {"acRate": 38.18718013145192, "difficulty": "Medium", "likes": 381, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1881", "paidOnly": false, "title": "Maximum Value after Insertion", "titleSlug": "maximum-value-after-insertion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28876, "totalSubmissionRaw": 75617}, "1882": {"acRate": 40.35422218138381, "difficulty": "Medium", "likes": 927, "dislikes": 272, "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": 35134, "totalSubmissionRaw": 87064}, "1883": {"acRate": 37.93139786079351, "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": 7199, "totalSubmissionRaw": 18979}, "1884": {"acRate": 73.14475443059808, "difficulty": "Medium", "likes": 1460, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "1884", "paidOnly": false, "title": "Egg Drop With 2 Eggs and N Floors", "titleSlug": "egg-drop-with-2-eggs-and-n-floors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50889, "totalSubmissionRaw": 69573}, "1885": {"acRate": 60.90761204913895, "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": 10858, "totalSubmissionRaw": 17827}, "1886": {"acRate": 57.25277655769593, "difficulty": "Easy", "likes": 1440, "dislikes": 124, "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": 72995, "totalSubmissionRaw": 127496}, "1887": {"acRate": 72.87886741067014, "difficulty": "Medium", "likes": 1226, "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": 95800, "totalSubmissionRaw": 131451}, "1888": {"acRate": 40.061803487282745, "difficulty": "Medium", "likes": 1215, "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": 28651, "totalSubmissionRaw": 71517}, "1889": {"acRate": 31.986507474276838, "difficulty": "Hard", "likes": 405, "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": 13181, "totalSubmissionRaw": 41208}, "1890": {"acRate": 77.31784372745591, "difficulty": "Easy", "likes": 409, "dislikes": 12, "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": 93243, "totalSubmissionRaw": 120597}, "1891": {"acRate": 49.705457717934266, "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": 64380, "totalSubmissionRaw": 129523}, "1892": {"acRate": 43.738956296383556, "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": 7426, "totalSubmissionRaw": 16978}, "1893": {"acRate": 50.03673612811858, "difficulty": "Easy", "likes": 603, "dislikes": 115, "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": 46991, "totalSubmissionRaw": 93913}, "1894": {"acRate": 53.34433590555629, "difficulty": "Medium", "likes": 1139, "dislikes": 129, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 179384, "totalSubmissionRaw": 336273}, "1895": {"acRate": 53.10038727644576, "difficulty": "Medium", "likes": 305, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "1895", "paidOnly": false, "title": "Largest Magic Square", "titleSlug": "largest-magic-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12203, "totalSubmissionRaw": 22981}, "1896": {"acRate": 54.181585677749354, "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": 4237, "totalSubmissionRaw": 7820}, "1897": {"acRate": 67.17828129657404, "difficulty": "Easy", "likes": 1103, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1897", "paidOnly": false, "title": "Redistribute Characters to Make All Strings Equal", "titleSlug": "redistribute-characters-to-make-all-strings-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141986, "totalSubmissionRaw": 211357}, "1898": {"acRate": 44.13221990257481, "difficulty": "Medium", "likes": 978, "dislikes": 130, "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": 31709, "totalSubmissionRaw": 71850}, "1899": {"acRate": 66.40979502425286, "difficulty": "Medium", "likes": 807, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1899", "paidOnly": false, "title": "Merge Triplets to Form Target Triplet", "titleSlug": "merge-triplets-to-form-target-triplet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 67908, "totalSubmissionRaw": 102256}, "1900": {"acRate": 51.0553851704853, "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": 5660, "totalSubmissionRaw": 11086}, "1901": {"acRate": 52.08201304753028, "difficulty": "Medium", "likes": 2099, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "1901", "paidOnly": false, "title": "Find a Peak Element II", "titleSlug": "find-a-peak-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83826, "totalSubmissionRaw": 160950}, "1902": {"acRate": 44.14414414414414, "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": 2401, "totalSubmissionRaw": 5439}, "1903": {"acRate": 63.67818444262049, "difficulty": "Easy", "likes": 2078, "dislikes": 128, "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": 292486, "totalSubmissionRaw": 459319}, "1904": {"acRate": 43.92565200467108, "difficulty": "Medium", "likes": 214, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "1904", "paidOnly": false, "title": "The Number of Full Rounds You Have Played", "titleSlug": "the-number-of-full-rounds-you-have-played", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22569, "totalSubmissionRaw": 51380}, "1905": {"acRate": 72.8575961121773, "difficulty": "Medium", "likes": 2505, "dislikes": 88, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 188295, "totalSubmissionRaw": 258443}, "1906": {"acRate": 44.67046379170057, "difficulty": "Medium", "likes": 534, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1906", "paidOnly": false, "title": "Minimum Absolute Difference Queries", "titleSlug": "minimum-absolute-difference-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11529, "totalSubmissionRaw": 25809}, "1907": {"acRate": 60.705770624547014, "difficulty": "Medium", "likes": 459, "dislikes": 86, "categoryTitle": "Database", "frontendQuestionId": "1907", "paidOnly": false, "title": "Count Salary Categories", "titleSlug": "count-salary-categories", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 121451, "totalSubmissionRaw": 200065}, "1908": {"acRate": 63.10383120488618, "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": 4546, "totalSubmissionRaw": 7204}, "1909": {"acRate": 27.81819861877232, "difficulty": "Easy", "likes": 1249, "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": 69241, "totalSubmissionRaw": 248907}, "1910": {"acRate": 77.86476572608888, "difficulty": "Medium", "likes": 1795, "dislikes": 61, "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": 131185, "totalSubmissionRaw": 168478}, "1911": {"acRate": 58.9980157293281, "difficulty": "Medium", "likes": 1245, "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": 40734, "totalSubmissionRaw": 69043}, "1912": {"acRate": 36.635859519408505, "difficulty": "Hard", "likes": 243, "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": 6937, "totalSubmissionRaw": 18935}, "1913": {"acRate": 82.86998344753127, "difficulty": "Easy", "likes": 1523, "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": 254831, "totalSubmissionRaw": 307507}, "1914": {"acRate": 49.812202974091676, "difficulty": "Medium", "likes": 239, "dislikes": 272, "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": 12997, "totalSubmissionRaw": 26092}, "1915": {"acRate": 66.9472079589217, "difficulty": "Medium", "likes": 1732, "dislikes": 272, "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": 83443, "totalSubmissionRaw": 124640}, "1916": {"acRate": 49.33881683011705, "difficulty": "Hard", "likes": 487, "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": 7798, "totalSubmissionRaw": 15805}, "1917": {"acRate": 27.05264871022866, "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": 6649, "totalSubmissionRaw": 24578}, "1918": {"acRate": 53.032806230823695, "difficulty": "Medium", "likes": 206, "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": 4494, "totalSubmissionRaw": 8474}, "1919": {"acRate": 41.69164412603261, "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": 5703, "totalSubmissionRaw": 13679}, "1920": {"acRate": 90.0129468574446, "difficulty": "Easy", "likes": 3385, "dislikes": 405, "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": 565933, "totalSubmissionRaw": 628724}, "1921": {"acRate": 50.913800746185956, "difficulty": "Medium", "likes": 1508, "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": 110263, "totalSubmissionRaw": 216568}, "1922": {"acRate": 46.45672651891595, "difficulty": "Medium", "likes": 1452, "dislikes": 443, "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": 76196, "totalSubmissionRaw": 164015}, "1923": {"acRate": 28.52040064810723, "difficulty": "Hard", "likes": 478, "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": 7745, "totalSubmissionRaw": 27156}, "1924": {"acRate": 50.65472088215024, "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": 735, "totalSubmissionRaw": 1451}, "1925": {"acRate": 68.05347058403031, "difficulty": "Easy", "likes": 426, "dislikes": 41, "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": 47600, "totalSubmissionRaw": 69945}, "1926": {"acRate": 46.90911355709562, "difficulty": "Medium", "likes": 2332, "dislikes": 112, "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": 165697, "totalSubmissionRaw": 353231}, "1927": {"acRate": 47.905749000427, "difficulty": "Medium", "likes": 500, "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": 12341, "totalSubmissionRaw": 25761}, "1928": {"acRate": 38.60560158974167, "difficulty": "Hard", "likes": 792, "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": 20593, "totalSubmissionRaw": 53342}, "1929": {"acRate": 90.08569305075306, "difficulty": "Easy", "likes": 3370, "dislikes": 398, "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": 850890, "totalSubmissionRaw": 944534}, "1930": {"acRate": 66.09746269750177, "difficulty": "Medium", "likes": 1730, "dislikes": 77, "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": 108265, "totalSubmissionRaw": 163796}, "1931": {"acRate": 57.80590717299579, "difficulty": "Hard", "likes": 481, "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": 9727, "totalSubmissionRaw": 16827}, "1932": {"acRate": 36.42021507070548, "difficulty": "Hard", "likes": 580, "dislikes": 41, "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": 9246, "totalSubmissionRaw": 25387}, "1933": {"acRate": 50.77540106951872, "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": 3798, "totalSubmissionRaw": 7480}, "1934": {"acRate": 59.290127406219895, "difficulty": "Medium", "likes": 917, "dislikes": 82, "categoryTitle": "Database", "frontendQuestionId": "1934", "paidOnly": false, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 245566, "totalSubmissionRaw": 414181}, "1935": {"acRate": 73.62627164847402, "difficulty": "Easy", "likes": 594, "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": 63471, "totalSubmissionRaw": 86207}, "1936": {"acRate": 42.96814636635323, "difficulty": "Medium", "likes": 376, "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": 29474, "totalSubmissionRaw": 68595}, "1937": {"acRate": 42.93292925397954, "difficulty": "Medium", "likes": 3091, "dislikes": 220, "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"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142515, "totalSubmissionRaw": 331948}, "1938": {"acRate": 43.131950706342046, "difficulty": "Hard", "likes": 385, "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": 5740, "totalSubmissionRaw": 13308}, "1939": {"acRate": 56.42114511641528, "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": 11559, "totalSubmissionRaw": 20487}, "1940": {"acRate": 81.27646883388012, "difficulty": "Medium", "likes": 186, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1940", "paidOnly": true, "title": "Longest Common Subsequence Between Sorted Arrays", "titleSlug": "longest-common-subsequence-between-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13626, "totalSubmissionRaw": 16765}, "1941": {"acRate": 77.90845065140594, "difficulty": "Easy", "likes": 893, "dislikes": 22, "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": 103873, "totalSubmissionRaw": 133327}, "1942": {"acRate": 42.485604149812026, "difficulty": "Medium", "likes": 580, "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": 17855, "totalSubmissionRaw": 42026}, "1943": {"acRate": 50.319069069069066, "difficulty": "Medium", "likes": 479, "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": 13405, "totalSubmissionRaw": 26640}, "1944": {"acRate": 69.88931085587254, "difficulty": "Hard", "likes": 1769, "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": 60362, "totalSubmissionRaw": 86368}, "1945": {"acRate": 74.85838710576283, "difficulty": "Easy", "likes": 1083, "dislikes": 90, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 187567, "totalSubmissionRaw": 250609}, "1946": {"acRate": 36.17712429475124, "difficulty": "Medium", "likes": 215, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1946", "paidOnly": false, "title": "Largest Number After Mutating Substring", "titleSlug": "largest-number-after-mutating-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21156, "totalSubmissionRaw": 58483}, "1947": {"acRate": 62.4798634319925, "difficulty": "Medium", "likes": 787, "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": 25986, "totalSubmissionRaw": 41591}, "1948": {"acRate": 55.548066907664975, "difficulty": "Hard", "likes": 320, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1948", "paidOnly": false, "title": "Delete Duplicate Folders in System", "titleSlug": "delete-duplicate-folders-in-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9066, "totalSubmissionRaw": 16321}, "1949": {"acRate": 54.44396177237185, "difficulty": "Medium", "likes": 147, "dislikes": 84, "categoryTitle": "Database", "frontendQuestionId": "1949", "paidOnly": true, "title": "Strong Friendship", "titleSlug": "strong-friendship", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12533, "totalSubmissionRaw": 23020}, "1950": {"acRate": 49.76241192855972, "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": 3037, "totalSubmissionRaw": 6103}, "1951": {"acRate": 68.84372647791095, "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": 11890, "totalSubmissionRaw": 17271}, "1952": {"acRate": 61.19523208982548, "difficulty": "Easy", "likes": 533, "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": 75212, "totalSubmissionRaw": 122903}, "1953": {"acRate": 40.898692537612504, "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": 24493, "totalSubmissionRaw": 59887}, "1954": {"acRate": 54.646208940479134, "difficulty": "Medium", "likes": 387, "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": 17701, "totalSubmissionRaw": 32392}, "1955": {"acRate": 51.44493952896244, "difficulty": "Hard", "likes": 521, "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": 12123, "totalSubmissionRaw": 23565}, "1956": {"acRate": 47.43961352657004, "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": 982, "totalSubmissionRaw": 2070}, "1957": {"acRate": 58.60460279020013, "difficulty": "Easy", "likes": 442, "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": 39445, "totalSubmissionRaw": 67307}, "1958": {"acRate": 48.87352526399064, "difficulty": "Medium", "likes": 161, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "1958", "paidOnly": false, "title": "Check if Move is Legal", "titleSlug": "check-if-move-is-legal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14209, "totalSubmissionRaw": 29073}, "1959": {"acRate": 43.21510411477533, "difficulty": "Medium", "likes": 567, "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": 8675, "totalSubmissionRaw": 20074}, "1960": {"acRate": 30.84913437757626, "difficulty": "Hard", "likes": 245, "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": 3742, "totalSubmissionRaw": 12130}, "1961": {"acRate": 52.86544614627312, "difficulty": "Easy", "likes": 487, "dislikes": 92, "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": 55846, "totalSubmissionRaw": 105638}, "1962": {"acRate": 62.738819256090714, "difficulty": "Medium", "likes": 1819, "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": 105016, "totalSubmissionRaw": 167386}, "1963": {"acRate": 72.04535856448409, "difficulty": "Medium", "likes": 1810, "dislikes": 77, "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": 80180, "totalSubmissionRaw": 111291}, "1964": {"acRate": 62.91034482758621, "difficulty": "Hard", "likes": 1798, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1964", "paidOnly": false, "title": "Find the Longest Valid Obstacle Course at Each Position", "titleSlug": "find-the-longest-valid-obstacle-course-at-each-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59293, "totalSubmissionRaw": 94250}, "1965": {"acRate": 72.44533702938931, "difficulty": "Easy", "likes": 702, "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": 128057, "totalSubmissionRaw": 176764}, "1966": {"acRate": 64.14881623449831, "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": 2845, "totalSubmissionRaw": 4435}, "1967": {"acRate": 81.21254732287723, "difficulty": "Easy", "likes": 699, "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": 75081, "totalSubmissionRaw": 92450}, "1968": {"acRate": 50.35609934258582, "difficulty": "Medium", "likes": 622, "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": 38605, "totalSubmissionRaw": 76664}, "1969": {"acRate": 35.796876862558115, "difficulty": "Medium", "likes": 243, "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": 12012, "totalSubmissionRaw": 33556}, "1970": {"acRate": 61.99023487911899, "difficulty": "Hard", "likes": 1901, "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": 57641, "totalSubmissionRaw": 92984}, "1971": {"acRate": 53.97000737979977, "difficulty": "Easy", "likes": 3894, "dislikes": 225, "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": 465118, "totalSubmissionRaw": 861808}, "1972": {"acRate": 50.49847616095873, "difficulty": "Hard", "likes": 134, "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": 9776, "totalSubmissionRaw": 19359}, "1973": {"acRate": 77.05756689903306, "difficulty": "Medium", "likes": 176, "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": 13707, "totalSubmissionRaw": 17788}, "1974": {"acRate": 75.69411417419683, "difficulty": "Easy", "likes": 696, "dislikes": 30, "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": 46156, "totalSubmissionRaw": 60977}, "1975": {"acRate": 49.994830705608685, "difficulty": "Medium", "likes": 555, "dislikes": 24, "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": 19343, "totalSubmissionRaw": 38690}, "1976": {"acRate": 27.65621130228289, "difficulty": "Medium", "likes": 2833, "dislikes": 134, "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": 75934, "totalSubmissionRaw": 274564}, "1977": {"acRate": 21.059152423915116, "difficulty": "Hard", "likes": 519, "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": 6629, "totalSubmissionRaw": 31478}, "1978": {"acRate": 48.47542258420988, "difficulty": "Easy", "likes": 372, "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": 142123, "totalSubmissionRaw": 293185}, "1979": {"acRate": 78.10545696962001, "difficulty": "Easy", "likes": 1129, "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": 147624, "totalSubmissionRaw": 189006}, "1980": {"acRate": 74.69445355746149, "difficulty": "Medium", "likes": 1993, "dislikes": 75, "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": 143438, "totalSubmissionRaw": 192033}, "1981": {"acRate": 35.26645768025078, "difficulty": "Medium", "likes": 958, "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": 29925, "totalSubmissionRaw": 84854}, "1982": {"acRate": 48.93617021276596, "difficulty": "Hard", "likes": 584, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1982", "paidOnly": false, "title": "Find Array Given Subset Sums", "titleSlug": "find-array-given-subset-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5796, "totalSubmissionRaw": 11844}, "1983": {"acRate": 53.691922112974744, "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": 2785, "totalSubmissionRaw": 5187}, "1984": {"acRate": 57.26934902496671, "difficulty": "Easy", "likes": 1002, "dislikes": 287, "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": 82141, "totalSubmissionRaw": 143430}, "1985": {"acRate": 45.80711693601023, "difficulty": "Medium", "likes": 1251, "dislikes": 147, "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": 70182, "totalSubmissionRaw": 153212}, "1986": {"acRate": 33.332924300246646, "difficulty": "Medium", "likes": 1118, "dislikes": 68, "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": 27164, "totalSubmissionRaw": 81493}, "1987": {"acRate": 52.329692154915584, "difficulty": "Hard", "likes": 701, "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": 13174, "totalSubmissionRaw": 25175}, "1988": {"acRate": 66.8562474609715, "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": 11520, "totalSubmissionRaw": 17231}, "1989": {"acRate": 51.42058686539357, "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": 2208, "totalSubmissionRaw": 4294}, "1990": {"acRate": 49.19825072886297, "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": 7425, "totalSubmissionRaw": 15092}, "1991": {"acRate": 67.64236678653155, "difficulty": "Easy", "likes": 1381, "dislikes": 65, "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": 103459, "totalSubmissionRaw": 152950}, "1992": {"acRate": 75.79680696661829, "difficulty": "Medium", "likes": 1383, "dislikes": 89, "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": 130560, "totalSubmissionRaw": 172250}, "1993": {"acRate": 46.246717739097484, "difficulty": "Medium", "likes": 465, "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": 17084, "totalSubmissionRaw": 36941}, "1994": {"acRate": 35.068057881403234, "difficulty": "Hard", "likes": 473, "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": 8167, "totalSubmissionRaw": 23289}, "1995": {"acRate": 61.74810697371033, "difficulty": "Easy", "likes": 637, "dislikes": 233, "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": 43541, "totalSubmissionRaw": 70516}, "1996": {"acRate": 44.03436127761174, "difficulty": "Medium", "likes": 3016, "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": 105494, "totalSubmissionRaw": 239572}, "1997": {"acRate": 37.80638676254542, "difficulty": "Medium", "likes": 491, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1997", "paidOnly": false, "title": "First Day Where You Have Been in All the Rooms", "titleSlug": "first-day-where-you-have-been-in-all-the-rooms", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9779, "totalSubmissionRaw": 25866}, "1998": {"acRate": 46.15715309290662, "difficulty": "Hard", "likes": 496, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1998", "paidOnly": false, "title": "GCD Sort of an Array", "titleSlug": "gcd-sort-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9663, "totalSubmissionRaw": 20935}, "1999": {"acRate": 49.37837837837838, "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": 1827, "totalSubmissionRaw": 3700}, "2000": {"acRate": 86.31280737513323, "difficulty": "Easy", "likes": 1335, "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"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 276945, "totalSubmissionRaw": 320862}, "2001": {"acRate": 50.219181011440185, "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": 42273, "totalSubmissionRaw": 84177}, "2002": {"acRate": 60.34397548680439, "difficulty": "Medium", "likes": 945, "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": 30525, "totalSubmissionRaw": 50585}, "2003": {"acRate": 46.85367295394702, "difficulty": "Hard", "likes": 452, "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": 8719, "totalSubmissionRaw": 18609}, "2004": {"acRate": 43.5349114780187, "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": 8754, "totalSubmissionRaw": 20108}, "2005": {"acRate": 59.038290293855745, "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": 663, "totalSubmissionRaw": 1123}, "2006": {"acRate": 84.1791921816045, "difficulty": "Easy", "likes": 1642, "dislikes": 43, "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": 163311, "totalSubmissionRaw": 194004}, "2007": {"acRate": 40.50069894522811, "difficulty": "Medium", "likes": 2451, "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": 137041, "totalSubmissionRaw": 338367}, "2008": {"acRate": 44.29712892741062, "difficulty": "Medium", "likes": 1279, "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": 32709, "totalSubmissionRaw": 73840}, "2009": {"acRate": 52.632089862709755, "difficulty": "Hard", "likes": 1881, "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": 75904, "totalSubmissionRaw": 144215}, "2010": {"acRate": 62.56221597056915, "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": 5782, "totalSubmissionRaw": 9242}, "2011": {"acRate": 89.40691709557098, "difficulty": "Easy", "likes": 1614, "dislikes": 189, "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": 418993, "totalSubmissionRaw": 468636}, "2012": {"acRate": 48.47767723973352, "difficulty": "Medium", "likes": 607, "dislikes": 65, "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": 24377, "totalSubmissionRaw": 50285}, "2013": {"acRate": 51.27951038751684, "difficulty": "Medium", "likes": 889, "dislikes": 234, "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": 73482, "totalSubmissionRaw": 143297}, "2014": {"acRate": 55.850994669093744, "difficulty": "Hard", "likes": 462, "dislikes": 81, "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": 8591, "totalSubmissionRaw": 15382}, "2015": {"acRate": 59.460946094609454, "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": 2162, "totalSubmissionRaw": 3636}, "2016": {"acRate": 56.86850315132684, "difficulty": "Easy", "likes": 1016, "dislikes": 32, "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": 90049, "totalSubmissionRaw": 158346}, "2017": {"acRate": 46.18267230868536, "difficulty": "Medium", "likes": 918, "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": 25757, "totalSubmissionRaw": 55772}, "2018": {"acRate": 49.79630421571496, "difficulty": "Medium", "likes": 294, "dislikes": 296, "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": 22124, "totalSubmissionRaw": 44429}, "2019": {"acRate": 33.80436273837289, "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": 7392, "totalSubmissionRaw": 21867}, "2020": {"acRate": 72.08590996741805, "difficulty": "Medium", "likes": 27, "dislikes": 214, "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": 10841, "totalSubmissionRaw": 15039}, "2021": {"acRate": 61.458954482210295, "difficulty": "Medium", "likes": 152, "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": 6184, "totalSubmissionRaw": 10062}, "2022": {"acRate": 71.37386688289065, "difficulty": "Easy", "likes": 1167, "dislikes": 87, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 225327, "totalSubmissionRaw": 315703}, "2023": {"acRate": 75.06608471137886, "difficulty": "Medium", "likes": 706, "dislikes": 54, "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": 48844, "totalSubmissionRaw": 65068}, "2024": {"acRate": 67.48897070009431, "difficulty": "Medium", "likes": 2885, "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": 110908, "totalSubmissionRaw": 164335}, "2025": {"acRate": 34.45359013566711, "difficulty": "Hard", "likes": 482, "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": 10590, "totalSubmissionRaw": 30737}, "2026": {"acRate": 84.26460711887172, "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": 12547, "totalSubmissionRaw": 14890}, "2027": {"acRate": 55.329168668909176, "difficulty": "Easy", "likes": 480, "dislikes": 72, "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": 40299, "totalSubmissionRaw": 72835}, "2028": {"acRate": 47.00610765454649, "difficulty": "Medium", "likes": 489, "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": 32940, "totalSubmissionRaw": 70076}, "2029": {"acRate": 28.765055298480526, "difficulty": "Medium", "likes": 241, "dislikes": 274, "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": 8765, "totalSubmissionRaw": 30471}, "2030": {"acRate": 39.41976507992582, "difficulty": "Hard", "likes": 484, "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": 8927, "totalSubmissionRaw": 22646}, "2031": {"acRate": 52.188427299703264, "difficulty": "Medium", "likes": 172, "dislikes": 17, "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": 4221, "totalSubmissionRaw": 8088}, "2032": {"acRate": 75.60845529789438, "difficulty": "Easy", "likes": 757, "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": 73718, "totalSubmissionRaw": 97500}, "2033": {"acRate": 53.481931779804114, "difficulty": "Medium", "likes": 549, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2033", "paidOnly": false, "title": "Minimum Operations to Make a Uni-Value Grid", "titleSlug": "minimum-operations-to-make-a-uni-value-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23754, "totalSubmissionRaw": 44415}, "2034": {"acRate": 48.62435970006359, "difficulty": "Medium", "likes": 1165, "dislikes": 65, "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": 69580, "totalSubmissionRaw": 143097}, "2035": {"acRate": 20.594702269766543, "difficulty": "Hard", "likes": 3099, "dislikes": 202, "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": 29879, "totalSubmissionRaw": 145081}, "2036": {"acRate": 40.354355098500804, "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": 3257, "totalSubmissionRaw": 8071}, "2037": {"acRate": 87.57020461203004, "difficulty": "Easy", "likes": 1330, "dislikes": 326, "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"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 238557, "totalSubmissionRaw": 272418}, "2038": {"acRate": 62.810020967079524, "difficulty": "Medium", "likes": 1575, "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": 145289, "totalSubmissionRaw": 231315}, "2039": {"acRate": 52.617180984153464, "difficulty": "Medium", "likes": 674, "dislikes": 63, "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": 15772, "totalSubmissionRaw": 29975}, "2040": {"acRate": 29.11401527891222, "difficulty": "Hard", "likes": 687, "dislikes": 38, "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": 12119, "totalSubmissionRaw": 41626}, "2041": {"acRate": 78.17320800746215, "difficulty": "Medium", "likes": 54, "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": 10895, "totalSubmissionRaw": 13937}, "2042": {"acRate": 70.10623013134524, "difficulty": "Easy", "likes": 615, "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": 61969, "totalSubmissionRaw": 88393}, "2043": {"acRate": 63.87657058388766, "difficulty": "Medium", "likes": 263, "dislikes": 218, "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": 31113, "totalSubmissionRaw": 48708}, "2044": {"acRate": 77.98356559594033, "difficulty": "Medium", "likes": 625, "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": 30274, "totalSubmissionRaw": 38821}, "2045": {"acRate": 63.165750316026745, "difficulty": "Hard", "likes": 1203, "dislikes": 66, "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": 82948, "totalSubmissionRaw": 131318}, "2046": {"acRate": 67.08330157762366, "difficulty": "Medium", "likes": 167, "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": 8802, "totalSubmissionRaw": 13121}, "2047": {"acRate": 29.340823197321654, "difficulty": "Easy", "likes": 302, "dislikes": 804, "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": 31287, "totalSubmissionRaw": 106633}, "2048": {"acRate": 48.8184358505537, "difficulty": "Medium", "likes": 198, "dislikes": 280, "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": 14151, "totalSubmissionRaw": 28987}, "2049": {"acRate": 50.10473323828132, "difficulty": "Medium", "likes": 1076, "dislikes": 83, "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": 28465, "totalSubmissionRaw": 56811}, "2050": {"acRate": 67.10848003663153, "difficulty": "Hard", "likes": 1533, "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": 82073, "totalSubmissionRaw": 122299}, "2051": {"acRate": 69.96702460471802, "difficulty": "Medium", "likes": 59, "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": 8275, "totalSubmissionRaw": 11827}, "2052": {"acRate": 49.50751684810783, "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": 1910, "totalSubmissionRaw": 3858}, "2053": {"acRate": 82.10113680909447, "difficulty": "Easy", "likes": 1240, "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": 230384, "totalSubmissionRaw": 280610}, "2054": {"acRate": 46.81857567738461, "difficulty": "Medium", "likes": 841, "dislikes": 26, "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": 19992, "totalSubmissionRaw": 42701}, "2055": {"acRate": 45.25638777754754, "difficulty": "Medium", "likes": 1222, "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": 56785, "totalSubmissionRaw": 125474}, "2056": {"acRate": 52.71507016473459, "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": 4320, "totalSubmissionRaw": 8195}, "2057": {"acRate": 73.24549903862962, "difficulty": "Easy", "likes": 422, "dislikes": 139, "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": 67043, "totalSubmissionRaw": 91532}, "2058": {"acRate": 69.63852748680728, "difficulty": "Medium", "likes": 1253, "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": 175776, "totalSubmissionRaw": 252412}, "2059": {"acRate": 49.670379631734484, "difficulty": "Medium", "likes": 643, "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": 17480, "totalSubmissionRaw": 35192}, "2060": {"acRate": 43.8614549291063, "difficulty": "Hard", "likes": 312, "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": 17045, "totalSubmissionRaw": 38861}, "2061": {"acRate": 62.532627865961196, "difficulty": "Medium", "likes": 122, "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": 8864, "totalSubmissionRaw": 14175}, "2062": {"acRate": 68.248687343309, "difficulty": "Easy", "likes": 950, "dislikes": 244, "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": 43284, "totalSubmissionRaw": 63421}, "2063": {"acRate": 54.059151156232375, "difficulty": "Medium", "likes": 836, "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": 30671, "totalSubmissionRaw": 56736}, "2064": {"acRate": 53.586954765098504, "difficulty": "Medium", "likes": 1074, "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": 33158, "totalSubmissionRaw": 61877}, "2065": {"acRate": 58.92013324037493, "difficulty": "Hard", "likes": 645, "dislikes": 48, "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": 22818, "totalSubmissionRaw": 38727}, "2066": {"acRate": 82.06684403059528, "difficulty": "Medium", "likes": 71, "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": 9871, "totalSubmissionRaw": 12028}, "2067": {"acRate": 46.56322989656323, "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": 2791, "totalSubmissionRaw": 5994}, "2068": {"acRate": 63.91502377073706, "difficulty": "Easy", "likes": 528, "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": 57674, "totalSubmissionRaw": 90235}, "2069": {"acRate": 26.38038151907595, "difficulty": "Medium", "likes": 166, "dislikes": 308, "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": 12059, "totalSubmissionRaw": 45712}, "2070": {"acRate": 49.930011198208284, "difficulty": "Medium", "likes": 590, "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": 17835, "totalSubmissionRaw": 35720}, "2071": {"acRate": 33.803653127510216, "difficulty": "Hard", "likes": 540, "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": 9679, "totalSubmissionRaw": 28633}, "2072": {"acRate": 74.1610522938723, "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": 11558, "totalSubmissionRaw": 15585}, "2073": {"acRate": 69.91673094177462, "difficulty": "Easy", "likes": 1664, "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": 222083, "totalSubmissionRaw": 317641}, "2074": {"acRate": 58.64031456953642, "difficulty": "Medium", "likes": 725, "dislikes": 341, "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": 28334, "totalSubmissionRaw": 48319}, "2075": {"acRate": 49.064166581745305, "difficulty": "Medium", "likes": 248, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "2075", "paidOnly": false, "title": "Decode the Slanted Ciphertext", "titleSlug": "decode-the-slanted-ciphertext", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14444, "totalSubmissionRaw": 29439}, "2076": {"acRate": 55.53179620676831, "difficulty": "Hard", "likes": 615, "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": 17919, "totalSubmissionRaw": 32268}, "2077": {"acRate": 55.723846424797465, "difficulty": "Medium", "likes": 131, "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": 4746, "totalSubmissionRaw": 8517}, "2078": {"acRate": 66.08208445314992, "difficulty": "Easy", "likes": 904, "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": 58028, "totalSubmissionRaw": 87812}, "2079": {"acRate": 79.83120858221152, "difficulty": "Medium", "likes": 913, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2079", "paidOnly": false, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53728, "totalSubmissionRaw": 67302}, "2080": {"acRate": 40.449499346974314, "difficulty": "Medium", "likes": 660, "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": 22299, "totalSubmissionRaw": 55128}, "2081": {"acRate": 42.52, "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": 7441, "totalSubmissionRaw": 17500}, "2082": {"acRate": 77.25755791126817, "difficulty": "Easy", "likes": 97, "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": 23613, "totalSubmissionRaw": 30564}, "2083": {"acRate": 74.22841290024274, "difficulty": "Medium", "likes": 134, "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": 12843, "totalSubmissionRaw": 17302}, "2084": {"acRate": 86.75999061546884, "difficulty": "Medium", "likes": 86, "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": 11094, "totalSubmissionRaw": 12787}, "2085": {"acRate": 71.16507165643003, "difficulty": "Easy", "likes": 811, "dislikes": 19, "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": 74734, "totalSubmissionRaw": 105015}, "2086": {"acRate": 46.838952737739966, "difficulty": "Medium", "likes": 539, "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": 22130, "totalSubmissionRaw": 47247}, "2087": {"acRate": 51.07143817384991, "difficulty": "Medium", "likes": 678, "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": 18995, "totalSubmissionRaw": 37193}, "2088": {"acRate": 65.1952028578719, "difficulty": "Hard", "likes": 370, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2088", "paidOnly": false, "title": "Count Fertile Pyramids in a Land", "titleSlug": "count-fertile-pyramids-in-a-land", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10220, "totalSubmissionRaw": 15676}, "2089": {"acRate": 76.60135076148981, "difficulty": "Easy", "likes": 1803, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2089", "paidOnly": false, "title": "Find Target Indices After Sorting Array", "titleSlug": "find-target-indices-after-sorting-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 193040, "totalSubmissionRaw": 252006}, "2090": {"acRate": 45.97562947806583, "difficulty": "Medium", "likes": 1894, "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": 130774, "totalSubmissionRaw": 284442}, "2091": {"acRate": 54.98995959644836, "difficulty": "Medium", "likes": 960, "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": 45455, "totalSubmissionRaw": 82662}, "2092": {"acRate": 45.51699469890126, "difficulty": "Hard", "likes": 1587, "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": 99258, "totalSubmissionRaw": 218068}, "2093": {"acRate": 59.82652091254753, "difficulty": "Medium", "likes": 228, "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": 10070, "totalSubmissionRaw": 16832}, "2094": {"acRate": 61.206740679130654, "difficulty": "Easy", "likes": 711, "dislikes": 265, "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": 33850, "totalSubmissionRaw": 55305}, "2095": {"acRate": 59.560585656852574, "difficulty": "Medium", "likes": 4223, "dislikes": 81, "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": 485622, "totalSubmissionRaw": 815342}, "2096": {"acRate": 56.386587117445586, "difficulty": "Medium", "likes": 3090, "dislikes": 161, "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": 204142, "totalSubmissionRaw": 362040}, "2097": {"acRate": 44.25847218565465, "difficulty": "Hard", "likes": 509, "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": 11767, "totalSubmissionRaw": 26586}, "2098": {"acRate": 36.735582154515775, "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": 3376, "totalSubmissionRaw": 9190}, "2099": {"acRate": 43.98585484847989, "difficulty": "Easy", "likes": 1259, "dislikes": 134, "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": 53734, "totalSubmissionRaw": 122161}, "2100": {"acRate": 49.58338559678893, "difficulty": "Medium", "likes": 893, "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": 27671, "totalSubmissionRaw": 55807}, "2101": {"acRate": 48.78080962685385, "difficulty": "Medium", "likes": 3096, "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": 129395, "totalSubmissionRaw": 265258}, "2102": {"acRate": 64.6904253572015, "difficulty": "Hard", "likes": 385, "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": 15756, "totalSubmissionRaw": 24356}, "2103": {"acRate": 80.85471686333271, "difficulty": "Easy", "likes": 961, "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": 77703, "totalSubmissionRaw": 96102}, "2104": {"acRate": 60.823814696555736, "difficulty": "Medium", "likes": 2416, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2104", "paidOnly": false, "title": "Sum of Subarray Ranges", "titleSlug": "sum-of-subarray-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110864, "totalSubmissionRaw": 182272}, "2105": {"acRate": 48.41371593743444, "difficulty": "Medium", "likes": 277, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2105", "paidOnly": false, "title": "Watering Plants II", "titleSlug": "watering-plants-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20767, "totalSubmissionRaw": 42897}, "2106": {"acRate": 36.47677700795484, "difficulty": "Hard", "likes": 554, "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": 11372, "totalSubmissionRaw": 31176}, "2107": {"acRate": 55.36848792884371, "difficulty": "Medium", "likes": 78, "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": 3486, "totalSubmissionRaw": 6296}, "2108": {"acRate": 83.90077821011673, "difficulty": "Easy", "likes": 1534, "dislikes": 54, "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": 303600, "totalSubmissionRaw": 361856}, "2109": {"acRate": 59.312529859941165, "difficulty": "Medium", "likes": 562, "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": 47176, "totalSubmissionRaw": 79538}, "2110": {"acRate": 59.18193372392201, "difficulty": "Medium", "likes": 714, "dislikes": 32, "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": 38183, "totalSubmissionRaw": 64518}, "2111": {"acRate": 38.91708468574801, "difficulty": "Hard", "likes": 700, "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": 13189, "totalSubmissionRaw": 33890}, "2112": {"acRate": 70.3677398989899, "difficulty": "Medium", "likes": 62, "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": 8917, "totalSubmissionRaw": 12672}, "2113": {"acRate": 73.94707417070443, "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": 1984, "totalSubmissionRaw": 2683}, "2114": {"acRate": 86.611757513552, "difficulty": "Easy", "likes": 1751, "dislikes": 61, "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": 308847, "totalSubmissionRaw": 356588}, "2115": {"acRate": 50.21769861464518, "difficulty": "Medium", "likes": 1889, "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": 97691, "totalSubmissionRaw": 194535}, "2116": {"acRate": 32.08461773772267, "difficulty": "Medium", "likes": 1158, "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": 27270, "totalSubmissionRaw": 84994}, "2117": {"acRate": 26.183581873461705, "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": 3617, "totalSubmissionRaw": 13814}, "2118": {"acRate": 55.08163265306123, "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": 2699, "totalSubmissionRaw": 4900}, "2119": {"acRate": 80.3046098298965, "difficulty": "Easy", "likes": 683, "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": 94749, "totalSubmissionRaw": 117987}, "2120": {"acRate": 82.69879394930499, "difficulty": "Medium", "likes": 541, "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": 32365, "totalSubmissionRaw": 39136}, "2121": {"acRate": 44.59378987664823, "difficulty": "Medium", "likes": 908, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2121", "paidOnly": false, "title": "Intervals Between Identical Elements", "titleSlug": "intervals-between-identical-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20968, "totalSubmissionRaw": 47020}, "2122": {"acRate": 39.58994473168123, "difficulty": "Hard", "likes": 373, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2122", "paidOnly": false, "title": "Recover the Original Array", "titleSlug": "recover-the-original-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11103, "totalSubmissionRaw": 28045}, "2123": {"acRate": 40.605794556628624, "difficulty": "Hard", "likes": 52, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2123", "paidOnly": true, "title": "Minimum Operations to Remove Adjacent Ones in Matrix", "titleSlug": "minimum-operations-to-remove-adjacent-ones-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 925, "totalSubmissionRaw": 2278}, "2124": {"acRate": 72.16747548776864, "difficulty": "Easy", "likes": 740, "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": 87441, "totalSubmissionRaw": 121164}, "2125": {"acRate": 85.58214398089507, "difficulty": "Medium", "likes": 1862, "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": 212153, "totalSubmissionRaw": 247894}, "2126": {"acRate": 51.77158920049683, "difficulty": "Medium", "likes": 559, "dislikes": 190, "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": 47517, "totalSubmissionRaw": 91782}, "2127": {"acRate": 37.386406921695595, "difficulty": "Hard", "likes": 1040, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2127", "paidOnly": false, "title": "Maximum Employees to Be Invited to a Meeting", "titleSlug": "maximum-employees-to-be-invited-to-a-meeting", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13740, "totalSubmissionRaw": 36753}, "2128": {"acRate": 76.2176542816863, "difficulty": "Medium", "likes": 475, "dislikes": 185, "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": 33519, "totalSubmissionRaw": 43978}, "2129": {"acRate": 64.85678221186522, "difficulty": "Easy", "likes": 736, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2129", "paidOnly": false, "title": "Capitalize the Title", "titleSlug": "capitalize-the-title", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66796, "totalSubmissionRaw": 102990}, "2130": {"acRate": 81.00681170323287, "difficulty": "Medium", "likes": 3543, "dislikes": 103, "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": 316573, "totalSubmissionRaw": 390798}, "2131": {"acRate": 47.98784513686153, "difficulty": "Medium", "likes": 2438, "dislikes": 62, "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": 120652, "totalSubmissionRaw": 251422}, "2132": {"acRate": 32.51429319600227, "difficulty": "Hard", "likes": 386, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2132", "paidOnly": false, "title": "Stamping the Grid", "titleSlug": "stamping-the-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7450, "totalSubmissionRaw": 22913}, "2133": {"acRate": 51.91117199230789, "difficulty": "Easy", "likes": 970, "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": 78824, "totalSubmissionRaw": 151844}, "2134": {"acRate": 65.50808114455825, "difficulty": "Medium", "likes": 1955, "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": 155354, "totalSubmissionRaw": 237154}, "2135": {"acRate": 43.12983139570272, "difficulty": "Medium", "likes": 693, "dislikes": 160, "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": 35429, "totalSubmissionRaw": 82145}, "2136": {"acRate": 71.81347150259067, "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": 55440, "totalSubmissionRaw": 77200}, "2137": {"acRate": 67.71510267741097, "difficulty": "Medium", "likes": 103, "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": 2605, "totalSubmissionRaw": 3847}, "2138": {"acRate": 67.0053184235647, "difficulty": "Easy", "likes": 465, "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": 49135, "totalSubmissionRaw": 73330}, "2139": {"acRate": 51.03921700374029, "difficulty": "Medium", "likes": 994, "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": 45577, "totalSubmissionRaw": 89298}, "2140": {"acRate": 55.10685005618211, "difficulty": "Medium", "likes": 2339, "dislikes": 60, "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": 105933, "totalSubmissionRaw": 192232}, "2141": {"acRate": 49.9967374104827, "difficulty": "Hard", "likes": 2006, "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": 61297, "totalSubmissionRaw": 122602}, "2142": {"acRate": 48.55605009833351, "difficulty": "Medium", "likes": 107, "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": 9382, "totalSubmissionRaw": 19322}, "2143": {"acRate": 52.082358446420216, "difficulty": "Hard", "likes": 38, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2143", "paidOnly": true, "title": "Choose Numbers From Two Arrays in Range", "titleSlug": "choose-numbers-from-two-arrays-in-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1113, "totalSubmissionRaw": 2137}, "2144": {"acRate": 61.50403074615674, "difficulty": "Easy", "likes": 596, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2144", "paidOnly": false, "title": "Minimum Cost of Buying Candies With Discount", "titleSlug": "minimum-cost-of-buying-candies-with-discount", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52490, "totalSubmissionRaw": 85344}, "2145": {"acRate": 38.9109231454126, "difficulty": "Medium", "likes": 522, "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": 19229, "totalSubmissionRaw": 49418}, "2146": {"acRate": 43.43296738520715, "difficulty": "Medium", "likes": 506, "dislikes": 159, "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": 16260, "totalSubmissionRaw": 37437}, "2147": {"acRate": 49.361074115402616, "difficulty": "Hard", "likes": 1056, "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": 68565, "totalSubmissionRaw": 138905}, "2148": {"acRate": 59.44116404507629, "difficulty": "Easy", "likes": 650, "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": 60501, "totalSubmissionRaw": 101782}, "2149": {"acRate": 84.05455535170661, "difficulty": "Medium", "likes": 3311, "dislikes": 186, "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": 416915, "totalSubmissionRaw": 496005}, "2150": {"acRate": 60.84711364100347, "difficulty": "Medium", "likes": 653, "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": 50668, "totalSubmissionRaw": 83271}, "2151": {"acRate": 50.3851464283119, "difficulty": "Hard", "likes": 507, "dislikes": 81, "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": 13867, "totalSubmissionRaw": 27522}, "2152": {"acRate": 43.149968625810494, "difficulty": "Medium", "likes": 71, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2152", "paidOnly": true, "title": "Minimum Number of Lines to Cover Points", "titleSlug": "minimum-number-of-lines-to-cover-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2063, "totalSubmissionRaw": 4781}, "2153": {"acRate": 40.028901734104046, "difficulty": "Hard", "likes": 78, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2153", "paidOnly": true, "title": "The Number of Passengers in Each Bus II", "titleSlug": "the-number-of-passengers-in-each-bus-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3047, "totalSubmissionRaw": 7612}, "2154": {"acRate": 71.3582329490978, "difficulty": "Easy", "likes": 715, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2154", "paidOnly": false, "title": "Keep Multiplying Found Values by Two", "titleSlug": "keep-multiplying-found-values-by-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 98986, "totalSubmissionRaw": 138717}, "2155": {"acRate": 64.3981034699786, "difficulty": "Medium", "likes": 506, "dislikes": 16, "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": 30696, "totalSubmissionRaw": 47666}, "2156": {"acRate": 23.762099451375057, "difficulty": "Hard", "likes": 426, "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": 13600, "totalSubmissionRaw": 57234}, "2157": {"acRate": 26.189195006457165, "difficulty": "Hard", "likes": 476, "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": 9734, "totalSubmissionRaw": 37168}, "2158": {"acRate": 55.30276769261645, "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": 30312, "totalSubmissionRaw": 54811}, "2159": {"acRate": 60.464245600898536, "difficulty": "Medium", "likes": 73, "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": 8075, "totalSubmissionRaw": 13355}, "2160": {"acRate": 86.2560976379344, "difficulty": "Easy", "likes": 1412, "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": 136684, "totalSubmissionRaw": 158463}, "2161": {"acRate": 85.13926101314723, "difficulty": "Medium", "likes": 1109, "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": 81983, "totalSubmissionRaw": 96293}, "2162": {"acRate": 41.27679071424935, "difficulty": "Medium", "likes": 208, "dislikes": 623, "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": 16216, "totalSubmissionRaw": 39286}, "2163": {"acRate": 48.23572208075664, "difficulty": "Hard", "likes": 671, "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": 10608, "totalSubmissionRaw": 21992}, "2164": {"acRate": 62.58627437877674, "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": 65561, "totalSubmissionRaw": 104753}, "2165": {"acRate": 52.3413436289052, "difficulty": "Medium", "likes": 635, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2165", "paidOnly": false, "title": "Smallest Value of the Rearranged Number", "titleSlug": "smallest-value-of-the-rearranged-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36875, "totalSubmissionRaw": 70451}, "2166": {"acRate": 32.650073206442165, "difficulty": "Medium", "likes": 589, "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": 23415, "totalSubmissionRaw": 71715}, "2167": {"acRate": 41.63333763385369, "difficulty": "Hard", "likes": 672, "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": 12908, "totalSubmissionRaw": 31004}, "2168": {"acRate": 60.151679306608884, "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": 2776, "totalSubmissionRaw": 4615}, "2169": {"acRate": 74.55316541734877, "difficulty": "Easy", "likes": 605, "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": 77876, "totalSubmissionRaw": 104457}, "2170": {"acRate": 33.429714652881216, "difficulty": "Medium", "likes": 580, "dislikes": 332, "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": 22892, "totalSubmissionRaw": 68478}, "2171": {"acRate": 43.02358094883027, "difficulty": "Medium", "likes": 872, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2171", "paidOnly": false, "title": "Removing Minimum Number of Magic Beans", "titleSlug": "removing-minimum-number-of-magic-beans", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27696, "totalSubmissionRaw": 64374}, "2172": {"acRate": 49.275110987791344, "difficulty": "Hard", "likes": 513, "dislikes": 30, "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": 14207, "totalSubmissionRaw": 28832}, "2173": {"acRate": 52.92841648590022, "difficulty": "Hard", "likes": 98, "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": 4880, "totalSubmissionRaw": 9220}, "2174": {"acRate": 67.30513434424049, "difficulty": "Medium", "likes": 92, "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": 5060, "totalSubmissionRaw": 7518}, "2175": {"acRate": 60.36011333516132, "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": 6604, "totalSubmissionRaw": 10941}, "2176": {"acRate": 79.6613980039686, "difficulty": "Easy", "likes": 642, "dislikes": 29, "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": 81496, "totalSubmissionRaw": 102303}, "2177": {"acRate": 64.61499993419928, "difficulty": "Medium", "likes": 673, "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": 49098, "totalSubmissionRaw": 75986}, "2178": {"acRate": 59.28702608870663, "difficulty": "Medium", "likes": 786, "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": 47132, "totalSubmissionRaw": 79498}, "2179": {"acRate": 41.55469780622465, "difficulty": "Hard", "likes": 620, "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": 8505, "totalSubmissionRaw": 20467}, "2180": {"acRate": 67.49273839688523, "difficulty": "Easy", "likes": 629, "dislikes": 32, "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": 65526, "totalSubmissionRaw": 97086}, "2181": {"acRate": 89.82044513963568, "difficulty": "Medium", "likes": 2306, "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": 275630, "totalSubmissionRaw": 306868}, "2182": {"acRate": 54.63104625161822, "difficulty": "Medium", "likes": 665, "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": 23210, "totalSubmissionRaw": 42485}, "2183": {"acRate": 29.564594769681886, "difficulty": "Hard", "likes": 848, "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": 17342, "totalSubmissionRaw": 58658}, "2184": {"acRate": 49.09315020250044, "difficulty": "Medium", "likes": 178, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2184", "paidOnly": true, "title": "Number of Ways to Build Sturdy Brick Wall", "titleSlug": "number-of-ways-to-build-sturdy-brick-wall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8364, "totalSubmissionRaw": 17037}, "2185": {"acRate": 78.30758069246562, "difficulty": "Easy", "likes": 699, "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": 101460, "totalSubmissionRaw": 129566}, "2186": {"acRate": 72.75201679018824, "difficulty": "Medium", "likes": 575, "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": 44370, "totalSubmissionRaw": 60988}, "2187": {"acRate": 38.79937740640616, "difficulty": "Medium", "likes": 2810, "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": 118401, "totalSubmissionRaw": 305169}, "2188": {"acRate": 41.9216077635156, "difficulty": "Hard", "likes": 569, "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": 12182, "totalSubmissionRaw": 29059}, "2189": {"acRate": 63.567567567567565, "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": 2352, "totalSubmissionRaw": 3700}, "2190": {"acRate": 59.12559227124484, "difficulty": "Easy", "likes": 371, "dislikes": 238, "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": 38434, "totalSubmissionRaw": 65004}, "2191": {"acRate": 60.22454087063011, "difficulty": "Medium", "likes": 923, "dislikes": 137, "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": 146551, "totalSubmissionRaw": 243341}, "2192": {"acRate": 62.19456528827075, "difficulty": "Medium", "likes": 1614, "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": 133528, "totalSubmissionRaw": 214694}, "2193": {"acRate": 51.25693902104397, "difficulty": "Hard", "likes": 982, "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": 24284, "totalSubmissionRaw": 47377}, "2194": {"acRate": 84.18010829296095, "difficulty": "Easy", "likes": 611, "dislikes": 96, "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": 73847, "totalSubmissionRaw": 87725}, "2195": {"acRate": 25.57096905443686, "difficulty": "Medium", "likes": 754, "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": 33309, "totalSubmissionRaw": 130261}, "2196": {"acRate": 81.77049813360793, "difficulty": "Medium", "likes": 1572, "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": 152466, "totalSubmissionRaw": 186456}, "2197": {"acRate": 39.35315012151804, "difficulty": "Hard", "likes": 428, "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": 14735, "totalSubmissionRaw": 37443}, "2198": {"acRate": 55.01680268843015, "difficulty": "Medium", "likes": 27, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2198", "paidOnly": true, "title": "Number of Single Divisor Triplets", "titleSlug": "number-of-single-divisor-triplets", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1146, "totalSubmissionRaw": 2083}, "2199": {"acRate": 49.54074074074074, "difficulty": "Hard", "likes": 44, "dislikes": 15, "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": 3344, "totalSubmissionRaw": 6750}, "2200": {"acRate": 66.17920297283445, "difficulty": "Easy", "likes": 416, "dislikes": 69, "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": 41317, "totalSubmissionRaw": 62432}, "2201": {"acRate": 56.659434786283846, "difficulty": "Medium", "likes": 214, "dislikes": 198, "categoryTitle": "Algorithms", "frontendQuestionId": "2201", "paidOnly": false, "title": "Count Artifacts That Can Be Extracted", "titleSlug": "count-artifacts-that-can-be-extracted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20109, "totalSubmissionRaw": 35491}, "2202": {"acRate": 23.07435656701247, "difficulty": "Medium", "likes": 618, "dislikes": 322, "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": 29738, "totalSubmissionRaw": 128879}, "2203": {"acRate": 37.17377656871245, "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": 12435, "totalSubmissionRaw": 33451}, "2204": {"acRate": 68.30122591943957, "difficulty": "Hard", "likes": 113, "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": 3510, "totalSubmissionRaw": 5139}, "2205": {"acRate": 50.09761811792268, "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": 6415, "totalSubmissionRaw": 12805}, "2206": {"acRate": 73.80108710609605, "difficulty": "Easy", "likes": 720, "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": 85810, "totalSubmissionRaw": 116272}, "2207": {"acRate": 34.891188635451385, "difficulty": "Medium", "likes": 502, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2207", "paidOnly": false, "title": "Maximize Number of Subsequences in a String", "titleSlug": "maximize-number-of-subsequences-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19993, "totalSubmissionRaw": 57301}, "2208": {"acRate": 47.07078925956062, "difficulty": "Medium", "likes": 594, "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": 32396, "totalSubmissionRaw": 68824}, "2209": {"acRate": 37.03952361492206, "difficulty": "Hard", "likes": 502, "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": 12689, "totalSubmissionRaw": 34258}, "2210": {"acRate": 61.19556453968662, "difficulty": "Easy", "likes": 692, "dislikes": 93, "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": 52373, "totalSubmissionRaw": 85583}, "2211": {"acRate": 43.97310804378867, "difficulty": "Medium", "likes": 671, "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": 29564, "totalSubmissionRaw": 67232}, "2212": {"acRate": 50.295708276669096, "difficulty": "Medium", "likes": 495, "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": 15903, "totalSubmissionRaw": 31619}, "2213": {"acRate": 32.44470774091627, "difficulty": "Hard", "likes": 300, "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": 4929, "totalSubmissionRaw": 15192}, "2214": {"acRate": 57.62869490690932, "difficulty": "Medium", "likes": 313, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "2214", "paidOnly": true, "title": "Minimum Health to Beat Game", "titleSlug": "minimum-health-to-beat-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31603, "totalSubmissionRaw": 54839}, "2215": {"acRate": 79.40656830237364, "difficulty": "Easy", "likes": 2357, "dislikes": 97, "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": 386519, "totalSubmissionRaw": 486760}, "2216": {"acRate": 48.62394579398832, "difficulty": "Medium", "likes": 795, "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": 33728, "totalSubmissionRaw": 69365}, "2217": {"acRate": 37.333780846439076, "difficulty": "Medium", "likes": 623, "dislikes": 289, "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": 23359, "totalSubmissionRaw": 62568}, "2218": {"acRate": 60.491057628615586, "difficulty": "Hard", "likes": 2319, "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": 68491, "totalSubmissionRaw": 113225}, "2219": {"acRate": 62.013079328973554, "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": 4362, "totalSubmissionRaw": 7034}, "2220": {"acRate": 85.43258212375859, "difficulty": "Easy", "likes": 942, "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": 107358, "totalSubmissionRaw": 125664}, "2221": {"acRate": 78.87684747828737, "difficulty": "Medium", "likes": 1097, "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": 82827, "totalSubmissionRaw": 105008}, "2222": {"acRate": 50.760280842527585, "difficulty": "Medium", "likes": 981, "dislikes": 51, "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": 37955, "totalSubmissionRaw": 74774}, "2223": {"acRate": 40.59610420089181, "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": 8649, "totalSubmissionRaw": 21305}, "2224": {"acRate": 65.34926195395072, "difficulty": "Easy", "likes": 454, "dislikes": 37, "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": 43652, "totalSubmissionRaw": 66798}, "2225": {"acRate": 73.14151844215874, "difficulty": "Medium", "likes": 2156, "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": 255071, "totalSubmissionRaw": 348734}, "2226": {"acRate": 38.38499676654452, "difficulty": "Medium", "likes": 1123, "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": 44517, "totalSubmissionRaw": 115975}, "2227": {"acRate": 40.53501708150317, "difficulty": "Hard", "likes": 334, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "2227", "paidOnly": false, "title": "Encrypt and Decrypt Strings", "titleSlug": "encrypt-and-decrypt-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13289, "totalSubmissionRaw": 32784}, "2228": {"acRate": 44.95499763145428, "difficulty": "Medium", "likes": 63, "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": 8541, "totalSubmissionRaw": 18999}, "2229": {"acRate": 61.33077156436445, "difficulty": "Easy", "likes": 81, "dislikes": 11, "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": 6065, "totalSubmissionRaw": 9889}, "2230": {"acRate": 50.09906340057637, "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": 5563, "totalSubmissionRaw": 11104}, "2231": {"acRate": 62.08967714069755, "difficulty": "Easy", "likes": 619, "dislikes": 298, "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": 46000, "totalSubmissionRaw": 74086}, "2232": {"acRate": 67.76204498465009, "difficulty": "Medium", "likes": 206, "dislikes": 333, "categoryTitle": "Algorithms", "frontendQuestionId": "2232", "paidOnly": false, "title": "Minimize Result by Adding Parentheses to Expression", "titleSlug": "minimize-result-by-adding-parentheses-to-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21631, "totalSubmissionRaw": 31922}, "2233": {"acRate": 41.769653913515384, "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": 33866, "totalSubmissionRaw": 81078}, "2234": {"acRate": 29.680041030496707, "difficulty": "Hard", "likes": 433, "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": 7523, "totalSubmissionRaw": 25347}, "2235": {"acRate": 87.96881410266604, "difficulty": "Easy", "likes": 1650, "dislikes": 3120, "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": 553208, "totalSubmissionRaw": 628869}, "2236": {"acRate": 84.66451914870186, "difficulty": "Easy", "likes": 1279, "dislikes": 1538, "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": 246007, "totalSubmissionRaw": 290567}, "2237": {"acRate": 63.480769230769226, "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": 3301, "totalSubmissionRaw": 5200}, "2238": {"acRate": 71.5418118466899, "difficulty": "Medium", "likes": 68, "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": 8210, "totalSubmissionRaw": 11477}, "2239": {"acRate": 46.04104434185514, "difficulty": "Easy", "likes": 595, "dislikes": 44, "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": 94944, "totalSubmissionRaw": 206216}, "2240": {"acRate": 57.29974671521292, "difficulty": "Medium", "likes": 450, "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": 28956, "totalSubmissionRaw": 50535}, "2241": {"acRate": 42.27669390250681, "difficulty": "Medium", "likes": 262, "dislikes": 349, "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": 22818, "totalSubmissionRaw": 53973}, "2242": {"acRate": 38.78886050713351, "difficulty": "Hard", "likes": 523, "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": 12452, "totalSubmissionRaw": 32102}, "2243": {"acRate": 66.30205736162273, "difficulty": "Easy", "likes": 549, "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": 41218, "totalSubmissionRaw": 62167}, "2244": {"acRate": 62.8952878937512, "difficulty": "Medium", "likes": 2775, "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": 153484, "totalSubmissionRaw": 244031}, "2245": {"acRate": 36.4332892998679, "difficulty": "Medium", "likes": 187, "dislikes": 401, "categoryTitle": "Algorithms", "frontendQuestionId": "2245", "paidOnly": false, "title": "Maximum Trailing Zeros in a Cornered Path", "titleSlug": "maximum-trailing-zeros-in-a-cornered-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8274, "totalSubmissionRaw": 22710}, "2246": {"acRate": 54.358412466520576, "difficulty": "Hard", "likes": 2384, "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": 75905, "totalSubmissionRaw": 139638}, "2247": {"acRate": 50.080993520518355, "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": 1855, "totalSubmissionRaw": 3704}, "2248": {"acRate": 68.3138335551871, "difficulty": "Easy", "likes": 717, "dislikes": 42, "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": 87758, "totalSubmissionRaw": 128463}, "2249": {"acRate": 53.44827586206896, "difficulty": "Medium", "likes": 236, "dislikes": 221, "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": 25513, "totalSubmissionRaw": 47734}, "2250": {"acRate": 35.293878049773944, "difficulty": "Medium", "likes": 506, "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": 17330, "totalSubmissionRaw": 49102}, "2251": {"acRate": 56.773279296794776, "difficulty": "Hard", "likes": 1657, "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": 82931, "totalSubmissionRaw": 146074}, "2252": {"acRate": 55.686138956100926, "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": 1611, "totalSubmissionRaw": 2893}, "2253": {"acRate": 66.78129298486932, "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": 971, "totalSubmissionRaw": 1454}, "2254": {"acRate": 64.26031294452346, "difficulty": "Hard", "likes": 81, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2254", "paidOnly": true, "title": "Design Video Sharing Platform", "titleSlug": "design-video-sharing-platform", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3614, "totalSubmissionRaw": 5624}, "2255": {"acRate": 72.71644383091943, "difficulty": "Easy", "likes": 540, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2255", "paidOnly": false, "title": "Count Prefixes of a Given String", "titleSlug": "count-prefixes-of-a-given-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65319, "totalSubmissionRaw": 89827}, "2256": {"acRate": 43.249947697181625, "difficulty": "Medium", "likes": 1511, "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": 86826, "totalSubmissionRaw": 200754}, "2257": {"acRate": 52.5491513005251, "difficulty": "Medium", "likes": 420, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2257", "paidOnly": false, "title": "Count Unguarded Cells in the Grid", "titleSlug": "count-unguarded-cells-in-the-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17213, "totalSubmissionRaw": 32756}, "2258": {"acRate": 35.21093000958773, "difficulty": "Hard", "likes": 735, "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": 11752, "totalSubmissionRaw": 33376}, "2259": {"acRate": 45.88132255337245, "difficulty": "Easy", "likes": 834, "dislikes": 55, "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": 90628, "totalSubmissionRaw": 197527}, "2260": {"acRate": 51.59029966138851, "difficulty": "Medium", "likes": 962, "dislikes": 38, "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": 79074, "totalSubmissionRaw": 153273}, "2261": {"acRate": 52.227502010380874, "difficulty": "Medium", "likes": 671, "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": 35721, "totalSubmissionRaw": 68395}, "2262": {"acRate": 55.773430898974915, "difficulty": "Hard", "likes": 1117, "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": 34982, "totalSubmissionRaw": 62723}, "2263": {"acRate": 65.90989712664064, "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": 3716, "totalSubmissionRaw": 5638}, "2264": {"acRate": 69.02596540691952, "difficulty": "Easy", "likes": 1004, "dislikes": 50, "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": 150810, "totalSubmissionRaw": 218483}, "2265": {"acRate": 86.35149452233894, "difficulty": "Medium", "likes": 2203, "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": 153229, "totalSubmissionRaw": 177448}, "2266": {"acRate": 47.95072788353863, "difficulty": "Medium", "likes": 874, "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": 21410, "totalSubmissionRaw": 44650}, "2267": {"acRate": 39.00440017407282, "difficulty": "Hard", "likes": 517, "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": 16133, "totalSubmissionRaw": 41362}, "2268": {"acRate": 71.32875303795102, "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": 30523, "totalSubmissionRaw": 42792}, "2269": {"acRate": 60.372414188846705, "difficulty": "Easy", "likes": 659, "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": 63126, "totalSubmissionRaw": 104561}, "2270": {"acRate": 48.17228955126105, "difficulty": "Medium", "likes": 571, "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": 44121, "totalSubmissionRaw": 91590}, "2271": {"acRate": 33.94078815763152, "difficulty": "Medium", "likes": 776, "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": 16967, "totalSubmissionRaw": 49990}, "2272": {"acRate": 46.23012560683259, "difficulty": "Hard", "likes": 1850, "dislikes": 206, "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": 69231, "totalSubmissionRaw": 149753}, "2273": {"acRate": 58.48010199435388, "difficulty": "Easy", "likes": 675, "dislikes": 187, "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": 64217, "totalSubmissionRaw": 109810}, "2274": {"acRate": 51.825273986523456, "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": 33149, "totalSubmissionRaw": 63963}, "2275": {"acRate": 72.94583001566795, "difficulty": "Medium", "likes": 564, "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": 28399, "totalSubmissionRaw": 38932}, "2276": {"acRate": 35.4025974025974, "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": 19081, "totalSubmissionRaw": 53899}, "2277": {"acRate": 62.6060233558697, "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": 5093, "totalSubmissionRaw": 8135}, "2278": {"acRate": 74.13394479700864, "difficulty": "Easy", "likes": 520, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2278", "paidOnly": false, "title": "Percentage of Letter in String", "titleSlug": "percentage-of-letter-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77917, "totalSubmissionRaw": 105103}, "2279": {"acRate": 67.53573144158005, "difficulty": "Medium", "likes": 1673, "dislikes": 71, "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": 97009, "totalSubmissionRaw": 143641}, "2280": {"acRate": 25.45175331160144, "difficulty": "Medium", "likes": 341, "dislikes": 524, "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": 27015, "totalSubmissionRaw": 106142}, "2281": {"acRate": 28.05561661903715, "difficulty": "Hard", "likes": 1188, "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": 20420, "totalSubmissionRaw": 72784}, "2282": {"acRate": 48.61710225831008, "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": 1916, "totalSubmissionRaw": 3941}, "2283": {"acRate": 72.45202050303969, "difficulty": "Easy", "likes": 602, "dislikes": 79, "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": 60780, "totalSubmissionRaw": 83890}, "2284": {"acRate": 57.14100107188099, "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": 35184, "totalSubmissionRaw": 61574}, "2285": {"acRate": 69.31528378384894, "difficulty": "Medium", "likes": 1271, "dislikes": 77, "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": 143780, "totalSubmissionRaw": 207429}, "2286": {"acRate": 18.019782095697142, "difficulty": "Hard", "likes": 333, "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": 7178, "totalSubmissionRaw": 39834}, "2287": {"acRate": 59.396865379233134, "difficulty": "Easy", "likes": 473, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2287", "paidOnly": false, "title": "Rearrange Characters to Make Target String", "titleSlug": "rearrange-characters-to-make-target-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42445, "totalSubmissionRaw": 71460}, "2288": {"acRate": 31.2477273582185, "difficulty": "Medium", "likes": 202, "dislikes": 1102, "categoryTitle": "Algorithms", "frontendQuestionId": "2288", "paidOnly": false, "title": "Apply Discount to Prices", "titleSlug": "apply-discount-to-prices", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24921, "totalSubmissionRaw": 79753}, "2289": {"acRate": 22.205571227080394, "difficulty": "Medium", "likes": 1338, "dislikes": 137, "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": 22671, "totalSubmissionRaw": 102096}, "2290": {"acRate": 54.78216440348223, "difficulty": "Hard", "likes": 955, "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": 27877, "totalSubmissionRaw": 50887}, "2291": {"acRate": 45.40543102222643, "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": 9581, "totalSubmissionRaw": 21101}, "2292": {"acRate": 39.35039264917998, "difficulty": "Medium", "likes": 61, "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": 7366, "totalSubmissionRaw": 18719}, "2293": {"acRate": 63.30795622448724, "difficulty": "Easy", "likes": 535, "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": 50559, "totalSubmissionRaw": 79862}, "2294": {"acRate": 73.92838125665602, "difficulty": "Medium", "likes": 771, "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": 44427, "totalSubmissionRaw": 60095}, "2295": {"acRate": 57.95048554385633, "difficulty": "Medium", "likes": 635, "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": 36820, "totalSubmissionRaw": 63537}, "2296": {"acRate": 45.50261761709005, "difficulty": "Hard", "likes": 572, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "2296", "paidOnly": false, "title": "Design a Text Editor", "titleSlug": "design-a-text-editor", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25901, "totalSubmissionRaw": 56922}, "2297": {"acRate": 45.768189361516285, "difficulty": "Medium", "likes": 147, "dislikes": 42, "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": 5240, "totalSubmissionRaw": 11449}, "2298": {"acRate": 81.54307865449543, "difficulty": "Medium", "likes": 49, "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": 6521, "totalSubmissionRaw": 7997}, "2299": {"acRate": 54.92380570454659, "difficulty": "Easy", "likes": 348, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2299", "paidOnly": false, "title": "Strong Password Checker II", "titleSlug": "strong-password-checker-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43827, "totalSubmissionRaw": 79796}, "2300": {"acRate": 43.63836260898468, "difficulty": "Medium", "likes": 2587, "dislikes": 80, "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": 170671, "totalSubmissionRaw": 391104}, "2301": {"acRate": 41.21663215624825, "difficulty": "Hard", "likes": 380, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "2301", "paidOnly": false, "title": "Match Substring After Replacement", "titleSlug": "match-substring-after-replacement", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14730, "totalSubmissionRaw": 35738}, "2302": {"acRate": 55.15036175976409, "difficulty": "Hard", "likes": 1048, "dislikes": 27, "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": 32167, "totalSubmissionRaw": 58326}, "2303": {"acRate": 65.94493715833457, "difficulty": "Easy", "likes": 264, "dislikes": 281, "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": 39929, "totalSubmissionRaw": 60549}, "2304": {"acRate": 66.94092031989281, "difficulty": "Medium", "likes": 891, "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": 31975, "totalSubmissionRaw": 47766}, "2305": {"acRate": 69.25233318186585, "difficulty": "Medium", "likes": 2571, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2305", "paidOnly": false, "title": "Fair Distribution of Cookies", "titleSlug": "fair-distribution-of-cookies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99062, "totalSubmissionRaw": 143045}, "2306": {"acRate": 46.41067183501658, "difficulty": "Hard", "likes": 1947, "dislikes": 72, "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": 61302, "totalSubmissionRaw": 132086}, "2307": {"acRate": 43.30612742112316, "difficulty": "Hard", "likes": 60, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2307", "paidOnly": true, "title": "Check for Contradictions in Equations", "titleSlug": "check-for-contradictions-in-equations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3555, "totalSubmissionRaw": 8209}, "2308": {"acRate": 69.37831434051675, "difficulty": "Medium", "likes": 79, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "2308", "paidOnly": true, "title": "Arrange Table by Gender", "titleSlug": "arrange-table-by-gender", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6149, "totalSubmissionRaw": 8863}, "2309": {"acRate": 70.24532276050056, "difficulty": "Easy", "likes": 482, "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": 56695, "totalSubmissionRaw": 80710}, "2310": {"acRate": 26.92292478392437, "difficulty": "Medium", "likes": 406, "dislikes": 328, "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": 27225, "totalSubmissionRaw": 101122}, "2311": {"acRate": 38.06526143079576, "difficulty": "Medium", "likes": 686, "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": 22736, "totalSubmissionRaw": 59729}, "2312": {"acRate": 50.22069209039548, "difficulty": "Hard", "likes": 546, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2312", "paidOnly": false, "title": "Selling Pieces of Wood", "titleSlug": "selling-pieces-of-wood", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11378, "totalSubmissionRaw": 22656}, "2313": {"acRate": 58.64462809917356, "difficulty": "Hard", "likes": 100, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2313", "paidOnly": true, "title": "Minimum Flips in Binary Tree to Get Result", "titleSlug": "minimum-flips-in-binary-tree-to-get-result", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3548, "totalSubmissionRaw": 6050}, "2314": {"acRate": 71.97172800389959, "difficulty": "Medium", "likes": 53, "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": 5906, "totalSubmissionRaw": 8206}, "2315": {"acRate": 82.49986437367764, "difficulty": "Easy", "likes": 630, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "2315", "paidOnly": false, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76035, "totalSubmissionRaw": 92164}, "2316": {"acRate": 49.213449211366324, "difficulty": "Medium", "likes": 2051, "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": 94510, "totalSubmissionRaw": 192041}, "2317": {"acRate": 79.59791964475805, "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": 26171, "totalSubmissionRaw": 32879}, "2318": {"acRate": 57.39753161663873, "difficulty": "Hard", "likes": 439, "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": 11301, "totalSubmissionRaw": 19689}, "2319": {"acRate": 65.26837049293512, "difficulty": "Easy", "likes": 494, "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": 54830, "totalSubmissionRaw": 84007}, "2320": {"acRate": 42.08156266308805, "difficulty": "Medium", "likes": 583, "dislikes": 194, "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": 28222, "totalSubmissionRaw": 67065}, "2321": {"acRate": 56.97856769472034, "difficulty": "Hard", "likes": 793, "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": 19620, "totalSubmissionRaw": 34434}, "2322": {"acRate": 52.48119262889088, "difficulty": "Hard", "likes": 454, "dislikes": 18, "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": 7604, "totalSubmissionRaw": 14489}, "2323": {"acRate": 65.91634980988593, "difficulty": "Medium", "likes": 63, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2323", "paidOnly": true, "title": "Find Minimum Time to Finish All Jobs II", "titleSlug": "find-minimum-time-to-finish-all-jobs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8668, "totalSubmissionRaw": 13150}, "2324": {"acRate": 74.46686430142489, "difficulty": "Medium", "likes": 49, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2324", "paidOnly": true, "title": "Product Sales Analysis IV", "titleSlug": "product-sales-analysis-iv", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7787, "totalSubmissionRaw": 10457}, "2325": {"acRate": 84.68482193867834, "difficulty": "Easy", "likes": 998, "dislikes": 102, "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": 111170, "totalSubmissionRaw": 131275}, "2326": {"acRate": 75.88356906113609, "difficulty": "Medium", "likes": 771, "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": 46248, "totalSubmissionRaw": 60946}, "2327": {"acRate": 46.02633760014734, "difficulty": "Medium", "likes": 851, "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": 24990, "totalSubmissionRaw": 54295}, "2328": {"acRate": 58.16993464052288, "difficulty": "Hard", "likes": 1989, "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": 69776, "totalSubmissionRaw": 119952}, "2329": {"acRate": 69.82877025913378, "difficulty": "Easy", "likes": 32, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "2329", "paidOnly": true, "title": "Product Sales Analysis V", "titleSlug": "product-sales-analysis-v", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7626, "totalSubmissionRaw": 10921}, "2330": {"acRate": 76.12291786329696, "difficulty": "Medium", "likes": 103, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2330", "paidOnly": true, "title": "Valid Palindrome IV", "titleSlug": "valid-palindrome-iv", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13253, "totalSubmissionRaw": 17410}, "2331": {"acRate": 82.76336250658647, "difficulty": "Easy", "likes": 1440, "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": 193196, "totalSubmissionRaw": 233432}, "2332": {"acRate": 27.532822341959474, "difficulty": "Medium", "likes": 461, "dislikes": 745, "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": 25396, "totalSubmissionRaw": 92239}, "2333": {"acRate": 25.582120042241574, "difficulty": "Medium", "likes": 628, "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": 14777, "totalSubmissionRaw": 57763}, "2334": {"acRate": 43.45905260574327, "difficulty": "Hard", "likes": 552, "dislikes": 9, "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": 10624, "totalSubmissionRaw": 24446}, "2335": {"acRate": 57.999930034865955, "difficulty": "Easy", "likes": 693, "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": 49739, "totalSubmissionRaw": 85757}, "2336": {"acRate": 71.59871929692781, "difficulty": "Medium", "likes": 1679, "dislikes": 196, "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": 152511, "totalSubmissionRaw": 213008}, "2337": {"acRate": 47.66725113428897, "difficulty": "Medium", "likes": 658, "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": 26370, "totalSubmissionRaw": 55321}, "2338": {"acRate": 26.964593221050865, "difficulty": "Hard", "likes": 485, "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": 6420, "totalSubmissionRaw": 23809}, "2339": {"acRate": 87.77366472765732, "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": 8299, "totalSubmissionRaw": 9455}, "2340": {"acRate": 72.6147669365335, "difficulty": "Medium", "likes": 180, "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": 32917, "totalSubmissionRaw": 45331}, "2341": {"acRate": 75.40330154225015, "difficulty": "Easy", "likes": 682, "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": 72260, "totalSubmissionRaw": 95832}, "2342": {"acRate": 55.26736053747453, "difficulty": "Medium", "likes": 703, "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": 50180, "totalSubmissionRaw": 90795}, "2343": {"acRate": 44.376056521173766, "difficulty": "Medium", "likes": 311, "dislikes": 431, "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": 30714, "totalSubmissionRaw": 69213}, "2344": {"acRate": 56.3415777751729, "difficulty": "Hard", "likes": 548, "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": 28839, "totalSubmissionRaw": 51186}, "2345": {"acRate": 37.76297041320929, "difficulty": "Medium", "likes": 157, "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": 9011, "totalSubmissionRaw": 23862}, "2346": {"acRate": 33.62660801173099, "difficulty": "Medium", "likes": 27, "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": 5045, "totalSubmissionRaw": 15003}, "2347": {"acRate": 60.77815369743838, "difficulty": "Easy", "likes": 371, "dislikes": 38, "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": 42754, "totalSubmissionRaw": 70344}, "2348": {"acRate": 66.77474243383169, "difficulty": "Medium", "likes": 2260, "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": 128719, "totalSubmissionRaw": 192766}, "2349": {"acRate": 44.85264966301044, "difficulty": "Medium", "likes": 398, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2349", "paidOnly": false, "title": "Design a Number Container System", "titleSlug": "design-a-number-container-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23758, "totalSubmissionRaw": 52969}, "2350": {"acRate": 68.70546581102013, "difficulty": "Hard", "likes": 644, "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": 15524, "totalSubmissionRaw": 22595}, "2351": {"acRate": 73.6949129372362, "difficulty": "Easy", "likes": 1043, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2351", "paidOnly": false, "title": "First Letter to Appear Twice", "titleSlug": "first-letter-to-appear-twice", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 129380, "totalSubmissionRaw": 175562}, "2352": {"acRate": 70.40335663041498, "difficulty": "Medium", "likes": 2231, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "2352", "paidOnly": false, "title": "Equal Row and Column Pairs", "titleSlug": "equal-row-and-column-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 243469, "totalSubmissionRaw": 345820}, "2353": {"acRate": 45.23463957426222, "difficulty": "Medium", "likes": 1493, "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": 85085, "totalSubmissionRaw": 188097}, "2354": {"acRate": 47.64181498503964, "difficulty": "Hard", "likes": 592, "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": 15445, "totalSubmissionRaw": 32419}, "2355": {"acRate": 40.1394986545815, "difficulty": "Hard", "likes": 284, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2355", "paidOnly": true, "title": "Maximum Number of Books You Can Take", "titleSlug": "maximum-number-of-books-you-can-take", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11337, "totalSubmissionRaw": 28244}, "2356": {"acRate": 88.66913580246913, "difficulty": "Easy", "likes": 474, "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": 215466, "totalSubmissionRaw": 243000}, "2357": {"acRate": 72.48982529283303, "difficulty": "Easy", "likes": 1182, "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": 116842, "totalSubmissionRaw": 161184}, "2358": {"acRate": 68.1199101376018, "difficulty": "Medium", "likes": 675, "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": 38812, "totalSubmissionRaw": 56976}, "2359": {"acRate": 45.53472924519629, "difficulty": "Medium", "likes": 1685, "dislikes": 405, "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": 79245, "totalSubmissionRaw": 174032}, "2360": {"acRate": 49.782992779228756, "difficulty": "Hard", "likes": 2339, "dislikes": 48, "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": 77769, "totalSubmissionRaw": 156216}, "2361": {"acRate": 78.1842726965913, "difficulty": "Hard", "likes": 185, "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": 11582, "totalSubmissionRaw": 14814}, "2362": {"acRate": 74.81657743406703, "difficulty": "Hard", "likes": 32, "dislikes": 29, "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": 3773, "totalSubmissionRaw": 5043}, "2363": {"acRate": 75.76787084921924, "difficulty": "Easy", "likes": 559, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2363", "paidOnly": false, "title": "Merge Similar Items", "titleSlug": "merge-similar-items", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60215, "totalSubmissionRaw": 79473}, "2364": {"acRate": 41.84117743008068, "difficulty": "Medium", "likes": 989, "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"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33347, "totalSubmissionRaw": 79699}, "2365": {"acRate": 52.755033694656696, "difficulty": "Medium", "likes": 559, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2365", "paidOnly": false, "title": "Task Scheduler II", "titleSlug": "task-scheduler-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38594, "totalSubmissionRaw": 73156}, "2366": {"acRate": 53.483617967339335, "difficulty": "Hard", "likes": 2004, "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": 67238, "totalSubmissionRaw": 125717}, "2367": {"acRate": 84.46982015425868, "difficulty": "Easy", "likes": 1266, "dislikes": 84, "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": 137663, "totalSubmissionRaw": 162973}, "2368": {"acRate": 59.000452966933416, "difficulty": "Medium", "likes": 710, "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": 58614, "totalSubmissionRaw": 99345}, "2369": {"acRate": 51.87712518423099, "difficulty": "Medium", "likes": 1999, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "2369", "paidOnly": false, "title": "Check if There is a Valid Partition For The Array", "titleSlug": "check-if-there-is-a-valid-partition-for-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89403, "totalSubmissionRaw": 172337}, "2370": {"acRate": 47.28690762063091, "difficulty": "Medium", "likes": 1456, "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": 115198, "totalSubmissionRaw": 243615}, "2371": {"acRate": 66.44382143627345, "difficulty": "Hard", "likes": 100, "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": 3081, "totalSubmissionRaw": 4637}, "2372": {"acRate": 83.13927781871776, "difficulty": "Medium", "likes": 37, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2372", "paidOnly": true, "title": "Calculate the Influence of Each Salesperson", "titleSlug": "calculate-the-influence-of-each-salesperson", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5641, "totalSubmissionRaw": 6785}, "2373": {"acRate": 87.92725273912147, "difficulty": "Easy", "likes": 1221, "dislikes": 162, "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": 166361, "totalSubmissionRaw": 189203}, "2374": {"acRate": 47.87177926557111, "difficulty": "Medium", "likes": 445, "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": 35394, "totalSubmissionRaw": 73935}, "2375": {"acRate": 76.25065251435531, "difficulty": "Medium", "likes": 943, "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": 35057, "totalSubmissionRaw": 45976}, "2376": {"acRate": 39.03005936488991, "difficulty": "Hard", "likes": 573, "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": 12426, "totalSubmissionRaw": 31837}, "2377": {"acRate": 78.99305555555556, "difficulty": "Easy", "likes": 38, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2377", "paidOnly": true, "title": "Sort the Olympic Table", "titleSlug": "sort-the-olympic-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6370, "totalSubmissionRaw": 8064}, "2378": {"acRate": 58.160919540229884, "difficulty": "Medium", "likes": 54, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2378", "paidOnly": true, "title": "Choose Edges to Maximize Score in a Tree", "titleSlug": "choose-edges-to-maximize-score-in-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1518, "totalSubmissionRaw": 2610}, "2379": {"acRate": 59.24067431107056, "difficulty": "Easy", "likes": 737, "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": 57140, "totalSubmissionRaw": 96454}, "2380": {"acRate": 50.81760432813592, "difficulty": "Medium", "likes": 503, "dislikes": 111, "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": 33439, "totalSubmissionRaw": 65802}, "2381": {"acRate": 37.86718067842963, "difficulty": "Medium", "likes": 761, "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": 22985, "totalSubmissionRaw": 60699}, "2382": {"acRate": 49.3366196444491, "difficulty": "Hard", "likes": 465, "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": 9408, "totalSubmissionRaw": 19069}, "2383": {"acRate": 41.38479904496617, "difficulty": "Easy", "likes": 346, "dislikes": 280, "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": 33280, "totalSubmissionRaw": 80416}, "2384": {"acRate": 35.501902228076716, "difficulty": "Medium", "likes": 612, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "2384", "paidOnly": false, "title": "Largest Palindromic Number", "titleSlug": "largest-palindromic-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40966, "totalSubmissionRaw": 115391}, "2385": {"acRate": 62.745562337753455, "difficulty": "Medium", "likes": 2733, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2385", "paidOnly": false, "title": "Amount of Time for Binary Tree to Be Infected", "titleSlug": "amount-of-time-for-binary-tree-to-be-infected", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143090, "totalSubmissionRaw": 228048}, "2386": {"acRate": 39.227590859263, "difficulty": "Hard", "likes": 567, "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": 9304, "totalSubmissionRaw": 23718}, "2387": {"acRate": 69.90639314877515, "difficulty": "Medium", "likes": 77, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2387", "paidOnly": true, "title": "Median of a Row Wise Sorted Matrix", "titleSlug": "median-of-a-row-wise-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3510, "totalSubmissionRaw": 5021}, "2388": {"acRate": 50.61536755737887, "difficulty": "Medium", "likes": 85, "dislikes": 29, "categoryTitle": "Database", "frontendQuestionId": "2388", "paidOnly": true, "title": "Change Null Values in a Table to the Previous Value", "titleSlug": "change-null-values-in-a-table-to-the-previous-value", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4565, "totalSubmissionRaw": 9019}, "2389": {"acRate": 71.97538717490765, "difficulty": "Easy", "likes": 1905, "dislikes": 173, "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": 117674, "totalSubmissionRaw": 163492}, "2390": {"acRate": 76.12431420834409, "difficulty": "Medium", "likes": 2930, "dislikes": 210, "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": 356733, "totalSubmissionRaw": 468618}, "2391": {"acRate": 85.20962294238036, "difficulty": "Medium", "likes": 1535, "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": 135727, "totalSubmissionRaw": 159286}, "2392": {"acRate": 79.57219158753107, "difficulty": "Hard", "likes": 1359, "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": 91921, "totalSubmissionRaw": 115519}, "2393": {"acRate": 74.84221016498726, "difficulty": "Medium", "likes": 133, "dislikes": 2, "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": 6759, "totalSubmissionRaw": 9031}, "2394": {"acRate": 40.756633680707594, "difficulty": "Medium", "likes": 28, "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": 4654, "totalSubmissionRaw": 11419}, "2395": {"acRate": 65.32134024043609, "difficulty": "Easy", "likes": 542, "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": 53085, "totalSubmissionRaw": 81268}, "2396": {"acRate": 87.86710121310882, "difficulty": "Medium", "likes": 635, "dislikes": 1583, "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": 97058, "totalSubmissionRaw": 110460}, "2397": {"acRate": 55.87288105602152, "difficulty": "Medium", "likes": 266, "dislikes": 414, "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": 15787, "totalSubmissionRaw": 28256}, "2398": {"acRate": 34.8626736220225, "difficulty": "Hard", "likes": 804, "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": 22188, "totalSubmissionRaw": 63644}, "2399": {"acRate": 70.80285892720838, "difficulty": "Easy", "likes": 486, "dislikes": 60, "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": 51017, "totalSubmissionRaw": 72055}, "2400": {"acRate": 35.344884890651656, "difficulty": "Medium", "likes": 794, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2400", "paidOnly": false, "title": "Number of Ways to Reach a Position After Exactly k Steps", "titleSlug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31903, "totalSubmissionRaw": 90262}, "2401": {"acRate": 51.63535663498241, "difficulty": "Medium", "likes": 1312, "dislikes": 31, "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": 34495, "totalSubmissionRaw": 66805}, "2402": {"acRate": 44.17748164961286, "difficulty": "Hard", "likes": 1720, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "2402", "paidOnly": false, "title": "Meeting Rooms III", "titleSlug": "meeting-rooms-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120673, "totalSubmissionRaw": 273155}, "2403": {"acRate": 56.00798403193613, "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": 1403, "totalSubmissionRaw": 2505}, "2404": {"acRate": 50.76445642219228, "difficulty": "Easy", "likes": 979, "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": 87025, "totalSubmissionRaw": 171429}, "2405": {"acRate": 78.02191278666385, "difficulty": "Medium", "likes": 2637, "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": 210287, "totalSubmissionRaw": 269521}, "2406": {"acRate": 47.44075021312873, "difficulty": "Medium", "likes": 783, "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": 27824, "totalSubmissionRaw": 58650}, "2407": {"acRate": 24.343155538977992, "difficulty": "Hard", "likes": 887, "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": 16316, "totalSubmissionRaw": 67025}, "2408": {"acRate": 78.40590252520005, "difficulty": "Medium", "likes": 52, "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": 7545, "totalSubmissionRaw": 9623}, "2409": {"acRate": 45.38071453082701, "difficulty": "Easy", "likes": 253, "dislikes": 585, "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": 23804, "totalSubmissionRaw": 52454}, "2410": {"acRate": 63.735732733483296, "difficulty": "Medium", "likes": 508, "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": 38251, "totalSubmissionRaw": 60015}, "2411": {"acRate": 44.428614028693545, "difficulty": "Medium", "likes": 569, "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": 13409, "totalSubmissionRaw": 30181}, "2412": {"acRate": 40.62834175301449, "difficulty": "Hard", "likes": 400, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2412", "paidOnly": false, "title": "Minimum Money Required Before Transactions", "titleSlug": "minimum-money-required-before-transactions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11018, "totalSubmissionRaw": 27119}, "2413": {"acRate": 87.88514912861551, "difficulty": "Easy", "likes": 907, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "2413", "paidOnly": false, "title": "Smallest Even Multiple", "titleSlug": "smallest-even-multiple", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 187139, "totalSubmissionRaw": 212936}, "2414": {"acRate": 58.74694675134343, "difficulty": "Medium", "likes": 509, "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": 48102, "totalSubmissionRaw": 81880}, "2415": {"acRate": 78.24270129287378, "difficulty": "Medium", "likes": 1134, "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": 55798, "totalSubmissionRaw": 71314}, "2416": {"acRate": 46.33546144447695, "difficulty": "Hard", "likes": 671, "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": 26926, "totalSubmissionRaw": 58111}, "2417": {"acRate": 45.18459069020867, "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": 1126, "totalSubmissionRaw": 2492}, "2418": {"acRate": 84.97005505870986, "difficulty": "Easy", "likes": 1724, "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": 306029, "totalSubmissionRaw": 360161}, "2419": {"acRate": 49.70427465383753, "difficulty": "Medium", "likes": 463, "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": 28825, "totalSubmissionRaw": 57993}, "2420": {"acRate": 38.96408161973057, "difficulty": "Medium", "likes": 630, "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": 24614, "totalSubmissionRaw": 63171}, "2421": {"acRate": 56.31020956634292, "difficulty": "Hard", "likes": 2247, "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": 56991, "totalSubmissionRaw": 101209}, "2422": {"acRate": 69.05694809725726, "difficulty": "Medium", "likes": 135, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2422", "paidOnly": true, "title": "Merge Operations to Turn Array Into a Palindrome", "titleSlug": "merge-operations-to-turn-array-into-a-palindrome", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12866, "totalSubmissionRaw": 18631}, "2423": {"acRate": 17.433122618997782, "difficulty": "Easy", "likes": 682, "dislikes": 1232, "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": 49971, "totalSubmissionRaw": 286644}, "2424": {"acRate": 55.632533942393096, "difficulty": "Medium", "likes": 360, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2424", "paidOnly": false, "title": "Longest Uploaded Prefix", "titleSlug": "longest-uploaded-prefix", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21922, "totalSubmissionRaw": 39405}, "2425": {"acRate": 58.22114446581376, "difficulty": "Medium", "likes": 406, "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": 20888, "totalSubmissionRaw": 35877}, "2426": {"acRate": 44.321106821106824, "difficulty": "Hard", "likes": 534, "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": 13775, "totalSubmissionRaw": 31080}, "2427": {"acRate": 79.17787881599703, "difficulty": "Easy", "likes": 582, "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": 93862, "totalSubmissionRaw": 118546}, "2428": {"acRate": 74.96873658472852, "difficulty": "Medium", "likes": 453, "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": 40165, "totalSubmissionRaw": 53575}, "2429": {"acRate": 44.382088615046506, "difficulty": "Medium", "likes": 481, "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": 22618, "totalSubmissionRaw": 50962}, "2430": {"acRate": 33.66964893513566, "difficulty": "Hard", "likes": 483, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2430", "paidOnly": false, "title": "Maximum Deletions on a String", "titleSlug": "maximum-deletions-on-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13849, "totalSubmissionRaw": 41132}, "2431": {"acRate": 63.85063559322034, "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": 2411, "totalSubmissionRaw": 3776}, "2432": {"acRate": 50.38233152204358, "difficulty": "Easy", "likes": 276, "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": 35975, "totalSubmissionRaw": 71404}, "2433": {"acRate": 88.03479333603669, "difficulty": "Medium", "likes": 1391, "dislikes": 86, "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": 154141, "totalSubmissionRaw": 175091}, "2434": {"acRate": 40.156017830609215, "difficulty": "Medium", "likes": 652, "dislikes": 194, "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": 19458, "totalSubmissionRaw": 48456}, "2435": {"acRate": 43.17287915418756, "difficulty": "Hard", "likes": 899, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2435", "paidOnly": false, "title": "Paths in Matrix Whose Sum Is Divisible by K", "titleSlug": "paths-in-matrix-whose-sum-is-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23929, "totalSubmissionRaw": 55426}, "2436": {"acRate": 71.20215311004785, "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": 2381, "totalSubmissionRaw": 3344}, "2437": {"acRate": 46.96978450517072, "difficulty": "Easy", "likes": 287, "dislikes": 238, "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": 32520, "totalSubmissionRaw": 69236}, "2438": {"acRate": 40.73106417979051, "difficulty": "Medium", "likes": 294, "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": 16837, "totalSubmissionRaw": 41337}, "2439": {"acRate": 46.45312595067287, "difficulty": "Medium", "likes": 2424, "dislikes": 619, "categoryTitle": "Algorithms", "frontendQuestionId": "2439", "paidOnly": false, "title": "Minimize Maximum of Array", "titleSlug": "minimize-maximum-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83984, "totalSubmissionRaw": 180793}, "2440": {"acRate": 53.01159463936153, "difficulty": "Hard", "likes": 390, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2440", "paidOnly": false, "title": "Create Components With Same Value", "titleSlug": "create-components-with-same-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7040, "totalSubmissionRaw": 13281}, "2441": {"acRate": 75.07243322973186, "difficulty": "Easy", "likes": 999, "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": 228017, "totalSubmissionRaw": 303729}, "2442": {"acRate": 79.7605784046462, "difficulty": "Medium", "likes": 631, "dislikes": 56, "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": 67294, "totalSubmissionRaw": 84370}, "2443": {"acRate": 47.64731468925108, "difficulty": "Medium", "likes": 257, "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": 37244, "totalSubmissionRaw": 78166}, "2444": {"acRate": 67.87396323927813, "difficulty": "Hard", "likes": 3167, "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": 146565, "totalSubmissionRaw": 215937}, "2445": {"acRate": 68.62617733030204, "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": 2113, "totalSubmissionRaw": 3079}, "2446": {"acRate": 51.210266018867515, "difficulty": "Easy", "likes": 460, "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": 47010, "totalSubmissionRaw": 91798}, "2447": {"acRate": 50.3733583489681, "difficulty": "Medium", "likes": 443, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2447", "paidOnly": false, "title": "Number of Subarrays With GCD Equal to K", "titleSlug": "number-of-subarrays-with-gcd-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26849, "totalSubmissionRaw": 53300}, "2448": {"acRate": 46.01159692838113, "difficulty": "Hard", "likes": 2388, "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": 67528, "totalSubmissionRaw": 146760}, "2449": {"acRate": 62.117735212850654, "difficulty": "Hard", "likes": 426, "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": 13264, "totalSubmissionRaw": 21353}, "2450": {"acRate": 64.24242424242425, "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": 1060, "totalSubmissionRaw": 1650}, "2451": {"acRate": 59.449739950890354, "difficulty": "Easy", "likes": 397, "dislikes": 112, "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": 30748, "totalSubmissionRaw": 51721}, "2452": {"acRate": 60.85464172631243, "difficulty": "Medium", "likes": 298, "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": 22871, "totalSubmissionRaw": 37583}, "2453": {"acRate": 39.66394226588992, "difficulty": "Medium", "likes": 567, "dislikes": 25, "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": 18246, "totalSubmissionRaw": 46002}, "2454": {"acRate": 38.98642405288222, "difficulty": "Hard", "likes": 665, "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": 10970, "totalSubmissionRaw": 28138}, "2455": {"acRate": 60.64253810563422, "difficulty": "Easy", "likes": 335, "dislikes": 37, "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": 60554, "totalSubmissionRaw": 99854}, "2456": {"acRate": 44.008065883949264, "difficulty": "Medium", "likes": 273, "dislikes": 366, "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": 23352, "totalSubmissionRaw": 53063}, "2457": {"acRate": 37.731719876416065, "difficulty": "Medium", "likes": 526, "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": 20517, "totalSubmissionRaw": 54372}, "2458": {"acRate": 41.21228685525137, "difficulty": "Hard", "likes": 850, "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": 27142, "totalSubmissionRaw": 65859}, "2459": {"acRate": 45.98982311606494, "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": 1898, "totalSubmissionRaw": 4127}, "2460": {"acRate": 67.91494128708317, "difficulty": "Easy", "likes": 552, "dislikes": 28, "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": 67900, "totalSubmissionRaw": 99978}, "2461": {"acRate": 34.24404730338866, "difficulty": "Medium", "likes": 1331, "dislikes": 25, "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": 64569, "totalSubmissionRaw": 188563}, "2462": {"acRate": 42.90693494775869, "difficulty": "Medium", "likes": 1901, "dislikes": 597, "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": 106238, "totalSubmissionRaw": 247600}, "2463": {"acRate": 40.926659125188536, "difficulty": "Hard", "likes": 469, "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": 8683, "totalSubmissionRaw": 21216}, "2464": {"acRate": 54.6485260770975, "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": 1205, "totalSubmissionRaw": 2205}, "2465": {"acRate": 58.2438177655908, "difficulty": "Easy", "likes": 372, "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": 46305, "totalSubmissionRaw": 79502}, "2466": {"acRate": 54.38814974712357, "difficulty": "Medium", "likes": 1710, "dislikes": 148, "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": 78611, "totalSubmissionRaw": 144537}, "2467": {"acRate": 49.61237448316598, "difficulty": "Medium", "likes": 707, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2467", "paidOnly": false, "title": "Most Profitable Path in a Tree", "titleSlug": "most-profitable-path-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13439, "totalSubmissionRaw": 27088}, "2468": {"acRate": 44.12048451066566, "difficulty": "Hard", "likes": 163, "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": 12348, "totalSubmissionRaw": 27987}, "2469": {"acRate": 89.72957901033023, "difficulty": "Easy", "likes": 623, "dislikes": 338, "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": 199520, "totalSubmissionRaw": 222357}, "2470": {"acRate": 39.10946574737629, "difficulty": "Medium", "likes": 360, "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": 23030, "totalSubmissionRaw": 58886}, "2471": {"acRate": 62.10978362605296, "difficulty": "Medium", "likes": 643, "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": 22562, "totalSubmissionRaw": 36326}, "2472": {"acRate": 40.576903981729714, "difficulty": "Hard", "likes": 460, "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": 16346, "totalSubmissionRaw": 40284}, "2473": {"acRate": 67.74954433365498, "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": 6319, "totalSubmissionRaw": 9327}, "2474": {"acRate": 45.24315705554079, "difficulty": "Hard", "likes": 39, "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": 3404, "totalSubmissionRaw": 7525}, "2475": {"acRate": 71.7069141441135, "difficulty": "Easy", "likes": 406, "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": 44274, "totalSubmissionRaw": 61743}, "2476": {"acRate": 41.593765454204394, "difficulty": "Medium", "likes": 444, "dislikes": 121, "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": 24391, "totalSubmissionRaw": 58641}, "2477": {"acRate": 64.37994959596051, "difficulty": "Medium", "likes": 2206, "dislikes": 89, "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": 71783, "totalSubmissionRaw": 111493}, "2478": {"acRate": 31.209663094321748, "difficulty": "Hard", "likes": 348, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2478", "paidOnly": false, "title": "Number of Beautiful Partitions", "titleSlug": "number-of-beautiful-partitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10542, "totalSubmissionRaw": 33778}, "2479": {"acRate": 49.74433893352812, "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": 681, "totalSubmissionRaw": 1369}, "2480": {"acRate": 76.78888709416896, "difficulty": "Easy", "likes": 28, "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": 4754, "totalSubmissionRaw": 6191}, "2481": {"acRate": 53.554247467654704, "difficulty": "Easy", "likes": 223, "dislikes": 50, "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": 35846, "totalSubmissionRaw": 66934}, "2482": {"acRate": 84.4300552195635, "difficulty": "Medium", "likes": 1177, "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": 128435, "totalSubmissionRaw": 152120}, "2483": {"acRate": 67.37455539008751, "difficulty": "Medium", "likes": 1939, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2483", "paidOnly": false, "title": "Minimum Penalty for a Shop", "titleSlug": "minimum-penalty-for-a-shop", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 109482, "totalSubmissionRaw": 162499}, "2484": {"acRate": 38.31392987681062, "difficulty": "Hard", "likes": 500, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2484", "paidOnly": false, "title": "Count Palindromic Subsequences", "titleSlug": "count-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11321, "totalSubmissionRaw": 29548}, "2485": {"acRate": 83.93050875980622, "difficulty": "Easy", "likes": 1287, "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": 234407, "totalSubmissionRaw": 279287}, "2486": {"acRate": 73.00068799317387, "difficulty": "Medium", "likes": 1101, "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": 189931, "totalSubmissionRaw": 260177}, "2487": {"acRate": 74.32489594899802, "difficulty": "Medium", "likes": 2096, "dislikes": 74, "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": 196792, "totalSubmissionRaw": 264766}, "2488": {"acRate": 44.44289402079118, "difficulty": "Hard", "likes": 577, "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": 12740, "totalSubmissionRaw": 28666}, "2489": {"acRate": 56.69456066945606, "difficulty": "Medium", "likes": 47, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2489", "paidOnly": true, "title": "Number of Substrings With Fixed Ratio", "titleSlug": "number-of-substrings-with-fixed-ratio", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1084, "totalSubmissionRaw": 1912}, "2490": {"acRate": 62.86533733952472, "difficulty": "Easy", "likes": 364, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2490", "paidOnly": false, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41427, "totalSubmissionRaw": 65898}, "2491": {"acRate": 60.20696441608736, "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": 37934, "totalSubmissionRaw": 63006}, "2492": {"acRate": 57.468677418299585, "difficulty": "Medium", "likes": 1778, "dislikes": 304, "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": 87837, "totalSubmissionRaw": 152843}, "2493": {"acRate": 39.31537102473498, "difficulty": "Hard", "likes": 420, "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": 8901, "totalSubmissionRaw": 22640}, "2494": {"acRate": 32.08967709553288, "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": 1918, "totalSubmissionRaw": 5977}, "2495": {"acRate": 64.0885860306644, "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": 1881, "totalSubmissionRaw": 2935}, "2496": {"acRate": 72.57310392716612, "difficulty": "Easy", "likes": 398, "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": 47031, "totalSubmissionRaw": 64805}, "2497": {"acRate": 39.674458359656626, "difficulty": "Medium", "likes": 401, "dislikes": 52, "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": 21352, "totalSubmissionRaw": 53818}, "2498": {"acRate": 61.83425474848103, "difficulty": "Medium", "likes": 710, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "2498", "paidOnly": false, "title": "Frog Jump II", "titleSlug": "frog-jump-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22593, "totalSubmissionRaw": 36538}, "2499": {"acRate": 43.244739756367665, "difficulty": "Hard", "likes": 230, "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": 4686, "totalSubmissionRaw": 10836}, "2500": {"acRate": 78.42180316180267, "difficulty": "Easy", "likes": 637, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2500", "paidOnly": false, "title": "Delete Greatest Value in Each Row", "titleSlug": "delete-greatest-value-in-each-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63793, "totalSubmissionRaw": 81346}, "2501": {"acRate": 40.06682506682507, "difficulty": "Medium", "likes": 462, "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": 26981, "totalSubmissionRaw": 67340}, "2502": {"acRate": 53.336886362290514, "difficulty": "Medium", "likes": 287, "dislikes": 87, "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": 18014, "totalSubmissionRaw": 33774}, "2503": {"acRate": 37.90487194300019, "difficulty": "Hard", "likes": 471, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2503", "paidOnly": false, "title": "Maximum Number of Points From Grid Queries", "titleSlug": "maximum-number-of-points-from-grid-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9842, "totalSubmissionRaw": 25965}, "2504": {"acRate": 76.3706693575513, "difficulty": "Easy", "likes": 30, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2504", "paidOnly": true, "title": "Concatenate the Name and the Profession", "titleSlug": "concatenate-the-name-and-the-profession", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4541, "totalSubmissionRaw": 5946}, "2505": {"acRate": 66.87392055267702, "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": 3872, "totalSubmissionRaw": 5790}, "2506": {"acRate": 70.7585656428297, "difficulty": "Easy", "likes": 501, "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"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47870, "totalSubmissionRaw": 67653}, "2507": {"acRate": 49.03075623673856, "difficulty": "Medium", "likes": 390, "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": 23801, "totalSubmissionRaw": 48543}, "2508": {"acRate": 32.65755220526266, "difficulty": "Hard", "likes": 333, "dislikes": 57, "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": 13950, "totalSubmissionRaw": 42716}, "2509": {"acRate": 56.62695612469387, "difficulty": "Hard", "likes": 352, "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": 13642, "totalSubmissionRaw": 24091}, "2510": {"acRate": 50.30510651964458, "difficulty": "Medium", "likes": 94, "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": 4699, "totalSubmissionRaw": 9341}, "2511": {"acRate": 38.68851429827039, "difficulty": "Easy", "likes": 278, "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": 24650, "totalSubmissionRaw": 63714}, "2512": {"acRate": 45.294267407816015, "difficulty": "Medium", "likes": 330, "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": 21349, "totalSubmissionRaw": 47134}, "2513": {"acRate": 30.737948366461048, "difficulty": "Medium", "likes": 479, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2513", "paidOnly": false, "title": "Minimize the Maximum of Two Arrays", "titleSlug": "minimize-the-maximum-of-two-arrays", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13453, "totalSubmissionRaw": 43769}, "2514": {"acRate": 33.79041491739818, "difficulty": "Hard", "likes": 419, "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": 12395, "totalSubmissionRaw": 36682}, "2515": {"acRate": 49.60880669878116, "difficulty": "Easy", "likes": 346, "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": 30689, "totalSubmissionRaw": 61862}, "2516": {"acRate": 34.56554025186662, "difficulty": "Medium", "likes": 709, "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": 16990, "totalSubmissionRaw": 49153}, "2517": {"acRate": 64.24239004711258, "difficulty": "Medium", "likes": 911, "dislikes": 146, "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": 22772, "totalSubmissionRaw": 35447}, "2518": {"acRate": 31.59300215686946, "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": 9228, "totalSubmissionRaw": 29209}, "2519": {"acRate": 53.363418417712595, "difficulty": "Hard", "likes": 103, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2519", "paidOnly": true, "title": "Count the Number of K-Big Indices", "titleSlug": "count-the-number-of-k-big-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7568, "totalSubmissionRaw": 14182}, "2520": {"acRate": 84.91231352008604, "difficulty": "Easy", "likes": 509, "dislikes": 33, "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": 90784, "totalSubmissionRaw": 106915}, "2521": {"acRate": 51.74075888553503, "difficulty": "Medium", "likes": 472, "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": 32740, "totalSubmissionRaw": 63277}, "2522": {"acRate": 46.379230216739195, "difficulty": "Medium", "likes": 372, "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": 21955, "totalSubmissionRaw": 47338}, "2523": {"acRate": 38.03293104493905, "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": 25085, "totalSubmissionRaw": 65956}, "2524": {"acRate": 39.396346306592534, "difficulty": "Hard", "likes": 23, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2524", "paidOnly": true, "title": "Maximum Frequency Score of a Subarray", "titleSlug": "maximum-frequency-score-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 992, "totalSubmissionRaw": 2518}, "2525": {"acRate": 36.07036592368325, "difficulty": "Easy", "likes": 198, "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": 34550, "totalSubmissionRaw": 95785}, "2526": {"acRate": 49.583010443189785, "difficulty": "Medium", "likes": 312, "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": 26873, "totalSubmissionRaw": 54198}, "2527": {"acRate": 68.90640261358661, "difficulty": "Medium", "likes": 361, "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": 20459, "totalSubmissionRaw": 29691}, "2528": {"acRate": 32.797803879213355, "difficulty": "Hard", "likes": 460, "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": 7288, "totalSubmissionRaw": 22221}, "2529": {"acRate": 71.07423635064168, "difficulty": "Easy", "likes": 908, "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": 114361, "totalSubmissionRaw": 160902}, "2530": {"acRate": 46.264070435765575, "difficulty": "Medium", "likes": 391, "dislikes": 10, "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": 29058, "totalSubmissionRaw": 62809}, "2531": {"acRate": 26.52600158830134, "difficulty": "Medium", "likes": 567, "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": 19373, "totalSubmissionRaw": 73034}, "2532": {"acRate": 44.232771184676245, "difficulty": "Hard", "likes": 112, "dislikes": 219, "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": 4249, "totalSubmissionRaw": 9606}, "2533": {"acRate": 51.89609919449724, "difficulty": "Medium", "likes": 53, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2533", "paidOnly": true, "title": "Number of Good Binary Strings", "titleSlug": "number-of-good-binary-strings", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5734, "totalSubmissionRaw": 11049}, "2534": {"acRate": 49.076884167931205, "difficulty": "Hard", "likes": 85, "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": 7762, "totalSubmissionRaw": 15816}, "2535": {"acRate": 84.58883440211241, "difficulty": "Easy", "likes": 697, "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": 134547, "totalSubmissionRaw": 159060}, "2536": {"acRate": 50.024468109896766, "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": 21467, "totalSubmissionRaw": 42913}, "2537": {"acRate": 51.38547380366938, "difficulty": "Medium", "likes": 856, "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": 21734, "totalSubmissionRaw": 42296}, "2538": {"acRate": 32.1867223247973, "difficulty": "Hard", "likes": 433, "dislikes": 16, "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": 8019, "totalSubmissionRaw": 24914}, "2539": {"acRate": 52.364711232378355, "difficulty": "Medium", "likes": 28, "dislikes": 69, "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": 2303, "totalSubmissionRaw": 4398}, "2540": {"acRate": 58.69483050419015, "difficulty": "Easy", "likes": 1127, "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": 243806, "totalSubmissionRaw": 415379}, "2541": {"acRate": 31.760186392255846, "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": 22901, "totalSubmissionRaw": 72106}, "2542": {"acRate": 53.84203317943847, "difficulty": "Medium", "likes": 2780, "dislikes": 167, "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": 97494, "totalSubmissionRaw": 181074}, "2543": {"acRate": 42.88409138545378, "difficulty": "Hard", "likes": 246, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2543", "paidOnly": false, "title": "Check if Point Is Reachable", "titleSlug": "check-if-point-is-reachable", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8184, "totalSubmissionRaw": 19084}, "2544": {"acRate": 68.34004237288136, "difficulty": "Easy", "likes": 399, "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": 64514, "totalSubmissionRaw": 94401}, "2545": {"acRate": 85.59172279560529, "difficulty": "Medium", "likes": 667, "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": 66842, "totalSubmissionRaw": 78094}, "2546": {"acRate": 41.35734963010614, "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": 19287, "totalSubmissionRaw": 46635}, "2547": {"acRate": 40.91978050692448, "difficulty": "Hard", "likes": 433, "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": 12528, "totalSubmissionRaw": 30616}, "2548": {"acRate": 66.1668228678538, "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": 1412, "totalSubmissionRaw": 2134}, "2549": {"acRate": 60.57286572586279, "difficulty": "Easy", "likes": 265, "dislikes": 272, "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": 43352, "totalSubmissionRaw": 71570}, "2550": {"acRate": 27.98717777480967, "difficulty": "Medium", "likes": 242, "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": 20954, "totalSubmissionRaw": 74870}, "2551": {"acRate": 66.4552461995102, "difficulty": "Hard", "likes": 2040, "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": 58884, "totalSubmissionRaw": 88607}, "2552": {"acRate": 33.56914326341984, "difficulty": "Hard", "likes": 374, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2552", "paidOnly": false, "title": "Count Increasing Quadruplets", "titleSlug": "count-increasing-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9443, "totalSubmissionRaw": 28130}, "2553": {"acRate": 79.62334118039207, "difficulty": "Easy", "likes": 490, "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": 76440, "totalSubmissionRaw": 96002}, "2554": {"acRate": 54.356558141111464, "difficulty": "Medium", "likes": 335, "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": 32072, "totalSubmissionRaw": 59003}, "2555": {"acRate": 33.642421575407056, "difficulty": "Medium", "likes": 549, "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": 10703, "totalSubmissionRaw": 31814}, "2556": {"acRate": 27.336019827080616, "difficulty": "Medium", "likes": 590, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2556", "paidOnly": false, "title": "Disconnect Path in a Binary Matrix by at Most One Flip", "titleSlug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14449, "totalSubmissionRaw": 52857}, "2557": {"acRate": 39.47681331747919, "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": 1660, "totalSubmissionRaw": 4205}, "2558": {"acRate": 67.14757470766565, "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": 49614, "totalSubmissionRaw": 73888}, "2559": {"acRate": 52.57384118506757, "difficulty": "Medium", "likes": 445, "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": 29138, "totalSubmissionRaw": 55423}, "2560": {"acRate": 44.0187785110058, "difficulty": "Medium", "likes": 915, "dislikes": 32, "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": 19878, "totalSubmissionRaw": 45158}, "2561": {"acRate": 34.316717531366564, "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": 10120, "totalSubmissionRaw": 29490}, "2562": {"acRate": 70.08986410122115, "difficulty": "Easy", "likes": 355, "dislikes": 16, "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": 50853, "totalSubmissionRaw": 72554}, "2563": {"acRate": 33.18253220232485, "difficulty": "Medium", "likes": 806, "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": 26405, "totalSubmissionRaw": 79574}, "2564": {"acRate": 33.69087993269711, "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": 12815, "totalSubmissionRaw": 38037}, "2565": {"acRate": 32.01016733742851, "difficulty": "Hard", "likes": 379, "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": 7556, "totalSubmissionRaw": 23605}, "2566": {"acRate": 60.134116063763145, "difficulty": "Easy", "likes": 230, "dislikes": 42, "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": 25916, "totalSubmissionRaw": 43097}, "2567": {"acRate": 48.189062929376206, "difficulty": "Medium", "likes": 242, "dislikes": 224, "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": 17536, "totalSubmissionRaw": 36390}, "2568": {"acRate": 57.77850186452337, "difficulty": "Medium", "likes": 352, "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": 15959, "totalSubmissionRaw": 27621}, "2569": {"acRate": 28.57142857142857, "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": 5810, "totalSubmissionRaw": 20335}, "2570": {"acRate": 73.85924593658406, "difficulty": "Easy", "likes": 334, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2570", "paidOnly": false, "title": "Merge Two 2D Arrays by Summing Values", "titleSlug": "merge-two-2d-arrays-by-summing-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44351, "totalSubmissionRaw": 60048}, "2571": {"acRate": 55.654623982797936, "difficulty": "Medium", "likes": 533, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "2571", "paidOnly": false, "title": "Minimum Operations to Reduce an Integer to 0", "titleSlug": "minimum-operations-to-reduce-an-integer-to-0", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30024, "totalSubmissionRaw": 53947}, "2572": {"acRate": 23.32205973419711, "difficulty": "Medium", "likes": 459, "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": 9792, "totalSubmissionRaw": 41986}, "2573": {"acRate": 31.651289775936736, "difficulty": "Hard", "likes": 188, "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": 5043, "totalSubmissionRaw": 15933}, "2574": {"acRate": 86.99152912409397, "difficulty": "Easy", "likes": 1054, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2574", "paidOnly": false, "title": "Left and Right Sum Differences", "titleSlug": "left-and-right-sum-differences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 149421, "totalSubmissionRaw": 171765}, "2575": {"acRate": 33.11931941292522, "difficulty": "Medium", "likes": 526, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2575", "paidOnly": false, "title": "Find the Divisibility Array of a String", "titleSlug": "find-the-divisibility-array-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29042, "totalSubmissionRaw": 87689}, "2576": {"acRate": 38.78796986831476, "difficulty": "Medium", "likes": 558, "dislikes": 28, "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": 20648, "totalSubmissionRaw": 53233}, "2577": {"acRate": 35.8468916414134, "difficulty": "Hard", "likes": 545, "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": 12184, "totalSubmissionRaw": 33989}, "2578": {"acRate": 71.05759521405301, "difficulty": "Easy", "likes": 374, "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": 37296, "totalSubmissionRaw": 52487}, "2579": {"acRate": 57.92038818275507, "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": 26977, "totalSubmissionRaw": 46576}, "2580": {"acRate": 36.51789409483979, "difficulty": "Medium", "likes": 313, "dislikes": 20, "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": 16765, "totalSubmissionRaw": 45909}, "2581": {"acRate": 46.40607101947308, "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": 6482, "totalSubmissionRaw": 13968}, "2582": {"acRate": 56.913787039741536, "difficulty": "Easy", "likes": 1020, "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": 190956, "totalSubmissionRaw": 335518}, "2583": {"acRate": 47.84185284828635, "difficulty": "Medium", "likes": 554, "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": 40900, "totalSubmissionRaw": 85490}, "2584": {"acRate": 23.282598158022296, "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": 12008, "totalSubmissionRaw": 51575}, "2585": {"acRate": 57.64205306888234, "difficulty": "Hard", "likes": 469, "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": 17205, "totalSubmissionRaw": 29848}, "2586": {"acRate": 74.31881620592597, "difficulty": "Easy", "likes": 341, "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": 63634, "totalSubmissionRaw": 85623}, "2587": {"acRate": 41.2264360785186, "difficulty": "Medium", "likes": 289, "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": 29655, "totalSubmissionRaw": 71932}, "2588": {"acRate": 50.76036233873181, "difficulty": "Medium", "likes": 501, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2588", "paidOnly": false, "title": "Count the Number of Beautiful Subarrays", "titleSlug": "count-the-number-of-beautiful-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18492, "totalSubmissionRaw": 36430}, "2589": {"acRate": 39.65703754156817, "difficulty": "Hard", "likes": 425, "dislikes": 18, "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": 9898, "totalSubmissionRaw": 24959}, "2590": {"acRate": 58.25161109554497, "difficulty": "Medium", "likes": 39, "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": 2079, "totalSubmissionRaw": 3569}, "2591": {"acRate": 19.23178871780043, "difficulty": "Easy", "likes": 304, "dislikes": 835, "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": 31924, "totalSubmissionRaw": 165996}, "2592": {"acRate": 58.24913478735512, "difficulty": "Medium", "likes": 438, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2592", "paidOnly": false, "title": "Maximize Greatness of an Array", "titleSlug": "maximize-greatness-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25078, "totalSubmissionRaw": 43053}, "2593": {"acRate": 52.739179484357365, "difficulty": "Medium", "likes": 363, "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": 19167, "totalSubmissionRaw": 36343}, "2594": {"acRate": 45.09389440566316, "difficulty": "Medium", "likes": 586, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2594", "paidOnly": false, "title": "Minimum Time to Repair Cars", "titleSlug": "minimum-time-to-repair-cars", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18346, "totalSubmissionRaw": 40684}, "2595": {"acRate": 73.54690867150272, "difficulty": "Easy", "likes": 322, "dislikes": 110, "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": 48463, "totalSubmissionRaw": 65894}, "2596": {"acRate": 57.08900243029642, "difficulty": "Medium", "likes": 389, "dislikes": 58, "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": 29833, "totalSubmissionRaw": 52257}, "2597": {"acRate": 51.1465071934684, "difficulty": "Medium", "likes": 1196, "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": 116144, "totalSubmissionRaw": 227075}, "2598": {"acRate": 39.48842512268874, "difficulty": "Medium", "likes": 349, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2598", "paidOnly": false, "title": "Smallest Missing Non-negative Integer After Operations", "titleSlug": "smallest-missing-non-negative-integer-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15932, "totalSubmissionRaw": 40346}, "2599": {"acRate": 50.77679958570689, "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": 1961, "totalSubmissionRaw": 3862}, "2600": {"acRate": 61.93576965669989, "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": 41946, "totalSubmissionRaw": 67725}, "2601": {"acRate": 38.00514002126905, "difficulty": "Medium", "likes": 380, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2601", "paidOnly": false, "title": "Prime Subtraction Operation", "titleSlug": "prime-subtraction-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17154, "totalSubmissionRaw": 45136}, "2602": {"acRate": 35.764215496412696, "difficulty": "Medium", "likes": 714, "dislikes": 23, "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": 19391, "totalSubmissionRaw": 54219}, "2603": {"acRate": 37.584185280294584, "difficulty": "Hard", "likes": 439, "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": 7757, "totalSubmissionRaw": 20639}, "2604": {"acRate": 40.77298050139276, "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": 1171, "totalSubmissionRaw": 2872}, "2605": {"acRate": 54.32459380134533, "difficulty": "Easy", "likes": 294, "dislikes": 23, "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": 38684, "totalSubmissionRaw": 71209}, "2606": {"acRate": 56.9744863400316, "difficulty": "Medium", "likes": 359, "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": 25234, "totalSubmissionRaw": 44290}, "2607": {"acRate": 37.323335291475175, "difficulty": "Medium", "likes": 461, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2607", "paidOnly": false, "title": "Make K-Subarray Sums Equal", "titleSlug": "make-k-subarray-sums-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10801, "totalSubmissionRaw": 28939}, "2608": {"acRate": 36.50236139222923, "difficulty": "Hard", "likes": 512, "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": 18395, "totalSubmissionRaw": 50394}, "2609": {"acRate": 46.60033894343151, "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": 31897, "totalSubmissionRaw": 68448}, "2610": {"acRate": 87.17893326996608, "difficulty": "Medium", "likes": 1606, "dislikes": 79, "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": 201780, "totalSubmissionRaw": 231455}, "2611": {"acRate": 46.10678249700001, "difficulty": "Medium", "likes": 621, "dislikes": 59, "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": 27280, "totalSubmissionRaw": 59167}, "2612": {"acRate": 16.74347158218126, "difficulty": "Hard", "likes": 241, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2612", "paidOnly": false, "title": "Minimum Reverse Operations", "titleSlug": "minimum-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5123, "totalSubmissionRaw": 30597}, "2613": {"acRate": 42.88990825688073, "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": 561, "totalSubmissionRaw": 1308}, "2614": {"acRate": 34.25646616092229, "difficulty": "Easy", "likes": 346, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2614", "paidOnly": false, "title": "Prime In Diagonal", "titleSlug": "prime-in-diagonal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45879, "totalSubmissionRaw": 133928}, "2615": {"acRate": 31.216228454131073, "difficulty": "Medium", "likes": 734, "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": 20682, "totalSubmissionRaw": 66254}, "2616": {"acRate": 43.96555327954517, "difficulty": "Medium", "likes": 2313, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "2616", "paidOnly": false, "title": "Minimize the Maximum Difference of Pairs", "titleSlug": "minimize-the-maximum-difference-of-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73619, "totalSubmissionRaw": 167447}, "2617": {"acRate": 24.92266156701727, "difficulty": "Hard", "likes": 378, "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": 8862, "totalSubmissionRaw": 35558}, "2618": {"acRate": 27.596264018610466, "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": 23841, "totalSubmissionRaw": 86395}, "2619": {"acRate": 73.6123866897049, "difficulty": "Easy", "likes": 502, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2619", "paidOnly": false, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141866, "totalSubmissionRaw": 192721}, "2620": {"acRate": 81.28880595397375, "difficulty": "Easy", "likes": 1279, "dislikes": 105, "categoryTitle": "JavaScript", "frontendQuestionId": "2620", "paidOnly": false, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 412535, "totalSubmissionRaw": 507493}, "2621": {"acRate": 87.05395538501325, "difficulty": "Easy", "likes": 589, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2621", "paidOnly": false, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144739, "totalSubmissionRaw": 166264}, "2622": {"acRate": 74.59534527344124, "difficulty": "Medium", "likes": 428, "dislikes": 30, "categoryTitle": "JavaScript", "frontendQuestionId": "2622", "paidOnly": false, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46731, "totalSubmissionRaw": 62646}, "2623": {"acRate": 62.62476523464723, "difficulty": "Medium", "likes": 598, "dislikes": 88, "categoryTitle": "JavaScript", "frontendQuestionId": "2623", "paidOnly": false, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 106035, "totalSubmissionRaw": 169318}, "2624": {"acRate": 65.63858039594399, "difficulty": "Medium", "likes": 100, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2624", "paidOnly": false, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10875, "totalSubmissionRaw": 16568}, "2625": {"acRate": 63.64688071297989, "difficulty": "Medium", "likes": 338, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2625", "paidOnly": false, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44563, "totalSubmissionRaw": 70016}, "2626": {"acRate": 84.82159047407974, "difficulty": "Easy", "likes": 590, "dislikes": 36, "categoryTitle": "JavaScript", "frontendQuestionId": "2626", "paidOnly": false, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168398, "totalSubmissionRaw": 198532}, "2627": {"acRate": 90.95244116106424, "difficulty": "Medium", "likes": 396, "dislikes": 46, "categoryTitle": "JavaScript", "frontendQuestionId": "2627", "paidOnly": false, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50354, "totalSubmissionRaw": 55363}, "2628": {"acRate": 38.74379057081035, "difficulty": "Medium", "likes": 214, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2628", "paidOnly": true, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12713, "totalSubmissionRaw": 32813}, "2629": {"acRate": 86.34834336982226, "difficulty": "Easy", "likes": 666, "dislikes": 49, "categoryTitle": "JavaScript", "frontendQuestionId": "2629", "paidOnly": false, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141667, "totalSubmissionRaw": 164065}, "2630": {"acRate": 30.96745027124774, "difficulty": "Hard", "likes": 116, "dislikes": 41, "categoryTitle": "JavaScript", "frontendQuestionId": "2630", "paidOnly": false, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5480, "totalSubmissionRaw": 17696}, "2631": {"acRate": 80.86455331412104, "difficulty": "Medium", "likes": 305, "dislikes": 17, "categoryTitle": "JavaScript", "frontendQuestionId": "2631", "paidOnly": false, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44896, "totalSubmissionRaw": 55520}, "2632": {"acRate": 89.25615392884015, "difficulty": "Medium", "likes": 343, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2632", "paidOnly": true, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16607, "totalSubmissionRaw": 18606}, "2633": {"acRate": 77.25818039318138, "difficulty": "Medium", "likes": 204, "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": 11829, "totalSubmissionRaw": 15311}, "2634": {"acRate": 84.80691295803518, "difficulty": "Easy", "likes": 636, "dislikes": 81, "categoryTitle": "JavaScript", "frontendQuestionId": "2634", "paidOnly": false, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180386, "totalSubmissionRaw": 212702}, "2635": {"acRate": 85.81506698500554, "difficulty": "Easy", "likes": 732, "dislikes": 72, "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": 198763, "totalSubmissionRaw": 231618}, "2636": {"acRate": 79.8131910026687, "difficulty": "Medium", "likes": 285, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2636", "paidOnly": true, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12561, "totalSubmissionRaw": 15738}, "2637": {"acRate": 81.64940170449654, "difficulty": "Medium", "likes": 483, "dislikes": 71, "categoryTitle": "JavaScript", "frontendQuestionId": "2637", "paidOnly": false, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56907, "totalSubmissionRaw": 69696}, "2638": {"acRate": 47.04513125565757, "difficulty": "Medium", "likes": 83, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2638", "paidOnly": true, "title": "Count the Number of K-Free Subsets", "titleSlug": "count-the-number-of-k-free-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3638, "totalSubmissionRaw": 7733}, "2639": {"acRate": 67.95837392192735, "difficulty": "Easy", "likes": 169, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2639", "paidOnly": false, "title": "Find the Width of Columns of a Grid", "titleSlug": "find-the-width-of-columns-of-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28603, "totalSubmissionRaw": 42089}, "2640": {"acRate": 71.04710872962715, "difficulty": "Medium", "likes": 293, "dislikes": 36, "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": 31822, "totalSubmissionRaw": 44790}, "2641": {"acRate": 67.71680533482908, "difficulty": "Medium", "likes": 583, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2641", "paidOnly": false, "title": "Cousins in Binary Tree II", "titleSlug": "cousins-in-binary-tree-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21731, "totalSubmissionRaw": 32091}, "2642": {"acRate": 70.61902594446973, "difficulty": "Hard", "likes": 812, "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": 68266, "totalSubmissionRaw": 96668}, "2643": {"acRate": 75.3632264529058, "difficulty": "Easy", "likes": 453, "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": 66187, "totalSubmissionRaw": 87824}, "2644": {"acRate": 49.53727821530352, "difficulty": "Easy", "likes": 235, "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": 32331, "totalSubmissionRaw": 65266}, "2645": {"acRate": 50.73553170864441, "difficulty": "Medium", "likes": 541, "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": 29833, "totalSubmissionRaw": 58801}, "2646": {"acRate": 46.00483178239084, "difficulty": "Hard", "likes": 478, "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": 10283, "totalSubmissionRaw": 22352}, "2647": {"acRate": 66.87370600414079, "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": 323, "totalSubmissionRaw": 483}, "2648": {"acRate": 83.27780914737436, "difficulty": "Easy", "likes": 245, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2648", "paidOnly": false, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29497, "totalSubmissionRaw": 35420}, "2649": {"acRate": 78.98861727934316, "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": 12699, "totalSubmissionRaw": 16077}, "2650": {"acRate": 48.856640281442395, "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": 2222, "totalSubmissionRaw": 4548}, "2651": {"acRate": 78.45569005958318, "difficulty": "Easy", "likes": 230, "dislikes": 48, "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": 58200, "totalSubmissionRaw": 74182}, "2652": {"acRate": 85.70736542431492, "difficulty": "Easy", "likes": 494, "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": 115003, "totalSubmissionRaw": 134181}, "2653": {"acRate": 33.60218428320362, "difficulty": "Medium", "likes": 624, "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": 21414, "totalSubmissionRaw": 63728}, "2654": {"acRate": 35.499904415981646, "difficulty": "Medium", "likes": 383, "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": 12999, "totalSubmissionRaw": 36617}, "2655": {"acRate": 52.23474543334628, "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": 1344, "totalSubmissionRaw": 2573}, "2656": {"acRate": 82.42082318245929, "difficulty": "Easy", "likes": 373, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2656", "paidOnly": false, "title": "Maximum Sum With Exactly K Elements ", "titleSlug": "maximum-sum-with-exactly-k-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77136, "totalSubmissionRaw": 93588}, "2657": {"acRate": 81.54166436375026, "difficulty": "Medium", "likes": 480, "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": 44260, "totalSubmissionRaw": 54279}, "2658": {"acRate": 60.461794810759336, "difficulty": "Medium", "likes": 436, "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": 27940, "totalSubmissionRaw": 46211}, "2659": {"acRate": 25.654091355711444, "difficulty": "Hard", "likes": 538, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2659", "paidOnly": false, "title": "Make Array Empty", "titleSlug": "make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11227, "totalSubmissionRaw": 43763}, "2660": {"acRate": 34.479545785412725, "difficulty": "Easy", "likes": 275, "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": 35526, "totalSubmissionRaw": 103035}, "2661": {"acRate": 50.845131020918274, "difficulty": "Medium", "likes": 433, "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": 24814, "totalSubmissionRaw": 48806}, "2662": {"acRate": 39.532342028818775, "difficulty": "Medium", "likes": 613, "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": 13745, "totalSubmissionRaw": 34769}, "2663": {"acRate": 37.850368809272915, "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": 5388, "totalSubmissionRaw": 14235}, "2664": {"acRate": 66.57777777777778, "difficulty": "Medium", "likes": 36, "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": 1498, "totalSubmissionRaw": 2250}, "2665": {"acRate": 80.25008709044572, "difficulty": "Easy", "likes": 727, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2665", "paidOnly": false, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 218846, "totalSubmissionRaw": 272705}, "2666": {"acRate": 86.34804411696841, "difficulty": "Easy", "likes": 474, "dislikes": 54, "categoryTitle": "JavaScript", "frontendQuestionId": "2666", "paidOnly": false, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112267, "totalSubmissionRaw": 130017}, "2667": {"acRate": 81.40590705632269, "difficulty": "Easy", "likes": 1283, "dislikes": 178, "categoryTitle": "JavaScript", "frontendQuestionId": "2667", "paidOnly": false, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 471034, "totalSubmissionRaw": 578625}, "2668": {"acRate": 72.58094703350177, "difficulty": "Easy", "likes": 19, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2668", "paidOnly": true, "title": "Find Latest Salaries", "titleSlug": "find-latest-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3878, "totalSubmissionRaw": 5343}, "2669": {"acRate": 72.86773794808406, "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": 3537, "totalSubmissionRaw": 4854}, "2670": {"acRate": 77.96351692181359, "difficulty": "Easy", "likes": 332, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2670", "paidOnly": false, "title": "Find the Distinct Difference Array", "titleSlug": "find-the-distinct-difference-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39876, "totalSubmissionRaw": 51146}, "2671": {"acRate": 30.139856406971465, "difficulty": "Medium", "likes": 322, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2671", "paidOnly": false, "title": "Frequency Tracker", "titleSlug": "frequency-tracker", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22585, "totalSubmissionRaw": 74934}, "2672": {"acRate": 54.871935727528665, "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": 15982, "totalSubmissionRaw": 29126}, "2673": {"acRate": 59.341006386413085, "difficulty": "Medium", "likes": 599, "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": 16911, "totalSubmissionRaw": 28498}, "2674": {"acRate": 74.90253411306043, "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": 1537, "totalSubmissionRaw": 2052}, "2675": {"acRate": 68.3699421965318, "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": 5914, "totalSubmissionRaw": 8650}, "2676": {"acRate": 82.72863041377492, "difficulty": "Medium", "likes": 163, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2676", "paidOnly": true, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9417, "totalSubmissionRaw": 11383}, "2677": {"acRate": 83.5372251938679, "difficulty": "Easy", "likes": 341, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2677", "paidOnly": false, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65281, "totalSubmissionRaw": 78146}, "2678": {"acRate": 81.7053683853937, "difficulty": "Easy", "likes": 713, "dislikes": 59, "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": 255660, "totalSubmissionRaw": 312905}, "2679": {"acRate": 60.20967959073775, "difficulty": "Medium", "likes": 352, "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": 35779, "totalSubmissionRaw": 59424}, "2680": {"acRate": 41.09513594991014, "difficulty": "Medium", "likes": 390, "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": 14177, "totalSubmissionRaw": 34498}, "2681": {"acRate": 31.411193831427813, "difficulty": "Hard", "likes": 315, "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": 9451, "totalSubmissionRaw": 30088}, "2682": {"acRate": 49.29636778382172, "difficulty": "Easy", "likes": 247, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2682", "paidOnly": false, "title": "Find the Losers of the Circular Game", "titleSlug": "find-the-losers-of-the-circular-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28094, "totalSubmissionRaw": 56990}, "2683": {"acRate": 62.07296208400022, "difficulty": "Medium", "likes": 271, "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": 22494, "totalSubmissionRaw": 36238}, "2684": {"acRate": 46.086972744062834, "difficulty": "Medium", "likes": 436, "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": 24704, "totalSubmissionRaw": 53602}, "2685": {"acRate": 66.13176605252151, "difficulty": "Medium", "likes": 665, "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": 30043, "totalSubmissionRaw": 45429}, "2686": {"acRate": 67.40088105726872, "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": 3366, "totalSubmissionRaw": 4994}, "2687": {"acRate": 80.59345895603207, "difficulty": "Easy", "likes": 21, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2687", "paidOnly": true, "title": "Bikes Last Time Used ", "titleSlug": "bikes-last-time-used", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3721, "totalSubmissionRaw": 4617}, "2688": {"acRate": 42.66194331983806, "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": 3372, "totalSubmissionRaw": 7904}, "2689": {"acRate": 74.42342575796839, "difficulty": "Easy", "likes": 37, "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": 2872, "totalSubmissionRaw": 3859}, "2690": {"acRate": 93.03843364757071, "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": 1283, "totalSubmissionRaw": 1379}, "2691": {"acRate": 37.547892720306514, "difficulty": "Hard", "likes": 11, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2691", "paidOnly": true, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 196, "totalSubmissionRaw": 522}, "2692": {"acRate": 63.38028169014085, "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": 405, "totalSubmissionRaw": 639}, "2693": {"acRate": 79.79658943182687, "difficulty": "Medium", "likes": 139, "dislikes": 13, "categoryTitle": "JavaScript", "frontendQuestionId": "2693", "paidOnly": false, "title": "Call Function with Custom Context", "titleSlug": "call-function-with-custom-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10435, "totalSubmissionRaw": 13077}, "2694": {"acRate": 74.23359945449897, "difficulty": "Medium", "likes": 241, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2694", "paidOnly": false, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26128, "totalSubmissionRaw": 35197}, "2695": {"acRate": 88.15322062914616, "difficulty": "Easy", "likes": 230, "dislikes": 48, "categoryTitle": "JavaScript", "frontendQuestionId": "2695", "paidOnly": false, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41194, "totalSubmissionRaw": 46730}, "2696": {"acRate": 69.97825073792139, "difficulty": "Easy", "likes": 413, "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": 54054, "totalSubmissionRaw": 77244}, "2697": {"acRate": 82.13163382184499, "difficulty": "Easy", "likes": 349, "dislikes": 26, "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": 55930, "totalSubmissionRaw": 68098}, "2698": {"acRate": 62.88121003443188, "difficulty": "Medium", "likes": 479, "dislikes": 31, "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": 20454, "totalSubmissionRaw": 32528}, "2699": {"acRate": 57.75464984783988, "difficulty": "Hard", "likes": 673, "dislikes": 146, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 62818, "totalSubmissionRaw": 108767}, "2700": {"acRate": 75.5706354102406, "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": 7350, "totalSubmissionRaw": 9726}, "2701": {"acRate": 32.46852764094144, "difficulty": "Hard", "likes": 47, "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": 2966, "totalSubmissionRaw": 9135}, "2702": {"acRate": 44.83807867854814, "difficulty": "Hard", "likes": 39, "dislikes": 2, "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": 2063, "totalSubmissionRaw": 4601}, "2703": {"acRate": 94.37431015452539, "difficulty": "Easy", "likes": 311, "dislikes": 155, "categoryTitle": "JavaScript", "frontendQuestionId": "2703", "paidOnly": false, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164165, "totalSubmissionRaw": 173951}, "2704": {"acRate": 62.397238070539416, "difficulty": "Easy", "likes": 650, "dislikes": 162, "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": 192479, "totalSubmissionRaw": 308473}, "2705": {"acRate": 65.30934596953391, "difficulty": "Medium", "likes": 177, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2705", "paidOnly": false, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24395, "totalSubmissionRaw": 37353}, "2706": {"acRate": 69.11367807405809, "difficulty": "Easy", "likes": 989, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2706", "paidOnly": false, "title": "Buy Two Chocolates", "titleSlug": "buy-two-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 185658, "totalSubmissionRaw": 268627}, "2707": {"acRate": 52.55666684622889, "difficulty": "Medium", "likes": 2089, "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": 87808, "totalSubmissionRaw": 167073}, "2708": {"acRate": 24.41995408056773, "difficulty": "Medium", "likes": 359, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2708", "paidOnly": false, "title": "Maximum Strength of a Group", "titleSlug": "maximum-strength-of-a-group", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29249, "totalSubmissionRaw": 119775}, "2709": {"acRate": 42.47030708137926, "difficulty": "Hard", "likes": 812, "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": 70908, "totalSubmissionRaw": 166959}, "2710": {"acRate": 78.86780650542119, "difficulty": "Easy", "likes": 316, "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": 68084, "totalSubmissionRaw": 86327}, "2711": {"acRate": 71.28100650511115, "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": 19943, "totalSubmissionRaw": 27978}, "2712": {"acRate": 54.68175634605922, "difficulty": "Medium", "likes": 532, "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": 18892, "totalSubmissionRaw": 34549}, "2713": {"acRate": 30.78376487053884, "difficulty": "Hard", "likes": 582, "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": 13197, "totalSubmissionRaw": 42870}, "2714": {"acRate": 61.977886977886975, "difficulty": "Hard", "likes": 32, "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": 1009, "totalSubmissionRaw": 1628}, "2715": {"acRate": 88.80285483436575, "difficulty": "Easy", "likes": 231, "dislikes": 291, "categoryTitle": "JavaScript", "frontendQuestionId": "2715", "paidOnly": false, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52756, "totalSubmissionRaw": 59408}, "2716": {"acRate": 76.66503654555308, "difficulty": "Easy", "likes": 327, "dislikes": 94, "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": 58004, "totalSubmissionRaw": 75659}, "2717": {"acRate": 64.13345690454125, "difficulty": "Easy", "likes": 207, "dislikes": 17, "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": 31832, "totalSubmissionRaw": 49634}, "2718": {"acRate": 31.09184936994683, "difficulty": "Medium", "likes": 692, "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": 21343, "totalSubmissionRaw": 68645}, "2719": {"acRate": 34.6508401418221, "difficulty": "Hard", "likes": 526, "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": 11239, "totalSubmissionRaw": 32435}, "2720": {"acRate": 51.671232876712324, "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": 1886, "totalSubmissionRaw": 3650}, "2721": {"acRate": 75.44997389464429, "difficulty": "Medium", "likes": 189, "dislikes": 45, "categoryTitle": "JavaScript", "frontendQuestionId": "2721", "paidOnly": false, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27457, "totalSubmissionRaw": 36391}, "2722": {"acRate": 54.899637699823145, "difficulty": "Medium", "likes": 168, "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": 31973, "totalSubmissionRaw": 58239}, "2723": {"acRate": 91.42347018599814, "difficulty": "Easy", "likes": 270, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2723", "paidOnly": false, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99331, "totalSubmissionRaw": 108650}, "2724": {"acRate": 82.65460326182954, "difficulty": "Easy", "likes": 172, "dislikes": 37, "categoryTitle": "JavaScript", "frontendQuestionId": "2724", "paidOnly": false, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42113, "totalSubmissionRaw": 50951}, "2725": {"acRate": 81.02832523950795, "difficulty": "Easy", "likes": 161, "dislikes": 85, "categoryTitle": "JavaScript", "frontendQuestionId": "2725", "paidOnly": false, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42881, "totalSubmissionRaw": 52921}, "2726": {"acRate": 75.63183015570799, "difficulty": "Easy", "likes": 112, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2726", "paidOnly": false, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28997, "totalSubmissionRaw": 38340}, "2727": {"acRate": 80.40831776499749, "difficulty": "Easy", "likes": 175, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2727", "paidOnly": false, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65852, "totalSubmissionRaw": 81897}, "2728": {"acRate": 84.97854077253218, "difficulty": "Easy", "likes": 52, "dislikes": 10, "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": 2178, "totalSubmissionRaw": 2563}, "2729": {"acRate": 52.35265320992293, "difficulty": "Easy", "likes": 231, "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": 45985, "totalSubmissionRaw": 87837}, "2730": {"acRate": 37.187731882265645, "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": 24056, "totalSubmissionRaw": 64688}, "2731": {"acRate": 28.04612219121152, "difficulty": "Medium", "likes": 485, "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": 13767, "totalSubmissionRaw": 49087}, "2732": {"acRate": 45.93149871312611, "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": 6960, "totalSubmissionRaw": 15153}, "2733": {"acRate": 76.63496499055302, "difficulty": "Easy", "likes": 346, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2733", "paidOnly": false, "title": "Neither Minimum nor Maximum", "titleSlug": "neither-minimum-nor-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96534, "totalSubmissionRaw": 125966}, "2734": {"acRate": 31.250784092334715, "difficulty": "Medium", "likes": 242, "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": 27401, "totalSubmissionRaw": 87681}, "2735": {"acRate": 33.51846709247431, "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": 12070, "totalSubmissionRaw": 36010}, "2736": {"acRate": 29.37374980766272, "difficulty": "Hard", "likes": 332, "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": 5727, "totalSubmissionRaw": 19497}, "2737": {"acRate": 57.540453074433664, "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": 1778, "totalSubmissionRaw": 3090}, "2738": {"acRate": 55.58050032071841, "difficulty": "Medium", "likes": 21, "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": 5199, "totalSubmissionRaw": 9354}, "2739": {"acRate": 39.36596720092751, "difficulty": "Easy", "likes": 283, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2739", "paidOnly": false, "title": "Total Distance Traveled", "titleSlug": "total-distance-traveled", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44480, "totalSubmissionRaw": 112991}, "2740": {"acRate": 65.43350371299064, "difficulty": "Medium", "likes": 284, "dislikes": 21, "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": 33924, "totalSubmissionRaw": 51845}, "2741": {"acRate": 28.670668109810094, "difficulty": "Medium", "likes": 557, "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": 14568, "totalSubmissionRaw": 50814}, "2742": {"acRate": 50.775208889788736, "difficulty": "Hard", "likes": 1373, "dislikes": 84, "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": 65204, "totalSubmissionRaw": 128417}, "2743": {"acRate": 76.58486707566462, "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": 6741, "totalSubmissionRaw": 8802}, "2744": {"acRate": 81.77292182924081, "difficulty": "Easy", "likes": 358, "dislikes": 15, "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": 72596, "totalSubmissionRaw": 88778}, "2745": {"acRate": 54.22144780611436, "difficulty": "Medium", "likes": 310, "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": 20538, "totalSubmissionRaw": 37878}, "2746": {"acRate": 27.096733310097903, "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": 8552, "totalSubmissionRaw": 31561}, "2747": {"acRate": 33.17382057231245, "difficulty": "Medium", "likes": 340, "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": 6863, "totalSubmissionRaw": 20688}, "2748": {"acRate": 50.5146051869944, "difficulty": "Easy", "likes": 208, "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": 35780, "totalSubmissionRaw": 70831}, "2749": {"acRate": 30.212204035254736, "difficulty": "Medium", "likes": 286, "dislikes": 287, "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": 9838, "totalSubmissionRaw": 32563}, "2750": {"acRate": 34.2897665284748, "difficulty": "Medium", "likes": 439, "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": 22001, "totalSubmissionRaw": 64162}, "2751": {"acRate": 57.06588382001455, "difficulty": "Hard", "likes": 1122, "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": 109829, "totalSubmissionRaw": 192460}, "2752": {"acRate": 38.57651245551602, "difficulty": "Hard", "likes": 13, "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": 1626, "totalSubmissionRaw": 4215}, "2753": {"acRate": 66.5137614678899, "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": 725, "totalSubmissionRaw": 1090}, "2754": {"acRate": 87.0344827586207, "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": 631, "totalSubmissionRaw": 725}, "2755": {"acRate": 64.85148514851485, "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": 524, "totalSubmissionRaw": 808}, "2756": {"acRate": 63.41991341991342, "difficulty": "Hard", "likes": 14, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2756", "paidOnly": true, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 293, "totalSubmissionRaw": 462}, "2757": {"acRate": 71.50537634408603, "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": 399, "totalSubmissionRaw": 558}, "2758": {"acRate": 84.09490333919156, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2758", "paidOnly": true, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 957, "totalSubmissionRaw": 1138}, "2759": {"acRate": 62.5609756097561, "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": 513, "totalSubmissionRaw": 820}, "2760": {"acRate": 29.907398397716584, "difficulty": "Easy", "likes": 295, "dislikes": 271, "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": 36883, "totalSubmissionRaw": 123324}, "2761": {"acRate": 34.50293060641446, "difficulty": "Medium", "likes": 363, "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": 30434, "totalSubmissionRaw": 88207}, "2762": {"acRate": 41.465729633668566, "difficulty": "Medium", "likes": 703, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2762", "paidOnly": false, "title": "Continuous Subarrays", "titleSlug": "continuous-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20533, "totalSubmissionRaw": 49518}, "2763": {"acRate": 47.142011834319526, "difficulty": "Hard", "likes": 306, "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": 7966, "totalSubmissionRaw": 16899}, "2764": {"acRate": 66.24277456647398, "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": 1146, "totalSubmissionRaw": 1730}, "2765": {"acRate": 34.234282643739924, "difficulty": "Easy", "likes": 215, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "2765", "paidOnly": false, "title": "Longest Alternating Subarray", "titleSlug": "longest-alternating-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25484, "totalSubmissionRaw": 74440}, "2766": {"acRate": 51.999094180107186, "difficulty": "Medium", "likes": 196, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2766", "paidOnly": false, "title": "Relocate Marbles", "titleSlug": "relocate-marbles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20666, "totalSubmissionRaw": 39743}, "2767": {"acRate": 53.68149046130287, "difficulty": "Medium", "likes": 354, "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": 16827, "totalSubmissionRaw": 31346}, "2768": {"acRate": 36.69548939204849, "difficulty": "Medium", "likes": 227, "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": 8233, "totalSubmissionRaw": 22436}, "2769": {"acRate": 90.80302155504233, "difficulty": "Easy", "likes": 354, "dislikes": 522, "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": 113235, "totalSubmissionRaw": 124704}, "2770": {"acRate": 31.436646576088805, "difficulty": "Medium", "likes": 426, "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": 27696, "totalSubmissionRaw": 88101}, "2771": {"acRate": 29.723237720284963, "difficulty": "Medium", "likes": 591, "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": 25367, "totalSubmissionRaw": 85344}, "2772": {"acRate": 33.3785276689766, "difficulty": "Medium", "likes": 388, "dislikes": 23, "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": 13294, "totalSubmissionRaw": 39828}, "2773": {"acRate": 75.28195488721805, "difficulty": "Medium", "likes": 10, "dislikes": 37, "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": 801, "totalSubmissionRaw": 1064}, "2774": {"acRate": 81.91304347826087, "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": 1413, "totalSubmissionRaw": 1725}, "2775": {"acRate": 68.90756302521008, "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": 574, "totalSubmissionRaw": 833}, "2776": {"acRate": 91.78743961352657, "difficulty": "Medium", "likes": 17, "dislikes": 9, "categoryTitle": "JavaScript", "frontendQuestionId": "2776", "paidOnly": true, "title": "Convert Callback Based Function to Promise Based Function", "titleSlug": "convert-callback-based-function-to-promise-based-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 760, "totalSubmissionRaw": 828}, "2777": {"acRate": 81.19834710743802, "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": 393, "totalSubmissionRaw": 484}, "2778": {"acRate": 81.72421549881904, "difficulty": "Easy", "likes": 277, "dislikes": 111, "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": 72661, "totalSubmissionRaw": 88910}, "2779": {"acRate": 38.618636498958026, "difficulty": "Medium", "likes": 612, "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": 25944, "totalSubmissionRaw": 67180}, "2780": {"acRate": 62.3463687150838, "difficulty": "Medium", "likes": 336, "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": 23994, "totalSubmissionRaw": 38485}, "2781": {"acRate": 38.00711235861512, "difficulty": "Hard", "likes": 558, "dislikes": 24, "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": 31955, "totalSubmissionRaw": 84078}, "2782": {"acRate": 83.49406528189911, "difficulty": "Medium", "likes": 33, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2782", "paidOnly": true, "title": "Number of Unique Categories", "titleSlug": "number-of-unique-categories", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2251, "totalSubmissionRaw": 2696}, "2783": {"acRate": 37.57729061270377, "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": 2674, "totalSubmissionRaw": 7116}, "2784": {"acRate": 49.33844622680171, "difficulty": "Easy", "likes": 272, "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": 50565, "totalSubmissionRaw": 102486}, "2785": {"acRate": 81.29116708306935, "difficulty": "Medium", "likes": 1002, "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": 136005, "totalSubmissionRaw": 167306}, "2786": {"acRate": 36.27434932067442, "difficulty": "Medium", "likes": 478, "dislikes": 27, "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": 19944, "totalSubmissionRaw": 54981}, "2787": {"acRate": 34.00550439292897, "difficulty": "Medium", "likes": 403, "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": 19275, "totalSubmissionRaw": 56682}, "2788": {"acRate": 74.58014065288128, "difficulty": "Easy", "likes": 310, "dislikes": 12, "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": 56842, "totalSubmissionRaw": 76216}, "2789": {"acRate": 47.3382687227376, "difficulty": "Medium", "likes": 465, "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": 30821, "totalSubmissionRaw": 65108}, "2790": {"acRate": 20.294085847118605, "difficulty": "Hard", "likes": 402, "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": 9385, "totalSubmissionRaw": 46245}, "2791": {"acRate": 48.60860137332851, "difficulty": "Hard", "likes": 387, "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": 6725, "totalSubmissionRaw": 13835}, "2792": {"acRate": 58.58310626702997, "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": 860, "totalSubmissionRaw": 1468}, "2793": {"acRate": 75.2435064935065, "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": 1854, "totalSubmissionRaw": 2464}, "2794": {"acRate": 64.08668730650155, "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": 1035, "totalSubmissionRaw": 1615}, "2795": {"acRate": 88.17365269461078, "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": 589, "totalSubmissionRaw": 668}, "2796": {"acRate": 92.84028324154208, "difficulty": "Easy", "likes": 25, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2796", "paidOnly": true, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2360, "totalSubmissionRaw": 2542}, "2797": {"acRate": 90.7079646017699, "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": 1025, "totalSubmissionRaw": 1130}, "2798": {"acRate": 87.80329590560181, "difficulty": "Easy", "likes": 500, "dislikes": 69, "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": 170550, "totalSubmissionRaw": 194241}, "2799": {"acRate": 65.44393106893108, "difficulty": "Medium", "likes": 563, "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": 41925, "totalSubmissionRaw": 64063}, "2800": {"acRate": 30.75419102559139, "difficulty": "Medium", "likes": 324, "dislikes": 264, "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": 15887, "totalSubmissionRaw": 51658}, "2801": {"acRate": 28.134008296421285, "difficulty": "Hard", "likes": 332, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2801", "paidOnly": false, "title": "Count Stepping Numbers in Range", "titleSlug": "count-stepping-numbers-in-range", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8003, "totalSubmissionRaw": 28446}, "2802": {"acRate": 77.07330880271724, "difficulty": "Medium", "likes": 59, "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": 5446, "totalSubmissionRaw": 7066}, "2803": {"acRate": 86.53295128939828, "difficulty": "Easy", "likes": 18, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2803", "paidOnly": true, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 906, "totalSubmissionRaw": 1047}, "2804": {"acRate": 89.41058941058941, "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": 895, "totalSubmissionRaw": 1001}, "2805": {"acRate": 82.03125, "difficulty": "Medium", "likes": 16, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2805", "paidOnly": true, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 420, "totalSubmissionRaw": 512}, "2806": {"acRate": 52.97973274748621, "difficulty": "Easy", "likes": 253, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2806", "paidOnly": false, "title": "Account Balance After Rounded Purchase", "titleSlug": "account-balance-after-rounded-purchase", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43890, "totalSubmissionRaw": 82843}, "2807": {"acRate": 88.83246518318332, "difficulty": "Medium", "likes": 544, "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": 81518, "totalSubmissionRaw": 91766}, "2808": {"acRate": 27.02768082385873, "difficulty": "Medium", "likes": 514, "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": 15642, "totalSubmissionRaw": 57874}, "2809": {"acRate": 26.642383244438662, "difficulty": "Hard", "likes": 233, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2809", "paidOnly": false, "title": "Minimum Time to Make Array Sum At Most x", "titleSlug": "minimum-time-to-make-array-sum-at-most-x", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4096, "totalSubmissionRaw": 15374}, "2810": {"acRate": 84.11382455718763, "difficulty": "Easy", "likes": 432, "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": 84007, "totalSubmissionRaw": 99873}, "2811": {"acRate": 33.85001374759417, "difficulty": "Medium", "likes": 499, "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": 29547, "totalSubmissionRaw": 87288}, "2812": {"acRate": 48.965648619148624, "difficulty": "Medium", "likes": 1599, "dislikes": 294, "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": 95105, "totalSubmissionRaw": 194228}, "2813": {"acRate": 33.331667582829446, "difficulty": "Hard", "likes": 307, "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": 6670, "totalSubmissionRaw": 20011}, "2814": {"acRate": 63.988919667590025, "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": 924, "totalSubmissionRaw": 1444}, "2815": {"acRate": 58.41313440289656, "difficulty": "Easy", "likes": 376, "dislikes": 123, "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": 46786, "totalSubmissionRaw": 80095}, "2816": {"acRate": 61.584656123146765, "difficulty": "Medium", "likes": 1144, "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": 169311, "totalSubmissionRaw": 274924}, "2817": {"acRate": 34.19855156059732, "difficulty": "Medium", "likes": 675, "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": 26678, "totalSubmissionRaw": 78013}, "2818": {"acRate": 32.64493771658706, "difficulty": "Hard", "likes": 326, "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": 6971, "totalSubmissionRaw": 21354}, "2819": {"acRate": 52.659574468085104, "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": 396, "totalSubmissionRaw": 752}, "2820": {"acRate": 66.33076467101363, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2820", "paidOnly": true, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2238, "totalSubmissionRaw": 3374}, "2821": {"acRate": 66.45091693635383, "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": 616, "totalSubmissionRaw": 927}, "2822": {"acRate": 58.513708513708515, "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": 811, "totalSubmissionRaw": 1386}, "2823": {"acRate": 53.27635327635327, "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": 374, "totalSubmissionRaw": 702}, "2824": {"acRate": 87.39239635658753, "difficulty": "Easy", "likes": 603, "dislikes": 67, "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": 167712, "totalSubmissionRaw": 191907}, "2825": {"acRate": 49.54623119800566, "difficulty": "Medium", "likes": 322, "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": 35377, "totalSubmissionRaw": 71402}, "2826": {"acRate": 42.324470294973, "difficulty": "Medium", "likes": 496, "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": 20375, "totalSubmissionRaw": 48140}, "2827": {"acRate": 18.31815023546669, "difficulty": "Hard", "likes": 351, "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": 9491, "totalSubmissionRaw": 51812}, "2828": {"acRate": 83.17204622519837, "difficulty": "Easy", "likes": 320, "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": 97376, "totalSubmissionRaw": 117078}, "2829": {"acRate": 61.52773662838321, "difficulty": "Medium", "likes": 329, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2829", "paidOnly": false, "title": "Determine the Minimum Sum of a k-avoiding Array", "titleSlug": "determine-the-minimum-sum-of-a-k-avoiding-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35302, "totalSubmissionRaw": 57377}, "2830": {"acRate": 36.55642888921845, "difficulty": "Medium", "likes": 665, "dislikes": 22, "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": 22185, "totalSubmissionRaw": 60687}, "2831": {"acRate": 36.05067426664813, "difficulty": "Medium", "likes": 677, "dislikes": 17, "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": 20744, "totalSubmissionRaw": 57543}, "2832": {"acRate": 73.87339055793991, "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": 1377, "totalSubmissionRaw": 1864}, "2833": {"acRate": 65.00313412731225, "difficulty": "Easy", "likes": 239, "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": 48740, "totalSubmissionRaw": 74981}, "2834": {"acRate": 37.90359621137828, "difficulty": "Medium", "likes": 295, "dislikes": 53, "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": 30534, "totalSubmissionRaw": 80557}, "2835": {"acRate": 32.59773690137824, "difficulty": "Hard", "likes": 522, "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": 12157, "totalSubmissionRaw": 37294}, "2836": {"acRate": 31.44576753818276, "difficulty": "Hard", "likes": 292, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "2836", "paidOnly": false, "title": "Maximize Value of Function in a Ball Passing Game", "titleSlug": "maximize-value-of-function-in-a-ball-passing-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4859, "totalSubmissionRaw": 15452}, "2837": {"acRate": 75.78451882845188, "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": 2898, "totalSubmissionRaw": 3824}, "2838": {"acRate": 69.13066111400312, "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": 1328, "totalSubmissionRaw": 1921}, "2839": {"acRate": 47.30696752103066, "difficulty": "Easy", "likes": 182, "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": 38409, "totalSubmissionRaw": 81190}, "2840": {"acRate": 56.03811807507854, "difficulty": "Medium", "likes": 255, "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": 27109, "totalSubmissionRaw": 48376}, "2841": {"acRate": 38.25319766131093, "difficulty": "Medium", "likes": 276, "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": 25451, "totalSubmissionRaw": 66533}, "2842": {"acRate": 29.52785469563993, "difficulty": "Hard", "likes": 335, "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": 12583, "totalSubmissionRaw": 42614}, "2843": {"acRate": 74.6019795146895, "difficulty": "Easy", "likes": 254, "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": 47561, "totalSubmissionRaw": 63753}, "2844": {"acRate": 38.31709789747432, "difficulty": "Medium", "likes": 346, "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": 26079, "totalSubmissionRaw": 68061}, "2845": {"acRate": 35.79159013056645, "difficulty": "Medium", "likes": 496, "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": 14419, "totalSubmissionRaw": 40286}, "2846": {"acRate": 44.72901400275702, "difficulty": "Hard", "likes": 301, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2846", "paidOnly": false, "title": "Minimum Edge Weight Equilibrium Queries in a Tree", "titleSlug": "minimum-edge-weight-equilibrium-queries-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6165, "totalSubmissionRaw": 13783}, "2847": {"acRate": 43.799349744542496, "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": 941, "totalSubmissionRaw": 2151}, "2848": {"acRate": 75.4585451410565, "difficulty": "Easy", "likes": 274, "dislikes": 27, "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": 50767, "totalSubmissionRaw": 67278}, "2849": {"acRate": 35.702297983534784, "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": 98920, "totalSubmissionRaw": 277069}, "2850": {"acRate": 44.829799649873564, "difficulty": "Medium", "likes": 504, "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": 23047, "totalSubmissionRaw": 51410}, "2851": {"acRate": 29.853334296654864, "difficulty": "Hard", "likes": 165, "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": 4132, "totalSubmissionRaw": 13841}, "2852": {"acRate": 64.8590021691974, "difficulty": "Medium", "likes": 29, "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": 1196, "totalSubmissionRaw": 1844}, "2853": {"acRate": 73.76697641172267, "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": 3096, "totalSubmissionRaw": 4197}, "2854": {"acRate": 67.7519818799547, "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": 2393, "totalSubmissionRaw": 3532}, "2855": {"acRate": 58.1543877294443, "difficulty": "Easy", "likes": 216, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2855", "paidOnly": false, "title": "Minimum Right Shifts to Sort the Array", "titleSlug": "minimum-right-shifts-to-sort-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34692, "totalSubmissionRaw": 59655}, "2856": {"acRate": 22.904767455414383, "difficulty": "Medium", "likes": 370, "dislikes": 98, "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": 23580, "totalSubmissionRaw": 102948}, "2857": {"acRate": 32.24657937325291, "difficulty": "Medium", "likes": 266, "dislikes": 41, "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": 10959, "totalSubmissionRaw": 33985}, "2858": {"acRate": 58.78011138696907, "difficulty": "Hard", "likes": 304, "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": 8760, "totalSubmissionRaw": 14903}, "2859": {"acRate": 86.71373102717966, "difficulty": "Easy", "likes": 266, "dislikes": 43, "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": 73698, "totalSubmissionRaw": 84990}, "2860": {"acRate": 52.3543990086741, "difficulty": "Medium", "likes": 164, "dislikes": 295, "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": 21969, "totalSubmissionRaw": 41963}, "2861": {"acRate": 38.62862352846531, "difficulty": "Medium", "likes": 270, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2861", "paidOnly": false, "title": "Maximum Number of Alloys", "titleSlug": "maximum-number-of-alloys", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14405, "totalSubmissionRaw": 37291}, "2862": {"acRate": 44.26961148938605, "difficulty": "Hard", "likes": 209, "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": 7737, "totalSubmissionRaw": 17477}, "2863": {"acRate": 71.01624611130315, "difficulty": "Medium", "likes": 125, "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": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12327, "totalSubmissionRaw": 17358}, "2864": {"acRate": 83.1809553874609, "difficulty": "Easy", "likes": 769, "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": 205526, "totalSubmissionRaw": 247083}, "2865": {"acRate": 43.62478673069143, "difficulty": "Medium", "likes": 289, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2865", "paidOnly": false, "title": "Beautiful Towers I", "titleSlug": "beautiful-towers-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24802, "totalSubmissionRaw": 56853}, "2866": {"acRate": 34.95244832193665, "difficulty": "Medium", "likes": 403, "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": 13341, "totalSubmissionRaw": 38169}, "2867": {"acRate": 35.84381471940193, "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": 7096, "totalSubmissionRaw": 19797}, "2868": {"acRate": 59.062103929024076, "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": 466, "totalSubmissionRaw": 789}, "2869": {"acRate": 60.57272339167843, "difficulty": "Easy", "likes": 171, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2869", "paidOnly": false, "title": "Minimum Operations to Collect Elements", "titleSlug": "minimum-operations-to-collect-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36890, "totalSubmissionRaw": 60902}, "2870": {"acRate": 62.022403730773426, "difficulty": "Medium", "likes": 1388, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2870", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Empty", "titleSlug": "minimum-number-of-operations-to-make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 181939, "totalSubmissionRaw": 293344}, "2871": {"acRate": 44.11265785293088, "difficulty": "Medium", "likes": 223, "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": 16383, "totalSubmissionRaw": 37139}, "2872": {"acRate": 57.74917561961493, "difficulty": "Hard", "likes": 188, "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": 10858, "totalSubmissionRaw": 18802}, "2873": {"acRate": 45.93098181471051, "difficulty": "Easy", "likes": 164, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2873", "paidOnly": false, "title": "Maximum Value of an Ordered Triplet I", "titleSlug": "maximum-value-of-an-ordered-triplet-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38492, "totalSubmissionRaw": 83804}, "2874": {"acRate": 41.49622747396645, "difficulty": "Medium", "likes": 277, "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": 26619, "totalSubmissionRaw": 64148}, "2875": {"acRate": 30.940644414190256, "difficulty": "Medium", "likes": 369, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2875", "paidOnly": false, "title": "Minimum Size Subarray in Infinite Array", "titleSlug": "minimum-size-subarray-in-infinite-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19772, "totalSubmissionRaw": 63903}, "2876": {"acRate": 33.034703885326294, "difficulty": "Hard", "likes": 321, "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": 10509, "totalSubmissionRaw": 31812}, "2877": {"acRate": 81.19799655233261, "difficulty": "Easy", "likes": 190, "dislikes": 8, "categoryTitle": "pandas", "frontendQuestionId": "2877", "paidOnly": false, "title": "Create a DataFrame from List", "titleSlug": "create-a-dataframe-from-list", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119642, "totalSubmissionRaw": 147346}, "2878": {"acRate": 84.9252862057041, "difficulty": "Easy", "likes": 98, "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": 93321, "totalSubmissionRaw": 109886}, "2879": {"acRate": 92.91855289686917, "difficulty": "Easy", "likes": 81, "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": 97702, "totalSubmissionRaw": 105148}, "2880": {"acRate": 79.24661964456217, "difficulty": "Easy", "likes": 82, "dislikes": 8, "categoryTitle": "pandas", "frontendQuestionId": "2880", "paidOnly": false, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77184, "totalSubmissionRaw": 97396}, "2881": {"acRate": 90.13812086195352, "difficulty": "Easy", "likes": 72, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2881", "paidOnly": false, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72700, "totalSubmissionRaw": 80654}, "2882": {"acRate": 85.46308388407404, "difficulty": "Easy", "likes": 85, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2882", "paidOnly": false, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64787, "totalSubmissionRaw": 75807}, "2883": {"acRate": 63.97639255327039, "difficulty": "Easy", "likes": 66, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2883", "paidOnly": false, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60379, "totalSubmissionRaw": 94376}, "2884": {"acRate": 92.02034058001136, "difficulty": "Easy", "likes": 66, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2884", "paidOnly": false, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66410, "totalSubmissionRaw": 72169}, "2885": {"acRate": 85.2864447459042, "difficulty": "Easy", "likes": 55, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2885", "paidOnly": false, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57210, "totalSubmissionRaw": 67080}, "2886": {"acRate": 87.21638852428278, "difficulty": "Easy", "likes": 60, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2886", "paidOnly": false, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55814, "totalSubmissionRaw": 63995}, "2887": {"acRate": 71.83992911990549, "difficulty": "Easy", "likes": 59, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2887", "paidOnly": false, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53513, "totalSubmissionRaw": 74490}, "2888": {"acRate": 90.61160699900105, "difficulty": "Easy", "likes": 60, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2888", "paidOnly": false, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56238, "totalSubmissionRaw": 62064}, "2889": {"acRate": 82.18090662210152, "difficulty": "Easy", "likes": 82, "dislikes": 13, "categoryTitle": "pandas", "frontendQuestionId": "2889", "paidOnly": false, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47206, "totalSubmissionRaw": 57442}, "2890": {"acRate": 85.8561894842418, "difficulty": "Easy", "likes": 73, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2890", "paidOnly": false, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44510, "totalSubmissionRaw": 51842}, "2891": {"acRate": 76.2392629991476, "difficulty": "Easy", "likes": 67, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2891", "paidOnly": false, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46509, "totalSubmissionRaw": 61004}, "2892": {"acRate": 40.319715808170514, "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": 908, "totalSubmissionRaw": 2252}, "2893": {"acRate": 68.4012539184953, "difficulty": "Medium", "likes": 19, "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": 2182, "totalSubmissionRaw": 3190}, "2894": {"acRate": 89.23288044536146, "difficulty": "Easy", "likes": 218, "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": 91685, "totalSubmissionRaw": 102748}, "2895": {"acRate": 69.3765778972229, "difficulty": "Medium", "likes": 257, "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": 34074, "totalSubmissionRaw": 49115}, "2896": {"acRate": 27.114196224498432, "difficulty": "Medium", "likes": 353, "dislikes": 69, "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": 12812, "totalSubmissionRaw": 47252}, "2897": {"acRate": 47.20151782084293, "difficulty": "Hard", "likes": 182, "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": 6966, "totalSubmissionRaw": 14758}, "2898": {"acRate": 68.18572656921754, "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": 793, "totalSubmissionRaw": 1163}, "2899": {"acRate": 66.18864974470476, "difficulty": "Easy", "likes": 153, "dislikes": 209, "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": 27093, "totalSubmissionRaw": 40933}, "2900": {"acRate": 62.20746296800688, "difficulty": "Easy", "likes": 181, "dislikes": 82, "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": 29691, "totalSubmissionRaw": 47729}, "2901": {"acRate": 27.31890070654497, "difficulty": "Medium", "likes": 194, "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": 10865, "totalSubmissionRaw": 39771}, "2902": {"acRate": 21.334591132515765, "difficulty": "Hard", "likes": 150, "dislikes": 23, "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": 4297, "totalSubmissionRaw": 20141}, "2903": {"acRate": 61.80482526328623, "difficulty": "Easy", "likes": 137, "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": 40552, "totalSubmissionRaw": 65613}, "2904": {"acRate": 39.39237742942907, "difficulty": "Medium", "likes": 182, "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": 25984, "totalSubmissionRaw": 65962}, "2905": {"acRate": 32.27083223389097, "difficulty": "Medium", "likes": 259, "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": 18345, "totalSubmissionRaw": 56847}, "2906": {"acRate": 30.966608084358523, "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": 12334, "totalSubmissionRaw": 39830}, "2907": {"acRate": 56.71641791044776, "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": 1178, "totalSubmissionRaw": 2077}, "2908": {"acRate": 65.26093245799488, "difficulty": "Easy", "likes": 156, "dislikes": 10, "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": 35189, "totalSubmissionRaw": 53921}, "2909": {"acRate": 54.18151472777302, "difficulty": "Medium", "likes": 190, "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": 24023, "totalSubmissionRaw": 44338}, "2910": {"acRate": 25.12936103488828, "difficulty": "Medium", "likes": 368, "dislikes": 179, "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": 12821, "totalSubmissionRaw": 51020}, "2911": {"acRate": 36.703946760329046, "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": 3971, "totalSubmissionRaw": 10819}, "2912": {"acRate": 61.41078838174274, "difficulty": "Hard", "likes": 15, "dislikes": 4, "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": 888, "totalSubmissionRaw": 1446}, "2913": {"acRate": 82.85325308111207, "difficulty": "Easy", "likes": 148, "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": 34689, "totalSubmissionRaw": 41868}, "2914": {"acRate": 60.25386996904025, "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": 19462, "totalSubmissionRaw": 32300}, "2915": {"acRate": 36.12446118020116, "difficulty": "Medium", "likes": 224, "dislikes": 26, "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": 21873, "totalSubmissionRaw": 60549}, "2916": {"acRate": 21.51797068469313, "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": 3215, "totalSubmissionRaw": 14941}, "2917": {"acRate": 74.7564935064935, "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": 26709, "totalSubmissionRaw": 35728}, "2918": {"acRate": 35.577797998180166, "difficulty": "Medium", "likes": 178, "dislikes": 20, "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": 27761, "totalSubmissionRaw": 78029}, "2919": {"acRate": 34.53717380600689, "difficulty": "Medium", "likes": 317, "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": 14029, "totalSubmissionRaw": 40620}, "2920": {"acRate": 37.595383441434564, "difficulty": "Hard", "likes": 199, "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": 7883, "totalSubmissionRaw": 20968}, "2921": {"acRate": 48.97959183673469, "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": 432, "totalSubmissionRaw": 882}, "2922": {"acRate": 41.18786313750807, "difficulty": "Medium", "likes": 14, "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": 1914, "totalSubmissionRaw": 4647}, "2923": {"acRate": 73.70625072035037, "difficulty": "Easy", "likes": 140, "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": 38370, "totalSubmissionRaw": 52058}, "2924": {"acRate": 58.83677216296556, "difficulty": "Medium", "likes": 155, "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": 26919, "totalSubmissionRaw": 45752}, "2925": {"acRate": 49.752503306253544, "difficulty": "Medium", "likes": 321, "dislikes": 67, "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": 13167, "totalSubmissionRaw": 26465}, "2926": {"acRate": 24.344306307050516, "difficulty": "Hard", "likes": 195, "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": 5894, "totalSubmissionRaw": 24211}, "2927": {"acRate": 43.95782643957826, "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": 542, "totalSubmissionRaw": 1233}, "2928": {"acRate": 76.08156437471159, "difficulty": "Easy", "likes": 103, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2928", "paidOnly": false, "title": "Distribute Candies Among Children I", "titleSlug": "distribute-candies-among-children-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26379, "totalSubmissionRaw": 34672}, "2929": {"acRate": 35.45269582909461, "difficulty": "Medium", "likes": 92, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "2929", "paidOnly": false, "title": "Distribute Candies Among Children II", "titleSlug": "distribute-candies-among-children-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12546, "totalSubmissionRaw": 35388}, "2930": {"acRate": 56.59277576613972, "difficulty": "Medium", "likes": 167, "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": 6408, "totalSubmissionRaw": 11323}, "2931": {"acRate": 65.56835914055935, "difficulty": "Hard", "likes": 93, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2931", "paidOnly": false, "title": "Maximum Spending After Buying Items", "titleSlug": "maximum-spending-after-buying-items", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10925, "totalSubmissionRaw": 16662}, "2932": {"acRate": 76.39141014252057, "difficulty": "Easy", "likes": 145, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2932", "paidOnly": false, "title": "Maximum Strong Pair XOR I", "titleSlug": "maximum-strong-pair-xor-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39557, "totalSubmissionRaw": 51782}, "2933": {"acRate": 44.65685376330951, "difficulty": "Medium", "likes": 190, "dislikes": 20, "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": 21935, "totalSubmissionRaw": 49119}, "2934": {"acRate": 45.152394775036285, "difficulty": "Medium", "likes": 181, "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": 12444, "totalSubmissionRaw": 27560}, "2935": {"acRate": 30.697336561743345, "difficulty": "Hard", "likes": 176, "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": 6339, "totalSubmissionRaw": 20650}, "2936": {"acRate": 66.33590591694231, "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": 1805, "totalSubmissionRaw": 2721}, "2937": {"acRate": 43.513986532585804, "difficulty": "Easy", "likes": 297, "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": 29338, "totalSubmissionRaw": 67422}, "2938": {"acRate": 53.580896093172825, "difficulty": "Medium", "likes": 189, "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": 24659, "totalSubmissionRaw": 46022}, "2939": {"acRate": 26.574142540242306, "difficulty": "Medium", "likes": 203, "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": 9344, "totalSubmissionRaw": 35162}, "2940": {"acRate": 35.700990995522915, "difficulty": "Hard", "likes": 231, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2940", "paidOnly": false, "title": "Find Building Where Alice and Bob Can Meet", "titleSlug": "find-building-where-alice-and-bob-can-meet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7097, "totalSubmissionRaw": 19879}, "2941": {"acRate": 46.56398104265403, "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": 393, "totalSubmissionRaw": 844}, "2942": {"acRate": 88.6821201123057, "difficulty": "Easy", "likes": 347, "dislikes": 28, "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": 155403, "totalSubmissionRaw": 175236}, "2943": {"acRate": 37.12787338274086, "difficulty": "Medium", "likes": 224, "dislikes": 148, "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": 11823, "totalSubmissionRaw": 31844}, "2944": {"acRate": 46.42344977915448, "difficulty": "Medium", "likes": 257, "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": 16186, "totalSubmissionRaw": 34866}, "2945": {"acRate": 16.545860596324882, "difficulty": "Hard", "likes": 166, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2945", "paidOnly": false, "title": "Find Maximum Non-decreasing Array Length", "titleSlug": "find-maximum-non-decreasing-array-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4223, "totalSubmissionRaw": 25523}, "2946": {"acRate": 58.47795731099142, "difficulty": "Easy", "likes": 172, "dislikes": 64, "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": 23448, "totalSubmissionRaw": 40100}, "2947": {"acRate": 62.126353684086276, "difficulty": "Medium", "likes": 140, "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": 21054, "totalSubmissionRaw": 33889}, "2948": {"acRate": 39.943551888840645, "difficulty": "Medium", "likes": 262, "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": 9199, "totalSubmissionRaw": 23029}, "2949": {"acRate": 25.408392839675244, "difficulty": "Hard", "likes": 180, "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": 5195, "totalSubmissionRaw": 20446}, "2950": {"acRate": 76.24703087885986, "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": 1284, "totalSubmissionRaw": 1684}, "2951": {"acRate": 75.78254444494202, "difficulty": "Easy", "likes": 157, "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": 50769, "totalSubmissionRaw": 66993}, "2952": {"acRate": 57.60356879013469, "difficulty": "Medium", "likes": 352, "dislikes": 56, "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": 20273, "totalSubmissionRaw": 35194}, "2953": {"acRate": 28.172051442910917, "difficulty": "Hard", "likes": 201, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2953", "paidOnly": false, "title": "Count Complete Substrings", "titleSlug": "count-complete-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7185, "totalSubmissionRaw": 25504}, "2954": {"acRate": 37.04330175913397, "difficulty": "Hard", "likes": 115, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2954", "paidOnly": false, "title": "Count the Number of Infection Sequences", "titleSlug": "count-the-number-of-infection-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3285, "totalSubmissionRaw": 8868}, "2955": {"acRate": 56.94287649582298, "difficulty": "Medium", "likes": 34, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2955", "paidOnly": true, "title": "Number of Same-End Substrings", "titleSlug": "number-of-same-end-substrings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2521, "totalSubmissionRaw": 4428}, "2956": {"acRate": 83.84333086915197, "difficulty": "Easy", "likes": 222, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2956", "paidOnly": false, "title": "Find Common Elements Between Two Arrays", "titleSlug": "find-common-elements-between-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63512, "totalSubmissionRaw": 75751}, "2957": {"acRate": 52.879469064440165, "difficulty": "Medium", "likes": 166, "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": 22230, "totalSubmissionRaw": 42039}, "2958": {"acRate": 55.81546579465646, "difficulty": "Medium", "likes": 1037, "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": 150205, "totalSubmissionRaw": 269110}, "2959": {"acRate": 51.59130184331797, "difficulty": "Hard", "likes": 159, "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": 7165, "totalSubmissionRaw": 13888}, "2960": {"acRate": 80.79656698404185, "difficulty": "Easy", "likes": 141, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2960", "paidOnly": false, "title": "Count Tested Devices After Test Operations", "titleSlug": "count-tested-devices-after-test-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42174, "totalSubmissionRaw": 52198}, "2961": {"acRate": 48.21001309195973, "difficulty": "Medium", "likes": 112, "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": 21358, "totalSubmissionRaw": 44302}, "2962": {"acRate": 58.913445623600424, "difficulty": "Medium", "likes": 1220, "dislikes": 60, "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": 133122, "totalSubmissionRaw": 225962}, "2963": {"acRate": 49.96986415689184, "difficulty": "Hard", "likes": 241, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2963", "paidOnly": false, "title": "Count the Number of Good Partitions", "titleSlug": "count-the-number-of-good-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10778, "totalSubmissionRaw": 21569}, "2964": {"acRate": 66.5137614678899, "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": 1740, "totalSubmissionRaw": 2616}, "2965": {"acRate": 76.05015494089292, "difficulty": "Easy", "likes": 202, "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": 53010, "totalSubmissionRaw": 69704}, "2966": {"acRate": 71.75059071610795, "difficulty": "Medium", "likes": 831, "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": 152437, "totalSubmissionRaw": 212454}, "2967": {"acRate": 22.34943858455257, "difficulty": "Medium", "likes": 224, "dislikes": 88, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13137, "totalSubmissionRaw": 58780}, "2968": {"acRate": 38.68171021377672, "difficulty": "Hard", "likes": 240, "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": 6514, "totalSubmissionRaw": 16840}, "2969": {"acRate": 53.46187554776512, "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": 610, "totalSubmissionRaw": 1141}, "2970": {"acRate": 52.369377140019346, "difficulty": "Easy", "likes": 148, "dislikes": 94, "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": 20036, "totalSubmissionRaw": 38259}, "2971": {"acRate": 66.09982040352929, "difficulty": "Medium", "likes": 783, "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": 135073, "totalSubmissionRaw": 204347}, "2972": {"acRate": 40.260727865290605, "difficulty": "Hard", "likes": 195, "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": 7412, "totalSubmissionRaw": 18408}, "2973": {"acRate": 37.31635651322233, "difficulty": "Hard", "likes": 176, "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": 8382, "totalSubmissionRaw": 22462}, "2974": {"acRate": 86.00617331883834, "difficulty": "Easy", "likes": 231, "dislikes": 18, "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": 88606, "totalSubmissionRaw": 103023}, "2975": {"acRate": 23.105535344307228, "difficulty": "Medium", "likes": 136, "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": 14163, "totalSubmissionRaw": 61295}, "2976": {"acRate": 58.555197066060074, "difficulty": "Medium", "likes": 863, "dislikes": 60, "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": 100907, "totalSubmissionRaw": 172328}, "2977": {"acRate": 25.868119205991725, "difficulty": "Hard", "likes": 96, "dislikes": 74, "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": 4939, "totalSubmissionRaw": 19090}, "2978": {"acRate": 42.2599212359891, "difficulty": "Medium", "likes": 9, "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": 1395, "totalSubmissionRaw": 3301}, "2979": {"acRate": 77.44464944649447, "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": 1679, "totalSubmissionRaw": 2168}, "2980": {"acRate": 70.99181561424123, "difficulty": "Easy", "likes": 107, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2980", "paidOnly": false, "title": "Check if Bitwise OR Has Trailing Zeros", "titleSlug": "check-if-bitwise-or-has-trailing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34436, "totalSubmissionRaw": 48507}, "2981": {"acRate": 43.452001275713606, "difficulty": "Medium", "likes": 166, "dislikes": 12, "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": 21793, "totalSubmissionRaw": 50161}, "2982": {"acRate": 34.116135062507304, "difficulty": "Medium", "likes": 250, "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": 17520, "totalSubmissionRaw": 51354}, "2983": {"acRate": 26.145287958115183, "difficulty": "Hard", "likes": 86, "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": 3196, "totalSubmissionRaw": 12224}, "2984": {"acRate": 61.132882080513006, "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": 1716, "totalSubmissionRaw": 2807}, "2985": {"acRate": 87.45128604832423, "difficulty": "Easy", "likes": 7, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2985", "paidOnly": true, "title": "Calculate Compressed Mean", "titleSlug": "calculate-compressed-mean", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2244, "totalSubmissionRaw": 2566}, "2986": {"acRate": 52.207568807339456, "difficulty": "Medium", "likes": 8, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2986", "paidOnly": true, "title": "Find Third Transaction", "titleSlug": "find-third-transaction", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1821, "totalSubmissionRaw": 3488}, "2987": {"acRate": 79.63970088375255, "difficulty": "Easy", "likes": 8, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2987", "paidOnly": true, "title": "Find Expensive Cities", "titleSlug": "find-expensive-cities", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2343, "totalSubmissionRaw": 2942}, "2988": {"acRate": 80.16910069177555, "difficulty": "Medium", "likes": 3, "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": 2086, "totalSubmissionRaw": 2602}, "2989": {"acRate": 89.05753618072715, "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": 2523, "totalSubmissionRaw": 2833}, "2990": {"acRate": 61.85000000000001, "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": 2474, "totalSubmissionRaw": 4000}, "2991": {"acRate": 54.017305315203956, "difficulty": "Hard", "likes": 9, "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": 1310, "totalSubmissionRaw": 2424}, "2992": {"acRate": 72.67045454545455, "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": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1279, "totalSubmissionRaw": 1760}, "2993": {"acRate": 80.43286219081273, "difficulty": "Medium", "likes": 10, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2993", "paidOnly": true, "title": "Friday Purchases I", "titleSlug": "friday-purchases-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1821, "totalSubmissionRaw": 2264}, "2994": {"acRate": 74.47883765003158, "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": 1179, "totalSubmissionRaw": 1583}, "2995": {"acRate": 42.5414364640884, "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": 1232, "totalSubmissionRaw": 2896}, "2996": {"acRate": 32.76620069635712, "difficulty": "Easy", "likes": 111, "dislikes": 238, "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": 31526, "totalSubmissionRaw": 96215}, "2997": {"acRate": 86.38471541149008, "difficulty": "Medium", "likes": 574, "dislikes": 55, "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": 110277, "totalSubmissionRaw": 127658}, "2998": {"acRate": 47.162286768095896, "difficulty": "Medium", "likes": 247, "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": 20458, "totalSubmissionRaw": 43379}, "2999": {"acRate": 26.36538991457702, "difficulty": "Hard", "likes": 106, "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": 4784, "totalSubmissionRaw": 18145}, "3000": {"acRate": 36.34876941360501, "difficulty": "Easy", "likes": 103, "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": 35785, "totalSubmissionRaw": 98449}, "3001": {"acRate": 21.114729340695643, "difficulty": "Medium", "likes": 152, "dislikes": 196, "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": 17896, "totalSubmissionRaw": 84756}, "3002": {"acRate": 45.98677998111425, "difficulty": "Medium", "likes": 281, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3002", "paidOnly": false, "title": "Maximum Size of a Set After Removals", "titleSlug": "maximum-size-of-a-set-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16071, "totalSubmissionRaw": 34947}, "3003": {"acRate": 28.503104547742907, "difficulty": "Hard", "likes": 134, "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": 3397, "totalSubmissionRaw": 11918}, "3004": {"acRate": 64.64547677261614, "difficulty": "Medium", "likes": 18, "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": 1322, "totalSubmissionRaw": 2045}, "3005": {"acRate": 78.71869690477949, "difficulty": "Easy", "likes": 643, "dislikes": 69, "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": 213123, "totalSubmissionRaw": 270740}, "3006": {"acRate": 36.5942281187788, "difficulty": "Medium", "likes": 156, "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": 26286, "totalSubmissionRaw": 71831}, "3007": {"acRate": 36.83293054950279, "difficulty": "Medium", "likes": 293, "dislikes": 116, "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": 9297, "totalSubmissionRaw": 25241}, "3008": {"acRate": 24.73989263147893, "difficulty": "Hard", "likes": 164, "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": 10415, "totalSubmissionRaw": 42098}, "3009": {"acRate": 45.84426946631671, "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": 3668, "totalSubmissionRaw": 8001}, "3010": {"acRate": 66.61001877284853, "difficulty": "Easy", "likes": 93, "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": 33708, "totalSubmissionRaw": 50605}, "3011": {"acRate": 51.63803080210096, "difficulty": "Medium", "likes": 121, "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": 23202, "totalSubmissionRaw": 44932}, "3012": {"acRate": 35.5166401334243, "difficulty": "Medium", "likes": 164, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3012", "paidOnly": false, "title": "Minimize Length of Array Using Operations", "titleSlug": "minimize-length-of-array-using-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14055, "totalSubmissionRaw": 39573}, "3013": {"acRate": 32.38083354130272, "difficulty": "Hard", "likes": 115, "dislikes": 18, "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": 5190, "totalSubmissionRaw": 16028}, "3014": {"acRate": 66.62500202912196, "difficulty": "Easy", "likes": 162, "dislikes": 27, "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": 41043, "totalSubmissionRaw": 61603}, "3015": {"acRate": 56.61577608142494, "difficulty": "Medium", "likes": 151, "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": 19580, "totalSubmissionRaw": 34584}, "3016": {"acRate": 80.7478085341009, "difficulty": "Medium", "likes": 731, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "3016", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word II", "titleSlug": "minimum-number-of-pushes-to-type-word-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172810, "totalSubmissionRaw": 214012}, "3017": {"acRate": 22.19669777458722, "difficulty": "Hard", "likes": 81, "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": 3092, "totalSubmissionRaw": 13930}, "3018": {"acRate": 44.09687184661958, "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": 437, "totalSubmissionRaw": 991}, "3019": {"acRate": 81.04740490912498, "difficulty": "Easy", "likes": 114, "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": 51905, "totalSubmissionRaw": 64043}, "3020": {"acRate": 24.825389798829374, "difficulty": "Medium", "likes": 172, "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": 20189, "totalSubmissionRaw": 81324}, "3021": {"acRate": 47.91480740008201, "difficulty": "Medium", "likes": 90, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "3021", "paidOnly": false, "title": "Alice and Bob Playing Flower Game", "titleSlug": "alice-and-bob-playing-flower-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19865, "totalSubmissionRaw": 41459}, "3022": {"acRate": 34.33131535498074, "difficulty": "Hard", "likes": 90, "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": 3119, "totalSubmissionRaw": 9085}, "3023": {"acRate": 59.18106206014075, "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": 925, "totalSubmissionRaw": 1563}, "3024": {"acRate": 38.36081829043296, "difficulty": "Easy", "likes": 93, "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": 47198, "totalSubmissionRaw": 123037}, "3025": {"acRate": 41.37951415568296, "difficulty": "Medium", "likes": 83, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "3025", "paidOnly": false, "title": "Find the Number of Ways to Place People I", "titleSlug": "find-the-number-of-ways-to-place-people-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14002, "totalSubmissionRaw": 33838}, "3026": {"acRate": 18.60584823107838, "difficulty": "Medium", "likes": 327, "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": 18794, "totalSubmissionRaw": 101017}, "3027": {"acRate": 47.88619622077506, "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": 8971, "totalSubmissionRaw": 18734}, "3028": {"acRate": 74.81126978000772, "difficulty": "Easy", "likes": 105, "dislikes": 37, "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": 48459, "totalSubmissionRaw": 64775}, "3029": {"acRate": 41.0665572761768, "difficulty": "Medium", "likes": 141, "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": 20022, "totalSubmissionRaw": 48755}, "3030": {"acRate": 44.41152706706168, "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": 9894, "totalSubmissionRaw": 22278}, "3031": {"acRate": 35.626113721043254, "difficulty": "Hard", "likes": 130, "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": 10996, "totalSubmissionRaw": 30865}, "3032": {"acRate": 87.49239813500913, "difficulty": "Easy", "likes": 23, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3032", "paidOnly": true, "title": "Count Numbers With Unique Digits II", "titleSlug": "count-numbers-with-unique-digits-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4316, "totalSubmissionRaw": 4933}, "3033": {"acRate": 68.57744422182226, "difficulty": "Easy", "likes": 110, "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": 40388, "totalSubmissionRaw": 58894}, "3034": {"acRate": 66.93717679586298, "difficulty": "Medium", "likes": 91, "dislikes": 9, "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": 26147, "totalSubmissionRaw": 39062}, "3035": {"acRate": 42.81183624778143, "difficulty": "Medium", "likes": 210, "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": 14714, "totalSubmissionRaw": 34369}, "3036": {"acRate": 32.75790595759801, "difficulty": "Hard", "likes": 142, "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": 11063, "totalSubmissionRaw": 33772}, "3037": {"acRate": 71.17903930131004, "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": 815, "totalSubmissionRaw": 1145}, "3038": {"acRate": 52.230061349693244, "difficulty": "Easy", "likes": 75, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3038", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score I", "titleSlug": "maximum-number-of-operations-with-the-same-score-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34054, "totalSubmissionRaw": 65200}, "3039": {"acRate": 56.89864630336688, "difficulty": "Medium", "likes": 132, "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": 26228, "totalSubmissionRaw": 46096}, "3040": {"acRate": 33.50566347103013, "difficulty": "Medium", "likes": 154, "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": 20026, "totalSubmissionRaw": 59769}, "3041": {"acRate": 32.397905759162306, "difficulty": "Hard", "likes": 150, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3041", "paidOnly": false, "title": "Maximize Consecutive Elements in an Array After Modification", "titleSlug": "maximize-consecutive-elements-in-an-array-after-modification", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7735, "totalSubmissionRaw": 23875}, "3042": {"acRate": 65.54380025391453, "difficulty": "Easy", "likes": 103, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3042", "paidOnly": false, "title": "Count Prefix and Suffix Pairs I", "titleSlug": "count-prefix-and-suffix-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38720, "totalSubmissionRaw": 59075}, "3043": {"acRate": 35.97015775385842, "difficulty": "Medium", "likes": 168, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3043", "paidOnly": false, "title": "Find the Length of the Longest Common Prefix", "titleSlug": "find-the-length-of-the-longest-common-prefix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25265, "totalSubmissionRaw": 70237}, "3044": {"acRate": 48.47130396995375, "difficulty": "Medium", "likes": 87, "dislikes": 65, "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": 15616, "totalSubmissionRaw": 32217}, "3045": {"acRate": 25.195780017139985, "difficulty": "Hard", "likes": 155, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3045", "paidOnly": false, "title": "Count Prefix and Suffix Pairs II", "titleSlug": "count-prefix-and-suffix-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8526, "totalSubmissionRaw": 33839}, "3046": {"acRate": 58.783604706099254, "difficulty": "Easy", "likes": 107, "dislikes": 10, "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": 51012, "totalSubmissionRaw": 86777}, "3047": {"acRate": 45.589421061119175, "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": 19789, "totalSubmissionRaw": 43407}, "3048": {"acRate": 36.22583006761121, "difficulty": "Medium", "likes": 173, "dislikes": 81, "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": 8412, "totalSubmissionRaw": 23221}, "3049": {"acRate": 22.874475034997666, "difficulty": "Hard", "likes": 74, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3049", "paidOnly": false, "title": "Earliest Second to Mark Indices II", "titleSlug": "earliest-second-to-mark-indices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2451, "totalSubmissionRaw": 10715}, "3050": {"acRate": 68.97938662644545, "difficulty": "Medium", "likes": 8, "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": 1372, "totalSubmissionRaw": 1989}, "3051": {"acRate": 74.55830388692578, "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": 2321, "totalSubmissionRaw": 3113}, "3052": {"acRate": 74.12844036697248, "difficulty": "Hard", "likes": 4, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "3052", "paidOnly": true, "title": "Maximize Items", "titleSlug": "maximize-items", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 808, "totalSubmissionRaw": 1090}, "3053": {"acRate": 49.795533186536645, "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": 1583, "totalSubmissionRaw": 3179}, "3054": {"acRate": 80.29850746268656, "difficulty": "Medium", "likes": 10, "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": 1613, "totalSubmissionRaw": 2009}, "3055": {"acRate": 60.475968268782076, "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": 1296, "totalSubmissionRaw": 2143}, "3056": {"acRate": 59.09490333919156, "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": 1345, "totalSubmissionRaw": 2276}, "3057": {"acRate": 68.49768365320979, "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": 1035, "totalSubmissionRaw": 1511}, "3058": {"acRate": 51.20772946859904, "difficulty": "Medium", "likes": 10, "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": 1166, "totalSubmissionRaw": 2277}, "3059": {"acRate": 67.62917933130699, "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": 1780, "totalSubmissionRaw": 2632}, "3060": {"acRate": 39.81520369592608, "difficulty": "Hard", "likes": 3, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "3060", "paidOnly": true, "title": "User Activities within Time Bounds", "titleSlug": "user-activities-within-time-bounds", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 948, "totalSubmissionRaw": 2381}, "3061": {"acRate": 77.88461538461539, "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": 648, "totalSubmissionRaw": 832}, "3062": {"acRate": 80.19620427248556, "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": 8747, "totalSubmissionRaw": 10907}, "3063": {"acRate": 86.1494649637556, "difficulty": "Easy", "likes": 37, "dislikes": 19, "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": 9983, "totalSubmissionRaw": 11588}, "3064": {"acRate": 90.91627172195894, "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": 1151, "totalSubmissionRaw": 1266}, "3065": {"acRate": 86.28312564618817, "difficulty": "Easy", "likes": 87, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3065", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value I", "titleSlug": "minimum-operations-to-exceed-threshold-value-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63425, "totalSubmissionRaw": 73508}, "3066": {"acRate": 27.87904950650472, "difficulty": "Medium", "likes": 86, "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": 28416, "totalSubmissionRaw": 101926}, "3067": {"acRate": 58.0815460758897, "difficulty": "Medium", "likes": 191, "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": 12322, "totalSubmissionRaw": 21215}, "3068": {"acRate": 66.83735788781358, "difficulty": "Hard", "likes": 636, "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": 71135, "totalSubmissionRaw": 106430}, "3069": {"acRate": 72.91926498711233, "difficulty": "Easy", "likes": 77, "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": 43850, "totalSubmissionRaw": 60135}, "3070": {"acRate": 59.59365369250086, "difficulty": "Medium", "likes": 137, "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": 26105, "totalSubmissionRaw": 43805}, "3071": {"acRate": 63.05245554759223, "difficulty": "Medium", "likes": 92, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3071", "paidOnly": false, "title": "Minimum Operations to Write the Letter Y on a Grid", "titleSlug": "minimum-operations-to-write-the-letter-y-on-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18475, "totalSubmissionRaw": 29301}, "3072": {"acRate": 27.89748303549704, "difficulty": "Hard", "likes": 131, "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": 10319, "totalSubmissionRaw": 36989}, "3073": {"acRate": 40.93234792495736, "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": 720, "totalSubmissionRaw": 1759}, "3074": {"acRate": 67.27772815561511, "difficulty": "Easy", "likes": 91, "dislikes": 5, "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": 47453, "totalSubmissionRaw": 70533}, "3075": {"acRate": 55.02287935678849, "difficulty": "Medium", "likes": 644, "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": 174236, "totalSubmissionRaw": 316661}, "3076": {"acRate": 46.023833958154434, "difficulty": "Medium", "likes": 129, "dislikes": 17, "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": 21975, "totalSubmissionRaw": 47747}, "3077": {"acRate": 28.02544956479477, "difficulty": "Hard", "likes": 134, "dislikes": 74, "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": 6343, "totalSubmissionRaw": 22633}, "3078": {"acRate": 68.646080760095, "difficulty": "Medium", "likes": 8, "dislikes": 3, "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": 578, "totalSubmissionRaw": 842}, "3079": {"acRate": 74.5948997210785, "difficulty": "Easy", "likes": 99, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3079", "paidOnly": false, "title": "Find the Sum of Encrypted Integers", "titleSlug": "find-the-sum-of-encrypted-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44929, "totalSubmissionRaw": 60231}, "3080": {"acRate": 49.45302532642037, "difficulty": "Medium", "likes": 112, "dislikes": 21, "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": 18218, "totalSubmissionRaw": 36839}, "3081": {"acRate": 27.576777879808184, "difficulty": "Medium", "likes": 161, "dislikes": 26, "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": 13514, "totalSubmissionRaw": 49005}, "3082": {"acRate": 39.280744942737876, "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": 7340, "totalSubmissionRaw": 18686}, "3083": {"acRate": 66.26518595811284, "difficulty": "Easy", "likes": 89, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3083", "paidOnly": false, "title": "Existence of a Substring in a String and Its Reverse", "titleSlug": "existence-of-a-substring-in-a-string-and-its-reverse", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44454, "totalSubmissionRaw": 67085}, "3084": {"acRate": 48.899595606390214, "difficulty": "Medium", "likes": 110, "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": 36639, "totalSubmissionRaw": 74927}, "3085": {"acRate": 44.145350653988665, "difficulty": "Medium", "likes": 197, "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": 19778, "totalSubmissionRaw": 44802}, "3086": {"acRate": 23.35816357555488, "difficulty": "Hard", "likes": 50, "dislikes": 48, "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": 3073, "totalSubmissionRaw": 13156}, "3087": {"acRate": 62.66349583828775, "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": 1054, "totalSubmissionRaw": 1682}, "3088": {"acRate": 52.86935286935287, "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": 433, "totalSubmissionRaw": 819}, "3089": {"acRate": 39.98211091234347, "difficulty": "Medium", "likes": 7, "dislikes": 16, "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": 894, "totalSubmissionRaw": 2236}, "3090": {"acRate": 63.933907318308435, "difficulty": "Easy", "likes": 169, "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": 40396, "totalSubmissionRaw": 63184}, "3091": {"acRate": 44.652070166387205, "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": 27695, "totalSubmissionRaw": 62024}, "3092": {"acRate": 42.73963113689497, "difficulty": "Medium", "likes": 224, "dislikes": 29, "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": 19744, "totalSubmissionRaw": 46196}, "3093": {"acRate": 41.439357569938466, "difficulty": "Hard", "likes": 125, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3093", "paidOnly": false, "title": "Longest Common Suffix Queries", "titleSlug": "longest-common-suffix-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9495, "totalSubmissionRaw": 22913}, "3094": {"acRate": 81.40929535232384, "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": 543, "totalSubmissionRaw": 667}, "3095": {"acRate": 41.155474269532, "difficulty": "Easy", "likes": 86, "dislikes": 12, "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": 27903, "totalSubmissionRaw": 67799}, "3096": {"acRate": 40.74019408877901, "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": 22081, "totalSubmissionRaw": 54200}, "3097": {"acRate": 30.47627602003009, "difficulty": "Medium", "likes": 189, "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": 13572, "totalSubmissionRaw": 44533}, "3098": {"acRate": 24.585172781245245, "difficulty": "Hard", "likes": 123, "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": 4845, "totalSubmissionRaw": 19707}, "3099": {"acRate": 83.07686028001143, "difficulty": "Easy", "likes": 122, "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": 61059, "totalSubmissionRaw": 73497}, "3100": {"acRate": 63.837145471180236, "difficulty": "Medium", "likes": 137, "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": 34887, "totalSubmissionRaw": 54650}, "3101": {"acRate": 57.26657733912873, "difficulty": "Medium", "likes": 207, "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": 35046, "totalSubmissionRaw": 61198}, "3102": {"acRate": 32.735460528848, "difficulty": "Hard", "likes": 164, "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": 8505, "totalSubmissionRaw": 25981}, "3103": {"acRate": 65.35796766743648, "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": 566, "totalSubmissionRaw": 866}, "3104": {"acRate": 57.271702367531006, "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": 508, "totalSubmissionRaw": 887}, "3105": {"acRate": 57.0884018162453, "difficulty": "Easy", "likes": 114, "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": 40736, "totalSubmissionRaw": 71356}, "3106": {"acRate": 63.60019139237956, "difficulty": "Medium", "likes": 144, "dislikes": 19, "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": 25255, "totalSubmissionRaw": 39709}, "3107": {"acRate": 48.58715813568018, "difficulty": "Medium", "likes": 133, "dislikes": 179, "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": 24623, "totalSubmissionRaw": 50678}, "3108": {"acRate": 45.886208604855, "difficulty": "Hard", "likes": 181, "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": 12041, "totalSubmissionRaw": 26241}, "3109": {"acRate": 41.734693877551024, "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": 409, "totalSubmissionRaw": 980}, "3110": {"acRate": 93.08132197643111, "difficulty": "Easy", "likes": 581, "dislikes": 37, "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": 270686, "totalSubmissionRaw": 290806}, "3111": {"acRate": 63.898071957723026, "difficulty": "Medium", "likes": 88, "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": 26479, "totalSubmissionRaw": 41438}, "3112": {"acRate": 34.79543954835398, "difficulty": "Medium", "likes": 157, "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": 18983, "totalSubmissionRaw": 54556}, "3113": {"acRate": 30.22447236793949, "difficulty": "Hard", "likes": 204, "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": 9910, "totalSubmissionRaw": 32788}, "3114": {"acRate": 35.664974939318476, "difficulty": "Easy", "likes": 92, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3114", "paidOnly": false, "title": "Latest Time You Can Obtain After Replacing Characters", "titleSlug": "latest-time-you-can-obtain-after-replacing-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33942, "totalSubmissionRaw": 95169}, "3115": {"acRate": 58.354039605451405, "difficulty": "Medium", "likes": 103, "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": 38750, "totalSubmissionRaw": 66405}, "3116": {"acRate": 16.76005805047166, "difficulty": "Hard", "likes": 212, "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": 8315, "totalSubmissionRaw": 49612}, "3117": {"acRate": 28.133817009270455, "difficulty": "Hard", "likes": 113, "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": 4886, "totalSubmissionRaw": 17367}, "3118": {"acRate": 60.83761939750184, "difficulty": "Medium", "likes": 3, "dislikes": 5, "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": 828, "totalSubmissionRaw": 1361}, "3119": {"acRate": 60.449735449735456, "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": 914, "totalSubmissionRaw": 1512}, "3120": {"acRate": 65.72736828464053, "difficulty": "Easy", "likes": 127, "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": 45647, "totalSubmissionRaw": 69449}, "3121": {"acRate": 41.579375775610146, "difficulty": "Medium", "likes": 145, "dislikes": 13, "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": 31160, "totalSubmissionRaw": 74941}, "3122": {"acRate": 41.284689741191144, "difficulty": "Medium", "likes": 215, "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": 14564, "totalSubmissionRaw": 35277}, "3123": {"acRate": 48.53228962818004, "difficulty": "Hard", "likes": 231, "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": 11904, "totalSubmissionRaw": 24528}, "3124": {"acRate": 69.2522711390636, "difficulty": "Medium", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3124", "paidOnly": true, "title": "Find Longest Calls", "titleSlug": "find-longest-calls", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 991, "totalSubmissionRaw": 1431}, "3125": {"acRate": 69.84815618221259, "difficulty": "Medium", "likes": 10, "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": 644, "totalSubmissionRaw": 922}, "3126": {"acRate": 57.637362637362635, "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": 1049, "totalSubmissionRaw": 1820}, "3127": {"acRate": 51.33059474906233, "difficulty": "Easy", "likes": 69, "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": 25866, "totalSubmissionRaw": 50391}, "3128": {"acRate": 47.74678656708835, "difficulty": "Medium", "likes": 104, "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": 18796, "totalSubmissionRaw": 39366}, "3129": {"acRate": 27.048613512205243, "difficulty": "Medium", "likes": 113, "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": 7823, "totalSubmissionRaw": 28922}, "3130": {"acRate": 28.446185413169182, "difficulty": "Hard", "likes": 59, "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": 3050, "totalSubmissionRaw": 10722}, "3131": {"acRate": 82.27477180490234, "difficulty": "Easy", "likes": 119, "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": 56155, "totalSubmissionRaw": 68253}, "3132": {"acRate": 31.32090290301937, "difficulty": "Medium", "likes": 152, "dislikes": 37, "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": 21535, "totalSubmissionRaw": 68756}, "3133": {"acRate": 38.14725029281181, "difficulty": "Medium", "likes": 199, "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": 14005, "totalSubmissionRaw": 36713}, "3134": {"acRate": 28.860966685923355, "difficulty": "Hard", "likes": 144, "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": 5995, "totalSubmissionRaw": 20772}, "3135": {"acRate": 55.676657584014535, "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": 613, "totalSubmissionRaw": 1101}, "3136": {"acRate": 37.811598005772765, "difficulty": "Easy", "likes": 100, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "3136", "paidOnly": false, "title": "Valid Word", "titleSlug": "valid-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41789, "totalSubmissionRaw": 110519}, "3137": {"acRate": 62.73372351996686, "difficulty": "Medium", "likes": 112, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3137", "paidOnly": false, "title": "Minimum Number of Operations to Make Word K-Periodic", "titleSlug": "minimum-number-of-operations-to-make-word-k-periodic", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24224, "totalSubmissionRaw": 38614}, "3138": {"acRate": 41.92253933901438, "difficulty": "Medium", "likes": 167, "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": 27893, "totalSubmissionRaw": 66536}, "3139": {"acRate": 16.7786808377618, "difficulty": "Hard", "likes": 117, "dislikes": 21, "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": 4294, "totalSubmissionRaw": 25592}, "3140": {"acRate": 62.43055555555556, "difficulty": "Medium", "likes": 5, "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": 899, "totalSubmissionRaw": 1440}, "3141": {"acRate": 71.68874172185431, "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": 433, "totalSubmissionRaw": 604}, "3142": {"acRate": 43.3500375174188, "difficulty": "Easy", "likes": 68, "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": 32353, "totalSubmissionRaw": 74632}, "3143": {"acRate": 38.98631939560315, "difficulty": "Medium", "likes": 146, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3143", "paidOnly": false, "title": "Maximum Points Inside the Square", "titleSlug": "maximum-points-inside-the-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17184, "totalSubmissionRaw": 44077}, "3144": {"acRate": 41.04018486840131, "difficulty": "Medium", "likes": 131, "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": 13675, "totalSubmissionRaw": 33321}, "3145": {"acRate": 25.321401562893875, "difficulty": "Hard", "likes": 55, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3145", "paidOnly": false, "title": "Find Products of Elements of Big Array", "titleSlug": "find-products-of-elements-of-big-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2009, "totalSubmissionRaw": 7934}, "3146": {"acRate": 89.18773129273035, "difficulty": "Easy", "likes": 122, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3146", "paidOnly": false, "title": "Permutation Difference between Two Strings", "titleSlug": "permutation-difference-between-two-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71095, "totalSubmissionRaw": 79714}, "3147": {"acRate": 40.64026420959148, "difficulty": "Medium", "likes": 148, "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": 29287, "totalSubmissionRaw": 72064}, "3148": {"acRate": 47.97415533719209, "difficulty": "Medium", "likes": 224, "dislikes": 20, "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": 17819, "totalSubmissionRaw": 37144}, "3149": {"acRate": 23.11495673671199, "difficulty": "Hard", "likes": 103, "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": 4301, "totalSubmissionRaw": 18607}, "3150": {"acRate": 88.01571709233792, "difficulty": "Easy", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3150", "paidOnly": true, "title": "Invalid Tweets II", "titleSlug": "invalid-tweets-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1344, "totalSubmissionRaw": 1527}, "3151": {"acRate": 75.71048945556413, "difficulty": "Easy", "likes": 92, "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": 57836, "totalSubmissionRaw": 76391}, "3152": {"acRate": 30.06995028326974, "difficulty": "Medium", "likes": 184, "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": 31209, "totalSubmissionRaw": 103788}, "3153": {"acRate": 43.74110420256199, "difficulty": "Medium", "likes": 171, "dislikes": 18, "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": 23356, "totalSubmissionRaw": 53396}, "3154": {"acRate": 36.620875509399234, "difficulty": "Hard", "likes": 132, "dislikes": 10, "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": 11143, "totalSubmissionRaw": 30428}, "3155": {"acRate": 49.34248141795312, "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": 863, "totalSubmissionRaw": 1749}, "3156": {"acRate": 57.7354260089686, "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": 515, "totalSubmissionRaw": 892}, "3157": {"acRate": 69.47427925381572, "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": 1229, "totalSubmissionRaw": 1769}, "3158": {"acRate": 82.08537190668652, "difficulty": "Easy", "likes": 92, "dislikes": 9, "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": 46306, "totalSubmissionRaw": 56412}, "3159": {"acRate": 73.60624105234766, "difficulty": "Medium", "likes": 113, "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": 35476, "totalSubmissionRaw": 48197}, "3160": {"acRate": 41.258499281994496, "difficulty": "Medium", "likes": 107, "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": 23847, "totalSubmissionRaw": 57799}, "3161": {"acRate": 14.017823449156724, "difficulty": "Hard", "likes": 96, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3161", "paidOnly": false, "title": "Block Placement Queries", "titleSlug": "block-placement-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4829, "totalSubmissionRaw": 34449}, "3162": {"acRate": 86.74453493356194, "difficulty": "Easy", "likes": 101, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3162", "paidOnly": false, "title": "Find the Number of Good Pairs I", "titleSlug": "find-the-number-of-good-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64760, "totalSubmissionRaw": 74656}, "3163": {"acRate": 55.93483863738234, "difficulty": "Medium", "likes": 106, "dislikes": 9, "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": 39933, "totalSubmissionRaw": 71392}, "3164": {"acRate": 25.680023097069558, "difficulty": "Medium", "likes": 205, "dislikes": 35, "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": 24905, "totalSubmissionRaw": 96982}, "3165": {"acRate": 16.951919993002303, "difficulty": "Hard", "likes": 108, "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": 5814, "totalSubmissionRaw": 34297}, "3166": {"acRate": 51.71377029464823, "difficulty": "Medium", "likes": 5, "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": 860, "totalSubmissionRaw": 1663}, "3167": {"acRate": 75.48228691687127, "difficulty": "Medium", "likes": 10, "dislikes": 3, "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": 2152, "totalSubmissionRaw": 2851}, "3168": {"acRate": 80.47621223892875, "difficulty": "Easy", "likes": 109, "dislikes": 10, "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": 52827, "totalSubmissionRaw": 65643}, "3169": {"acRate": 33.79108368974169, "difficulty": "Medium", "likes": 196, "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": 37845, "totalSubmissionRaw": 111997}, "3170": {"acRate": 35.887102358497096, "difficulty": "Medium", "likes": 192, "dislikes": 26, "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": 25913, "totalSubmissionRaw": 72207}, "3171": {"acRate": 31.05384356645709, "difficulty": "Hard", "likes": 165, "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": 12002, "totalSubmissionRaw": 38649}, "3172": {"acRate": 72.49834327369119, "difficulty": "Easy", "likes": 4, "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": 1094, "totalSubmissionRaw": 1509}, "3173": {"acRate": 95.37231804795961, "difficulty": "Easy", "likes": 9, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3173", "paidOnly": true, "title": "Bitwise OR of Adjacent Elements", "titleSlug": "bitwise-or-of-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2267, "totalSubmissionRaw": 2377}, "3174": {"acRate": 72.63575306185159, "difficulty": "Easy", "likes": 81, "dislikes": 2, "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": 49640, "totalSubmissionRaw": 68341}, "3175": {"acRate": 39.50664967234431, "difficulty": "Medium", "likes": 114, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3175", "paidOnly": false, "title": "Find The First Player to win K Games in a Row", "titleSlug": "find-the-first-player-to-win-k-games-in-a-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30686, "totalSubmissionRaw": 77673}, "3176": {"acRate": 30.499532985090116, "difficulty": "Medium", "likes": 128, "dislikes": 72, "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": 17633, "totalSubmissionRaw": 57814}, "3177": {"acRate": 24.215196894065446, "difficulty": "Hard", "likes": 104, "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": 6549, "totalSubmissionRaw": 27045}, "3178": {"acRate": 61.97158345838234, "difficulty": "Easy", "likes": 132, "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": 45840, "totalSubmissionRaw": 73970}, "3179": {"acRate": 54.593765968318856, "difficulty": "Medium", "likes": 96, "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": 37394, "totalSubmissionRaw": 68495}, "3180": {"acRate": 29.454413842220173, "difficulty": "Medium", "likes": 163, "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": 25228, "totalSubmissionRaw": 85651}, "3181": {"acRate": 20.926818370408196, "difficulty": "Hard", "likes": 111, "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": 6557, "totalSubmissionRaw": 31333}, "3182": {"acRate": 51.559741024131846, "difficulty": "Medium", "likes": 7, "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": 876, "totalSubmissionRaw": 1699}, "3183": {"acRate": 58.14648729446936, "difficulty": "Medium", "likes": 12, "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": 778, "totalSubmissionRaw": 1338}, "3184": {"acRate": 79.20336382749021, "difficulty": "Easy", "likes": 102, "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": 55756, "totalSubmissionRaw": 70396}, "3185": {"acRate": 42.99328568334416, "difficulty": "Medium", "likes": 148, "dislikes": 10, "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": 39699, "totalSubmissionRaw": 92338}, "3186": {"acRate": 26.220721624211627, "difficulty": "Medium", "likes": 226, "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": 23531, "totalSubmissionRaw": 89742}, "3187": {"acRate": 26.95580565468021, "difficulty": "Hard", "likes": 109, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3187", "paidOnly": false, "title": "Peaks in Array", "titleSlug": "peaks-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8838, "totalSubmissionRaw": 32787}, "3188": {"acRate": 42.26148409893993, "difficulty": "Hard", "likes": 4, "dislikes": 4, "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": 598, "totalSubmissionRaw": 1415}, "3189": {"acRate": 77.09317709317709, "difficulty": "Medium", "likes": 52, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3189", "paidOnly": true, "title": "Minimum Moves to Get a Peaceful Board", "titleSlug": "minimum-moves-to-get-a-peaceful-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4079, "totalSubmissionRaw": 5291}, "3190": {"acRate": 89.90475992646677, "difficulty": "Easy", "likes": 130, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3190", "paidOnly": false, "title": "Find Minimum Operations to Make All Elements Divisible by Three", "titleSlug": "find-minimum-operations-to-make-all-elements-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86561, "totalSubmissionRaw": 96281}, "3191": {"acRate": 70.98481886890801, "difficulty": "Medium", "likes": 138, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3191", "paidOnly": false, "title": "Minimum Operations to Make Binary Array Elements Equal to One I", "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43579, "totalSubmissionRaw": 61392}, "3192": {"acRate": 65.24410805950018, "difficulty": "Medium", "likes": 116, "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": 34826, "totalSubmissionRaw": 53378}, "3193": {"acRate": 33.52001659406762, "difficulty": "Hard", "likes": 90, "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": 6464, "totalSubmissionRaw": 19284}, "3194": {"acRate": 85.31281453620808, "difficulty": "Easy", "likes": 104, "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": 64418, "totalSubmissionRaw": 75508}, "3195": {"acRate": 73.95961631769492, "difficulty": "Medium", "likes": 102, "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": 39632, "totalSubmissionRaw": 53586}, "3196": {"acRate": 28.49890248993388, "difficulty": "Medium", "likes": 160, "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": 21163, "totalSubmissionRaw": 74259}, "3197": {"acRate": 37.52624065832564, "difficulty": "Hard", "likes": 67, "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": 4469, "totalSubmissionRaw": 11909}, "3198": {"acRate": 81.9859402460457, "difficulty": "Easy", "likes": 4, "dislikes": 2, "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": 933, "totalSubmissionRaw": 1138}, "3199": {"acRate": 84.34782608695653, "difficulty": "Easy", "likes": 7, "dislikes": 2, "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": 679, "totalSubmissionRaw": 805}, "3200": {"acRate": 42.627917280358275, "difficulty": "Easy", "likes": 128, "dislikes": 19, "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": 35599, "totalSubmissionRaw": 83511}, "3201": {"acRate": 37.70355278616361, "difficulty": "Medium", "likes": 124, "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": 25353, "totalSubmissionRaw": 67243}, "3202": {"acRate": 39.30390693486862, "difficulty": "Medium", "likes": 179, "dislikes": 12, "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": 16588, "totalSubmissionRaw": 42206}, "3203": {"acRate": 35.83226394005878, "difficulty": "Hard", "likes": 127, "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": 8656, "totalSubmissionRaw": 24157}, "3204": {"acRate": 94.45438282647585, "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": 527, "totalSubmissionRaw": 558}, "3205": {"acRate": 80.10835913312694, "difficulty": "Medium", "likes": 18, "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": 1035, "totalSubmissionRaw": 1292}, "3206": {"acRate": 67.0071827613727, "difficulty": "Easy", "likes": 84, "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": 46178, "totalSubmissionRaw": 68915}, "3207": {"acRate": 31.808094817803557, "difficulty": "Medium", "likes": 94, "dislikes": 37, "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": 25227, "totalSubmissionRaw": 79310}, "3208": {"acRate": 40.5092796976814, "difficulty": "Medium", "likes": 140, "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": 22940, "totalSubmissionRaw": 56629}, "3209": {"acRate": 34.23040304665186, "difficulty": "Hard", "likes": 136, "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": 10786, "totalSubmissionRaw": 31510}, "3210": {"acRate": 69.24455417944327, "difficulty": "Easy", "likes": 84, "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": 52164, "totalSubmissionRaw": 75333}, "3211": {"acRate": 86.3623342609265, "difficulty": "Medium", "likes": 144, "dislikes": 23, "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": 42207, "totalSubmissionRaw": 48872}, "3212": {"acRate": 51.92373636924765, "difficulty": "Medium", "likes": 132, "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": 22713, "totalSubmissionRaw": 43743}, "3213": {"acRate": 20.244509280970878, "difficulty": "Hard", "likes": 141, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3213", "paidOnly": false, "title": "Construct String with Minimum Cost", "titleSlug": "construct-string-with-minimum-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11310, "totalSubmissionRaw": 55867}, "3214": {"acRate": 51.92909280500522, "difficulty": "Hard", "likes": 1, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3214", "paidOnly": true, "title": "Year on Year Growth Rate", "titleSlug": "year-on-year-growth-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 498, "totalSubmissionRaw": 959}, "3215": {"acRate": 73.49624060150376, "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": 391, "totalSubmissionRaw": 532}, "3216": {"acRate": 53.591254590485946, "difficulty": "Easy", "likes": 75, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3216", "paidOnly": false, "title": "Lexicographically Smallest String After a Swap", "titleSlug": "lexicographically-smallest-string-after-a-swap", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43924, "totalSubmissionRaw": 81962}, "3217": {"acRate": 61.12815466543181, "difficulty": "Medium", "likes": 125, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3217", "paidOnly": false, "title": "Delete Nodes From Linked List Present in Array", "titleSlug": "delete-nodes-from-linked-list-present-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42242, "totalSubmissionRaw": 69103}, "3218": {"acRate": 57.87836825497719, "difficulty": "Medium", "likes": 153, "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": 25496, "totalSubmissionRaw": 44051}, "3219": {"acRate": 56.023962724650545, "difficulty": "Hard", "likes": 97, "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": 20200, "totalSubmissionRaw": 36056}, "3220": {"acRate": 71.20427322758174, "difficulty": "Medium", "likes": 22, "dislikes": 7, "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": 4399, "totalSubmissionRaw": 6178}, "3221": {"acRate": 68.58108108108108, "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": 406, "totalSubmissionRaw": 592}, "3222": {"acRate": 51.33094021814165, "difficulty": "Easy", "likes": 81, "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": 37179, "totalSubmissionRaw": 72430}, "3223": {"acRate": 55.06624117590175, "difficulty": "Medium", "likes": 88, "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": 28472, "totalSubmissionRaw": 51705}, "3224": {"acRate": 22.88650163475012, "difficulty": "Medium", "likes": 197, "dislikes": 19, "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": 12250, "totalSubmissionRaw": 53525}, "3225": {"acRate": 27.078972407231213, "difficulty": "Hard", "likes": 52, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3225", "paidOnly": false, "title": "Maximum Score From Grid Operations", "titleSlug": "maximum-score-from-grid-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1423, "totalSubmissionRaw": 5255}, "3226": {"acRate": 64.48183385479854, "difficulty": "Easy", "likes": 82, "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": 40394, "totalSubmissionRaw": 62644}, "3227": {"acRate": 62.52140670137868, "difficulty": "Medium", "likes": 124, "dislikes": 26, "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": 36143, "totalSubmissionRaw": 57809}, "3228": {"acRate": 53.90780755986064, "difficulty": "Medium", "likes": 146, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3228", "paidOnly": false, "title": "Maximum Number of Operations to Move Ones to the End", "titleSlug": "maximum-number-of-operations-to-move-ones-to-the-end", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26769, "totalSubmissionRaw": 49657}, "3229": {"acRate": 38.175289701322015, "difficulty": "Hard", "likes": 186, "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": 14034, "totalSubmissionRaw": 36762}, "3230": {"acRate": 41.18564742589704, "difficulty": "Medium", "likes": 4, "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": 528, "totalSubmissionRaw": 1282}, "3231": {"acRate": 56.42105263157895, "difficulty": "Hard", "likes": 6, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3231", "paidOnly": true, "title": "Minimum Number of Increasing Subsequence to Be Removed", "titleSlug": "minimum-number-of-increasing-subsequence-to-be-removed", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 268, "totalSubmissionRaw": 475}, "3232": {"acRate": 83.21627342950471, "difficulty": "Easy", "likes": 92, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3232", "paidOnly": false, "title": "Find if Digit Game Can Be Won", "titleSlug": "find-if-digit-game-can-be-won", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59359, "totalSubmissionRaw": 71331}, "3233": {"acRate": 26.61989442677431, "difficulty": "Medium", "likes": 164, "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": 31720, "totalSubmissionRaw": 119159}, "3234": {"acRate": 15.305252976533174, "difficulty": "Medium", "likes": 218, "dislikes": 38, "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": 6646, "totalSubmissionRaw": 43423}, "3235": {"acRate": 28.457271787158035, "difficulty": "Hard", "likes": 92, "dislikes": 23, "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": 6054, "totalSubmissionRaw": 21274}, "3236": {"acRate": 79.41888619854721, "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": 328, "totalSubmissionRaw": 413}, "3237": {"acRate": 81.68168168168168, "difficulty": "Medium", "likes": 12, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3237", "paidOnly": true, "title": "Alt and Tab Simulation", "titleSlug": "alt-and-tab-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 544, "totalSubmissionRaw": 666}, "3238": {"acRate": 61.11247604540318, "difficulty": "Easy", "likes": 67, "dislikes": 12, "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": 37311, "totalSubmissionRaw": 61053}, "3239": {"acRate": 78.1340021853581, "difficulty": "Medium", "likes": 56, "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": 31463, "totalSubmissionRaw": 40268}, "3240": {"acRate": 22.829224961137022, "difficulty": "Medium", "likes": 112, "dislikes": 47, "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": 9252, "totalSubmissionRaw": 40527}, "3241": {"acRate": 23.257184002094654, "difficulty": "Hard", "likes": 75, "dislikes": 3, "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": 3553, "totalSubmissionRaw": 15277}, "3242": {"acRate": 83.34197851055947, "difficulty": "Easy", "likes": 77, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3242", "paidOnly": false, "title": "Design Neighbor Sum Service", "titleSlug": "design-neighbor-sum-service", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33739, "totalSubmissionRaw": 40483}, "3243": {"acRate": 47.24060136121486, "difficulty": "Medium", "likes": 96, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3243", "paidOnly": false, "title": "Shortest Distance After Road Addition Queries I", "titleSlug": "shortest-distance-after-road-addition-queries-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24917, "totalSubmissionRaw": 52746}, "3244": {"acRate": 23.09854128563144, "difficulty": "Hard", "likes": 150, "dislikes": 5, "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": 10356, "totalSubmissionRaw": 44834}, "3245": {"acRate": 13.941253836036827, "difficulty": "Hard", "likes": 50, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3245", "paidOnly": false, "title": "Alternating Groups III", "titleSlug": "alternating-groups-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1272, "totalSubmissionRaw": 9124}, "3246": {"acRate": 87.46770025839793, "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": 677, "totalSubmissionRaw": 774}, "3247": {"acRate": 55.316285329744275, "difficulty": "Medium", "likes": 7, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3247", "paidOnly": true, "title": "Number of Subsequences with Odd Sum", "titleSlug": "number-of-subsequences-with-odd-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 411, "totalSubmissionRaw": 743}, "3248": {"acRate": 81.92616705914946, "difficulty": "Easy", "likes": 96, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3248", "paidOnly": false, "title": "Snake in Matrix", "titleSlug": "snake-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47314, "totalSubmissionRaw": 57752}, "3249": {"acRate": 55.594444818379664, "difficulty": "Medium", "likes": 137, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3249", "paidOnly": false, "title": "Count the Number of Good Nodes", "titleSlug": "count-the-number-of-good-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24779, "totalSubmissionRaw": 44570}, "3250": {"acRate": 45.64052005668864, "difficulty": "Hard", "likes": 112, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3250", "paidOnly": false, "title": "Find the Count of Monotonic Pairs I", "titleSlug": "find-the-count-of-monotonic-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14814, "totalSubmissionRaw": 32458}, "3251": {"acRate": 22.11519002711782, "difficulty": "Hard", "likes": 76, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3251", "paidOnly": false, "title": "Find the Count of Monotonic Pairs II", "titleSlug": "find-the-count-of-monotonic-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5464, "totalSubmissionRaw": 24707}, "3252": {"acRate": 63.58792184724689, "difficulty": "Medium", "likes": 2, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "3252", "paidOnly": true, "title": "Premier League Table Ranking II", "titleSlug": "premier-league-table-ranking-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 358, "totalSubmissionRaw": 563}, "3253": {"acRate": 53.57737104825291, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3253", "paidOnly": true, "title": "Construct String with Minimum Cost (Easy)", "titleSlug": "construct-string-with-minimum-cost-easy", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 322, "totalSubmissionRaw": 601}, "3254": {"acRate": 53.486185447707214, "difficulty": "Medium", "likes": 59, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3254", "paidOnly": false, "title": "Find the Power of K-Size Subarrays I", "titleSlug": "find-the-power-of-k-size-subarrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36975, "totalSubmissionRaw": 69130}, "3255": {"acRate": 26.161889350337788, "difficulty": "Medium", "likes": 107, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3255", "paidOnly": false, "title": "Find the Power of K-Size Subarrays II", "titleSlug": "find-the-power-of-k-size-subarrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23119, "totalSubmissionRaw": 88369}, "3256": {"acRate": 13.801365036541908, "difficulty": "Hard", "likes": 86, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3256", "paidOnly": false, "title": "Maximum Value Sum by Placing Three Rooks I", "titleSlug": "maximum-value-sum-by-placing-three-rooks-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6855, "totalSubmissionRaw": 49669}, "3257": {"acRate": 27.784810126582276, "difficulty": "Hard", "likes": 41, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3257", "paidOnly": false, "title": "Maximum Value Sum by Placing Three Rooks II", "titleSlug": "maximum-value-sum-by-placing-three-rooks-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3950, "totalSubmissionRaw": 14218}, "3258": {"acRate": 79.73846153846154, "difficulty": "Easy", "likes": 84, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3258", "paidOnly": false, "title": "Count Substrings That Satisfy K-Constraint I", "titleSlug": "count-substrings-that-satisfy-k-constraint-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36281, "totalSubmissionRaw": 45500}, "3259": {"acRate": 48.63627627417749, "difficulty": "Medium", "likes": 120, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3259", "paidOnly": false, "title": "Maximum Energy Boost From Two Drinks", "titleSlug": "maximum-energy-boost-from-two-drinks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27835, "totalSubmissionRaw": 57231}, "3260": {"acRate": 13.863028850585307, "difficulty": "Hard", "likes": 80, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "3260", "paidOnly": false, "title": "Find the Largest Palindrome Divisible by K", "titleSlug": "find-the-largest-palindrome-divisible-by-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"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": 6015, "totalSubmissionRaw": 43392}, "3261": {"acRate": 20.274415751017905, "difficulty": "Hard", "likes": 100, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3261", "paidOnly": false, "title": "Count Substrings That Satisfy K-Constraint II", "titleSlug": "count-substrings-that-satisfy-k-constraint-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3635, "totalSubmissionRaw": 17929}, "3262": {"acRate": 74.2782152230971, "difficulty": "Medium", "likes": 6, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3262", "paidOnly": true, "title": "Find Overlapping Shifts", "titleSlug": "find-overlapping-shifts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 283, "totalSubmissionRaw": 381}, "3263": {"acRate": 95.47790339157245, "difficulty": "Easy", "likes": 3, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3263", "paidOnly": true, "title": "Convert Doubly Linked List to Array I", "titleSlug": "convert-doubly-linked-list-to-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 929, "totalSubmissionRaw": 973}, "3264": {"acRate": 81.45362461259354, "difficulty": "Easy", "likes": 79, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3264", "paidOnly": false, "title": "Final Array State After K Multiplication Operations I", "titleSlug": "final-array-state-after-k-multiplication-operations-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43102, "totalSubmissionRaw": 52916}, "3265": {"acRate": 36.4488203957382, "difficulty": "Medium", "likes": 120, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3265", "paidOnly": false, "title": "Count Almost Equal Pairs I", "titleSlug": "count-almost-equal-pairs-i", "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"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22989, "totalSubmissionRaw": 63071}, "3266": {"acRate": 9.53926666887483, "difficulty": "Hard", "likes": 124, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3266", "paidOnly": false, "title": "Final Array State After K Multiplication Operations II", "titleSlug": "final-array-state-after-k-multiplication-operations-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": 5760, "totalSubmissionRaw": 60380}, "3267": {"acRate": 20.02653655196028, "difficulty": "Hard", "likes": 62, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3267", "paidOnly": false, "title": "Count Almost Equal Pairs II", "titleSlug": "count-almost-equal-pairs-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"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4679, "totalSubmissionRaw": 23364}, "3268": {"acRate": 85.04672897196261, "difficulty": "Hard", "likes": 3, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3268", "paidOnly": true, "title": "Find Overlapping Shifts II", "titleSlug": "find-overlapping-shifts-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 182, "totalSubmissionRaw": 214}, "3269": {"acRate": 68.43971631205675, "difficulty": "Hard", "likes": 5, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3269", "paidOnly": true, "title": "Constructing Two Increasing Arrays", "titleSlug": "constructing-two-increasing-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 193, "totalSubmissionRaw": 282}, "3270": {"acRate": 76.05878268919231, "difficulty": "Easy", "likes": 36, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3270", "paidOnly": false, "title": "Find the Key of the Numbers", "titleSlug": "find-the-key-of-the-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32864, "totalSubmissionRaw": 43209}, "3271": {"acRate": 83.9064571638128, "difficulty": "Medium", "likes": 44, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3271", "paidOnly": false, "title": "Hash Divided String", "titleSlug": "hash-divided-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29744, "totalSubmissionRaw": 35449}, "3272": {"acRate": 25.73624479241488, "difficulty": "Hard", "likes": 56, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3272", "paidOnly": false, "title": "Find the Count of Good Integers", "titleSlug": "find-the-count-of-good-integers", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3583, "totalSubmissionRaw": 13922}, "3273": {"acRate": 35.91753890237593, "difficulty": "Hard", "likes": 110, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3273", "paidOnly": false, "title": "Minimum Amount of Damage Dealt to Bob", "titleSlug": "minimum-amount-of-damage-dealt-to-bob", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9025, "totalSubmissionRaw": 25126}, "3274": {"acRate": 69.61438672238617, "difficulty": "Easy", "likes": 59, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3274", "paidOnly": false, "title": "Check if Two Chessboard Squares Have the Same Color", "titleSlug": "check-if-two-chessboard-squares-have-the-same-color", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35140, "totalSubmissionRaw": 50478}, "3275": {"acRate": 46.62848697579901, "difficulty": "Medium", "likes": 59, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3275", "paidOnly": false, "title": "K-th Nearest Obstacle Queries", "titleSlug": "k-th-nearest-obstacle-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25240, "totalSubmissionRaw": 54130}, "3276": {"acRate": 10.682017657080904, "difficulty": "Hard", "likes": 140, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3276", "paidOnly": false, "title": "Select Cells in Grid With Maximum Score", "titleSlug": "select-cells-in-grid-with-maximum-score", "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": 6202, "totalSubmissionRaw": 58093}, "3277": {"acRate": 38.20682628629648, "difficulty": "Hard", "likes": 55, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3277", "paidOnly": false, "title": "Maximum XOR Score Subarray Queries", "titleSlug": "maximum-xor-score-subarray-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2250, "totalSubmissionRaw": 5889}, "3278": {"acRate": 81.2807881773399, "difficulty": "Medium", "likes": 4, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3278", "paidOnly": true, "title": "Find Candidates for Data Scientist Position II", "titleSlug": "find-candidates-for-data-scientist-position-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 165, "totalSubmissionRaw": 203}}
\ No newline at end of file