{ "data": { "problemsetQuestionList": { "total": 3677, "questions": [ { "acRate": 56.25135106415301, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.864268355903, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.495532090974, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.61715932475886, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "4", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.35435575986987, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "5", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.262064704318654, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "6", "isFavor": false, "paidOnly": false, "status": null, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 30.713930432990725, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "7", "isFavor": false, "paidOnly": false, "status": null, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 19.71786797774815, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "8", "isFavor": false, "paidOnly": false, "status": null, "title": "String to Integer (atoi)", "titleSlug": "string-to-integer-atoi", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 59.5938884727188, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "9", "isFavor": false, "paidOnly": false, "status": null, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 29.591734029503346, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "10", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.25768240250755, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "11", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.30013335999035, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "12", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.40141018607439, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "13", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.083639618834006, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "14", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Common Prefix", "titleSlug": "longest-common-prefix", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 37.62987916447053, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "15", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.216845629222334, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "16", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.43390133756864, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "17", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.83607922787807, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "18", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.75116544590855, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "19", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.80277028619171, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "20", "isFavor": false, "paidOnly": false, "status": null, "title": "Valid Parentheses", "titleSlug": "valid-parentheses", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 67.25345930596714, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "21", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.60786202495919, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "22", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.56921488164796, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "23", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.82927057789156, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "24", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.94884196845824, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "25", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.076798191542416, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "26", "isFavor": false, "paidOnly": false, "status": null, "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": true }, { "acRate": 60.51037398724005, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "27", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.43390433220486, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "28", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 18.684445997188337, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "29", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.265098892304806, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "30", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.745036768087445, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "31", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.877415325261566, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "32", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.33145818876755, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "33", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.4093069814705, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "34", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.62169682936242, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "35", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.4151735137673, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "36", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.23283585097698, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "37", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.19272056005081, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "38", "isFavor": false, "paidOnly": false, "status": null, "title": "Count and Say", "titleSlug": "count-and-say", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 75.25518122712992, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "39", "isFavor": false, "paidOnly": false, "status": null, "title": "Combination Sum", "titleSlug": "combination-sum", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 58.11781105139323, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "40", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.5142591195776, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "41", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.77805195423629, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "42", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.63362172349878, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "43", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.465271902832207, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "44", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.85912642958054, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "45", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.05380144660849, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "46", "isFavor": false, "paidOnly": false, "status": null, "title": "Permutations", "titleSlug": "permutations", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.10994566120216, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "47", "isFavor": false, "paidOnly": false, "status": null, "title": "Permutations II", "titleSlug": "permutations-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 78.522195808483, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "48", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.404416144071, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "49", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.499754479202856, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "50", "isFavor": false, "paidOnly": false, "status": null, "title": "Pow(x, n)", "titleSlug": "powx-n", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 73.76895713693723, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "51", "isFavor": false, "paidOnly": false, "status": null, "title": "N-Queens", "titleSlug": "n-queens", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 77.27584855281113, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "52", "isFavor": false, "paidOnly": false, "status": null, "title": "N-Queens II", "titleSlug": "n-queens-ii", "topicTags": [ { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.41296562184371, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "53", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.83458937427644, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "54", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.872876530989544, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "55", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.896938136801474, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "56", "isFavor": false, "paidOnly": false, "status": null, "title": "Merge Intervals", "titleSlug": "merge-intervals", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 43.9506968943955, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "57", "isFavor": false, "paidOnly": false, "status": null, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 57.02512791279604, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "58", "isFavor": false, "paidOnly": false, "status": null, "title": "Length of Last Word", "titleSlug": "length-of-last-word", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 73.835335812105, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "59", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.63799217075646, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "60", "isFavor": false, "paidOnly": false, "status": null, "title": "Permutation Sequence", "titleSlug": "permutation-sequence", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 40.41611679038702, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "61", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.06410160224947, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "62", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.532529531470296, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "63", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.04162882408932, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "64", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 21.87169143636395, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "65", "isFavor": false, "paidOnly": false, "status": null, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 47.95089016481854, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "66", "isFavor": false, "paidOnly": false, "status": null, "title": "Plus One", "titleSlug": "plus-one", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.059022267884586, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "67", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.94986813685128, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "68", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.706270594966604, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "69", "isFavor": false, "paidOnly": false, "status": null, "title": "Sqrt(x)", "titleSlug": "sqrtx", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 53.6752620396474, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "70", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.670411206579104, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "71", "isFavor": false, "paidOnly": false, "status": null, "title": "Simplify Path", "titleSlug": "simplify-path", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 59.33008294215693, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "72", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.408690840089776, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "73", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.79580045632555, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "74", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.22508107850375, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "75", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.95741655706821, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "76", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.40364574007091, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "77", "isFavor": false, "paidOnly": false, "status": null, "title": "Combinations", "titleSlug": "combinations", "topicTags": [ { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 81.37463821318269, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "78", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.85731130200086, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "79", "isFavor": false, "paidOnly": false, "status": null, "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": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 63.441303860236175, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "80", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.16574118827735, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "81", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.44734765038156, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "82", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.37233699993133, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "83", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.17323991140252, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "84", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.6911117850968, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "85", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.57387092105099, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "86", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.80855745646961, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "87", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.49380396122044, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "88", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.55610064238738, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "89", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.06146379350963, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "90", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.93093097618017, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "91", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.085583564154845, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "92", "isFavor": false, "paidOnly": false, "status": null, "title": "Reverse Linked List II", "titleSlug": "reverse-linked-list-ii", "topicTags": [ { "name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 53.91253109985145, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "93", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.06905165811305, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "94", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.959701786803244, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "95", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.72613742820421, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "96", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.63388461540821, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "97", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.734982181334985, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "98", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.31337451165787, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "99", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.72482188390704, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "100", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.84168213311035, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "101", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.24206017467262, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "102", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.326328258468855, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "103", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.45513922228476, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "104", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.44439141428735, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "105", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.88864639076155, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "106", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.6297357962043, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "107", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.51508731612147, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "108", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.03653964177226, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "109", "isFavor": false, "paidOnly": false, "status": null, "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": true }, { "acRate": 56.04144695806899, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "110", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.296840356086314, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "111", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.535428499207214, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "112", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.97178109525596, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "113", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.24330279102597, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "114", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.65404607661259, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "115", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.97983604893153, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "116", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.12362259696702, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "117", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.08239498215872, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "118", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.36232436488473, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "119", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.3395017539036, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "120", "isFavor": false, "paidOnly": false, "status": null, "title": "Triangle", "titleSlug": "triangle", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 55.68355849867466, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "121", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.9821363344776, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "122", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.01838113152163, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "123", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.51829958224077, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "124", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.66275094329771, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "125", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.224584096449377, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "126", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.64921353600183, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "127", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.96982176446284, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "128", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.92962097405605, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "129", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.63181975567202, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "130", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.8247444497757, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "131", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.73318421943288, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "132", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.28080722833425, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "133", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.807906271440494, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "134", "isFavor": false, "paidOnly": false, "status": null, "title": "Gas Station", "titleSlug": "gas-station", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 47.20851179937866, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "135", "isFavor": false, "paidOnly": false, "status": null, "title": "Candy", "titleSlug": "candy", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 76.52430658308896, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "136", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.83035127254112, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "137", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.2862320785164, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "138", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.58283485098047, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "139", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.113283241959955, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "140", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.10120192337692, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "141", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.898431231418286, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "142", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.308629736775636, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "143", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.0522463402322, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "144", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.53555856275389, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "145", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.82073017768695, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "146", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.08573698684381, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "147", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.67969170102169, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "148", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.387155609497434, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "149", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.61095293110488, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "150", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.42467544841269, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "151", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.34301545766177, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "152", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.103948671305126, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "153", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.20957219697783, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "154", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.92417465306618, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "155", "isFavor": false, "paidOnly": false, "status": null, "title": "Min Stack", "titleSlug": "min-stack", "topicTags": [ { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" }, { "name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 64.73804823815034, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "156", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 42.3369113194658, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "157", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 43.017923393774495, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "158", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 56.671018175319176, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "159", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.96302358139444, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "160", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.51815055176593, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "161", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 46.57687961095239, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "162", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.39609618252082, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "163", "isFavor": false, "paidOnly": true, "status": null, "title": "Missing Ranges", "titleSlug": "missing-ranges", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 50.09127015796954, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "164", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.752305400683, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "165", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.503802927457166, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "166", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.82343825472265, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "167", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.260736623771976, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "168", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.84749800065089, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "169", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.75873969164575, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "170", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 66.24547371131531, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "171", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.21064287920867, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "172", "isFavor": false, "paidOnly": false, "status": null, "title": "Factorial Trailing Zeroes", "titleSlug": "factorial-trailing-zeroes", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 75.4295459358418, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "173", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.943845261190134, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "174", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.43368018101336, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "175", "isFavor": false, "paidOnly": false, "status": null, "title": "Combine Two Tables", "titleSlug": "combine-two-tables", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 44.824423166105895, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "176", "isFavor": false, "paidOnly": false, "status": null, "title": "Second Highest Salary", "titleSlug": "second-highest-salary", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 38.41037077556402, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "177", "isFavor": false, "paidOnly": false, "status": null, "title": "Nth Highest Salary", "titleSlug": "nth-highest-salary", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 65.96258982500537, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "178", "isFavor": false, "paidOnly": false, "status": null, "title": "Rank Scores", "titleSlug": "rank-scores", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 41.701836425733205, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "179", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.717108173822645, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "180", "isFavor": false, "paidOnly": false, "status": null, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 71.96453525552458, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "181", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.77952146088941, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "182", "isFavor": false, "paidOnly": false, "status": null, "title": "Duplicate Emails", "titleSlug": "duplicate-emails", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 70.95529967644718, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "183", "isFavor": false, "paidOnly": false, "status": null, "title": "Customers Who Never Order", "titleSlug": "customers-who-never-order", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 55.70283117826752, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "184", "isFavor": false, "paidOnly": false, "status": null, "title": "Department Highest Salary", "titleSlug": "department-highest-salary", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 58.530557357304204, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "185", "isFavor": false, "paidOnly": false, "status": null, "title": "Department Top Three Salaries", "titleSlug": "department-top-three-salaries", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.23488112334451, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "186", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 51.87110707622239, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "187", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.15303140508879, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "188", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.59249101487425, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "189", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.19063637833682, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "190", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.21997098831581, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "191", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.552276032366187, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "192", "isFavor": false, "paidOnly": false, "status": null, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [ { "name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 27.976288033323836, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "193", "isFavor": false, "paidOnly": false, "status": null, "title": "Valid Phone Numbers", "titleSlug": "valid-phone-numbers", "topicTags": [ { "name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 29.068108928115027, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "194", "isFavor": false, "paidOnly": false, "status": null, "title": "Transpose File", "titleSlug": "transpose-file", "topicTags": [ { "name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 35.047507770435175, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "195", "isFavor": false, "paidOnly": false, "status": null, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [ { "name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 64.83150081371811, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "196", "isFavor": false, "paidOnly": false, "status": null, "title": "Delete Duplicate Emails", "titleSlug": "delete-duplicate-emails", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 50.59452192413454, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "197", "isFavor": false, "paidOnly": false, "status": null, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.55532701647877, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "198", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.05474486137564, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "199", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.87894008585605, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "200", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.09368842482994, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "201", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.49280947457468, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "202", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.64695245676783, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "203", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.16056867558154, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "204", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.3320715101417, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "205", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.65456200961015, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "206", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.87617817284688, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "207", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.44130115057602, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "208", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.97431876778129, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "209", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.044026082409815, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "210", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.45394405534411, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "211", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.59056817313396, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "212", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.999878505619115, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "213", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.03597726679693, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "214", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.35804831456575, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "215", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.33212048403037, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "216", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.525241034129664, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "217", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.26712008135637, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "218", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.62489434174699, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "219", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 23.87912174160445, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "220", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.268139168546156, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "221", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.8555029191952, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "222", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.7642125987166, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "223", "isFavor": false, "paidOnly": false, "status": null, "title": "Rectangle Area", "titleSlug": "rectangle-area", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 46.03912701390115, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "224", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.19721745259064, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "225", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.33330670681482, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "226", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.13995162767067, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "227", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.34015914585654, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "228", "isFavor": false, "paidOnly": false, "status": null, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 55.039200757684, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "229", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.82277688265403, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "230", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.35411083146358, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "231", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.51945391871212, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "232", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.3928708992592, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "233", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.51574132778819, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "234", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.04897384477535, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "235", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.58606865770813, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "236", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.88848751516468, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "237", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.05363535044563, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "238", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.913611674466715, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "239", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.90370346724066, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "240", "isFavor": false, "paidOnly": false, "status": null, "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": true }, { "acRate": 72.60631481308202, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "241", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 67.10391860800559, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "242", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.02808635506183, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "243", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 62.249114953626496, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "244", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.20468110921936, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "245", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 47.58954487711753, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "246", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 53.34477653716062, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "247", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 42.5443707422015, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "248", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 67.5061570047341, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "249", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 57.24710947870884, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "250", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.28355858018041, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "251", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.06852317964424, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "252", "isFavor": false, "paidOnly": true, "status": null, "title": "Meeting Rooms", "titleSlug": "meeting-rooms", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 52.26515482407146, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "253", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.339199685379995, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "254", "isFavor": false, "paidOnly": true, "status": null, "title": "Factor Combinations", "titleSlug": "factor-combinations", "topicTags": [ { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 51.43606365498458, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "255", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 63.8980332344568, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "256", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 67.19582215635313, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "257", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.12380110391007, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "258", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.03686248620828, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "259", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 70.45427690726946, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "260", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.476140156728476, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "261", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 37.10808959487109, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "262", "isFavor": false, "paidOnly": false, "status": null, "title": "Trips and Users", "titleSlug": "trips-and-users", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 42.57109604291064, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "263", "isFavor": false, "paidOnly": false, "status": null, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 49.32569014639898, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "264", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.581719858228006, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "265", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.5400607474263, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "266", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 42.18238459359955, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "267", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 70.70524905546435, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "268", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.81052087809164, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "269", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 49.53860225811062, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "270", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.184163591125476, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "271", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.66947879138983, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "272", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 34.494995501260206, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "273", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.60996894824373, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "274", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.98823655190413, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "275", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.932359605609655, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "276", "isFavor": false, "paidOnly": true, "status": null, "title": "Paint Fence", "titleSlug": "paint-fence", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 48.56840656059244, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "277", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 46.23327650102308, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "278", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.914492016540905, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "279", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.2908383273258, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "280", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 66.00892835182134, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "281", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 42.13094507240619, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "282", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.04922055489551, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "283", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.64372880170635, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "284", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.93731204338372, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "285", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 63.21522535984776, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "286", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 63.316687617546854, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "287", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.18224617974842, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "288", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 71.75962141125368, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "289", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.32211742610188, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "290", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.672293429972896, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "291", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 58.41560361907923, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "292", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.90818419867573, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "293", "isFavor": false, "paidOnly": true, "status": null, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.2045113625212, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "294", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 53.65340149261245, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "295", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.23922893585815, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "296", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.52450746788463, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "297", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.18733787010341, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "298", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 51.67047712865149, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "299", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.3361702670503, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "300", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.41782330517657, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "301", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.691918973783096, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "302", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 69.62602592991972, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "303", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.9771157773309, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "304", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.20523034084857, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "305", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 32.883031003285254, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "306", "isFavor": false, "paidOnly": false, "status": null, "title": "Additive Number", "titleSlug": "additive-number", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 42.022203204425296, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "307", "isFavor": false, "paidOnly": false, "status": null, "title": "Range Sum Query - Mutable", "titleSlug": "range-sum-query-mutable", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer" }, { "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 }, { "acRate": 44.99431485754026, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "308", "isFavor": false, "paidOnly": true, "status": null, "title": "Range Sum Query 2D - Mutable", "titleSlug": "range-sum-query-2d-mutable", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design" }, { "name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 61.004794241586126, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "309", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.143354981486034, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "310", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.03368040627252, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "311", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 62.05066256680577, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "312", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.58522942853996, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "313", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.43021512782077, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "314", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 42.98966074579655, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "315", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.82481846221493, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "316", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.61160310709046, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "317", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.703273799737445, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "318", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.49286216335823, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "319", "isFavor": false, "paidOnly": false, "status": null, "title": "Bulb Switcher", "titleSlug": "bulb-switcher", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 60.17821638721414, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "320", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 33.18554440451858, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "321", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.098794370283244, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "322", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.37575648322216, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "323", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 36.04500174612332, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "324", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.66232915737735, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "325", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.01766790844526, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "326", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.36890377636878, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "327", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.09487406977193, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "328", "isFavor": false, "paidOnly": false, "status": null, "title": "Odd Even Linked List", "titleSlug": "odd-even-linked-list", "topicTags": [ { "name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 55.70934725025815, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "329", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.66447904073425, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "330", "isFavor": false, "paidOnly": false, "status": null, "title": "Patching Array", "titleSlug": "patching-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 46.454660891444796, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "331", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.82029984313524, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "332", "isFavor": false, "paidOnly": false, "status": null, "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": false, "hasVideoSolution": false }, { "acRate": 45.6806367888721, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "333", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 39.15501003399958, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "334", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.74482545566883, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "335", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.496732856428295, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "336", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.16060362476745, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "337", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.00420266990558, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "338", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.70008514074556, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "339", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 49.656797749696224, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "340", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 65.35911779217368, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "341", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.07725493675221, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "342", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.37563439595907, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "343", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.05096748612026, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "344", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.101666027452396, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "345", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.03156600705873, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "346", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.67554296406315, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "347", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.678881198355256, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "348", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.83782621232102, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "349", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.25155336489154, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "350", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.46070490869449, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "351", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.61655701166131, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "352", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.81072356259091, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "353", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 37.45340676315524, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "354", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.33711953604571, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "355", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.07994049736442, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "356", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 54.69247270515161, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "357", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.42922858769805, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "358", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.6781473442946, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "359", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 57.27393732229634, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "360", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 52.703688139615366, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "361", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 69.30141213878238, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "362", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 44.86317440627964, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "363", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.82301376316586, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "364", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 43.66734682253293, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "365", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.12483935632291, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "366", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 44.319299230310705, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "367", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.05663167389653, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "368", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.1890657340661, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "369", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.45894839226456, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "370", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 54.236260366297564, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "371", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.67020810385057, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "372", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.95413955769702, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "373", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.269070622650965, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "374", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.622818568676095, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "375", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.989858885518515, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "376", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.74186064003981, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "377", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.85034373165935, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "378", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.54958743833404, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "379", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 55.086733806791585, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "380", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.9519271808351, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "381", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.19270311258074, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "382", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.92811450651637, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "383", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.230388478684425, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "384", "isFavor": false, "paidOnly": false, "status": null, "title": "Shuffle an Array", "titleSlug": "shuffle-an-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design" }, { "name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 40.78788318344454, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "385", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.08019570786439, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "386", "isFavor": false, "paidOnly": false, "status": null, "title": "Lexicographical Numbers", "titleSlug": "lexicographical-numbers", "topicTags": [ { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 64.1344667158097, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "387", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.66669468611216, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "388", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.80109296404397, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "389", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.14672794064959, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "390", "isFavor": false, "paidOnly": false, "status": null, "title": "Elimination Game", "titleSlug": "elimination-game", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 35.84294527896996, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "391", "isFavor": false, "paidOnly": false, "status": null, "title": "Perfect Rectangle", "titleSlug": "perfect-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": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 48.57162386980906, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "392", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.663452646466844, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "393", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.52484908052461, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "394", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.624278690602466, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "395", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.500303969715134, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "396", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.75129455032261, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "397", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.70652566923933, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "398", "isFavor": false, "paidOnly": false, "status": null, "title": "Random Pick Index", "titleSlug": "random-pick-index", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling" }, { "name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 63.46946728887912, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "399", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.95095647309288, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "400", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.12854944931852, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "401", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.54601281104263, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "402", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.755179600708544, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "403", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.95884488554291, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "404", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.59245274740943, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "405", "isFavor": false, "paidOnly": false, "status": null, "title": "Convert a Number to Hexadecimal", "titleSlug": "convert-a-number-to-hexadecimal", "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 }, { "acRate": 74.30216454887996, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "406", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.06746480533423, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "407", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 36.917872261609084, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "408", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 55.64390498709139, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "409", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.857878507828744, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "410", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.255749147068784, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "411", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.71757128420599, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "412", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.81195616421972, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "413", "isFavor": false, "paidOnly": false, "status": null, "title": "Arithmetic Slices", "titleSlug": "arithmetic-slices", "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 }, { "acRate": 37.7541994562068, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "414", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.92186855576312, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "415", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.79376451356552, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "416", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.039296490075124, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "417", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.36013282177451, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "418", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.8263628358083, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "419", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 14.869121892577287, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "420", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.3658860339433, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "421", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.08416961355889, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "422", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 51.78978445667358, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "423", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.9424790343646, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "424", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.45876495623545, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "425", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 65.58914050019405, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "426", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 77.532958984375, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "427", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.36702910861932, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "428", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 71.31461541453986, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "429", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.72966155931182, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "430", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.2691180389022, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "431", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 44.09105555450255, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "432", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 55.847304488636496, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "433", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.52371032223881, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "434", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.9926258215938, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "435", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.437144538144736, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "436", "isFavor": false, "paidOnly": false, "status": null, "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": false, "hasVideoSolution": false }, { "acRate": 46.13558292362609, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "437", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.562866063246695, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "438", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.142988605752336, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "439", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 45.98385279232038, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "440", "isFavor": false, "paidOnly": false, "status": null, "title": "K-th Smallest in Lexicographical Order", "titleSlug": "k-th-smallest-in-lexicographical-order", "topicTags": [ { "name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 47.54125099925836, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "441", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.55338233421914, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "442", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.725357616805496, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "443", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.739910313901348, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "444", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.964906990503735, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "445", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.61951940002563, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "446", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.67653980361925, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "447", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.75722597271876, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "448", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.86939746669037, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "449", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.51525673199448, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "450", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.57927268504146, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "451", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.7208831903194, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "452", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.04840458930304, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "453", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.65605143567164, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "454", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.301492451987, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "455", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.240325236839745, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "456", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.012849876996725, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "457", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.1242737444415, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "458", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.147864759396676, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "459", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.391058519445906, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "460", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.26872828784846, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "461", "isFavor": false, "paidOnly": false, "status": null, "title": "Hamming Distance", "titleSlug": "hamming-distance", "topicTags": [ { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 61.14177122923934, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "462", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.7779251839957, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "463", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.620457394326415, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "464", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.08655939181005, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "465", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 32.43822010851715, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "466", "isFavor": false, "paidOnly": false, "status": null, "title": "Count The Repetitions", "titleSlug": "count-the-repetitions", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 41.713371333948984, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "467", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.925366243321875, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "468", "isFavor": false, "paidOnly": false, "status": null, "title": "Validate IP Address", "titleSlug": "validate-ip-address", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 39.96702448607311, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "469", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 45.95677706664483, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "470", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.49963402603189, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "471", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 49.54081140054454, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "472", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 41.189186714964286, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "473", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.18729509250887, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "474", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.47134276697547, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "475", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.35474054438411, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "476", "isFavor": false, "paidOnly": false, "status": null, "title": "Number Complement", "titleSlug": "number-complement", "topicTags": [ { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 54.06243441987554, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "477", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.4858528561375, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "478", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.714285714285715, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "479", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.75647648102386, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "480", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.948329662261386, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "481", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.93685975960669, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "482", "isFavor": false, "paidOnly": false, "status": null, "title": "License Key Formatting", "titleSlug": "license-key-formatting", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 44.12270054698214, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "483", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.94141657042509, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "484", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 63.206735959428585, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "485", "isFavor": false, "paidOnly": false, "status": null, "title": "Max Consecutive Ones", "titleSlug": "max-consecutive-ones", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 55.911210304232505, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "486", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.695932939715206, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "487", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 31.103176949491733, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "488", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.6349684845163, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "489", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.768304318865106, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "490", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.96560847395093, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "491", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.43722053591827, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "492", "isFavor": false, "paidOnly": false, "status": null, "title": "Construct the Rectangle", "titleSlug": "construct-the-rectangle", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 32.77697540828263, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "493", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 51.214878944446816, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "494", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.057216904161464, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "495", "isFavor": false, "paidOnly": false, "status": null, "title": "Teemo Attacking", "titleSlug": "teemo-attacking", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 75.04169998269603, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "496", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.50490409851014, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "497", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 66.51928181669913, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "498", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.91112554052747, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "499", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.9035005871651, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "500", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.83976891705318, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "501", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.13198062300254, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "502", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.08607266214004, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "503", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.483486623941936, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "504", "isFavor": false, "paidOnly": false, "status": null, "title": "Base 7", "titleSlug": "base-7", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 54.39201719538299, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "505", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 73.71812336800991, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "506", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.86880856760375, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "507", "isFavor": false, "paidOnly": false, "status": null, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 68.2604988451891, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "508", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.34670390914786, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "509", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.04425258557663, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "510", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 75.93015537680839, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "511", "isFavor": false, "paidOnly": false, "status": null, "title": "Game Play Analysis I", "titleSlug": "game-play-analysis-i", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 54.210765569430706, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "512", "isFavor": false, "paidOnly": true, "status": null, "title": "Game Play Analysis II", "titleSlug": "game-play-analysis-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 71.91426408743946, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "513", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.01516801647492, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "514", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.25882794387638, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "515", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.55781792446514, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "516", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.92866231434245, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "517", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.33469715174464, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "518", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.17535652795374, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "519", "isFavor": false, "paidOnly": false, "status": null, "title": "Random Flip Matrix", "titleSlug": "random-flip-matrix", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling" }, { "name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.14477616769099, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "520", "isFavor": false, "paidOnly": false, "status": null, "title": "Detect Capital", "titleSlug": "detect-capital", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 61.55459855503763, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "521", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Uncommon Subsequence I", "titleSlug": "longest-uncommon-subsequence-i", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 43.57692846143077, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "522", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.99683287475133, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "523", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.10398298264457, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "524", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.81133979863909, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "525", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.63736033718877, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "526", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.475646688914175, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "527", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 48.514681498014305, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "528", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.32321295408543, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "529", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.95746212380887, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "530", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.50920532904867, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "531", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 45.03649936996799, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "532", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.7319844789357, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "533", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 81.24960826625359, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "534", "isFavor": false, "paidOnly": true, "status": null, "title": "Game Play Analysis III", "titleSlug": "game-play-analysis-iii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 86.44545856028265, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "535", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.52477637370439, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "536", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.59509975882482, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "537", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.8371705661343, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "538", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.44766347923208, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "539", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 59.16300764435742, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "540", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.535897273704855, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "541", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.307460298726674, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "542", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.22359014742304, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "543", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.39776951672862, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "544", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 47.358973689781266, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "545", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 48.545960905511464, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "546", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.28328394478241, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "547", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.038514554447424, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "548", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 49.557796207715334, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "549", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 39.91512054167814, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "550", "isFavor": false, "paidOnly": false, "status": null, "title": "Game Play Analysis IV", "titleSlug": "game-play-analysis-iv", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 49.72588919896757, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "551", "isFavor": false, "paidOnly": false, "status": null, "title": "Student Attendance Record I", "titleSlug": "student-attendance-record-i", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.05898152958472, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "552", "isFavor": false, "paidOnly": false, "status": null, "title": "Student Attendance Record II", "titleSlug": "student-attendance-record-ii", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.11166404635994, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "553", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.88912958874764, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "554", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.40083382966051, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "555", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 34.79842196281885, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "556", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.74741233670953, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "557", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.23632290858965, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "558", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.13475693424577, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "559", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.988690886951346, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "560", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.83625744293471, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "561", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.52306018670782, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "562", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.55813353957205, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "563", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.704081979059062, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "564", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.14244864084582, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "565", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.13582416871238, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "566", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.69861004144204, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "567", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.510428012887395, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "568", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 66.0819683461193, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "569", "isFavor": false, "paidOnly": true, "status": null, "title": "Median Employee Salary", "titleSlug": "median-employee-salary", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 48.958223505462335, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "570", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.40003980990769, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "571", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.4724408392449, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "572", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.30489250042322, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "573", "isFavor": false, "paidOnly": true, "status": null, "title": "Squirrel Simulation", "titleSlug": "squirrel-simulation", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 62.19975778779519, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "574", "isFavor": false, "paidOnly": true, "status": null, "title": "Winning Candidate", "titleSlug": "winning-candidate", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 70.02953060655788, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "575", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.231200422141676, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "576", "isFavor": false, "paidOnly": false, "status": null, "title": "Out of Boundary Paths", "titleSlug": "out-of-boundary-paths", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 76.9647564542245, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "577", "isFavor": false, "paidOnly": false, "status": null, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 40.13070935526509, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "578", "isFavor": false, "paidOnly": true, "status": null, "title": "Get Highest Answer Rate Question", "titleSlug": "get-highest-answer-rate-question", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 49.040026416963464, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "579", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.82922907541326, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "580", "isFavor": false, "paidOnly": true, "status": null, "title": "Count Student Number in Departments", "titleSlug": "count-student-number-in-departments", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 37.61383098122638, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "581", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.13912938731875, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "582", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.50085208097939, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "583", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.94669150170044, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "584", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Customer Referee", "titleSlug": "find-customer-referee", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 50.2821262009286, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "585", "isFavor": false, "paidOnly": false, "status": null, "title": "Investments in 2016", "titleSlug": "investments-in-2016", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 64.07818618100866, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "586", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.36291159465648, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "587", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.282588796686724, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "588", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.38278671575833, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "589", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.79112946237913, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "590", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.49899587781419, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "591", "isFavor": false, "paidOnly": false, "status": null, "title": "Tag Validator", "titleSlug": "tag-validator", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 66.24369619227787, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "592", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.502744649921524, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "593", "isFavor": false, "paidOnly": false, "status": null, "title": "Valid Square", "titleSlug": "valid-square", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 63.87813739665592, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "594", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.2995050576666, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "595", "isFavor": false, "paidOnly": false, "status": null, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 61.63323707009714, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "596", "isFavor": false, "paidOnly": false, "status": null, "title": "Classes With at Least 5 Students", "titleSlug": "classes-with-at-least-5-students", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 41.258582702004645, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "597", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 57.596681827822685, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "598", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.5296446850613, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "599", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.68080406062891, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "600", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.90827807846075, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "601", "isFavor": false, "paidOnly": false, "status": null, "title": "Human Traffic of Stadium", "titleSlug": "human-traffic-of-stadium", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 61.45081434684231, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "602", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.25333632683787, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "603", "isFavor": false, "paidOnly": true, "status": null, "title": "Consecutive Available Seats", "titleSlug": "consecutive-available-seats", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 40.21908569368299, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "604", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 28.95305508016014, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "605", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.30304387844035, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "606", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.93116511929237, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "607", "isFavor": false, "paidOnly": false, "status": null, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.24817986008509, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "608", "isFavor": false, "paidOnly": false, "status": null, "title": "Tree Node", "titleSlug": "tree-node", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 67.58244651761952, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "609", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.06398435317128, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "610", "isFavor": false, "paidOnly": false, "status": null, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.748484034940965, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "611", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.17452786915324, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "612", "isFavor": false, "paidOnly": true, "status": null, "title": "Shortest Distance in a Plane", "titleSlug": "shortest-distance-in-a-plane", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 79.86901270772239, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "613", "isFavor": false, "paidOnly": true, "status": null, "title": "Shortest Distance in a Line", "titleSlug": "shortest-distance-in-a-line", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 40.277805416807624, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "614", "isFavor": false, "paidOnly": true, "status": null, "title": "Second Degree Follower", "titleSlug": "second-degree-follower", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.76798392680179, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "615", "isFavor": false, "paidOnly": true, "status": null, "title": "Average Salary: Departments VS Company", "titleSlug": "average-salary-departments-vs-company", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 51.111890037805765, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "616", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 78.80934576866791, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "617", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.65916501356682, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "618", "isFavor": false, "paidOnly": true, "status": null, "title": "Students Report By Geography", "titleSlug": "students-report-by-geography", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 70.20284248991337, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "619", "isFavor": false, "paidOnly": false, "status": null, "title": "Biggest Single Number", "titleSlug": "biggest-single-number", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 75.00641891328632, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "620", "isFavor": false, "paidOnly": false, "status": null, "title": "Not Boring Movies", "titleSlug": "not-boring-movies", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 61.993964597050024, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "621", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.991740672656185, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "622", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.07301319609854, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "623", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.61869195662972, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "624", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.858156429318484, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "625", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Factorization", "titleSlug": "minimum-factorization", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 73.12488475013829, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "626", "isFavor": false, "paidOnly": false, "status": null, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 84.21567546945869, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "627", "isFavor": false, "paidOnly": false, "status": null, "title": "Swap Salary", "titleSlug": "swap-salary", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 45.44089329817071, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "628", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.97680520158278, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "629", "isFavor": false, "paidOnly": false, "status": null, "title": "K Inverse Pairs Array", "titleSlug": "k-inverse-pairs-array", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 40.905889742597374, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "630", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.266587872712854, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "631", "isFavor": false, "paidOnly": true, "status": null, "title": "Design Excel Sum Formula", "titleSlug": "design-excel-sum-formula", "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": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design" }, { "name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 69.8391130479999, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "632", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.518031468933046, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "633", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.75740868366643, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "634", "isFavor": false, "paidOnly": true, "status": null, "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" }, { "name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 59.11130717860566, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "635", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 65.14840562492044, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "636", "isFavor": false, "paidOnly": false, "status": null, "title": "Exclusive Time of Functions", "titleSlug": "exclusive-time-of-functions", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.36903206654073, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "637", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.048028072746746, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "638", "isFavor": false, "paidOnly": false, "status": null, "title": "Shopping Offers", "titleSlug": "shopping-offers", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization" }, { "name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 31.39082328029704, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "639", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.92442701406619, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "640", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.37684686250653, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "641", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 49.48725159355081, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "642", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 45.99106321834857, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "643", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.552006442088306, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "644", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 45.234446803211995, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "645", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.16489496330043, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "646", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.03172644704016, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "647", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.4541942778179, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "648", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.249456727135296, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "649", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.19084525357607, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "650", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.89600901300741, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "651", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.284560514769936, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "652", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.58532488356112, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "653", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.0973876044807, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "654", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.85154605795694, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "655", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 32.54225565209873, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "656", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.2607323497471, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "657", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.973908518872236, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "658", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.68640988372093, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "659", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.38337967253629, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "660", "isFavor": false, "paidOnly": true, "status": null, "title": "Remove 9", "titleSlug": "remove-9", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 68.63059741949475, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "661", "isFavor": false, "paidOnly": false, "status": null, "title": "Image Smoother", "titleSlug": "image-smoother", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 44.600675153977654, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "662", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.25042913693847, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "663", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.76342984096189, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "664", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.159548442139513, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "665", "isFavor": false, "paidOnly": false, "status": null, "title": "Non-decreasing Array", "titleSlug": "non-decreasing-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.69148461195017, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "666", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.588271835010566, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "667", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.20522003697412, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "668", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.42063295198108, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "669", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.854776975910546, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "670", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Swap", "titleSlug": "maximum-swap", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 45.53677648192617, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "671", "isFavor": false, "paidOnly": false, "status": null, "title": "Second Minimum Node In a Binary Tree", "titleSlug": "second-minimum-node-in-a-binary-tree", "topicTags": [ { "name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 49.67090594509748, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "672", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.555556481436724, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "673", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.3602788347776, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "674", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Continuous Increasing Subsequence", "titleSlug": "longest-continuous-increasing-subsequence", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 35.60181003528412, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "675", "isFavor": false, "paidOnly": false, "status": null, "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": false, "hasVideoSolution": false }, { "acRate": 56.867239281199424, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "676", "isFavor": false, "paidOnly": false, "status": null, "title": "Implement Magic Dictionary", "titleSlug": "implement-magic-dictionary", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design" }, { "name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.87946825859801, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "677", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.324609495127305, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "678", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.14671137534331, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "679", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.37799177793818, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "680", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.94072773996895, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "681", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 79.340726421813, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "682", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.87031685445982, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "683", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 66.76863927611734, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "684", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.42977990654596, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "685", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.488475473315425, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "686", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.94232761126509, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "687", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.70975526787032, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "688", "isFavor": false, "paidOnly": false, "status": null, "title": "Knight Probability in Chessboard", "titleSlug": "knight-probability-in-chessboard", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 59.55076935170083, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "689", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 68.71866526558111, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "690", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.23059922895954, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "691", "isFavor": false, "paidOnly": false, "status": null, "title": "Stickers to Spell Word", "titleSlug": "stickers-to-spell-word", "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": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization" }, { "name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 59.56483520792622, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "692", "isFavor": false, "paidOnly": false, "status": null, "title": "Top K Frequent Words", "titleSlug": "top-k-frequent-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" }, { "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 }, { "acRate": 63.68127097364654, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "693", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.43061910084254, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "694", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 73.40179940291523, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "695", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.08606980942275, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "696", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.63450390402684, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "697", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.19815741060136, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "698", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.57917809768929, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "699", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.08499432275865, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "700", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.3686643498469, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "701", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.89326498096756, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "702", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.218517420004545, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "703", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.9388196411909, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "704", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.2748559194313, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "705", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.04339957703962, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "706", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.322449364933256, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "707", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.28395436319562, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "708", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 84.35478879777193, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "709", "isFavor": false, "paidOnly": false, "status": null, "title": "To Lower Case", "titleSlug": "to-lower-case", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 34.13584659481293, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "710", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.979035639413, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "711", "isFavor": false, "paidOnly": true, "status": null, "title": "Number of Distinct Islands II", "titleSlug": "number-of-distinct-islands-ii", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search" }, { "name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find" }, { "name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 65.93873890698009, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "712", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.1951033146576, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "713", "isFavor": false, "paidOnly": false, "status": null, "title": "Subarray Product Less Than K", "titleSlug": "subarray-product-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": true, "hasVideoSolution": false }, { "acRate": 71.08147378347431, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "714", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.318900287573165, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "715", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.59137881206112, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "716", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 45.22465295526468, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "717", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.09584516419533, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "718", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.971482055166234, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "719", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.79703569267997, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "720", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.176511665808604, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "721", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.626154629427596, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "722", "isFavor": false, "paidOnly": false, "status": null, "title": "Remove Comments", "titleSlug": "remove-comments", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 77.33788012216372, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "723", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.103237541767655, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "724", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.30746120416981, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "725", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.00542789190624, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "726", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.61803942360834, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "727", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Window Subsequence", "titleSlug": "minimum-window-subsequence", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 79.84375341090178, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "728", "isFavor": false, "paidOnly": false, "status": null, "title": "Self Dividing Numbers", "titleSlug": "self-dividing-numbers", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 58.19979547675648, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "729", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.8406412895878, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "730", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Different Palindromic Subsequences", "titleSlug": "count-different-palindromic-subsequences", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.45467747224435, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "731", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 70.86996760758907, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "732", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.07000798858125, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "733", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.656928167906834, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "734", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 45.99191263479606, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "735", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.05889777886358, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "736", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 50.78502375336368, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "737", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 48.95815880462431, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "738", "isFavor": false, "paidOnly": false, "status": null, "title": "Monotone Increasing Digits", "titleSlug": "monotone-increasing-digits", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 67.66377935252254, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "739", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.87172182104128, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "740", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.33445474623757, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "741", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.18571365267869, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "742", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 58.44559076471852, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "743", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.539709308240525, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "744", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.518421636339994, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "745", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.52401475583476, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "746", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.20317143051937, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "747", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 61.79862273866026, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "748", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 53.15535562944129, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "749", "isFavor": false, "paidOnly": false, "status": null, "title": "Contain Virus", "titleSlug": "contain-virus", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 67.83682342351523, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "750", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 53.96882617502661, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "751", "isFavor": false, "paidOnly": true, "status": null, "title": "IP to CIDR", "titleSlug": "ip-to-cidr", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 60.86295278639036, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "752", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.07008011866878, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "753", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 44.1364821595039, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "754", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.214830637778455, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "755", "isFavor": false, "paidOnly": true, "status": null, "title": "Pour Water", "titleSlug": "pour-water", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 53.07444265302719, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "756", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 45.55030340699063, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "757", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 52.24844912352956, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "758", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 72.6285377761087, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "759", "isFavor": false, "paidOnly": true, "status": null, "title": "Employee Free Time", "titleSlug": "employee-free-time", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "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": true, "hasVideoSolution": false }, { "acRate": 83.93981939681298, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "760", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.41335647911774, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "761", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.626921825313, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "762", "isFavor": false, "paidOnly": false, "status": null, "title": "Prime Number of Set Bits in Binary Representation", "titleSlug": "prime-number-of-set-bits-in-binary-representation", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 81.63692618829103, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "763", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.71305514004229, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "764", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.73460891473166, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "765", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.42237883825413, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "766", "isFavor": false, "paidOnly": false, "status": null, "title": "Toeplitz Matrix", "titleSlug": "toeplitz-matrix", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.44806203636522, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "767", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.40393638945016, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "768", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 64.11140800139654, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "769", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 49.02335094596898, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "770", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 89.34017121797893, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "771", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.74301331217492, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "772", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 73.30420841683367, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "773", "isFavor": false, "paidOnly": false, "status": null, "title": "Sliding Puzzle", "titleSlug": "sliding-puzzle", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" }, { "name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search" }, { "name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 53.03952321204517, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "774", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 42.49092512458727, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "775", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.37175226362979, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "776", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 37.63089497480298, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "777", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 63.55181963448031, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "778", "isFavor": false, "paidOnly": false, "status": null, "title": "Swim in Rising Water", "titleSlug": "swim-in-rising-water", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search" }, { "name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find" }, { "name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 47.703181603402115, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "779", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.8414607421173, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "780", "isFavor": false, "paidOnly": false, "status": null, "title": "Reaching Points", "titleSlug": "reaching-points", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 58.14323834341799, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "781", "isFavor": false, "paidOnly": false, "status": null, "title": "Rabbits in Forest", "titleSlug": "rabbits-in-forest", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 50.80396337639533, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "782", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.60463309114994, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "783", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.36781379433378, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "784", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.25904090876411, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "785", "isFavor": false, "paidOnly": false, "status": null, "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": true }, { "acRate": 68.70311228004257, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "786", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.79558186698938, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "787", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.52652361070653, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "788", "isFavor": false, "paidOnly": false, "status": null, "title": "Rotated Digits", "titleSlug": "rotated-digits", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.834101382488484, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "789", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.754427344379586, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "790", "isFavor": false, "paidOnly": false, "status": null, "title": "Domino and Tromino Tiling", "titleSlug": "domino-and-tromino-tiling", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 72.13409131452197, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "791", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.64755830363896, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "792", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.095520665924916, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "793", "isFavor": false, "paidOnly": false, "status": null, "title": "Preimage Size of Factorial Zeroes Function", "titleSlug": "preimage-size-of-factorial-zeroes-function", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 34.666530662643815, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "794", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 54.22616574929899, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "795", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.38617124467496, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "796", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.27028842879476, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "797", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.75090115727566, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "798", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Rotation with Highest Score", "titleSlug": "smallest-rotation-with-highest-score", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 58.387586882592245, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "799", "isFavor": false, "paidOnly": false, "status": null, "title": "Champagne Tower", "titleSlug": "champagne-tower", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 67.85034876347495, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "800", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 40.98155066281606, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "801", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 69.45357596558871, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "802", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.131780161133065, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "803", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.36034437476378, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "804", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.228296560163813, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "805", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 71.20749902934162, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "806", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.29267873510541, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "807", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.91590258234367, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "808", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.49303884343191, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "809", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 63.74841471147749, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "810", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.95187361561133, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "811", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.47284909619704, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "812", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 54.3535206732401, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "813", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.37728661143457, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "814", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.965020576131685, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "815", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.10527027483858, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "816", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 57.41096800291654, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "817", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 44.26997890789782, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "818", "isFavor": false, "paidOnly": false, "status": null, "title": "Race Car", "titleSlug": "race-car", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 44.72564139339076, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "819", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.642498738160974, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "820", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.37107770939204, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "821", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.79323883126007, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "822", "isFavor": false, "paidOnly": false, "status": null, "title": "Card Flipping Game", "titleSlug": "card-flipping-game", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.96071850754787, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "823", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.55928607778098, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "824", "isFavor": false, "paidOnly": false, "status": null, "title": "Goat Latin", "titleSlug": "goat-latin", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 49.211618954764745, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "825", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 56.00645181421271, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "826", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.57059709486231, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "827", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.088757240305576, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "828", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 42.18507660918611, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "829", "isFavor": false, "paidOnly": false, "status": null, "title": "Consecutive Numbers Sum", "titleSlug": "consecutive-numbers-sum", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 53.284699123072265, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "830", "isFavor": false, "paidOnly": false, "status": null, "title": "Positions of Large Groups", "titleSlug": "positions-of-large-groups", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 50.83583731854924, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "831", "isFavor": false, "paidOnly": false, "status": null, "title": "Masking Personal Information", "titleSlug": "masking-personal-information", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 83.1647595667963, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "832", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.16327326232126, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "833", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.38789653085998, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "834", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.83890800383553, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "835", "isFavor": false, "paidOnly": false, "status": null, "title": "Image Overlap", "titleSlug": "image-overlap", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 45.96694751703757, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "836", "isFavor": false, "paidOnly": false, "status": null, "title": "Rectangle Overlap", "titleSlug": "rectangle-overlap", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.06040956204747, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "837", "isFavor": false, "paidOnly": false, "status": null, "title": "New 21 Game", "titleSlug": "new-21-game", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 63.02965741548713, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "838", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.62281282512059, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "839", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.52430584392216, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "840", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.00137150798827, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "841", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.8336842856633, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "842", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.378180349622106, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "843", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.57557619311041, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "844", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.279589396578785, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "845", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.42012776122992, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "846", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.54910218221546, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "847", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.74832819719867, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "848", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.23987346341156, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "849", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Distance to Closest Person", "titleSlug": "maximize-distance-to-closest-person", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 54.7375398765381, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "850", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.30869214997071, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "851", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.28242394058243, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "852", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.920395985006145, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "853", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 40.21388452735269, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "854", "isFavor": false, "paidOnly": false, "status": null, "title": "K-Similar Strings", "titleSlug": "k-similar-strings", "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 }, { "acRate": 43.03050401950488, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "855", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 63.612809430018366, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "856", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.52213784804349, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "857", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.938305303630656, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "858", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 33.72030348020473, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "859", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.60633656253632, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "860", "isFavor": false, "paidOnly": false, "status": null, "title": "Lemonade Change", "titleSlug": "lemonade-change", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 80.24604481708839, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "861", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.34184948028523, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "862", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.89928316796005, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "863", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.04538063743169, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "864", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.65348153981283, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "865", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.44376252814967, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "866", "isFavor": false, "paidOnly": false, "status": null, "title": "Prime Palindrome", "titleSlug": "prime-palindrome", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.85922918564533, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "867", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.0093120745485, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "868", "isFavor": false, "paidOnly": false, "status": null, "title": "Binary Gap", "titleSlug": "binary-gap", "topicTags": [ { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 66.14643371757926, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "869", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.69577855446834, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "870", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.76293664952418, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "871", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.141560838912, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "872", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.58594619181383, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "873", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.35819258221245, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "874", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.08431584138063, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "875", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.01849608787585, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "876", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.0226638437109, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "877", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.00674933048499, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "878", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.028131983699225, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "879", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.7453259526061, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "880", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.72054915054029, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "881", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.073431081526785, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "882", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.52097586730316, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "883", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.43371081261492, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "884", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.52326392348311, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "885", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.829292609158315, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "886", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.170342080009306, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "887", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.71532155716595, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "888", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.03443775398215, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "889", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 76.87647093871958, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "890", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.37236370555961, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "891", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.61215220208156, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "892", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 73.06187188787914, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "893", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 82.73512955707122, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "894", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.40866873065015, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "895", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.871116257720885, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "896", "isFavor": false, "paidOnly": false, "status": null, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 78.78063768995919, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "897", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.48591057392196, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "898", "isFavor": false, "paidOnly": false, "status": null, "title": "Bitwise ORs of Subarrays", "titleSlug": "bitwise-ors-of-subarrays", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 66.41817983395035, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "899", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.96764781601305, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "900", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 67.99676750015516, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "901", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.716021746082504, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "902", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.888188608776844, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "903", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 49.532049305745865, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "904", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.34067350145682, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "905", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.48305035299609, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "906", "isFavor": false, "paidOnly": false, "status": null, "title": "Super Palindromes", "titleSlug": "super-palindromes", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 37.897740413410844, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "907", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.29454340458896, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "908", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Range I", "titleSlug": "smallest-range-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 47.97210023249806, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "909", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.34954131723669, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "910", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.20688061469135, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "911", "isFavor": false, "paidOnly": false, "status": null, "title": "Online Election", "titleSlug": "online-election", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.26423192584941, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "912", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.91742508952456, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "913", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.91586841894613, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "914", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.14965272677676, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "915", "isFavor": false, "paidOnly": false, "status": null, "title": "Partition Array into Disjoint Intervals", "titleSlug": "partition-array-into-disjoint-intervals", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 55.80955185408051, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "916", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.29779766177232, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "917", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.32270931706934, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "918", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.74646359188519, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "919", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.97118926918353, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "920", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.51890333353693, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "921", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.06682734095402, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "922", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.939767735964224, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "923", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.633057446126585, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "924", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.6196633738924, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "925", "isFavor": false, "paidOnly": false, "status": null, "title": "Long Pressed Name", "titleSlug": "long-pressed-name", "topicTags": [ { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 61.69344841021523, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "926", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.84243521364614, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "927", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.0296162760752, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "928", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 67.67281193378331, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "929", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.05911807769587, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "930", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.95167111651105, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "931", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.2896233943419, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "932", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.71610695427165, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "933", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.904478663654636, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "934", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.40886899145775, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "935", "isFavor": false, "paidOnly": false, "status": null, "title": "Knight Dialer", "titleSlug": "knight-dialer", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 61.99638070238237, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "936", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.824312352495085, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "937", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 87.50106426527553, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "938", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.10733747470895, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "939", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Area Rectangle", "titleSlug": "minimum-area-rectangle", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 43.69963637692547, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "940", "isFavor": false, "paidOnly": false, "status": null, "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": true }, { "acRate": 34.48343338573854, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "941", "isFavor": false, "paidOnly": false, "status": null, "title": "Valid Mountain Array", "titleSlug": "valid-mountain-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 80.39401306982388, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "942", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.59685737632449, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "943", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.85372217522057, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "944", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.42345427833881, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "945", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.82223985359757, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "946", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.41865860254374, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "947", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.28706975526764, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "948", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.62861943877515, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "949", "isFavor": false, "paidOnly": false, "status": null, "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": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 83.38636142449674, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "950", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.63988045069127, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "951", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.44827398231053, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "952", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.67726899773098, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "953", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.5466175091773, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "954", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.84140398494849, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "955", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 51.85384747536273, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "956", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.00894263790817, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "957", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.65955154429905, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "958", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.62018172463361, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "959", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.10667969144744, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "960", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.65814653326474, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "961", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.74438926045271, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "962", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Width Ramp", "titleSlug": "maximum-width-ramp", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" }, { "name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 55.7520385106592, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "963", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Area Rectangle II", "titleSlug": "minimum-area-rectangle-ii", "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 }, { "acRate": 48.453778052295654, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "964", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 72.39597070624878, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "965", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.65870517533625, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "966", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.89007050297372, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "967", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.39715993732807, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "968", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.38898967575948, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "969", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.27839207555863, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "970", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.308522621638474, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "971", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.05854336177813, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "972", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.24868721169906, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "973", "isFavor": false, "paidOnly": false, "status": null, "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": true }, { "acRate": 55.73368327951559, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "974", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.809472657455764, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "975", "isFavor": false, "paidOnly": false, "status": null, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 57.668075959890906, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "976", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.3280015211039, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "977", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.30491912584639, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "978", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.19213364829098, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "979", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.51493787086235, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "980", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.4944301762013, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "981", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.63577201637451, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "982", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.41265080720098, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "983", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.6837788602122, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "984", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.6223931748578, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "985", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.7866082663231, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "986", "isFavor": false, "paidOnly": false, "status": null, "title": "Interval List Intersections", "titleSlug": "interval-list-intersections", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" }, { "name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.21354241028633, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "987", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.94124476272034, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "988", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.12524467758732, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "989", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.26567391628431, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "990", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.423315421583574, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "991", "isFavor": false, "paidOnly": false, "status": null, "title": "Broken Calculator", "titleSlug": "broken-calculator", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 66.70065943279107, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "992", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.54261376175134, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "993", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.27781683006087, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "994", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.18867513215979, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "995", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.67397212429465, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "996", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 50.217921306114924, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "997", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.56763111488472, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "998", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.63738655712956, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "999", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.755508602475096, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1000", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.44109293601252, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1001", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.57263548169641, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1002", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.56686046511628, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1003", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.59417058775213, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1004", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.83178796549276, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1005", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.848517389001046, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1006", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.494427339735466, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1007", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.69737999095076, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1008", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.64822826227486, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1009", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.306875830696946, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1010", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.78034217476174, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1011", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.15737172987224, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1012", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.213531625814745, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1013", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.597147971079345, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1014", "isFavor": false, "paidOnly": false, "status": null, "title": "Best Sightseeing Pair", "titleSlug": "best-sightseeing-pair", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 46.64342595440719, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1015", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.10619129768067, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1016", "isFavor": false, "paidOnly": false, "status": null, "title": "Binary String With Substrings Representing 1 To N", "titleSlug": "binary-string-with-substrings-representing-1-to-n", "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 61.43333749620881, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1017", "isFavor": false, "paidOnly": false, "status": null, "title": "Convert to Base -2", "titleSlug": "convert-to-base-2", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 47.16398651367364, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1018", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.69832727641093, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1019", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.08213699979775, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1020", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.19050080917177, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1021", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.52882584963545, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1022", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.27165671882562, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1023", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.15899452540674, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1024", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.82811650420714, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1025", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.08290056148554, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1026", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.62375557001338, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1027", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.29963880154874, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1028", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 67.85591063419122, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1029", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.1952818354712, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1030", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.459265803640285, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1031", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.41880781089414, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1032", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.0349382757129, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1033", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.24847413534336, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1034", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.62311874446432, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1035", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.72164529161357, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1036", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.36811349892803, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1037", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 88.30621790842524, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1038", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.55265610438024, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1039", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.98987707881417, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1040", "isFavor": false, "paidOnly": false, "status": null, "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": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.27537100596639, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1041", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.78063144478566, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1042", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.20053154464343, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1043", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.888416453745783, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1044", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.26544800838262, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1045", "isFavor": false, "paidOnly": false, "status": null, "title": "Customers Who Bought All Products", "titleSlug": "customers-who-bought-all-products", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 66.0842647070725, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1046", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.00664160612241, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1047", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.39662733333249, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1048", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.264008250257824, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1049", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.72830416806106, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1050", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.26825376080781, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1051", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.98184632091826, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1052", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.379952880702504, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1053", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.94057638357562, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1054", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.40450842786457, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1055", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 49.29289929846702, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1056", "isFavor": false, "paidOnly": true, "status": null, "title": "Confusing Number", "titleSlug": "confusing-number", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 59.03731671724074, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1057", "isFavor": false, "paidOnly": true, "status": null, "title": "Campus Bikes", "titleSlug": "campus-bikes", "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 }, { "acRate": 45.65235584567746, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1058", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 37.069527009563195, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1059", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.17906314147005, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1060", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 81.13327664162007, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1061", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.23912698592571, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1062", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 79.43606741048504, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1063", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 63.821902215633855, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1064", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.36736986362921, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1065", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 55.77744649771383, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1066", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 46.121657481118596, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1067", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 85.04782893321592, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1068", "isFavor": false, "paidOnly": false, "status": null, "title": "Product Sales Analysis I", "titleSlug": "product-sales-analysis-i", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 82.40743282189224, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1069", "isFavor": false, "paidOnly": true, "status": null, "title": "Product Sales Analysis II", "titleSlug": "product-sales-analysis-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 44.92745710026488, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1070", "isFavor": false, "paidOnly": false, "status": null, "title": "Product Sales Analysis III", "titleSlug": "product-sales-analysis-iii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.93608438675663, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1071", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.56511202467986, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1072", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 37.175157567767684, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1073", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.52719920106405, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1074", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.03610398390032, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1075", "isFavor": false, "paidOnly": false, "status": null, "title": "Project Employees I", "titleSlug": "project-employees-i", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 50.30355119740595, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1076", "isFavor": false, "paidOnly": true, "status": null, "title": "Project Employees II", "titleSlug": "project-employees-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 77.10574476632594, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1077", "isFavor": false, "paidOnly": true, "status": null, "title": "Project Employees III", "titleSlug": "project-employees-iii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 63.742115910984175, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1078", "isFavor": false, "paidOnly": false, "status": null, "title": "Occurrences After Bigram", "titleSlug": "occurrences-after-bigram", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 83.57714732529875, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1079", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 54.13017266874446, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1080", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.40707123098201, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1081", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.766174362242, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1082", "isFavor": false, "paidOnly": true, "status": null, "title": "Sales Analysis I", "titleSlug": "sales-analysis-i", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 49.97914284831443, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1083", "isFavor": false, "paidOnly": true, "status": null, "title": "Sales Analysis II", "titleSlug": "sales-analysis-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 46.87383030279151, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1084", "isFavor": false, "paidOnly": false, "status": null, "title": "Sales Analysis III", "titleSlug": "sales-analysis-iii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 76.62419239052404, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1085", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.26242139537196, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1086", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 66.73280641996539, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1087", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 47.08555597409383, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1088", "isFavor": false, "paidOnly": true, "status": null, "title": "Confusing Number II", "titleSlug": "confusing-number-ii", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.982122869229364, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1089", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.557347792324556, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1090", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.398195602532546, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1091", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.53431360534062, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1092", "isFavor": false, "paidOnly": false, "status": null, "title": "Shortest Common Supersequence ", "titleSlug": "shortest-common-supersequence", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 42.37402532814693, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1093", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.14444140816218, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1094", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.65354258862175, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1095", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.24614505996573, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1096", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.60038734667528, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1097", "isFavor": false, "paidOnly": true, "status": null, "title": "Game Play Analysis V", "titleSlug": "game-play-analysis-v", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 43.39287737452321, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1098", "isFavor": false, "paidOnly": true, "status": null, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 62.060751972134, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1099", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.35481909824824, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1100", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 65.71019188306308, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1101", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 54.2287229868642, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1102", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 66.88104558247872, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1103", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.59602110646348, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1104", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.64112747778843, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1105", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.8250115255868, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1106", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 45.06700176348219, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1107", "isFavor": false, "paidOnly": true, "status": null, "title": "New Users Daily Count", "titleSlug": "new-users-daily-count", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 89.79580699440629, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1108", "isFavor": false, "paidOnly": false, "status": null, "title": "Defanging an IP Address", "titleSlug": "defanging-an-ip-address", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 65.1832864498028, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1109", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.44480425030238, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1110", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.53328141463192, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1111", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.19528780768125, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1112", "isFavor": false, "paidOnly": true, "status": null, "title": "Highest Grade For Each Student", "titleSlug": "highest-grade-for-each-student", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 65.04883359253499, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1113", "isFavor": false, "paidOnly": true, "status": null, "title": "Reported Posts", "titleSlug": "reported-posts", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 71.98170510369528, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1114", "isFavor": false, "paidOnly": false, "status": null, "title": "Print in Order", "titleSlug": "print-in-order", "topicTags": [ { "name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 70.60541530847748, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1115", "isFavor": false, "paidOnly": false, "status": null, "title": "Print FooBar Alternately", "titleSlug": "print-foobar-alternately", "topicTags": [ { "name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 64.16936933681443, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1116", "isFavor": false, "paidOnly": false, "status": null, "title": "Print Zero Even Odd", "titleSlug": "print-zero-even-odd", "topicTags": [ { "name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 57.960733847047194, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1117", "isFavor": false, "paidOnly": false, "status": null, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [ { "name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 59.21499559693043, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1118", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 91.23785435436615, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1119", "isFavor": false, "paidOnly": true, "status": null, "title": "Remove Vowels from a String", "titleSlug": "remove-vowels-from-a-string", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 66.8578097574872, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1120", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.66674251905791, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1121", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.96002300154395, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1122", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.98338088734432, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1123", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 36.23865750742939, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1124", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.3267738073529, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1125", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.96788003009625, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1126", "isFavor": false, "paidOnly": true, "status": null, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 46.98640159446981, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1127", "isFavor": false, "paidOnly": true, "status": null, "title": "User Purchase Platform", "titleSlug": "user-purchase-platform", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 60.62048425005907, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1128", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 47.42112883773588, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1129", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.6924614371708, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1130", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.388073255637956, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1131", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.10707054225044, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1132", "isFavor": false, "paidOnly": true, "status": null, "title": "Reported Posts II", "titleSlug": "reported-posts-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 70.85521027208273, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1133", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 77.87447949881832, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1134", "isFavor": false, "paidOnly": true, "status": null, "title": "Armstrong Number", "titleSlug": "armstrong-number", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.72448630391763, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1135", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.89295610325215, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1136", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 63.48194526006981, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1137", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.62688823119462, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1138", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.45744787657709, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1139", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.93236829797512, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1140", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.79850696216705, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1141", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.690255917337495, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1142", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 58.48230775182821, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1143", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.64132632430246, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1144", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.59609710233354, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1145", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.66881942836266, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1146", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.92454501530037, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1147", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.05130085670386, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1148", "isFavor": false, "paidOnly": false, "status": null, "title": "Article Views I", "titleSlug": "article-views-i", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 47.22182324409727, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1149", "isFavor": false, "paidOnly": true, "status": null, "title": "Article Views II", "titleSlug": "article-views-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 59.09175952103776, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1150", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.11498110738184, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1151", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 43.87132847582604, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1152", "isFavor": false, "paidOnly": true, "status": null, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 34.726548867029464, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1153", "isFavor": false, "paidOnly": true, "status": null, "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" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 48.66097100139653, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1154", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.850588489503586, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1155", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.85685976312273, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1156", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.546181527389045, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1157", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.11231679318425, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1158", "isFavor": false, "paidOnly": false, "status": null, "title": "Market Analysis I", "titleSlug": "market-analysis-i", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 57.71163509856977, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1159", "isFavor": false, "paidOnly": true, "status": null, "title": "Market Analysis II", "titleSlug": "market-analysis-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 71.21897873943749, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1160", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.46515620791811, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1161", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.93704672807866, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1162", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.630924297662446, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1163", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.54311647755108, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1164", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 87.71682226057769, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1165", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.83013025585124, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1166", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 71.41498611278831, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1167", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 65.22359547975788, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1168", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 31.336492576882293, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1169", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.873495971635805, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1170", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.95458612909756, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1171", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.07795963480552, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1172", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.82457111234089, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1173", "isFavor": false, "paidOnly": true, "status": null, "title": "Immediate Food Delivery I", "titleSlug": "immediate-food-delivery-i", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 54.88560300990123, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1174", "isFavor": false, "paidOnly": false, "status": null, "title": "Immediate Food Delivery II", "titleSlug": "immediate-food-delivery-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 60.03748022303805, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1175", "isFavor": false, "paidOnly": false, "status": null, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 54.35996039660789, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1176", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 40.60250372141829, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1177", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.341480221062845, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1178", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.59026462709852, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1179", "isFavor": false, "paidOnly": false, "status": null, "title": "Reformat Department Table", "titleSlug": "reformat-department-table", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 80.76000639556574, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1180", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 51.458567078057385, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1181", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 56.406908171861836, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1182", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.87283921382902, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1183", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximum Number of Ones", "titleSlug": "maximum-number-of-ones", "topicTags": [ { "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" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 54.86491536190725, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1184", "isFavor": false, "paidOnly": false, "status": null, "title": "Distance Between Bus Stops", "titleSlug": "distance-between-bus-stops", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 58.76087608760876, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1185", "isFavor": false, "paidOnly": false, "status": null, "title": "Day of the Week", "titleSlug": "day-of-the-week", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 45.51686429962752, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1186", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.795560842412605, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1187", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.10563995936016, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1188", "isFavor": false, "paidOnly": true, "status": null, "title": "Design Bounded Blocking Queue", "titleSlug": "design-bounded-blocking-queue", "topicTags": [ { "name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 59.81947427844737, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1189", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.78988918488244, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1190", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 24.43921917659935, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1191", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.534801446913384, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1192", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.47596743584425, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1193", "isFavor": false, "paidOnly": false, "status": null, "title": "Monthly Transactions I", "titleSlug": "monthly-transactions-i", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 49.949862120832286, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1194", "isFavor": false, "paidOnly": true, "status": null, "title": "Tournament Winners", "titleSlug": "tournament-winners", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.36957420421662, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1195", "isFavor": false, "paidOnly": false, "status": null, "title": "Fizz Buzz Multithreaded", "titleSlug": "fizz-buzz-multithreaded", "topicTags": [ { "name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 66.93807829181495, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1196", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 41.459312118230685, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1197", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Knight Moves", "titleSlug": "minimum-knight-moves", "topicTags": [ { "name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 76.78303705290213, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1198", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 46.20557789938683, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1199", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 70.83541356929875, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1200", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.719847644791205, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1201", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.78479102421102, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1202", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.64505234718001, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1203", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.61762907574649, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1204", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.97609142786447, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1205", "isFavor": false, "paidOnly": true, "status": null, "title": "Monthly Transactions II", "titleSlug": "monthly-transactions-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 58.668849932575604, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1206", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.42887282926769, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1207", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.14270656808076, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1208", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.020599479230164, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1209", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.05513057240834, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1210", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.96285139366807, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1211", "isFavor": false, "paidOnly": false, "status": null, "title": "Queries Quality and Percentage", "titleSlug": "queries-quality-and-percentage", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 55.853539203750266, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1212", "isFavor": false, "paidOnly": true, "status": null, "title": "Team Scores in Football Tournament", "titleSlug": "team-scores-in-football-tournament", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 80.05855330492942, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1213", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 67.3930365076299, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1214", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 47.804333258878714, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1215", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 49.08888514714411, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1216", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.48485516531868, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1217", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.36125680438128, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1218", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.16730451959013, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1219", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.43796902223868, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1220", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Vowels Permutation", "titleSlug": "count-vowels-permutation", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 86.97949939020849, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1221", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.36011402814884, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1222", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.25622098882848, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1223", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.724664585267064, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1224", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.15781600598354, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1225", "isFavor": false, "paidOnly": true, "status": null, "title": "Report Contiguous Dates", "titleSlug": "report-contiguous-dates", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 54.632087127625496, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1226", "isFavor": false, "paidOnly": false, "status": null, "title": "The Dining Philosophers", "titleSlug": "the-dining-philosophers", "topicTags": [ { "name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 66.84959323471577, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1227", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.13319458896982, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1228", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 55.20325472897527, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1229", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 58.07792610188748, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1230", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.14896732359013, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1231", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 39.78281347341673, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1232", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.60837735687637, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1233", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 39.89074068938743, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1234", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.47179054749463, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1235", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.78470615455808, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1236", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 69.62026450664851, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1237", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.9678791950603, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1238", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.35102455961911, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1239", "isFavor": false, "paidOnly": false, "status": null, "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": true }, { "acRate": 54.469759734879865, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1240", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.94071887077244, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1241", "isFavor": false, "paidOnly": true, "status": null, "title": "Number of Comments per Post", "titleSlug": "number-of-comments-per-post", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 50.37771961101141, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1242", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 53.25119072271692, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1243", "isFavor": false, "paidOnly": true, "status": null, "title": "Array Transformation", "titleSlug": "array-transformation", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 67.98982672149462, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1244", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.14618089999099, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1245", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 46.32637586303229, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1246", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.91929512809122, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1247", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.04510810959005, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1248", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 70.96356602867185, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1249", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.772853185595565, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1250", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.85768534783584, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1251", "isFavor": false, "paidOnly": false, "status": null, "title": "Average Selling Price", "titleSlug": "average-selling-price", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 79.38059925667199, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1252", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.107809301839154, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1253", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.85648508133986, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1254", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.58295185477506, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1255", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.12322910554111, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1256", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.16360474786421, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1257", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 56.70775331657162, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1258", "isFavor": false, "paidOnly": true, "status": null, "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": "Sort", "id": "VG9waWNUYWdOb2RlOjE4", "slug": "sort" }, { "name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 60.03069007537122, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1259", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 67.82862861952096, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1260", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.0513643931723, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1261", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 51.053599957598564, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1262", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.00366984290497, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1263", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.35326602049713, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1264", "isFavor": false, "paidOnly": true, "status": null, "title": "Page Recommendations", "titleSlug": "page-recommendations", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 94.04262727971795, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1265", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 82.6146288209607, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1266", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.49572261336968, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1267", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 65.07696064894995, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1268", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.98870918369907, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1269", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.18302369854919, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1270", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 58.404066784814844, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1271", "isFavor": false, "paidOnly": true, "status": null, "title": "Hexspeak", "titleSlug": "hexspeak", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 66.87778636879595, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1272", "isFavor": false, "paidOnly": true, "status": null, "title": "Remove Interval", "titleSlug": "remove-interval", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": true }, { "acRate": 61.34306248971306, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1273", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.80180199881907, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1274", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 54.205427024790545, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1275", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.552730851238316, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1276", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.6079755436946, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1277", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 61.846754861049455, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1278", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.68205486904485, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1279", "isFavor": false, "paidOnly": true, "status": null, "title": "Traffic Light Controlled Intersection", "titleSlug": "traffic-light-controlled-intersection", "topicTags": [ { "name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 60.738366433469295, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1280", "isFavor": false, "paidOnly": false, "status": null, "title": "Students and Examinations", "titleSlug": "students-and-examinations", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 86.5930893644593, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1281", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 87.45494479706366, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1282", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 64.55247901566487, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1283", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.18121513065819, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1284", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.89596820382873, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1285", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.56469732114431, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1286", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.06879145841669, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1287", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.16068540527988, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1288", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.54549196535943, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1289", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.30292124047747, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1290", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.27888102715737, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1291", "isFavor": false, "paidOnly": false, "status": null, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [ { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 53.64923368180743, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1292", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.76552265891791, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1293", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.9234626430232, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1294", "isFavor": false, "paidOnly": true, "status": null, "title": "Weather Type in Each Country", "titleSlug": "weather-type-in-each-country", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 79.49812791294795, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1295", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.9402878094503, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1296", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.748885639910135, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1297", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.41690554144193, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1298", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 71.64152723851927, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1299", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.63620188126631, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1300", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.387611642071306, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1301", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.4080162703802, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1302", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 89.6523489474941, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1303", "isFavor": false, "paidOnly": true, "status": null, "title": "Find the Team Size", "titleSlug": "find-the-team-size", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 76.72107452181265, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1304", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 80.09604313878523, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1305", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.31584426892807, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1306", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.75936949777815, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1307", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.2685496356153, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1308", "isFavor": false, "paidOnly": true, "status": null, "title": "Running Total for Different Genders", "titleSlug": "running-total-for-different-genders", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 80.31262198537024, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1309", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.28024882778203, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1310", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 50.431135962330785, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1311", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.09725389222864, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1312", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.09088171577757, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1313", "isFavor": false, "paidOnly": false, "status": null, "title": "Decompress Run-Length Encoded List", "titleSlug": "decompress-run-length-encoded-list", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 76.06040915100047, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1314", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.79467806801765, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1315", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.33526246319423, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1316", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.34291857027681, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1317", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 71.80408502211789, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1318", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.42469777051302, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1319", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.152089447021986, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1320", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.22946448720771, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1321", "isFavor": false, "paidOnly": false, "status": null, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 58.93152711094416, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1322", "isFavor": false, "paidOnly": true, "status": null, "title": "Ads Performance", "titleSlug": "ads-performance", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 84.45744317591341, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1323", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.74056443386604, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1324", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.24626157437095, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1325", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.76304788319006, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1326", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.74256650346273, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1327", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.52495899466175, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1328", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.10195314053861, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1329", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.854769026254566, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1330", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.70826053249714, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1331", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 76.75455076820307, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1332", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.56449425369406, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1333", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.15512532376566, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1334", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.68423703849712, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1335", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.9777649990416, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1336", "isFavor": false, "paidOnly": true, "status": null, "title": "Number of Transactions per Visit", "titleSlug": "number-of-transactions-per-visit", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 74.10352739006042, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1337", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.20272195560888, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1338", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.01073308530183, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1339", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.27636316030633, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1340", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.79653500418634, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1341", "isFavor": false, "paidOnly": false, "status": null, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 85.68971339111215, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1342", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.80564595817205, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1343", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.29619143853637, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1344", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.13689630785596, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1345", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.393357067495664, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1346", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 82.22725548969593, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1347", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.498735668867994, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1348", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.65218045867416, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1349", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 89.91337501051274, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1350", "isFavor": false, "paidOnly": true, "status": null, "title": "Students With Invalid Departments", "titleSlug": "students-with-invalid-departments", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 77.77040508136406, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1351", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.83397976579541, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1352", "isFavor": false, "paidOnly": false, "status": null, "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": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 38.66863140190185, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1353", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 36.27386404569546, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1354", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.1262288802826, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1355", "isFavor": false, "paidOnly": true, "status": null, "title": "Activity Participants", "titleSlug": "activity-participants", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 78.80228661058385, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1356", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.64313466927261, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1357", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.32768496004549, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1358", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 64.86690291132939, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1359", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.72910994362848, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1360", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.92442599339151, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1361", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.58905490879091, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1362", "isFavor": false, "paidOnly": false, "status": null, "title": "Closest Divisors", "titleSlug": "closest-divisors", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 32.888024614073174, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1363", "isFavor": false, "paidOnly": false, "status": null, "title": "Largest Multiple of Three", "titleSlug": "largest-multiple-of-three", "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 75.04258943781942, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1364", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 87.20902935425073, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1365", "isFavor": false, "paidOnly": false, "status": null, "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 Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 59.634044397659366, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1366", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.90351194554137, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1367", "isFavor": false, "paidOnly": false, "status": null, "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": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 70.75784777759642, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1368", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 67.4807267238126, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1369", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.98184022386263, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1370", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.71625199688238, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1371", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 66.82993332047359, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1372", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.148097142072565, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1373", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.19609830250823, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1374", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.83725545789622, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1375", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.33186288002611, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1376", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.158606640470374, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1377", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.59187613086307, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1378", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.76689745684402, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1379", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.93413931017194, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1380", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.07322192647406, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1381", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 84.70876673775226, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1382", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.61778098372481, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1383", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.13686498928994, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1384", "isFavor": false, "paidOnly": true, "status": null, "title": "Total Sales Amount by Year", "titleSlug": "total-sales-amount-by-year", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 70.69646114945962, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1385", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.044720030063885, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1386", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.90835345488654, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1387", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.33827663978744, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1388", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.3101760537658, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1389", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.2551673849433, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1390", "isFavor": false, "paidOnly": false, "status": null, "title": "Four Divisors", "titleSlug": "four-divisors", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 49.33106128886886, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1391", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.90891223579651, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1392", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.84570359851764, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1393", "isFavor": false, "paidOnly": false, "status": null, "title": "Capital Gain/Loss", "titleSlug": "capital-gainloss", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 75.43249986624969, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1394", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.10995070153231, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1395", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.09951307600528, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1396", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.17588204318062, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1397", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.79563295731909, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1398", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.88692106771995, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1399", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Largest Group", "titleSlug": "count-largest-group", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 68.65985847593056, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1400", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 49.064826982041176, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1401", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.4347624443793, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1402", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.20819985004431, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1403", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.36153348238219, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1404", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 65.47120682915758, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1405", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 63.166910961920095, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1406", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.047555996211486, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1407", "isFavor": false, "paidOnly": false, "status": null, "title": "Top Travellers", "titleSlug": "top-travellers", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 69.78718822536665, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1408", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 84.59459053569014, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1409", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.18628095551172, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1410", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.27795445872027, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1411", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.187527256868734, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1412", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.58468990072332, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1413", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.64927204956037, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1414", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.1584557764333, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1415", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 46.82086330935252, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1416", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.06986416156087, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1417", "isFavor": false, "paidOnly": false, "status": null, "title": "Reformat The String", "titleSlug": "reformat-the-string", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 75.88862947042266, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1418", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.886713334297305, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1419", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.38077927979099, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1420", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.98413566739606, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1421", "isFavor": false, "paidOnly": true, "status": null, "title": "NPV Queries", "titleSlug": "npv-queries", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 65.13442768652146, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1422", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.388975642240084, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1423", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.19624619076835, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1424", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.35919860380347, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1425", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.56593043094743, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1426", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 55.892343556053405, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1427", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 54.958826447452346, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1428", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 56.23356442744441, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1429", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 47.34487734487735, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1430", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 88.0825564186501, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1431", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.84682167359273, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1432", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 70.5162208945223, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1433", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.80045909949547, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1434", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.89405566372696, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1435", "isFavor": false, "paidOnly": true, "status": null, "title": "Create a Session Bar Chart", "titleSlug": "create-a-session-bar-chart", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 79.45039706905726, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1436", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.1436947874154, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1437", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.941888537249575, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1438", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.04845781560542, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1439", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.05641582010061, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1440", "isFavor": false, "paidOnly": true, "status": null, "title": "Evaluate Boolean Expression", "titleSlug": "evaluate-boolean-expression", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 80.32926568186683, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1441", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.81852082038533, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1442", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.20664806565267, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1443", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.53201029643777, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1444", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 86.0525886003593, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1445", "isFavor": false, "paidOnly": true, "status": null, "title": "Apples & Oranges", "titleSlug": "apples-oranges", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 60.29754775263191, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1446", "isFavor": false, "paidOnly": false, "status": null, "title": "Consecutive Characters", "titleSlug": "consecutive-characters", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 68.77461199907343, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1447", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.59520152286542, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1448", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.9595258939996, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1449", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.7270938115023, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1450", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.17454537453658, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1451", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.86549976969139, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1452", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.98696088264794, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1453", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.5764483199327, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1454", "isFavor": false, "paidOnly": true, "status": null, "title": "Active Users", "titleSlug": "active-users", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 68.71748350895743, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1455", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 60.837669458411284, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1456", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.33544184066778, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1457", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.3777858860849, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1458", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.59518754423213, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1459", "isFavor": false, "paidOnly": true, "status": null, "title": "Rectangles Area", "titleSlug": "rectangles-area", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 75.81573355560512, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1460", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.72140307569137, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1461", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.59347020710069, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1462", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 72.11756455906482, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1463", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.37434720103273, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1464", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.27442590215376, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1465", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.29252008341727, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1466", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.44788876859081, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1467", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.80861456483126, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1468", "isFavor": false, "paidOnly": true, "status": null, "title": "Calculate Salaries", "titleSlug": "calculate-salaries", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 84.00409181357024, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1469", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 88.88417470709855, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1470", "isFavor": false, "paidOnly": false, "status": null, "title": "Shuffle the Array", "titleSlug": "shuffle-the-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.13278782059311, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1471", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.90546262020554, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1472", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.064843405381566, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1473", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.38483932578019, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1474", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 83.44111444500659, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1475", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 86.05933094887439, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1476", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.5747979968451, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1477", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.86842805213228, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1478", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.04819503399571, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1479", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 86.93060072248355, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1480", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.53849145636573, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1481", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.7280422055766, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1482", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.38069538786018, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1483", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.85503134028093, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1484", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.93326761026218, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1485", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 87.06435873605948, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1486", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.0679351940645, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1487", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.534349534534137, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1488", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.18794754203878, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1489", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.14473948903641, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1490", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 63.437688078605866, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1491", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.74532353931868, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1492", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.85682663250967, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1493", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.713670340808314, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1494", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.98109845350983, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1495", "isFavor": false, "paidOnly": true, "status": null, "title": "Friendly Movies Streamed Last Month", "titleSlug": "friendly-movies-streamed-last-month", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.53276424805423, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1496", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.16823373625037, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1497", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 49.51100218979169, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1498", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.68439531526298, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1499", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.891794539298324, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1500", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.55114402517069, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1501", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 69.44514160576757, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1502", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.22994381340625, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1503", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.99247772481345, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1504", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 40.35504145493448, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1505", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.4160156640227, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1506", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 67.53869499241276, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1507", "isFavor": false, "paidOnly": false, "status": null, "title": "Reformat Date", "titleSlug": "reformat-date", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 63.09161270652961, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1508", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 59.18591543228049, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1509", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.500321443614354, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1510", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.62978476777576, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1511", "isFavor": false, "paidOnly": true, "status": null, "title": "Customer Order Frequency", "titleSlug": "customer-order-frequency", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 89.65669644879756, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1512", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.133269905033735, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1513", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.34436122676013, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1514", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.83984719365266, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1515", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.01890359168242, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1516", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 40.130867738513345, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1517", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.58513756803171, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1518", "isFavor": false, "paidOnly": false, "status": null, "title": "Water Bottles", "titleSlug": "water-bottles", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 55.160558802842516, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1519", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.618913261126785, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1520", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.145311381531855, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1521", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.3211137897167, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1522", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.71314796376038, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1523", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.90611837363538, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1524", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 68.41385256502372, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1525", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.67588009876323, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1526", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.90818786578411, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1527", "isFavor": false, "paidOnly": false, "status": null, "title": "Patients With a Condition", "titleSlug": "patients-with-a-condition", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 85.18838725613995, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1528", "isFavor": false, "paidOnly": false, "status": null, "title": "Shuffle String", "titleSlug": "shuffle-string", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 73.64509718612938, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1529", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.76193009014906, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1530", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.06196693824893, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1531", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.03063993860782, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1532", "isFavor": false, "paidOnly": true, "status": null, "title": "The Most Recent Three Orders", "titleSlug": "the-most-recent-three-orders", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.58030056729589, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1533", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 85.51485502923278, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1534", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Good Triplets", "titleSlug": "count-good-triplets", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.796053365045154, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1535", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.3469252810227, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1536", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.24220863081459, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1537", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.67569844166783, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1538", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 62.709146760473345, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1539", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.34891004180873, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1540", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.3157313029596, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1541", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.64765814333053, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1542", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.877571911147506, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1543", "isFavor": false, "paidOnly": true, "status": null, "title": "Fix Product Name Format", "titleSlug": "fix-product-name-format", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 68.31002860249407, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1544", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.181340633008, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1545", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 48.3009884893966, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1546", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.36940779116695, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1547", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.30935444010286, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1548", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.86168023777282, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1549", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 69.52560695986159, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1550", "isFavor": false, "paidOnly": false, "status": null, "title": "Three Consecutive Odds", "titleSlug": "three-consecutive-odds", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 82.4569598291739, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1551", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.54657525922802, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1552", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.80505396651768, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1553", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.81688596491228, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1554", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 51.9958263570406, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1555", "isFavor": false, "paidOnly": true, "status": null, "title": "Bank Account Summary", "titleSlug": "bank-account-summary", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 53.52674508603166, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1556", "isFavor": false, "paidOnly": false, "status": null, "title": "Thousand Separator", "titleSlug": "thousand-separator", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 81.2713999125149, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1557", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.721427300683665, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1558", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.179280424207896, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1559", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.37485079496443, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1560", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.58727390413175, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1561", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.310845874416195, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1562", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Latest Group of Size M", "titleSlug": "find-latest-group-of-size-m", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.400551691458936, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1563", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.28635911559941, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1564", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 82.11285700168001, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1565", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 43.58816781383153, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1566", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.51280090119675, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1567", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.942287667373115, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1568", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.6829481221506, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1569", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 89.91678834519551, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1570", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 87.44037036385079, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1571", "isFavor": false, "paidOnly": true, "status": null, "title": "Warehouse Manager", "titleSlug": "warehouse-manager", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 83.86665240695994, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1572", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.01759237996346, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1573", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.38344554986099, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1574", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 64.91736972197822, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1575", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.19798136645963, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1576", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.39860534276778, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1577", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.37521753636126, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1578", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.32703119583185, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1579", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.73208722741433, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1580", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 67.54659995836612, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1581", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.72937258410421, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1582", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.20210358141392, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1583", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.55226730635788, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1584", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.672287552695806, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1585", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.337017416822285, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1586", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 83.24172334553516, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1587", "isFavor": false, "paidOnly": false, "status": null, "title": "Bank Account Summary II", "titleSlug": "bank-account-summary-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 83.62597789643611, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1588", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.61423192192423, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1589", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.41447203721585, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1590", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 60.267003134030695, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1591", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.019908954522336, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1592", "isFavor": false, "paidOnly": false, "status": null, "title": "Rearrange Spaces Between Words", "titleSlug": "rearrange-spaces-between-words", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 68.42055594090473, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1593", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 35.14067098293114, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1594", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.788715118061944, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1595", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.75910364145659, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1596", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 62.52010257747642, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1597", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 71.61614360898176, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1598", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.12275093615855, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1599", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.81413777085552, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1600", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.49829887464014, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1601", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.03592063831739, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1602", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 87.11583862474022, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1603", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.023638232271324, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1604", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.81934388129079, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1605", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.58964692235192, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1606", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.317816608252244, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1607", "isFavor": false, "paidOnly": true, "status": null, "title": "Sellers With No Sales", "titleSlug": "sellers-with-no-sales", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 66.712165871424, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1608", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.75408397097601, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1609", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.77217617221329, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1610", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.21487820784183, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1611", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.29351095831544, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1612", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.92161520190024, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1613", "isFavor": false, "paidOnly": true, "status": null, "title": "Find the Missing IDs", "titleSlug": "find-the-missing-ids", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 84.48651924188526, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1614", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.63919836320964, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1615", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximal Network Rank", "titleSlug": "maximal-network-rank", "topicTags": [ { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 31.701342528832306, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1616", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.6650466562986, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1617", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.53716216216216, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1618", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 70.75609019252424, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1619", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.606813394348805, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1620", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.92061158482799, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1621", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 17.62879730528009, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1622", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.93621324857328, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1623", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.23732397410754, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1624", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.61024026285168, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1625", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.48184158618058, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1626", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.667934235544124, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1627", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.40006842675486, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1628", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.34728006867389, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1629", "isFavor": false, "paidOnly": false, "status": null, "title": "Slowest Key", "titleSlug": "slowest-key", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 83.74664192538843, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1630", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.08451179738063, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1631", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.59593351621753, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1632", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.36635340948895, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1633", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.82419458885136, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1634", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 48.41978062836959, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1635", "isFavor": false, "paidOnly": true, "status": null, "title": "Hopper Company Queries I", "titleSlug": "hopper-company-queries-i", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 80.39842215004612, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1636", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 87.10121934635782, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1637", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.95429440486673, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1638", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.85183652308778, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1639", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.08005035497703, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1640", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.01164419506689, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1641", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.460128996435884, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1642", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.07221874347735, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1643", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.01824971390712, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1644", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 39.79601990049751, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1645", "isFavor": false, "paidOnly": true, "status": null, "title": "Hopper Company Queries II", "titleSlug": "hopper-company-queries-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 51.15858042867904, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1646", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 61.37345986473025, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1647", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.87339570545478, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1648", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.505511365930474, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1649", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.68343354194847, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1650", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 65.7665645655328, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1651", "isFavor": false, "paidOnly": true, "status": null, "title": "Hopper Company Queries III", "titleSlug": "hopper-company-queries-iii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 79.28618706986612, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1652", "isFavor": false, "paidOnly": false, "status": null, "title": "Defuse the Bomb", "titleSlug": "defuse-the-bomb", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 65.60839029871711, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1653", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.313410243575905, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1654", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.97549019607843, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1655", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.28612719109516, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1656", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.20616571755976, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1657", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.18556204489594, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1658", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.08233315939004, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1659", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.18975650713686, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1660", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 67.80140689322708, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1661", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.87856103139946, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1662", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.21531100478468, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1663", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.80171606228872, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1664", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.807128355515445, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1665", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.89782465392221, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1666", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.75769583879346, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1667", "isFavor": false, "paidOnly": false, "status": null, "title": "Fix Names in a Table", "titleSlug": "fix-names-in-a-table", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 40.101431145593885, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1668", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.51583786420626, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1669", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.4202276655343, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1670", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.85782210583013, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1671", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 88.59090554881433, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1672", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.1602766440821, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1673", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.6170935333239, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1674", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.937706989715885, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1675", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.1962652028845, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1676", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 38.442477876106196, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1677", "isFavor": false, "paidOnly": true, "status": null, "title": "Product's Worth Over Invoices", "titleSlug": "products-worth-over-invoices", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 87.82484271993141, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1678", "isFavor": false, "paidOnly": false, "status": null, "title": "Goal Parser Interpretation", "titleSlug": "goal-parser-interpretation", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.55063016591995, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1679", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.76299466269173, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1680", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.30628231239229, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1681", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.20730021949436, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1682", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 85.3935924325248, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1683", "isFavor": false, "paidOnly": false, "status": null, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 88.33806395862432, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1684", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 68.13233036704415, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1685", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.71601786853861, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1686", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.58253725640046, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1687", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.15470507937528, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1688", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 88.67447679545731, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1689", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.531338890225435, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1690", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.846647508152294, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1691", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.48267117497887, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1692", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 86.69898234804573, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1693", "isFavor": false, "paidOnly": false, "status": null, "title": "Daily Leads and Partners", "titleSlug": "daily-leads-and-partners", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 67.1731377040624, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1694", "isFavor": false, "paidOnly": false, "status": null, "title": "Reformat Phone Number", "titleSlug": "reformat-phone-number", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 63.93430608454278, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1695", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.12621311244835, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1696", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.931638913234, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1697", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.53927671909899, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1698", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 80.79945390757703, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1699", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 78.88931878946612, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1700", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.04689782715556, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1701", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.65515865096787, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1702", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.02713487629689, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1703", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.67693775436673, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1704", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.90929174214642, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1705", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 72.1171233145957, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1706", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.41083841679671, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1707", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.49022147390234, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1708", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 69.89774957776054, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1709", "isFavor": false, "paidOnly": true, "status": null, "title": "Biggest Window Between Visits", "titleSlug": "biggest-window-between-visits", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.42011497314152, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1710", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.97601441216449, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1711", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.696070541306554, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1712", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.03395784543326, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1713", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.47400060114217, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1714", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 75.80846288137002, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1715", "isFavor": false, "paidOnly": true, "status": null, "title": "Count Apples and Oranges", "titleSlug": "count-apples-and-oranges", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 78.6073814361794, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1716", "isFavor": false, "paidOnly": false, "status": null, "title": "Calculate Money in Leetcode Bank", "titleSlug": "calculate-money-in-leetcode-bank", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 66.5380006870875, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1717", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.94988236221921, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1718", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 44.463945059137735, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1719", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 87.11156417887372, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1720", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.75553276211818, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1721", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.60326248598687, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1722", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.26640196634524, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1723", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.676767676767675, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1724", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 79.13180817459558, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1725", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.12219777074053, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1726", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 75.18678649502064, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1727", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.7228743727846, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1728", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.44449371556688, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1729", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Followers Count", "titleSlug": "find-followers-count", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.860295057293364, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1730", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 52.47529298137026, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1731", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.83925640538345, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1732", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.151639498550615, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1733", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.31309051315374, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1734", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.49852355886506, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1735", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.27066866054262, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1736", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.32714506723789, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1737", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.57021805445713, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1738", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.98943560888787, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1739", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.0479882829327, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1740", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 86.73463366363599, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1741", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.41123916311346, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1742", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.82888082954487, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1743", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 35.233160621761655, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1744", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.88449329884787, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1745", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.2857487340246, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1746", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 62.11232550589762, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1747", "isFavor": false, "paidOnly": true, "status": null, "title": "Leetflex Banned Accounts", "titleSlug": "leetflex-banned-accounts", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 79.31081851462639, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1748", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.39288097524454, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1749", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 55.95997289444614, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1750", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.75326526245241, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1751", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.29106071360451, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1752", "isFavor": false, "paidOnly": false, "status": null, "title": "Check if Array Is Sorted and Rotated", "titleSlug": "check-if-array-is-sorted-and-rotated", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 68.13772113372646, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1753", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.302290586858376, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1754", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.287804048307535, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1755", "isFavor": false, "paidOnly": false, "status": null, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 77.77812975164724, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1756", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 89.08314243421836, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1757", "isFavor": false, "paidOnly": false, "status": null, "title": "Recyclable and Low Fat Products", "titleSlug": "recyclable-and-low-fat-products", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 63.70641853248845, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1758", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.300129867170945, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1759", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.95112775055516, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1760", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 43.749114661210356, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1761", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 80.8327745843284, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1762", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 62.939457654370614, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1763", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.94345027083747, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1764", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.3143956951974, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1765", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 42.7875608842263, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1766", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.25592582874135, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1767", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 82.1959500731845, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1768", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 90.10457717921479, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1769", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 42.58268017587459, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1770", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.630197483543036, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1771", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.07010385756676, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1772", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 85.05939902166317, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1773", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.97579160652091, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1774", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.150554266563546, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1775", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.788646320362254, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1776", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.35294117647058, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1777", "isFavor": false, "paidOnly": true, "status": null, "title": "Product's Price for Each Store", "titleSlug": "products-price-for-each-store", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 44.28514536041418, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1778", "isFavor": false, "paidOnly": true, "status": null, "title": "Shortest Path in a Hidden Grid", "titleSlug": "shortest-path-in-a-hidden-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": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" }, { "name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.57681115522333, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1779", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.34316308287757, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1780", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 72.16240558409923, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1781", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.170955796184316, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1782", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Pairs Of Nodes", "titleSlug": "count-pairs-of-nodes", "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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 83.09848290048856, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1783", "isFavor": false, "paidOnly": true, "status": null, "title": "Grand Slam Titles", "titleSlug": "grand-slam-titles", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 39.16639452498261, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1784", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.502116245449635, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1785", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.33611276040994, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1786", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.21439317953862, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1787", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.14545454545456, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1788", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.6753429404211, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1789", "isFavor": false, "paidOnly": false, "status": null, "title": "Primary Department for Each Employee", "titleSlug": "primary-department-for-each-employee", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 49.47200300020725, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1790", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 86.6663828428503, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1791", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Center of Star Graph", "titleSlug": "find-center-of-star-graph", "topicTags": [ { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.32020137238692, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1792", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 64.30874250771932, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1793", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.07740528754428, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1794", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 85.62230716112781, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1795", "isFavor": false, "paidOnly": false, "status": null, "title": "Rearrange Products Table", "titleSlug": "rearrange-products-table", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.53892551550007, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1796", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.04626703142015, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1797", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.77095610186652, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1798", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.90508235980807, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1799", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.36089649054566, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1800", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Ascending Subarray Sum", "titleSlug": "maximum-ascending-subarray-sum", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.47107379709327, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1801", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.830326095884786, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1802", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Value at a Given Index in a Bounded Array", "titleSlug": "maximum-value-at-a-given-index-in-a-bounded-array", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 45.908796895213456, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1803", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.17610772587076, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1804", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 39.448404706381176, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1805", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.32160538649416, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1806", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.74070090526128, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1807", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.362734207213215, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1808", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 58.71328053513394, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1809", "isFavor": false, "paidOnly": true, "status": null, "title": "Ad-Free Sessions", "titleSlug": "ad-free-sessions", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 58.76554273552145, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1810", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Path Cost in a Hidden Grid", "titleSlug": "minimum-path-cost-in-a-hidden-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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" }, { "name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive" }, { "name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 60.51083133361822, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1811", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Interview Candidates", "titleSlug": "find-interview-candidates", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 79.52972702376395, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1812", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.566041854041465, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1813", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 48.48381874551369, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1814", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.86071743757462, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1815", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.22831606743856, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1816", "isFavor": false, "paidOnly": false, "status": null, "title": "Truncate Sentence", "titleSlug": "truncate-sentence", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 80.64481176937987, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1817", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.629366153587878, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1818", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.586643486148375, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1819", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.84653465346535, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1820", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 87.61245674740485, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1821", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.88242130391542, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1822", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.11524438184232, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1823", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.10969781427409, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1824", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.39626826162233, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1825", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.22175449146808, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1826", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 81.39476649555529, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1827", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.57978702956214, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1828", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.77339360981372, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1829", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 50.35411471321696, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1830", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.36592363716619, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1831", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximum Transaction Each Day", "titleSlug": "maximum-transaction-each-day", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 83.95001631436458, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1832", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.04226777822583, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1833", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 46.82816802191885, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1834", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.99761946969888, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1835", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.47320766498848, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1836", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 78.2510000110194, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1837", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.33538904149419, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1838", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.944834260827484, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1839", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.890759189282036, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1840", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.49488054607509, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1841", "isFavor": false, "paidOnly": true, "status": null, "title": "League Statistics", "titleSlug": "league-statistics", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 53.84677944046844, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1842", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 44.77630950485592, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1843", "isFavor": false, "paidOnly": true, "status": null, "title": "Suspicious Bank Accounts", "titleSlug": "suspicious-bank-accounts", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 82.34143853086209, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1844", "isFavor": false, "paidOnly": false, "status": null, "title": "Replace All Digits with Characters", "titleSlug": "replace-all-digits-with-characters", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 66.61453710356876, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1845", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.72672708014593, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1846", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.221802406940945, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1847", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 54.24532868622326, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1848", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.05320413200475, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1849", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 71.59990074715338, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1850", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.92275479905779, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1851", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.05520301541104, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1852", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 85.293458781362, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1853", "isFavor": false, "paidOnly": true, "status": null, "title": "Convert Date Format", "titleSlug": "convert-date-format", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 62.986073881983316, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1854", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.01091129521115, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1855", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.26189612929453, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1856", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.49602237114894, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1857", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.813674860566, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1858", "isFavor": false, "paidOnly": true, "status": null, "title": "Longest Word With All Prefixes", "titleSlug": "longest-word-with-all-prefixes", "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": true, "hasVideoSolution": false }, { "acRate": 83.87536832914985, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1859", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.71781147784716, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1860", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.17895047169812, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1861", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 30.040429832960953, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1862", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 90.07669661383363, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1863", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.617048907820575, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1864", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.709246566064316, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1865", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 58.13095704400052, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1866", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.76098444813529, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1867", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.47374034107986, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1868", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.74270596485263, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1869", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.417741681186605, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1870", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.859172794432734, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1871", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.2780269058296, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1872", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.18117555019512, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1873", "isFavor": false, "paidOnly": false, "status": null, "title": "Calculate Special Bonus", "titleSlug": "calculate-special-bonus", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 89.07222404192598, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1874", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 65.87406228688339, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1875", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 75.96181733351828, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1876", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.5200649696155, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1877", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.54137738813156, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1878", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.57472660996355, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1879", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.8552475171594, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1880", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.70744667944581, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1881", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.59501666959115, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1882", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.395131616190206, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1883", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.09346446779603, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1884", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.24201853759011, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1885", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 58.51630963178535, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1886", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.34379043620784, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1887", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.69768811315644, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1888", "isFavor": false, "paidOnly": false, "status": null, "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": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 32.88545171083942, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1889", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.29148532459969, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1890", "isFavor": false, "paidOnly": false, "status": null, "title": "The Latest Login in 2020", "titleSlug": "the-latest-login-in-2020", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.85354142396618, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1891", "isFavor": false, "paidOnly": true, "status": null, "title": "Cutting Ribbons", "titleSlug": "cutting-ribbons", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 45.09776405650669, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1892", "isFavor": false, "paidOnly": true, "status": null, "title": "Page Recommendations II", "titleSlug": "page-recommendations-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 50.582093185270985, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1893", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.15981475527876, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1894", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.76969046889366, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1895", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.900994200497095, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1896", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.77246422810535, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1897", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.24919529466846, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1898", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.18379642852285, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1899", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.24676886083559, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1900", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 53.68879859636162, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1901", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.42792109256449, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1902", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 66.09309227973954, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1903", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.361203134037964, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1904", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.87806459623901, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1905", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.97194046498658, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1906", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.16343845382001, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1907", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Salary Categories", "titleSlug": "count-salary-categories", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.65393314903241, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1908", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 28.986949670225847, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1909", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.28714432163748, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1910", "isFavor": false, "paidOnly": false, "status": null, "title": "Remove All Occurrences of a Substring", "titleSlug": "remove-all-occurrences-of-a-substring", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 58.714085087061655, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1911", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.99528090801839, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1912", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.94640532816975, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1913", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.79386619622744, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1914", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.6560345089462, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1915", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.08904810644831, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1916", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 28.212176746080225, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1917", "isFavor": false, "paidOnly": true, "status": null, "title": "Leetcodify Friends Recommendations", "titleSlug": "leetcodify-friends-recommendations", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 52.56697515830492, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1918", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 42.82660332541568, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1919", "isFavor": false, "paidOnly": true, "status": null, "title": "Leetcodify Similar Friends", "titleSlug": "leetcodify-similar-friends", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 91.07665851007548, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1920", "isFavor": false, "paidOnly": false, "status": null, "title": "Build Array from Permutation", "titleSlug": "build-array-from-permutation", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 50.855928652660566, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1921", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.03824031320224, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1922", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Good Numbers", "titleSlug": "count-good-numbers", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 28.653101370873546, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1923", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.41736227045075, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1924", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 69.3396059148237, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1925", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.85720727255618, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1926", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.73599586736835, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1927", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.412834281461, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1928", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 90.54601712441847, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1929", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.95672354948806, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1930", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.10853327172921, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1931", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 36.52861796184272, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1932", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.81985624438454, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1933", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.30618425745734, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1934", "isFavor": false, "paidOnly": false, "status": null, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 74.91526107658785, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1935", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.48569651741293, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1936", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.01659172808727, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1937", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.15045929680076, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1938", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.768467980500816, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1939", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 81.27372181290467, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1940", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 78.89850963754505, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1941", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.37871512882008, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1942", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 51.42840278597568, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1943", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.73858911768922, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1944", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.76894639556377, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1945", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.30428659185233, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1946", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.71770585627343, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1947", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.0900875257952, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1948", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 54.28407336946768, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1949", "isFavor": false, "paidOnly": true, "status": null, "title": "Strong Friendship", "titleSlug": "strong-friendship", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 48.06645260365768, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1950", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 69.37372708757637, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1951", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 63.226365523027326, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1952", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.708747471513604, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1953", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.89448604492853, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1954", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.16488838716725, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1955", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.66363276612584, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1956", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.24215969377477, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1957", "isFavor": false, "paidOnly": false, "status": null, "title": "Delete Characters to Make Fancy String", "titleSlug": "delete-characters-to-make-fancy-string", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 49.588794280898554, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1958", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.2177053586427, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1959", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.38808723726692, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1960", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.63631903324887, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1961", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.8863224551298, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1962", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.05140474217434, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1963", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 62.54318426236997, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1964", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.93479857515331, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1965", "isFavor": false, "paidOnly": false, "status": null, "title": "Employees With Missing Information", "titleSlug": "employees-with-missing-information", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.519747235387044, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1966", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 82.13171459576778, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1967", "isFavor": false, "paidOnly": false, "status": null, "title": "Number of Strings That Appear as Substrings in Word", "titleSlug": "number-of-strings-that-appear-as-substrings-in-word", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 50.288560446104704, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1968", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.67413354811105, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1969", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.45565854216729, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1970", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.273494984186335, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1971", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.052173913043475, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1972", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 77.19457013574662, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1973", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 78.0083726730204, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1974", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.87142639635525, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1975", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 37.20291018463008, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1976", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 21.070811744386873, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1977", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.80580370608483, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1978", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.91742522756827, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1979", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.40368225670804, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1980", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.10962607301008, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1981", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.989724846562304, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1982", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.57427161280051, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1983", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.00676885627778, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1984", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.103497179031315, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1985", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.03654573544297, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1986", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.304555633543906, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1987", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.89588916418062, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1988", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 49.292813455657495, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1989", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 48.8171235448742, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1990", "isFavor": false, "paidOnly": true, "status": null, "title": "Count the Number of Experiments", "titleSlug": "count-the-number-of-experiments", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 68.40949054793253, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1991", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.47940127985697, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1992", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.18336743003555, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1993", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.21860629642731, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1994", "isFavor": false, "paidOnly": false, "status": null, "title": "The Number of Good Subsets", "titleSlug": "the-number-of-good-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": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" }, { "name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 63.714494628494286, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "1995", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.28142338009976, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1996", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.91769547325103, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1997", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.27188298119341, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "1998", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.07692307692308, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "1999", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 86.43675234793633, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2000", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.67462709940101, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2001", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.75170350673093, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2002", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.95281331682487, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2003", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.47144754316069, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2004", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 56.96465696465697, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2005", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 85.0448102331736, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2006", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.61145253376812, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2007", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.437885091368685, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2008", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.184988854964686, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2009", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.12960180315552, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2010", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 89.59054907668582, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2011", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.44921679302629, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2012", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.66570859098406, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2013", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.50043503915352, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2014", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 57.73822933093039, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2015", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 66.31367546071581, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2016", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Difference Between Increasing Elements", "titleSlug": "maximum-difference-between-increasing-elements", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 60.92700733188274, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2017", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 50.2328103670737, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2018", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.545359345305044, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2019", "isFavor": false, "paidOnly": false, "status": null, "title": "The Score of Students Solving Math Expression", "titleSlug": "the-score-of-students-solving-math-expression", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "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" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" }, { "name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 72.05017205017205, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2020", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.41353383458647, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2021", "isFavor": false, "paidOnly": true, "status": null, "title": "Brightest Position on Street", "titleSlug": "brightest-position-on-street", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 71.90520646693071, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2022", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.00257918085215, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2023", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.08008100243111, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2024", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.898274320700025, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2025", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.43463808814259, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2026", "isFavor": false, "paidOnly": true, "status": null, "title": "Low-Quality Problems", "titleSlug": "low-quality-problems", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.916776056707796, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2027", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.386164987929746, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2028", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 29.21603366183147, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2029", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.12056843123396, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2030", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.306584362139915, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2031", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.8592670311565, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2032", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.4954970574354, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2033", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 48.42189198193327, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2034", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 22.304556059298626, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2035", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.873174481168334, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2036", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 87.29319168232169, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2037", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.895876784854806, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2038", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.33419689119171, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2039", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.033544723257556, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2040", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 78.6683766164369, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2041", "isFavor": false, "paidOnly": true, "status": null, "title": "Accepted Candidates From the Interviews", "titleSlug": "accepted-candidates-from-the-interviews", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 72.20237165768033, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2042", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.348267559928814, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2043", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 89.65158392981697, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2044", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 62.447076062529504, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2045", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.9602969860945, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2046", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 30.24338394457332, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2047", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.31430088182381, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2048", "isFavor": false, "paidOnly": false, "status": null, "title": "Next Greater Numerically Balanced Number", "titleSlug": "next-greater-numerically-balanced-number", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 51.56542347511538, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2049", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.7817802917535, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2050", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.74385964912281, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2051", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.76020851433536, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2052", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 82.05213840560074, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2053", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.83218359861359, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2054", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 46.93637305166192, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2055", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.105710589539825, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2056", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.69785418679696, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2057", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Index With Equal Value", "titleSlug": "smallest-index-with-equal-value", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.43425784170613, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2058", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.905583807209595, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2059", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.303652142469716, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2060", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.24923648122642, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2061", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.08689998916459, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2062", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.79983745989042, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2063", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.739544225776136, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2064", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 60.12333211576889, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2065", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.94861984148675, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2066", "isFavor": false, "paidOnly": true, "status": null, "title": "Account Balance", "titleSlug": "account-balance", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 44.8254894807248, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2067", "isFavor": false, "paidOnly": true, "status": null, "title": "Number of Equal Count Substrings", "titleSlug": "number-of-equal-count-substrings", "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 }, { "acRate": 63.86296817077848, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2068", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.18539874745727, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2069", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.05362622686811, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2070", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 50.48778565322047, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2071", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Number of Tasks You Can Assign", "titleSlug": "maximum-number-of-tasks-you-can-assign", "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": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 75.29335071707953, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2072", "isFavor": false, "paidOnly": true, "status": null, "title": "The Winner University", "titleSlug": "the-winner-university", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 71.10450340687386, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2073", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.07356372930326, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2074", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.868384973951194, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2075", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.53625152459683, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2076", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.19335347432024, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2077", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 65.58401832214345, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2078", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.06974452278068, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2079", "isFavor": false, "paidOnly": false, "status": null, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 40.42229301158628, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2080", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.85253642741501, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2081", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 77.52671838550425, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2082", "isFavor": false, "paidOnly": true, "status": null, "title": "The Number of Rich Customers", "titleSlug": "the-number-of-rich-customers", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.32813177286519, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2083", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 86.69117181063439, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2084", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.71216805848528, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2085", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.33188490276085, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2086", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.43130764266234, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2087", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.9679939651921, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2088", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.45842461661023, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2089", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.91192997848384, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2090", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.676236108874214, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2091", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.30319512583146, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2092", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.81843503378552, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2093", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 78.9608559770403, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2094", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 59.4766203438309, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2095", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.34440330846805, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2096", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.45950110921068, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2097", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 35.692880861747796, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2098", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 57.48406131307651, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2099", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 50.75611449733817, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2100", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.488135934965314, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2101", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.64218086842964, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2102", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.30954958856648, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2103", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.09508883995582, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2104", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.319509556437076, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2105", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.08131803901512, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2106", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 60.36209297698787, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2107", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 83.91951293933673, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2108", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.69157715768894, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2109", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 59.72582194213844, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2110", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.62104818704808, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2111", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.42949213714876, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2112", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 70.10902483343429, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2113", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 86.60177349551917, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2114", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.507934082946306, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2115", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 44.921079164721036, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2116", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 24.361177953477714, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2117", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.70103092783505, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2118", "isFavor": false, "paidOnly": true, "status": null, "title": "Build the Equation", "titleSlug": "build-the-equation", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 81.46160325101287, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2119", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.69905003740902, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2120", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.20318696110889, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2121", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.51505372975343, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2122", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.84991273996509, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2123", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.50965098614336, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2124", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.41638758651486, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2125", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.87130589076375, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2126", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.967481543190374, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2127", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 76.17830714873003, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2128", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 67.04401035537774, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2129", "isFavor": false, "paidOnly": false, "status": null, "title": "Capitalize the Title", "titleSlug": "capitalize-the-title", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 81.57159088197558, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2130", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.68405828376489, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2131", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.922853525951304, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2132", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.40417399281401, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2133", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.57743423254311, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2134", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.676711358909685, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2135", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.17151741728101, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2136", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.16944172380019, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2137", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 77.05901783748074, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2138", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 51.71265006031132, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2139", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.263255079106145, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2140", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.8269740348454, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2141", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.971086220369884, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2142", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 52.303961196443005, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2143", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 62.32127464832538, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2144", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.74233825198638, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2145", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 45.50604316216774, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2146", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.73180007122077, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2147", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.35443152105311, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2148", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 84.45824252237819, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2149", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.99166362839096, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2150", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.462646264626464, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2151", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.13196085048937, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2152", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 40.08526453869698, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2153", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 71.2941496567791, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2154", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.66051716316346, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2155", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.20061603307125, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2156", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.974671896944162, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2157", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.49427894031543, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2158", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.216892469181005, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2159", "isFavor": false, "paidOnly": true, "status": null, "title": "Order Two Columns Independently", "titleSlug": "order-two-columns-independently", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 86.16175324427586, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2160", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 89.857936998147, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2161", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 41.14001933725938, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2162", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.96581932570052, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2163", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 62.83603639391602, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2164", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.98168132872695, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2165", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.09627668617783, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2166", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.48747061184701, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2167", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.26263320728772, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2168", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 75.1280500409607, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2169", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.839081756748286, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2170", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.88418173327106, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2171", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.173994613731956, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2172", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.54830860999922, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2173", "isFavor": false, "paidOnly": true, "status": null, "title": "Longest Winning Streak", "titleSlug": "longest-winning-streak", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 67.23905310928492, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2174", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 60.77966352923738, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2175", "isFavor": false, "paidOnly": true, "status": null, "title": "The Change in Global Rankings", "titleSlug": "the-change-in-global-rankings", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 84.04021517455602, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2176", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 64.87334581299977, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2177", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.521488205300614, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2178", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.97895221728115, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2179", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 69.17293233082707, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2180", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 89.6055944055944, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2181", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.91035827222342, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2182", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 30.21885163251104, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2183", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.43480016148567, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2184", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 84.49503624559667, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2185", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 72.91467127928752, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2186", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.185498927188114, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2187", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.67185861914034, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2188", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.28197674418605, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2189", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.27466544547906, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2190", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.986182369174124, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2191", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.99447928916765, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2192", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.288428324697755, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2193", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.01887236590284, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2194", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.3153987365693, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2195", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.65066259834276, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2196", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.81109071223462, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2197", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.444854297307266, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2198", "isFavor": false, "paidOnly": true, "status": null, "title": "Number of Single Divisor Triplets", "titleSlug": "number-of-single-divisor-triplets", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 50.040766408479406, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2199", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 77.43253703937064, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2200", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 56.54808892057752, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2201", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 23.640020110608344, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2202", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.18151728370706, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2203", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.04736781741026, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2204", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 50.767246937459696, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2205", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 79.26765923244739, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2206", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 35.415929475838084, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2207", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.26939508389573, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2208", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.73884954652752, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2209", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.30815027715049, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2210", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Hills and Valleys in an Array", "titleSlug": "count-hills-and-valleys-in-an-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 44.64221301789868, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2211", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.82331631812943, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2212", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.55678670360111, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2213", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.78196500672948, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2214", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 81.04419524225483, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2215", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.28550105779589, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2216", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.51899750523327, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2217", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.35354714221247, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2218", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.521608850985366, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2219", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 87.67571461983273, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2220", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Bit Flips to Convert Number", "titleSlug": "minimum-bit-flips-to-convert-number", "topicTags": [ { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 78.92221249270285, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2221", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.51859633944113, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2222", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.959270422752915, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2223", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.84140698893121, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2224", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.54622306995704, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2225", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.02176238620631, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2226", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 37.20693652558612, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2227", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.43229927769195, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2228", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.80103488566182, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2229", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.78783437156468, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2230", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.23166814296233, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2231", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.86134588638065, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2232", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.64886224281238, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2233", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.925474254742547, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2234", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 87.94497034598486, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2235", "isFavor": false, "paidOnly": false, "status": null, "title": "Add Two Integers", "titleSlug": "add-two-integers", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 84.94007462606781, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2236", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.50170881749829, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2237", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.15320910973085, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2238", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 47.40811521878915, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2239", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Closest Number to Zero", "titleSlug": "find-closest-number-to-zero", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.2395014050456, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2240", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.87420788112754, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2241", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.32327044025158, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2242", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.80108074348635, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2243", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.03109576644334, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2244", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.82040502849752, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2245", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.842061636293906, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2246", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.503893724232704, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2247", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.49123922566059, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2248", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.71311698936461, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2249", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.382643268439814, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2250", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Number of Rectangles Containing Each Point", "titleSlug": "count-number-of-rectangles-containing-each-point", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "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 }, { "acRate": 57.40633543291743, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2251", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.77209434498437, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2252", "isFavor": false, "paidOnly": true, "status": null, "title": "Dynamic Pivoting of a Table", "titleSlug": "dynamic-pivoting-of-a-table", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.23879040667362, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2253", "isFavor": false, "paidOnly": true, "status": null, "title": "Dynamic Unpivoting of a Table", "titleSlug": "dynamic-unpivoting-of-a-table", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 63.566388710712, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2254", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.05290193700282, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2255", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.63158769435314, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2256", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.67909374250779, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2257", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 36.61530947517983, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2258", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.67724042295025, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2259", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.95898745802601, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2260", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.33585604161297, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2261", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.92664776754075, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2262", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.39723291969763, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2263", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.77874625526366, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2264", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.60990489689982, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2265", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.242354500764094, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2266", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.62843091925518, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2267", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.32598202723385, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2268", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 62.15848578296119, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2269", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.009777117010415, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2270", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 35.16409682143164, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2271", "isFavor": false, "paidOnly": false, "status": null, "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": "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 }, { "acRate": 45.94770431873103, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2272", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.88965497028891, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2273", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.268127479288665, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2274", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.82361473591708, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2275", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 34.7352322691646, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2276", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.18840724797276, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2277", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.69592829293782, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2278", "isFavor": false, "paidOnly": false, "status": null, "title": "Percentage of Letter in String", "titleSlug": "percentage-of-letter-in-string", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 67.77222676012639, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2279", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.315515310419073, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2280", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 28.666039331530733, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2281", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.476708074534166, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2282", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.68124823229942, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2283", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.72432887082078, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2284", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.13439230570938, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2285", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 17.921585160202362, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2286", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.47131746681481, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2287", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.15311491158499, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2288", "isFavor": false, "paidOnly": false, "status": null, "title": "Apply Discount to Prices", "titleSlug": "apply-discount-to-prices", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 23.43054910733128, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2289", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.21785107397402, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2290", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 46.82516577713084, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2291", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 40.33220114323585, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2292", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 63.84573554970305, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2293", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.82078658463024, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2294", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 59.09986991564633, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2295", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.12420386527688, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2296", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.95335540174541, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2297", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 81.69573643410853, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2298", "isFavor": false, "paidOnly": true, "status": null, "title": "Tasks Count in the Weekend", "titleSlug": "tasks-count-in-the-weekend", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 55.116387578412564, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2299", "isFavor": false, "paidOnly": false, "status": null, "title": "Strong Password Checker II", "titleSlug": "strong-password-checker-ii", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 45.914277019944926, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2300", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.54874827022267, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2301", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.41586753231282, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2302", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 67.90260631001371, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2303", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.50524109014675, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2304", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.56639299936089, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2305", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.42083994804445, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2306", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.51932074163923, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2307", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 70.42367545201044, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2308", "isFavor": false, "paidOnly": true, "status": null, "title": "Arrange Table by Gender", "titleSlug": "arrange-table-by-gender", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 71.34459955914768, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2309", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.536783703663414, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2310", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.913472765735, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2311", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 52.00478104965772, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2312", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.691026716185455, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2313", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 73.36202773792444, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2314", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 82.93872123517896, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2315", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 49.480747365688146, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2316", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.56389452332657, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2317", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.74975836921185, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2318", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.83169013386708, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2319", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.13103609634357, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2320", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.79214090745223, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2321", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.44774091269392, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2322", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 65.73441617813155, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2323", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 75.62559276282191, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2324", "isFavor": false, "paidOnly": true, "status": null, "title": "Product Sales Analysis IV", "titleSlug": "product-sales-analysis-iv", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 85.62957837942817, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2325", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.23557681004038, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2326", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 46.53240291840854, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2327", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.539142649124486, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2328", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.75749946047047, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2329", "isFavor": false, "paidOnly": true, "status": null, "title": "Product Sales Analysis V", "titleSlug": "product-sales-analysis-v", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 75.68370298939247, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2330", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 82.40956035354982, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2331", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.03753521766791, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2332", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.119606358819077, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2333", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Sum of Squared Difference", "titleSlug": "minimum-sum-of-squared-difference", "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": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 44.792594391817126, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2334", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.40040846210165, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2335", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.56762154508498, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2336", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.79732453078722, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2337", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 56.98026803151728, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2338", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 88.50892632637667, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2339", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 72.22122140154927, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2340", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 75.63160230803373, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2341", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.96650147144092, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2342", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 46.07781047821282, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2343", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.905518845401474, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2344", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.61814823072268, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2345", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 34.018036072144284, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2346", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.33475863074269, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2347", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.17984883250101, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2348", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.13207812719908, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2349", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 69.00149031296571, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2350", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.43594769833919, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2351", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.6503742099902, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2352", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.034280117531836, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2353", "isFavor": false, "paidOnly": false, "status": null, "title": "Design a Food Rating System", "titleSlug": "design-a-food-rating-system", "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": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 48.383352677831205, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2354", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.345094176293244, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2355", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 89.35773482134675, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2356", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.59176256814052, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2357", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.2797833648333, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2358", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.898817533993046, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2359", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.070542497935975, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2360", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Cycle in a Graph", "titleSlug": "longest-cycle-in-a-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 }, { "acRate": 77.68595041322314, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2361", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.23284572462676, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2362", "isFavor": false, "paidOnly": true, "status": null, "title": "Generate the Invoice", "titleSlug": "generate-the-invoice", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 77.03614507858077, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2363", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.306805158239555, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2364", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 54.1753854037665, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2365", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.18892811249132, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2366", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.1564648017841, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2367", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.737569060773474, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2368", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.05103471063809, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2369", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.74175536823971, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2370", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.61855670103093, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2371", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 83.78286104472517, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2372", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 87.76270569967032, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2373", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.74318984263567, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2374", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.75127613157393, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2375", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 40.49516971968537, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2376", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.47302140850529, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2377", "isFavor": false, "paidOnly": true, "status": null, "title": "Sort the Olympic Table", "titleSlug": "sort-the-olympic-table", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.24820453892559, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2378", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.45677088743464, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2379", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 51.82707421311752, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2380", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.37126787034542, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2381", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 48.82692961577695, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2382", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.03243267275011, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2383", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.660318113965104, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2384", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.45511488138436, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2385", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.12694862856016, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2386", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.14243482934694, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2387", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 51.720914421687766, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2388", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 73.05296795096235, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2389", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.37054531385068, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2390", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.11612973506023, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2391", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.25499673313233, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2392", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 71.29450731438035, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2393", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 41.836218880323514, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2394", "isFavor": false, "paidOnly": true, "status": null, "title": "Employees With Deductions", "titleSlug": "employees-with-deductions", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 66.51329037454691, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2395", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 89.1827625860019, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2396", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.988288814434576, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2397", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.22560345979567, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2398", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 71.06678834746272, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2399", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.37679019636793, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2400", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.79395902397437, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2401", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 48.94295773855724, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2402", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.58409387222947, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2403", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 52.48280080853931, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2404", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.30801640324042, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2405", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.620728609040064, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2406", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 25.55605615100066, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2407", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.96854859499871, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2408", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 46.906614465957134, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2409", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.06312534600791, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2410", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 62.063636670378244, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2411", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 41.58216328653146, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2412", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 88.11130322326713, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2413", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.86305405707435, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2414", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.65913530793063, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2415", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 60.741758383114906, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2416", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 45.09869521579123, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2417", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 84.78333349209827, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2418", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.40602273622305, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2419", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 40.19212891230245, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2420", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.08194506978839, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2421", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.87991625542097, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2422", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 18.379191384911294, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2423", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.164693285011225, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2424", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Uploaded Prefix", "titleSlug": "longest-uploaded-prefix", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "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 }, { "acRate": 66.96116713535976, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2425", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 45.91720067005238, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2426", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.64399328019445, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2427", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.03691573050905, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2428", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.43509994949058, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2429", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimize XOR", "titleSlug": "minimize-xor", "topicTags": [ { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 34.97561290045336, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2430", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.6097046413502, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2431", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.855914828446515, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2432", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 88.19099261937039, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2433", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.53525860309915, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2434", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 44.527576208290135, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2435", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.92539233341908, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2436", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 47.61059405552872, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2437", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.3119193389562, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2438", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 46.4031289973433, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2439", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimize Maximum of Array", "titleSlug": "minimize-maximum-of-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 52.66990291262136, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2440", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.5818984910998, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2441", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.63408668870873, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2442", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 48.59985801377041, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2443", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.37904501763575, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2444", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.67386448250187, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2445", "isFavor": false, "paidOnly": true, "status": null, "title": "Number of Nodes With Value One", "titleSlug": "number-of-nodes-with-value-one", "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 }, { "acRate": 52.57756711812256, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2446", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.51420286034403, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2447", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.454420235411966, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2448", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.012791970114336, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2449", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.667649950835795, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2450", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.466589440312156, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2451", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.42354023194778, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2452", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.01519572549168, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2453", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.618519751158445, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2454", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.1349529286347, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2455", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.636170428094324, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2456", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.28206295525494, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2457", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.93613944895173, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2458", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 45.09836892550866, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2459", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.72054551157834, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2460", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 42.687785996186086, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2461", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 43.32523634070432, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2462", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.94490517111889, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2463", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 54.84109386548411, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2464", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 58.61218677826593, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2465", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.11490894264746, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2466", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.46310387090185, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2467", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 42.12547731107362, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2468", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 90.20278332731029, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2469", "isFavor": false, "paidOnly": false, "status": null, "title": "Convert the Temperature", "titleSlug": "convert-the-temperature", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 40.561228348838966, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2470", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.24654955663567, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2471", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 42.09965842877235, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2472", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Number of Non-overlapping Palindrome Substrings", "titleSlug": "maximum-number-of-non-overlapping-palindrome-substrings", "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 67.07901802838512, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2473", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 48.643795482468576, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2474", "isFavor": false, "paidOnly": true, "status": null, "title": "Customers With Strictly Increasing Purchases", "titleSlug": "customers-with-strictly-increasing-purchases", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 72.78904412054622, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2475", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.25091817803188, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2476", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.4344864389754, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2477", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.23798532043468, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2478", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.49161364950838, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2479", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 79.75062942093274, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2480", "isFavor": false, "paidOnly": true, "status": null, "title": "Form a Chemical Bond", "titleSlug": "form-a-chemical-bond", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 55.45431490471705, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2481", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.34976431468557, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2482", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.70512255981212, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2483", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.808578518255935, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2484", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.8018890388126, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2485", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.95163671094903, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2486", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.47739065974797, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2487", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.405910951190705, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2488", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.780303030303024, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2489", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 70.3399423644394, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2490", "isFavor": false, "paidOnly": false, "status": null, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 68.92801453442627, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2491", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 58.06030626143352, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2492", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.23166090791841, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2493", "isFavor": false, "paidOnly": false, "status": null, "title": "Divide Nodes Into the Maximum Number of Groups", "titleSlug": "divide-nodes-into-the-maximum-number-of-groups", "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 }, { "acRate": 36.02846054333765, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2494", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.955710375715356, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2495", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 73.6779582598692, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2496", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.25936496610774, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2497", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.3350234527811, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2498", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.702147003286946, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2499", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.35064689056847, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2500", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.065728527793055, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2501", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 49.02971737652027, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2502", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.419719295614456, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2503", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 79.6298627722523, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2504", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.45476333133612, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2505", "isFavor": false, "paidOnly": true, "status": null, "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" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 72.92631108129262, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2506", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.323621227887614, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2507", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.76924934519718, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2508", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.099770838321305, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2509", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.353463587921844, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2510", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 40.41799732152055, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2511", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.31862383590307, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2512", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.42075403371826, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2513", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.09718392245341, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2514", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.30335039679316, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2515", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.54004202227552, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2516", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 66.9690846635684, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2517", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.719972345573964, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2518", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.360396932792064, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2519", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 85.82958318909701, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2520", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.372291831474726, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2521", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.947736617857736, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2522", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.4992639054189, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2523", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 35.45693151992364, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2524", "isFavor": false, "paidOnly": true, "status": null, "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": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 37.95668399194669, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2525", "isFavor": false, "paidOnly": false, "status": null, "title": "Categorize Box According to Criteria", "titleSlug": "categorize-box-according-to-criteria", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 49.93027326944189, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2526", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.74746159854205, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2527", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.40333143507973, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2528", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.48136560041927, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2529", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 63.87612563849664, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2530", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 27.20229314335744, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2531", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.9182534471438, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2532", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.35197250662276, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2533", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 49.638445314853875, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2534", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 85.1320066750909, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2535", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.70697984341163, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2536", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.9709214643388, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2537", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 32.42048304078131, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2538", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.3272945251099, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2539", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 58.07858603505728, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2540", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.655967977603964, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2541", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.364080853854865, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2542", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.989950191739766, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2543", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.45421361688621, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2544", "isFavor": false, "paidOnly": false, "status": null, "title": "Alternating Digit Sum", "titleSlug": "alternating-digit-sum", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 85.82048516380094, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2545", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.95430333066672, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2546", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.927022365481946, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2547", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.75312165536925, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2548", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.38854397235869, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2549", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.135475089761343, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2550", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.25598787314776, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2551", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.08041009745775, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2552", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.45153336415473, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2553", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.95020254426922, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2554", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 36.049701894159234, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2555", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.43533772005591, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2556", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.20549755517378, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2557", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 75.57199863642744, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2558", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 67.81612414280764, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2559", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 65.00587051733629, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2560", "isFavor": false, "paidOnly": false, "status": null, "title": "House Robber IV", "titleSlug": "house-robber-iv", "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": true, "hasVideoSolution": false }, { "acRate": 57.65876887767939, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2561", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Sort", "id": "VG9waWNUYWdOb2RlOjE4", "slug": "sort" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 71.30154420498897, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2562", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.862529918128445, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2563", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 34.91850910246516, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2564", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.64693849720442, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2565", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.26571767497035, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2566", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 49.27725738195996, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2567", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.06351665375678, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2568", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.684006243935368, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2569", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.88451712628695, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2570", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 58.52787695687998, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2571", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.57990976963309, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2572", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.10692727795343, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2573", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 87.6335413040811, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2574", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.00698860168907, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2575", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.45950924281298, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2576", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.593432145680666, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2577", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 72.51737071880957, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2578", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.15095754195822, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2579", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Total Number of Colored Cells", "titleSlug": "count-total-number-of-colored-cells", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 38.4496012126024, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2580", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.103649802326245, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2581", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.57453050688446, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2582", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.15000398587268, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2583", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 28.257730340605868, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2584", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.89827035002869, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2585", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.7515076219927, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2586", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.88547855164727, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2587", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.43687610099824, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2588", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.43348848240491, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2589", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.098387627509055, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2590", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 19.695541076968045, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2591", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.919906005394765, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2592", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.47388323696602, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2593", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 59.780585560777155, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2594", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 72.92613769508365, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2595", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.00238525857776, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2596", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.84997339457249, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2597", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.184508476606965, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2598", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.83886799668558, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2599", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 59.97802267468275, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2600", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.55272842071536, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2601", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 37.24887999774591, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2602", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.07670764423219, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2603", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.85757884028484, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2604", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 54.49177660254547, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2605", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.225955077750044, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2606", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.17890170110743, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2607", "isFavor": false, "paidOnly": false, "status": null, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 38.201761962342374, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2608", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.70885252464595, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2609", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.33276437671529, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2610", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.58530364651548, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2611", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 15.51433389544688, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2612", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.02144772117963, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2613", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 36.682401327319894, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2614", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.77178205112532, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2615", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.93768320215539, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2616", "isFavor": false, "paidOnly": false, "status": null, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 23.06926709442433, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2617", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 28.47025978005516, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2618", "isFavor": false, "paidOnly": false, "status": null, "title": "Check if Object Instance of Class", "titleSlug": "check-if-object-instance-of-class", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.4388705747456, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2619", "isFavor": false, "paidOnly": false, "status": null, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 82.26002510404969, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2620", "isFavor": false, "paidOnly": false, "status": null, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 87.50951255657468, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2621", "isFavor": false, "paidOnly": false, "status": null, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 75.87822261700823, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2622", "isFavor": false, "paidOnly": false, "status": null, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 64.35741708099944, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2623", "isFavor": false, "paidOnly": false, "status": null, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 67.7696335078534, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2624", "isFavor": false, "paidOnly": false, "status": null, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 64.88172722877226, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2625", "isFavor": false, "paidOnly": false, "status": null, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 85.4112313843311, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2626", "isFavor": false, "paidOnly": false, "status": null, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 91.73427991886409, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2627", "isFavor": false, "paidOnly": false, "status": null, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 39.21573985517147, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2628", "isFavor": false, "paidOnly": true, "status": null, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 86.86979739280666, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2629", "isFavor": false, "paidOnly": false, "status": null, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 37.65987323997116, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2630", "isFavor": false, "paidOnly": false, "status": null, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 81.12365419085266, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2631", "isFavor": false, "paidOnly": false, "status": null, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 89.48451587612702, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2632", "isFavor": false, "paidOnly": true, "status": null, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 77.97359390449601, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2633", "isFavor": false, "paidOnly": true, "status": null, "title": "Convert Object to JSON String", "titleSlug": "convert-object-to-json-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 85.48147547223974, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2634", "isFavor": false, "paidOnly": false, "status": null, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 86.18393436911946, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2635", "isFavor": false, "paidOnly": false, "status": null, "title": "Apply Transform Over Each Element in Array", "titleSlug": "apply-transform-over-each-element-in-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 79.74852564815845, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2636", "isFavor": false, "paidOnly": true, "status": null, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 82.95480993017843, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2637", "isFavor": false, "paidOnly": false, "status": null, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 46.92881480799337, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2638", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 69.6397382008023, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2639", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.2291208401334, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2640", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.55677857273895, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2641", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 64.28256528616997, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2642", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.28544158351872, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2643", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.76722124734474, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2644", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Maximum Divisibility Score", "titleSlug": "find-the-maximum-divisibility-score", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 50.511387075207324, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2645", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.84728149935053, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2646", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.66386554621849, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2647", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 83.53249496391622, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2648", "isFavor": false, "paidOnly": false, "status": null, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 79.97799779977997, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2649", "isFavor": false, "paidOnly": false, "status": null, "title": "Nested Array Generator", "titleSlug": "nested-array-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 54.31072859474699, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2650", "isFavor": false, "paidOnly": false, "status": null, "title": "Design Cancellable Function", "titleSlug": "design-cancellable-function", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 76.06361829025845, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2651", "isFavor": false, "paidOnly": false, "status": null, "title": "Calculate Delayed Arrival Time", "titleSlug": "calculate-delayed-arrival-time", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 85.4909004463932, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2652", "isFavor": false, "paidOnly": false, "status": null, "title": "Sum Multiples", "titleSlug": "sum-multiples", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 34.784442248837266, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2653", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.807535220962784, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2654", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.4796828543112, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2655", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 80.01943602030728, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2656", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 87.01397045187612, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2657", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 70.40743940703015, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2658", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 25.83097389752938, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2659", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.26019639424326, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2660", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.90739847435594, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2661", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 41.245036206493815, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2662", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.395080651047365, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2663", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.62267343485618, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2664", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 81.14196417838683, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2665", "isFavor": false, "paidOnly": false, "status": null, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 86.66912496400951, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2666", "isFavor": false, "paidOnly": false, "status": null, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 82.02784670982125, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2667", "isFavor": false, "paidOnly": false, "status": null, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.9306081251577, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2668", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Latest Salaries", "titleSlug": "find-latest-salaries", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.40434722028702, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2669", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.46700442506253, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2670", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.12061889658152, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2671", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.84084465734676, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2672", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.43563068920676, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2673", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.01212789415656, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2674", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.65235472631224, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2675", "isFavor": false, "paidOnly": true, "status": null, "title": "Array of Objects to Matrix", "titleSlug": "array-of-objects-to-matrix", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 83.1921873807889, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2676", "isFavor": false, "paidOnly": true, "status": null, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 84.49878534314055, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2677", "isFavor": false, "paidOnly": false, "status": null, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 81.30434167527268, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2678", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.537339297948655, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2679", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.702231435190825, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2680", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.331556364581978, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2681", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.18105423987777, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2682", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.82358439905329, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2683", "isFavor": false, "paidOnly": false, "status": null, "title": "Neighboring Bitwise XOR", "titleSlug": "neighboring-bitwise-xor", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 58.813855669357864, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2684", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 77.65124819169851, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2685", "isFavor": false, "paidOnly": false, "status": null, "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": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 69.7912402783463, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2686", "isFavor": false, "paidOnly": true, "status": null, "title": "Immediate Food Delivery III", "titleSlug": "immediate-food-delivery-iii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 80.70075487822248, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2687", "isFavor": false, "paidOnly": true, "status": null, "title": "Bikes Last Time Used ", "titleSlug": "bikes-last-time-used", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 44.79599626770718, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2688", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Active Users", "titleSlug": "find-active-users", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 73.62448418156808, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2689", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 93.35317460317461, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2690", "isFavor": false, "paidOnly": true, "status": null, "title": "Infinite Method Object", "titleSlug": "infinite-method-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 41.288782816229116, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2691", "isFavor": false, "paidOnly": true, "status": null, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 62.95210166177908, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2692", "isFavor": false, "paidOnly": true, "status": null, "title": "Make Object Immutable", "titleSlug": "make-object-immutable", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 78.52348993288591, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2693", "isFavor": false, "paidOnly": false, "status": null, "title": "Call Function with Custom Context", "titleSlug": "call-function-with-custom-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.59916234616874, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2694", "isFavor": false, "paidOnly": false, "status": null, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 89.14569471211333, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2695", "isFavor": false, "paidOnly": false, "status": null, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 77.09425110103373, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2696", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 80.13220712449505, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2697", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.77667860908544, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2698", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 55.87835684452421, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2699", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.20677240439817, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2700", "isFavor": false, "paidOnly": true, "status": null, "title": "Differences Between Two Objects", "titleSlug": "differences-between-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 34.72705331156386, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2701", "isFavor": false, "paidOnly": true, "status": null, "title": "Consecutive Transactions with Increasing Amounts", "titleSlug": "consecutive-transactions-with-increasing-amounts", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 42.59470004877255, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2702", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 94.50210711244759, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2703", "isFavor": false, "paidOnly": false, "status": null, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 63.000905293327214, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2704", "isFavor": false, "paidOnly": false, "status": null, "title": "To Be Or Not To Be", "titleSlug": "to-be-or-not-to-be", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 67.02365015618028, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2705", "isFavor": false, "paidOnly": false, "status": null, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 68.30929331415315, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2706", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.12369548859881, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2707", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 24.99840249920125, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2708", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.764953310339024, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2709", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.87145421238644, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2710", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.03465145991088, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2711", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.67183591795898, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2712", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.829433279584695, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2713", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.624919302776, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2714", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 89.62441891421433, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2715", "isFavor": false, "paidOnly": false, "status": null, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 77.79526021094667, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2716", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.530280130751116, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2717", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.40546517979669, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2718", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.53253958093287, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2719", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.665971442323126, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2720", "isFavor": false, "paidOnly": true, "status": null, "title": "Popularity Percentage", "titleSlug": "popularity-percentage", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 77.89372077154792, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2721", "isFavor": false, "paidOnly": false, "status": null, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.294033495035976, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2722", "isFavor": false, "paidOnly": false, "status": null, "title": "Join Two Arrays by ID", "titleSlug": "join-two-arrays-by-id", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 91.75363162266154, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2723", "isFavor": false, "paidOnly": false, "status": null, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 83.25871365299442, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2724", "isFavor": false, "paidOnly": false, "status": null, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 84.20628337091517, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2725", "isFavor": false, "paidOnly": false, "status": null, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 77.57228063902748, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2726", "isFavor": false, "paidOnly": false, "status": null, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 81.54954505407113, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2727", "isFavor": false, "paidOnly": false, "status": null, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 85.43295684911672, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2728", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 52.55020586505336, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2729", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.67354174990012, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2730", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.315875879780886, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2731", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.27374860302335, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2732", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.11596584260711, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2733", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.01373595874166, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2734", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.08379340837934, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2735", "isFavor": false, "paidOnly": false, "status": null, "title": "Collecting Chocolates", "titleSlug": "collecting-chocolates", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 28.645711158026426, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2736", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.13855309652222, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2737", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 55.05649877917212, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2738", "isFavor": false, "paidOnly": true, "status": null, "title": "Count Occurrences in Text", "titleSlug": "count-occurrences-in-text", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 40.4461910259812, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2739", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.47488281961674, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2740", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 28.838389067191223, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2741", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.657388430182245, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2742", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.16232906925453, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2743", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 81.86376899405265, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2744", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.159961727482276, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2745", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.633807959109163, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2746", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.8278202912861, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2747", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.269539326771984, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2748", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.337121286981954, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2749", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 34.286052818662945, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2750", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.07413195292279, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2751", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.89692642036635, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2752", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.73285198555957, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2753", "isFavor": false, "paidOnly": true, "status": null, "title": "Count Houses in a Circular Street II", "titleSlug": "count-houses-in-a-circular-street-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 86.983842010772, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2754", "isFavor": false, "paidOnly": true, "status": null, "title": "Bind Function to Context", "titleSlug": "bind-function-to-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 64.84312148028962, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2755", "isFavor": false, "paidOnly": true, "status": null, "title": "Deep Merge of Two Objects", "titleSlug": "deep-merge-of-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 66.57420249653259, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2756", "isFavor": false, "paidOnly": true, "status": null, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 74.63592233009709, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2757", "isFavor": false, "paidOnly": true, "status": null, "title": "Generate Circular Array Values", "titleSlug": "generate-circular-array-values", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 85.55891238670695, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2758", "isFavor": false, "paidOnly": true, "status": null, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 61.26482213438735, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2759", "isFavor": false, "paidOnly": true, "status": null, "title": "Convert JSON String to Object", "titleSlug": "convert-json-string-to-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 30.745065497006696, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2760", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.1525116315748, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2761", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.980818589805494, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2762", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 42.60813428018076, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2763", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.1741214057508, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2764", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 34.71873515640904, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2765", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.54480576028546, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2766", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.2077922077922, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2767", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.38142088383976, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2768", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 90.98385638912829, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2769", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Maximum Achievable Number", "titleSlug": "find-the-maximum-achievable-number", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 31.818403519553616, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2770", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.24779025657317, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2771", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.86040829195239, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2772", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.91555812608445, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2773", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 82.2658126501201, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2774", "isFavor": false, "paidOnly": true, "status": null, "title": "Array Upper Bound", "titleSlug": "array-upper-bound", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 71.2570056044836, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2775", "isFavor": false, "paidOnly": true, "status": null, "title": "Undefined to Null", "titleSlug": "undefined-to-null", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 91.05304829770388, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2776", "isFavor": false, "paidOnly": true, "status": null, "title": "Convert Callback Based Function to Promise Based Function", "titleSlug": "convert-callback-based-function-to-promise-based-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 82.9436038514443, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2777", "isFavor": false, "paidOnly": true, "status": null, "title": "Date Range Generator", "titleSlug": "date-range-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 81.37294367066528, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2778", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.17199581932611, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2779", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 75.52784506149096, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2780", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 38.029423508093004, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2781", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.76330076004344, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2782", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 38.470400567174764, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2783", "isFavor": false, "paidOnly": true, "status": null, "title": "Flight Occupancy and Waitlist Analysis", "titleSlug": "flight-occupancy-and-waitlist-analysis", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 48.486622610034644, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2784", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.54969217238347, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2785", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.877065853038395, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2786", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.97139260784987, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2787", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 75.38997866694417, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2788", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.09718103876239, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2789", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 22.43768277398691, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2790", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.079104398796005, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2791", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.4806828391734, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2792", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 78.58980957282553, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2793", "isFavor": false, "paidOnly": true, "status": null, "title": "Status of Flight Tickets", "titleSlug": "status-of-flight-tickets", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 64.17355371900827, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2794", "isFavor": false, "paidOnly": true, "status": null, "title": "Create Object from Two Arrays", "titleSlug": "create-object-from-two-arrays", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 90.19047619047619, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2795", "isFavor": false, "paidOnly": true, "status": null, "title": "Parallel Execution of Promises for Individual Results Retrieval", "titleSlug": "parallel-execution-of-promises-for-individual-results-retrieval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 93.26716738197425, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2796", "isFavor": false, "paidOnly": true, "status": null, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 89.71041281577325, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2797", "isFavor": false, "paidOnly": true, "status": null, "title": "Partial Function with Placeholders", "titleSlug": "partial-function-with-placeholders", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 87.6454377196344, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2798", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.82699114836247, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2799", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 31.05110081504278, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2800", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.687910232317456, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2801", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.00894076741587, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2802", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 86.03213844252163, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2803", "isFavor": false, "paidOnly": true, "status": null, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 89.69816272965879, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2804", "isFavor": false, "paidOnly": true, "status": null, "title": "Array Prototype ForEach", "titleSlug": "array-prototype-foreach", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 83.39719029374201, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2805", "isFavor": false, "paidOnly": true, "status": null, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 55.45120337238371, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2806", "isFavor": false, "paidOnly": false, "status": null, "title": "Account Balance After Rounded Purchase", "titleSlug": "account-balance-after-rounded-purchase", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 91.47299016456233, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2807", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 27.814422879197707, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2808", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.036845448770308, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2809", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.30050121450954, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2810", "isFavor": false, "paidOnly": false, "status": null, "title": "Faulty Keyboard", "titleSlug": "faulty-keyboard", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 34.084295404281434, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2811", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.455377574370715, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2812", "isFavor": false, "paidOnly": false, "status": null, "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": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 28.03642290249433, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2813", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.22283609576427, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2814", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.57310223078157, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2815", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.229095408603214, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2816", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.97411480965549, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2817", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.903941503480745, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2818", "isFavor": false, "paidOnly": false, "status": null, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 43.82022471910113, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2819", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.31320892791804, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2820", "isFavor": false, "paidOnly": true, "status": null, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 73.73086220789685, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2821", "isFavor": false, "paidOnly": true, "status": null, "title": "Delay the Resolution of Each Promise", "titleSlug": "delay-the-resolution-of-each-promise", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 60.01936108422071, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2822", "isFavor": false, "paidOnly": true, "status": null, "title": "Inversion of Object", "titleSlug": "inversion-of-object", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.54648956356736, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2823", "isFavor": false, "paidOnly": true, "status": null, "title": "Deep Object Filter", "titleSlug": "deep-object-filter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 87.574366884227, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2824", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.63492323305071, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2825", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 42.24864827274466, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2826", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 20.369462707252353, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2827", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.6975458002074, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2828", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.197045868418186, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2829", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.48230506075262, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2830", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.74669478465407, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2831", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.31473710195013, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2832", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 64.7948360162906, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2833", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.64801893427707, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2834", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.897296918440297, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2835", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.47074936411661, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2836", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.86018620798485, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2837", "isFavor": false, "paidOnly": true, "status": null, "title": "Total Traveled Distance", "titleSlug": "total-traveled-distance", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 68.52317281592441, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2838", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 47.29579663775, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2839", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.5080273318149, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2840", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.78760619690155, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2841", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.816004856299582, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2842", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.09007663361685, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2843", "isFavor": false, "paidOnly": false, "status": null, "title": " Count Symmetric Integers", "titleSlug": "count-symmetric-integers", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 38.217474062357574, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2844", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.04584334702949, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2845", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 43.79596553897878, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2846", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.1277988287978, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2847", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 73.0149820819481, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2848", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.146162035267785, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2849", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 44.60758440893751, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2850", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.49893754426899, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2851", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.91484790229559, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2852", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 73.98096861241301, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2853", "isFavor": false, "paidOnly": true, "status": null, "title": "Highest Salaries Difference", "titleSlug": "highest-salaries-difference", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.92828685258964, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2854", "isFavor": false, "paidOnly": true, "status": null, "title": "Rolling Average Steps", "titleSlug": "rolling-average-steps", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.89774476437942, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2855", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.759970657840732, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2856", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.284305251919264, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2857", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.63213345039508, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2858", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.80488463095399, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2859", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.32895415265948, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2860", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.41781670006079, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2861", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.928800150687515, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2862", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.02840201305496, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2863", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 82.7911729999375, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2864", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.667124554960616, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2865", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.297964349752135, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2866", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.19484138040839, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2867", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.47087776866284, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2868", "isFavor": false, "paidOnly": true, "status": null, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 61.56309105647122, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2869", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.92562134093896, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2870", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.723766528404795, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2871", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.6, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2872", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 58.169308154973756, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2873", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Value of an Ordered Triplet I", "titleSlug": "maximum-value-of-an-ordered-triplet-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 56.49809343787074, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2874", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Value of an Ordered Triplet II", "titleSlug": "maximum-value-of-an-ordered-triplet-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 31.413306398022385, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2875", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.496631354490393, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2876", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.33692819268447, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2877", "isFavor": false, "paidOnly": false, "status": null, "title": "Create a DataFrame from List", "titleSlug": "create-a-dataframe-from-list", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 85.11592179445682, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2878", "isFavor": false, "paidOnly": false, "status": null, "title": "Get the Size of a DataFrame", "titleSlug": "get-the-size-of-a-dataframe", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 93.09081431657454, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2879", "isFavor": false, "paidOnly": false, "status": null, "title": "Display the First Three Rows", "titleSlug": "display-the-first-three-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 79.07041529164702, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2880", "isFavor": false, "paidOnly": false, "status": null, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 90.27454873174682, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2881", "isFavor": false, "paidOnly": false, "status": null, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 85.459802403497, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2882", "isFavor": false, "paidOnly": false, "status": null, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 64.45020885175968, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2883", "isFavor": false, "paidOnly": false, "status": null, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 92.50379825970646, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2884", "isFavor": false, "paidOnly": false, "status": null, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 85.53835381982262, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2885", "isFavor": false, "paidOnly": false, "status": null, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 87.49807144191183, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2886", "isFavor": false, "paidOnly": false, "status": null, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 72.36413425080747, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2887", "isFavor": false, "paidOnly": false, "status": null, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 90.71161488287865, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2888", "isFavor": false, "paidOnly": false, "status": null, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 83.52457518728302, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2889", "isFavor": false, "paidOnly": false, "status": null, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 86.14041396947175, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2890", "isFavor": false, "paidOnly": false, "status": null, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 76.45506046503655, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2891", "isFavor": false, "paidOnly": false, "status": null, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 40.33699259637478, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2892", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 67.91283111027616, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2893", "isFavor": false, "paidOnly": true, "status": null, "title": "Calculate Orders Within Each Interval", "titleSlug": "calculate-orders-within-each-interval", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 91.22459773322387, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2894", "isFavor": false, "paidOnly": false, "status": null, "title": "Divisible and Non-divisible Sums Difference", "titleSlug": "divisible-and-non-divisible-sums-difference", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 69.60206337509211, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2895", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.374008290038827, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2896", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.60614509868241, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2897", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.11207335710647, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2898", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 61.38889979967791, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2899", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.26520066656741, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2900", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 51.39271656632746, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2901", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 20.87281305287989, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2902", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.27746250996112, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2903", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.19721577726218, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2904", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.10567373758589, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2905", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.34521617739292, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2906", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.671052631578945, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2907", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 66.35654036885553, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2908", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.92996951274511, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2909", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 24.08691015729139, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2910", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.160427807486634, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2911", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.9962626801922, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2912", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 79.78290105667627, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2913", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 76.42033238353109, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2914", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 38.3447606053949, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2915", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 21.249080012616968, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2916", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.3197054060649, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2917", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.1950671163129, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2918", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 34.17361637604245, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2919", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.90926839657804, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2920", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 44.40789473684211, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2921", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 42.07782761546854, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2922", "isFavor": false, "paidOnly": true, "status": null, "title": "Market Analysis III", "titleSlug": "market-analysis-iii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 72.70501474926255, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2923", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 70.12342606070116, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2924", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Champion II", "titleSlug": "find-champion-ii", "topicTags": [ { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 46.57071266243226, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2925", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.113928487964476, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2926", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.419226166733154, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2927", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 75.37395903224532, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2928", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.88639310754082, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2929", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 55.9077008618293, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2930", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.463648603163925, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2931", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.32283896287532, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2932", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.64757152976686, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2933", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.342637180627555, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2934", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.250247358214274, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2935", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.891515994436716, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2936", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 43.63391109201165, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2937", "isFavor": false, "paidOnly": false, "status": null, "title": "Make Three Strings Equal", "titleSlug": "make-three-strings-equal", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 64.01113919963603, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2938", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 27.6024252151041, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2939", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.18529942384915, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2940", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 36.97007481296758, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2941", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 90.5089976185094, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2942", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Words Containing Character", "titleSlug": "find-words-containing-character", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 37.30562966556175, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2943", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.53874406521545, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2944", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 17.256880733944953, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2945", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 58.61900297558391, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2946", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.06440104709616, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2947", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.22734806796333, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2948", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 25.179379622474883, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2949", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.37844143723751, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2950", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.54263794629684, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2951", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.213204450118546, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2952", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.059953012153027, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2953", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.187362464633765, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2954", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.44586745048639, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2955", "isFavor": false, "paidOnly": true, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 83.9417884039981, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2956", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.22170161258835, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2957", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.01039268234377, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2958", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.35996696603696, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2959", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.53610133490442, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2960", "isFavor": false, "paidOnly": false, "status": null, "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" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 47.46963364141206, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2961", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.480270179535104, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2962", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.8072587297223, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2963", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.28384279475983, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2964", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 83.31238022454343, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2965", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 78.76300117730297, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2966", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 22.703878760597192, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2967", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.18760553866937, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2968", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.979492714517, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2969", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 55.34733182826205, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2970", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.40449407147398, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2971", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.41364362308921, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2972", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.74338400900901, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2973", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.07274781212146, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2974", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 24.36491748562952, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2975", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.4499356972258, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2976", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.90724973133835, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2977", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 40.75976957807878, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2978", "isFavor": false, "paidOnly": true, "status": null, "title": "Symmetric Coordinates", "titleSlug": "symmetric-coordinates", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 80.24268003165392, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2979", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 70.23170341962287, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2980", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.898738438896295, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2981", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 38.56646825396825, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2982", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 23.490503064506342, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2983", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.182023742227244, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2984", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 87.5366568914956, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2985", "isFavor": false, "paidOnly": true, "status": null, "title": "Calculate Compressed Mean", "titleSlug": "calculate-compressed-mean", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 53.75764637343431, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2986", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Third Transaction", "titleSlug": "find-third-transaction", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 78.08219178082192, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2987", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Expensive Cities", "titleSlug": "find-expensive-cities", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 80.87567121024371, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2988", "isFavor": false, "paidOnly": true, "status": null, "title": "Manager of the Largest Department", "titleSlug": "manager-of-the-largest-department", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 88.94940267041461, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2989", "isFavor": false, "paidOnly": true, "status": null, "title": "Class Performance", "titleSlug": "class-performance", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 63.886838868388686, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2990", "isFavor": false, "paidOnly": true, "status": null, "title": "Loan Types", "titleSlug": "loan-types", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 55.87941704931124, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2991", "isFavor": false, "paidOnly": true, "status": null, "title": "Top Three Wineries ", "titleSlug": "top-three-wineries", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 71.77624409734835, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2992", "isFavor": false, "paidOnly": true, "status": null, "title": "Number of Self-Divisible Permutations", "titleSlug": "number-of-self-divisible-permutations", "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": false, "hasVideoSolution": false }, { "acRate": 80.73059360730593, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2993", "isFavor": false, "paidOnly": true, "status": null, "title": "Friday Purchases I", "titleSlug": "friday-purchases-i", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 76.73063742289239, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2994", "isFavor": false, "paidOnly": true, "status": null, "title": "Friday Purchases II ", "titleSlug": "friday-purchases-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 42.83612494341331, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2995", "isFavor": false, "paidOnly": true, "status": null, "title": "Viewers Turned Streamers", "titleSlug": "viewers-turned-streamers", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 34.275044650105535, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "2996", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.39174064067927, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2997", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.82249476737782, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "2998", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.357872789206354, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "2999", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 45.78272957210644, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3000", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Area of Longest Diagonal Rectangle", "titleSlug": "maximum-area-of-longest-diagonal-rectangle", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 21.647913857176682, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3001", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Moves to Capture The Queen", "titleSlug": "minimum-moves-to-capture-the-queen", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 45.276348068690176, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3002", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.887503994886547, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3003", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.657402155416904, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3004", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 77.92140721109094, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3005", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.25306028022813, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3006", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.46790757381258, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3007", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.882930291332723, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3008", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.10765295246216, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3009", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 66.15374520161423, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3010", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.51451681489591, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3011", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 35.169318645450836, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3012", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.598964300444525, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3013", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.45410815531558, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3014", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.96764692555168, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3015", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 79.90996526733691, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3016", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 22.348047145828517, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3017", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.71785451873622, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3018", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 79.95182444736417, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3019", "isFavor": false, "paidOnly": false, "status": null, "title": "Number of Changing Keys", "titleSlug": "number-of-changing-keys", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 26.486497060751002, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3020", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 60.01557956992448, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3021", "isFavor": false, "paidOnly": false, "status": null, "title": "Alice and Bob Playing Flower Game", "titleSlug": "alice-and-bob-playing-flower-game", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 28.874878030473617, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3022", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.202216066481995, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3023", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 44.46673768405088, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3024", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 64.12206103051525, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3025", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 20.574600686942958, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3026", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.4827559994831, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3027", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 73.98171423486752, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3028", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.66620811093381, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3029", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.62399639828919, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3030", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.551134048621485, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3031", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 87.10023866348449, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3032", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.5488085284281, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3033", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.45863473850503, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3034", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.46942771821609, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3035", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.60675050951931, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3036", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.4153005464481, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3037", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 52.22426323776056, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3038", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.531073028093424, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3039", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 33.390727542163575, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3040", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.887962348779176, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3041", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.7173273844076, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3042", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 56.58336858962032, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3043", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 45.22088762214984, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3044", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.487151248164466, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3045", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.93800085743495, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3046", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.453986094304405, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3047", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.30973146264952, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3048", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 20.447385003150597, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3049", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.73376324274528, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3050", "isFavor": false, "paidOnly": true, "status": null, "title": "Pizza Toppings Cost Analysis", "titleSlug": "pizza-toppings-cost-analysis", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 76.071604532764, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3051", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.6059544658494, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3052", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximize Items", "titleSlug": "maximize-items", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 50.428027901077996, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3053", "isFavor": false, "paidOnly": true, "status": null, "title": "Classifying Triangles by Lengths", "titleSlug": "classifying-triangles-by-lengths", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 78.98916967509025, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3054", "isFavor": false, "paidOnly": true, "status": null, "title": "Binary Tree Nodes", "titleSlug": "binary-tree-nodes", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 58.342257442707215, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3055", "isFavor": false, "paidOnly": true, "status": null, "title": "Top Percentile Fraud", "titleSlug": "top-percentile-fraud", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 58.41624365482233, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3056", "isFavor": false, "paidOnly": true, "status": null, "title": "Snaps Analysis", "titleSlug": "snaps-analysis", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 67.87581699346406, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3057", "isFavor": false, "paidOnly": true, "status": null, "title": "Employees Project Allocation", "titleSlug": "employees-project-allocation", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 48.89867841409692, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3058", "isFavor": false, "paidOnly": true, "status": null, "title": "Friends With No Mutual Friends", "titleSlug": "friends-with-no-mutual-friends", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 70.47941117963, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3059", "isFavor": false, "paidOnly": true, "status": null, "title": "Find All Unique Email Domains", "titleSlug": "find-all-unique-email-domains", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 39.919191919191924, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3060", "isFavor": false, "paidOnly": true, "status": null, "title": "User Activities within Time Bounds", "titleSlug": "user-activities-within-time-bounds", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 81.67239404352806, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3061", "isFavor": false, "paidOnly": true, "status": null, "title": "Calculate Trapping Rain Water", "titleSlug": "calculate-trapping-rain-water", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 78.0174520069808, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3062", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 85.44066099148722, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3063", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 89.49211908931699, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3064", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 86.21174649323189, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3065", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.77140454492118, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3066", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 54.676595438520756, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3067", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.67430319059314, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3068", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.30782460303705, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3069", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.59445770507073, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3070", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.722296668105116, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3071", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 29.60329938250507, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3072", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 35.66099671739779, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3073", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.54352627220024, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3074", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.86317366988249, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3075", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.935515155246996, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3076", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.025246220002774, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3077", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 64.22811059907833, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3078", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 74.05969993748698, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3079", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.05730659025788, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3080", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 28.202200539755033, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3081", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 37.03370418848168, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3082", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 65.93985056195193, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3083", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.31148962385771, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3084", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.1449335936769, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3085", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 20.7297926479346, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3086", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.126150514347586, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3087", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Trending Hashtags", "titleSlug": "find-trending-hashtags", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 43.50961538461539, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3088", "isFavor": false, "paidOnly": true, "status": null, "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" }, { "name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 37.65467351989339, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3089", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Bursty Behavior", "titleSlug": "find-bursty-behavior", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 64.20306041381217, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3090", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.625641678333544, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3091", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.81834597327555, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3092", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.04407867206026, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3093", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.96703296703298, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3094", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 43.26111084302466, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3095", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.43980087271834, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3096", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 50.21288879266797, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3097", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 23.81855419858909, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3098", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 83.25590021792554, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3099", "isFavor": false, "paidOnly": false, "status": null, "title": "Harshad Number", "titleSlug": "harshad-number", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 62.41271061567044, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3100", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.640308738597724, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3101", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.00715243629861, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3102", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.54430379746836, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3103", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Trending Hashtags II ", "titleSlug": "find-trending-hashtags-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 58.39263290079531, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3104", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 64.97569698347641, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3105", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Strictly Increasing or Strictly Decreasing Subarray", "titleSlug": "longest-strictly-increasing-or-strictly-decreasing-subarray", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.5250100040016, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3106", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.10221456772873, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3107", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.31070156297241, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3108", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 36.026091319618665, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3109", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 91.64608424886904, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3110", "isFavor": false, "paidOnly": false, "status": null, "title": "Score of a String", "titleSlug": "score-of-a-string", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 62.75577017515141, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3111", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.323237048298445, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3112", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.55559773196365, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3113", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 34.64262318301729, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3114", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.74706029522142, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3115", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 18.8376152774594, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3116", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.24740766132488, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3117", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.93766159149669, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3118", "isFavor": false, "paidOnly": true, "status": null, "title": "Friday Purchase III ", "titleSlug": "friday-purchase-iii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 53.191489361702125, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3119", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 65.90226743143933, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3120", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.51228922710042, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3121", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.06078114166859, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3122", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 45.926571997056335, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3123", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.74014677901604, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3124", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Longest Calls", "titleSlug": "find-longest-calls", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.61561928004882, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3125", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 62.145366117265596, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3126", "isFavor": false, "paidOnly": true, "status": null, "title": "Server Utilization Time", "titleSlug": "server-utilization-time", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 52.2822665267576, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3127", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.597352359666466, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3128", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.45617395223073, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3129", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.354827931840962, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3130", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.32429208817423, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3131", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.27107757382699, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3132", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 55.465480360851906, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3133", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Array End", "titleSlug": "minimum-array-end", "topicTags": [ { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 28.98545532707602, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3134", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.885844748858446, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3135", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 50.86993598976668, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3136", "isFavor": false, "paidOnly": false, "status": null, "title": "Valid Word", "titleSlug": "valid-word", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 60.03288377363521, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3137", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.76056706489106, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3138", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 17.788610817860025, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3139", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 56.03576751117735, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3140", "isFavor": false, "paidOnly": true, "status": null, "title": "Consecutive Available Seats II", "titleSlug": "consecutive-available-seats-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 47.491638795986624, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3141", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 44.162776602192615, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3142", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 38.541907625877094, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3143", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.28765056690946, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3144", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 22.30406852248394, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3145", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 87.38327807151178, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3146", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.480553641886395, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3147", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.111799210623865, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3148", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 24.208004945139855, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3149", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 86.159169550173, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3150", "isFavor": false, "paidOnly": true, "status": null, "title": "Invalid Tweets II", "titleSlug": "invalid-tweets-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 81.64385345290603, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3151", "isFavor": false, "paidOnly": false, "status": null, "title": "Special Array I", "titleSlug": "special-array-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 45.683272787262766, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3152", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 42.683722954488935, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3153", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.68852625692644, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3154", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 41.53439153439153, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3155", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 41.493506493506494, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3156", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.80593198670417, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3157", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 78.07133886547965, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3158", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.87226392843789, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3159", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.181361745791534, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3160", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 17.442158559251425, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3161", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 85.92030019660483, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3162", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 66.9070211324937, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3163", "isFavor": false, "paidOnly": false, "status": null, "title": "String Compression III", "titleSlug": "string-compression-iii", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 26.224401820726996, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3164", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 14.928192731926304, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3165", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 52.73668639053254, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3166", "isFavor": false, "paidOnly": true, "status": null, "title": "Calculate Parking Fees and Duration", "titleSlug": "calculate-parking-fees-and-duration", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 75.85757707338254, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3167", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 78.67521470326444, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3168", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 47.94855065205091, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3169", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Days Without Meetings", "titleSlug": "count-days-without-meetings", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 50.93870594572637, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3170", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 30.130194771377983, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3171", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.21094439541041, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3172", "isFavor": false, "paidOnly": true, "status": null, "title": "Second Day Verification", "titleSlug": "second-day-verification", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 94.92014950730547, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3173", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 82.56525994000772, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3174", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 39.643693466183024, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3175", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 31.865159998245794, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3176", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 24.18456197329003, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3177", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.68505627552319, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3178", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.644027635746895, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3179", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 30.200186702624208, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3180", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 20.86056070826307, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3181", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.184671830411745, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3182", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Top Scoring Students", "titleSlug": "find-top-scoring-students", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 51.04643557880968, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3183", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 77.67161287481838, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3184", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.17749618723052, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3185", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 28.171877378852063, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3186", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.2317817951775, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3187", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.79822935968705, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3188", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Top Scoring Students II", "titleSlug": "find-top-scoring-students-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 75.92379701100344, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3189", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 88.97354525398013, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3190", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 80.4667045645612, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3191", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 64.33866256242736, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3192", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 28.37056760618262, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3193", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 84.99431001173285, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3194", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 77.96483315675393, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3195", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 29.051594947548704, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3196", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 63.775950021804604, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3197", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 81.2849906691549, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3198", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Cities in Each State", "titleSlug": "find-cities-in-each-state", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 83.11617806731813, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3199", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 43.61031459301664, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3200", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.78357283652318, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3201", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 57.31085598023543, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3202", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 57.21269746200495, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3203", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 94.10430839002267, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3204", "isFavor": false, "paidOnly": true, "status": null, "title": "Bitwise User Permissions Analysis", "titleSlug": "bitwise-user-permissions-analysis", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 77.87673672960456, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3205", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 68.07769127297925, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3206", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 32.63202994633112, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3207", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.783475871318835, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3208", "isFavor": false, "paidOnly": false, "status": null, "title": "Alternating Groups II", "titleSlug": "alternating-groups-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 34.241521962530626, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3209", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.02218898823729, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3210", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Encrypted String", "titleSlug": "find-the-encrypted-string", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 87.58730740052843, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3211", "isFavor": false, "paidOnly": false, "status": null, "title": "Generate Binary Strings Without Adjacent Zeros", "titleSlug": "generate-binary-strings-without-adjacent-zeros", "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 }, { "acRate": 50.9863219481341, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3212", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 19.03879472693032, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3213", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 51.07621736062104, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3214", "isFavor": false, "paidOnly": true, "status": null, "title": "Year on Year Growth Rate", "titleSlug": "year-on-year-growth-rate", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 59.87972508591065, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3215", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 53.941358632046644, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3216", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 67.44861543415263, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3217", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.89701683567983, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3218", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.86948267679165, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3219", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 68.43702579666162, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3220", "isFavor": false, "paidOnly": false, "status": null, "title": "Odd and Even Transactions", "titleSlug": "odd-and-even-transactions", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 58.41346153846154, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3221", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 52.304950008195384, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3222", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.95952107452435, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3223", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 23.559020117337518, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3224", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.013774104683193, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3225", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.92285639822778, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3226", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 62.680796421465566, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3227", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 53.140391997010774, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3228", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 39.009686941337876, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3229", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 36.76853055916775, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3230", "isFavor": false, "paidOnly": true, "status": null, "title": "Customer Purchasing Behavior Analysis", "titleSlug": "customer-purchasing-behavior-analysis", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 44.821731748726656, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3231", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 81.22854672338048, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3232", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 27.15210307163116, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3233", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 17.394996769131357, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3234", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.631744297227154, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3235", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 73.20574162679426, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3236", "isFavor": false, "paidOnly": true, "status": null, "title": "CEO Subordinate Hierarchy", "titleSlug": "ceo-subordinate-hierarchy", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 49.66118102613746, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3237", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 59.9791933418694, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3238", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 74.47181678896864, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3239", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 24.951275226858353, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3240", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 25.77237919197254, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3241", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 75.94372550072491, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3242", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 61.846108548434586, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3243", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 25.845414924842125, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3244", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 15.69918934568616, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3245", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 81.13738738738738, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3246", "isFavor": false, "paidOnly": true, "status": null, "title": "Premier League Table Ranking", "titleSlug": "premier-league-table-ranking", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 47.192716236722305, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3247", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 81.87991294937507, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3248", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 54.85761988683796, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3249", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 46.895938903431876, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3250", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 23.37641665605501, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3251", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 57.61973875181422, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3252", "isFavor": false, "paidOnly": true, "status": null, "title": "Premier League Table Ranking II", "titleSlug": "premier-league-table-ranking-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 58.9765100671141, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3253", "isFavor": false, "paidOnly": true, "status": null, "title": "Construct String with Minimum Cost (Easy)", "titleSlug": "construct-string-with-minimum-cost-easy", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 62.36150052359558, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3254", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 30.79044634983771, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3255", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 15.460101274663874, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3256", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.509443699040148, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3257", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 78.23913704041325, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3258", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 49.52842584751949, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3259", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 15.62943909087419, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3260", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 22.042538966194474, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3261", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.91709183673469, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3262", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Overlapping Shifts", "titleSlug": "find-overlapping-shifts", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 94.72611118662499, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3263", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 87.00634808516034, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3264", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 37.758497581742496, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3265", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 11.969396635080255, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3266", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 26.712874930994296, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3267", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 59.31198102016607, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3268", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Overlapping Shifts II", "titleSlug": "find-overlapping-shifts-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 61.212976022567, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3269", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 76.09027474923681, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3270", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 82.95428235587455, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3271", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 69.59241284634274, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3272", "isFavor": false, "paidOnly": false, "status": null, "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": true, "hasVideoSolution": false }, { "acRate": 38.651000870322015, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3273", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 72.00349762582044, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3274", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 48.393565849075124, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3275", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 14.647598530957604, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3276", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 42.65628922922421, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3277", "isFavor": false, "paidOnly": false, "status": null, "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 }, { "acRate": 43.245341614906835, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3278", "isFavor": false, "paidOnly": true, "status": null, "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 }, { "acRate": 52.78137128072446, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3279", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximum Total Area Occupied by Pistons", "titleSlug": "maximum-total-area-occupied-by-pistons", "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" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 88.47667295004713, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3280", "isFavor": false, "paidOnly": false, "status": null, "title": "Convert Date to Binary", "titleSlug": "convert-date-to-binary", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 34.97207053558855, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3281", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Score of Numbers in Ranges", "titleSlug": "maximize-score-of-numbers-in-ranges", "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 }, { "acRate": 32.74766667063998, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3282", "isFavor": false, "paidOnly": false, "status": null, "title": "Reach End of Array With Max Score", "titleSlug": "reach-end-of-array-with-max-score", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 32.744399433842545, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3283", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Number of Moves to Kill All Pawns", "titleSlug": "maximum-number-of-moves-to-kill-all-pawns", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search" }, { "name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory" }, { "name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 42.25014961101137, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3284", "isFavor": false, "paidOnly": true, "status": null, "title": "Sum of Consecutive Subarrays", "titleSlug": "sum-of-consecutive-subarrays", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 86.27040541915602, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3285", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Indices of Stable Mountains", "titleSlug": "find-indices-of-stable-mountains", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 31.304689032764372, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3286", "isFavor": false, "paidOnly": false, "status": null, "title": "Find a Safe Walk Through a Grid", "titleSlug": "find-a-safe-walk-through-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 }, { "acRate": 19.352611797192605, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3287", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Maximum Sequence Value of Array", "titleSlug": "find-the-maximum-sequence-value-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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 17.31251072593101, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3288", "isFavor": false, "paidOnly": false, "status": null, "title": "Length of the Longest Increasing Path", "titleSlug": "length-of-the-longest-increasing-path", "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 }, { "acRate": 88.42190515577613, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3289", "isFavor": false, "paidOnly": false, "status": null, "title": "The Two Sneaky Numbers of Digitville", "titleSlug": "the-two-sneaky-numbers-of-digitville", "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 }, { "acRate": 40.99214260584027, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3290", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Multiplication Score", "titleSlug": "maximum-multiplication-score", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.490050213873907, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3291", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Number of Valid Strings to Form Target I", "titleSlug": "minimum-number-of-valid-strings-to-form-target-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "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": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "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 }, { "acRate": 18.510131108462456, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3292", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Number of Valid Strings to Form Target II", "titleSlug": "minimum-number-of-valid-strings-to-form-target-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "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 }, { "acRate": 79.34034070315332, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3293", "isFavor": false, "paidOnly": true, "status": null, "title": "Calculate Product Final Price", "titleSlug": "calculate-product-final-price", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 81.5404201145767, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3294", "isFavor": false, "paidOnly": true, "status": null, "title": "Convert Doubly Linked List to Array II", "titleSlug": "convert-doubly-linked-list-to-array-ii", "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 }, { "acRate": 47.949276974416016, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3295", "isFavor": false, "paidOnly": false, "status": null, "title": "Report Spam Message", "titleSlug": "report-spam-message", "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 }, { "acRate": 36.242895692943186, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3296", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Number of Seconds to Make Mountain Height Zero", "titleSlug": "minimum-number-of-seconds-to-make-mountain-height-zero", "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": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.85362265538801, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3297", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Substrings That Can Be Rearranged to Contain a String I", "titleSlug": "count-substrings-that-can-be-rearranged-to-contain-a-string-i", "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 }, { "acRate": 55.47985679029511, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3298", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Substrings That Can Be Rearranged to Contain a String II", "titleSlug": "count-substrings-that-can-be-rearranged-to-contain-a-string-ii", "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 }, { "acRate": 41.220657276995304, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3299", "isFavor": false, "paidOnly": true, "status": null, "title": "Sum of Consecutive Subsequences", "titleSlug": "sum-of-consecutive-subsequences", "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 }, { "acRate": 83.98088000980512, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3300", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Element After Replacement With Digit Sum", "titleSlug": "minimum-element-after-replacement-with-digit-sum", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 36.71837642479844, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3301", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize the Total Height of Unique Towers", "titleSlug": "maximize-the-total-height-of-unique-towers", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.751545711027074, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3302", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Lexicographically Smallest Valid Sequence", "titleSlug": "find-the-lexicographically-smallest-valid-sequence", "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 14.286986728422551, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3303", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Occurrence of First Almost Equal Substring", "titleSlug": "find-the-occurrence-of-first-almost-equal-substring", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 81.8137850641137, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3304", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the K-th Character in String Game I", "titleSlug": "find-the-k-th-character-in-string-game-i", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 41.4113712374582, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3305", "isFavor": false, "paidOnly": false, "status": null, "title": "Count of Substrings Containing Every Vowel and K Consonants I", "titleSlug": "count-of-substrings-containing-every-vowel-and-k-consonants-i", "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 }, { "acRate": 40.61050220366504, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3306", "isFavor": false, "paidOnly": false, "status": null, "title": "Count of Substrings Containing Every Vowel and K Consonants II", "titleSlug": "count-of-substrings-containing-every-vowel-and-k-consonants-ii", "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 }, { "acRate": 48.644589451407185, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3307", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the K-th Character in String Game II", "titleSlug": "find-the-k-th-character-in-string-game-ii", "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 }, { "acRate": 48.96431245320689, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3308", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Top Performing Driver", "titleSlug": "find-top-performing-driver", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 65.10417634704385, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3309", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Possible Number by Binary Concatenation", "titleSlug": "maximum-possible-number-by-binary-concatenation", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 49.70474001268231, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3310", "isFavor": false, "paidOnly": false, "status": null, "title": "Remove Methods From Project", "titleSlug": "remove-methods-from-project", "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 }, { "acRate": 28.386468049561465, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3311", "isFavor": false, "paidOnly": false, "status": null, "title": "Construct 2D Grid Matching Graph Layout", "titleSlug": "construct-2d-grid-matching-graph-layout", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.30251557065437, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3312", "isFavor": false, "paidOnly": false, "status": null, "title": "Sorted GCD Pair Queries", "titleSlug": "sorted-gcd-pair-queries", "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": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 52.96482412060301, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3313", "isFavor": false, "paidOnly": true, "status": null, "title": "Find the Last Marked Nodes in Tree", "titleSlug": "find-the-last-marked-nodes-in-tree", "topicTags": [ { "name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 74.20386941958706, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3314", "isFavor": false, "paidOnly": false, "status": null, "title": "Construct the Minimum Bitwise Array I", "titleSlug": "construct-the-minimum-bitwise-array-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 35.17797001915076, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3315", "isFavor": false, "paidOnly": false, "status": null, "title": "Construct the Minimum Bitwise Array II", "titleSlug": "construct-the-minimum-bitwise-array-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 38.47527472527473, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3316", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Maximum Removals From Source String", "titleSlug": "find-maximum-removals-from-source-string", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 33.777038269550744, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3317", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Number of Possible Ways for an Event", "titleSlug": "find-the-number-of-possible-ways-for-an-event", "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 }, { "acRate": 63.839635535307515, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3318", "isFavor": false, "paidOnly": false, "status": null, "title": "Find X-Sum of All K-Long Subarrays I", "titleSlug": "find-x-sum-of-all-k-long-subarrays-i", "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 }, { "acRate": 61.29032258064516, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3319", "isFavor": false, "paidOnly": false, "status": null, "title": "K-th Largest Perfect Subtree Size in Binary Tree", "titleSlug": "k-th-largest-perfect-subtree-size-in-binary-tree", "topicTags": [ { "name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 31.440526001195458, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3320", "isFavor": false, "paidOnly": false, "status": null, "title": "Count The Number of Winning Sequences", "titleSlug": "count-the-number-of-winning-sequences", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 16.390218560985563, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3321", "isFavor": false, "paidOnly": false, "status": null, "title": "Find X-Sum of All K-Long Subarrays II", "titleSlug": "find-x-sum-of-all-k-long-subarrays-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 }, { "acRate": 69.6875, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3322", "isFavor": false, "paidOnly": true, "status": null, "title": "Premier League Table Ranking III", "titleSlug": "premier-league-table-ranking-iii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 50.246085011185684, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3323", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimize Connected Groups by Inserting Interval", "titleSlug": "minimize-connected-groups-by-inserting-interval", "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 }, { "acRate": 79.61966845967726, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3324", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Sequence of Strings Appeared on the Screen", "titleSlug": "find-the-sequence-of-strings-appeared-on-the-screen", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 54.899755501222494, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3325", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Substrings With K-Frequency Characters I", "titleSlug": "count-substrings-with-k-frequency-characters-i", "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 }, { "acRate": 28.713900117851303, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3326", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Division Operations to Make Array Non Decreasing", "titleSlug": "minimum-division-operations-to-make-array-non-decreasing", "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 }, { "acRate": 18.344419337385826, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3327", "isFavor": false, "paidOnly": false, "status": null, "title": "Check if DFS Strings Are Palindromes", "titleSlug": "check-if-dfs-strings-are-palindromes", "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": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 68.08600337268128, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3328", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Cities in Each State II", "titleSlug": "find-cities-in-each-state-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.16588566073102, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3329", "isFavor": false, "paidOnly": true, "status": null, "title": "Count Substrings With K-Frequency Characters II", "titleSlug": "count-substrings-with-k-frequency-characters-ii", "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 }, { "acRate": 72.03729121595674, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3330", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Original Typed String I", "titleSlug": "find-the-original-typed-string-i", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 54.06767458603312, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3331", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Subtree Sizes After Changes", "titleSlug": "find-subtree-sizes-after-changes", "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 46.76145868183339, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3332", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Points Tourist Can Earn", "titleSlug": "maximum-points-tourist-can-earn", "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 }, { "acRate": 46.01857327169122, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3333", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Original Typed String II", "titleSlug": "find-the-original-typed-string-ii", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 40.57209573847052, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3334", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Maximum Factor Score of Array", "titleSlug": "find-the-maximum-factor-score-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 }, { "acRate": 45.742851301458, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3335", "isFavor": false, "paidOnly": false, "status": null, "title": "Total Characters in String After Transformations I", "titleSlug": "total-characters-in-string-after-transformations-i", "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" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 29.408681980959035, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3336", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Number of Subsequences With Equal GCD", "titleSlug": "find-the-number-of-subsequences-with-equal-gcd", "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 }, { "acRate": 58.14967304432066, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3337", "isFavor": false, "paidOnly": false, "status": null, "title": "Total Characters in String After Transformations II", "titleSlug": "total-characters-in-string-after-transformations-ii", "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" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 87.23486309294253, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3338", "isFavor": false, "paidOnly": true, "status": null, "title": "Second Highest Salary II", "titleSlug": "second-highest-salary-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 58.68544600938967, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3339", "isFavor": false, "paidOnly": true, "status": null, "title": "Find the Number of K-Even Arrays", "titleSlug": "find-the-number-of-k-even-arrays", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 81.46702488974502, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3340", "isFavor": false, "paidOnly": false, "status": null, "title": "Check Balanced String", "titleSlug": "check-balanced-string", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 55.603614814517464, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3341", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Minimum Time to Reach Last Room I", "titleSlug": "find-minimum-time-to-reach-last-room-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "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 }, { "acRate": 68.29320452785664, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3342", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Minimum Time to Reach Last Room II", "titleSlug": "find-minimum-time-to-reach-last-room-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "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 }, { "acRate": 49.277675050870926, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3343", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Number of Balanced Permutations", "titleSlug": "count-number-of-balanced-permutations", "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": true, "hasVideoSolution": false }, { "acRate": 51.54320987654321, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3344", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximum Sized Array", "titleSlug": "maximum-sized-array", "topicTags": [ { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 63.94843542609866, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3345", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Divisible Digit Product I", "titleSlug": "smallest-divisible-digit-product-i", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 21.38014013730625, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3346", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Frequency of an Element After Performing Operations I", "titleSlug": "maximum-frequency-of-an-element-after-performing-operations-i", "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 }, { "acRate": 37.19423881557773, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3347", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Frequency of an Element After Performing Operations II", "titleSlug": "maximum-frequency-of-an-element-after-performing-operations-ii", "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 }, { "acRate": 11.401850562133122, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3348", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Divisible Digit Product II", "titleSlug": "smallest-divisible-digit-product-ii", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 42.86615262547556, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3349", "isFavor": false, "paidOnly": false, "status": null, "title": "Adjacent Increasing Subarrays Detection I", "titleSlug": "adjacent-increasing-subarrays-detection-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.308745195873506, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3350", "isFavor": false, "paidOnly": false, "status": null, "title": "Adjacent Increasing Subarrays Detection II", "titleSlug": "adjacent-increasing-subarrays-detection-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 30.08086684992928, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3351", "isFavor": false, "paidOnly": false, "status": null, "title": "Sum of Good Subsequences", "titleSlug": "sum-of-good-subsequences", "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 }, { "acRate": 25.833279608020117, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3352", "isFavor": false, "paidOnly": false, "status": null, "title": "Count K-Reducible Numbers Less Than N", "titleSlug": "count-k-reducible-numbers-less-than-n", "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 }, { "acRate": 62.848837209302324, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3353", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Total Operations", "titleSlug": "minimum-total-operations", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 55.701171875, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3354", "isFavor": false, "paidOnly": false, "status": null, "title": "Make Array Elements Equal to Zero", "titleSlug": "make-array-elements-equal-to-zero", "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 }, { "acRate": 54.41507835353495, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3355", "isFavor": false, "paidOnly": false, "status": null, "title": "Zero Array Transformation I", "titleSlug": "zero-array-transformation-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 43.579457494783604, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3356", "isFavor": false, "paidOnly": false, "status": null, "title": "Zero Array Transformation II", "titleSlug": "zero-array-transformation-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": false }, { "acRate": 16.452030316100807, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3357", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimize the Maximum Adjacent Element Difference", "titleSlug": "minimize-the-maximum-adjacent-element-difference", "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 }, { "acRate": 85.39291217257319, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3358", "isFavor": false, "paidOnly": true, "status": null, "title": "Books with NULL Ratings", "titleSlug": "books-with-null-ratings", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 49.92150706436421, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3359", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Sorted Submatrices With Maximum Element at Most K", "titleSlug": "find-sorted-submatrices-with-maximum-element-at-most-k", "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 }, { "acRate": 41.814888709654596, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3360", "isFavor": false, "paidOnly": false, "status": null, "title": "Stone Removal Game", "titleSlug": "stone-removal-game", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 52.92064838067903, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3361", "isFavor": false, "paidOnly": false, "status": null, "title": "Shift Distance Between Two Strings", "titleSlug": "shift-distance-between-two-strings", "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 }, { "acRate": 55.07265697906946, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3362", "isFavor": false, "paidOnly": false, "status": null, "title": "Zero Array Transformation III", "titleSlug": "zero-array-transformation-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" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 65.35689463110891, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3363", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Maximum Number of Fruits Collected", "titleSlug": "find-the-maximum-number-of-fruits-collected", "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 }, { "acRate": 44.48013816925734, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3364", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Positive Sum Subarray ", "titleSlug": "minimum-positive-sum-subarray", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.328091797705056, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3365", "isFavor": false, "paidOnly": false, "status": null, "title": "Rearrange K Substrings to Form Target String", "titleSlug": "rearrange-k-substrings-to-form-target-string", "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 }, { "acRate": 30.046294399606705, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3366", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Array Sum", "titleSlug": "minimum-array-sum", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 29.205358502055105, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3367", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Sum of Weights after Edge Removals", "titleSlug": "maximize-sum-of-weights-after-edge-removals", "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 }, { "acRate": 86.55077767612077, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3368", "isFavor": false, "paidOnly": true, "status": null, "title": "First Letter Capitalization", "titleSlug": "first-letter-capitalization", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 34.59214501510574, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3369", "isFavor": false, "paidOnly": true, "status": null, "title": "Design an Array Statistics Tracker ", "titleSlug": "design-an-array-statistics-tracker", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design" }, { "name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue" }, { "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 }, { "acRate": 76.04577380843222, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3370", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Number With All Set Bits", "titleSlug": "smallest-number-with-all-set-bits", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 35.936980078413214, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3371", "isFavor": false, "paidOnly": false, "status": null, "title": "Identify the Largest Outlier in an Array", "titleSlug": "identify-the-largest-outlier-in-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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.63532643143884, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3372", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize the Number of Target Nodes After Connecting Trees I", "titleSlug": "maximize-the-number-of-target-nodes-after-connecting-trees-i", "topicTags": [ { "name": "Tree", "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 }, { "acRate": 73.14154840642993, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3373", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize the Number of Target Nodes After Connecting Trees II", "titleSlug": "maximize-the-number-of-target-nodes-after-connecting-trees-ii", "topicTags": [ { "name": "Tree", "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 }, { "acRate": 67.07019328585962, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3374", "isFavor": false, "paidOnly": false, "status": null, "title": "First Letter Capitalization II", "titleSlug": "first-letter-capitalization-ii", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 73.32794665411748, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3375", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Operations to Make Array Values Equal to K", "titleSlug": "minimum-operations-to-make-array-values-equal-to-k", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 31.007543103448278, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3376", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Time to Break Locks I", "titleSlug": "minimum-time-to-break-locks-i", "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": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 28.347252155172413, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3377", "isFavor": false, "paidOnly": false, "status": null, "title": "Digit Operations to Make Two Integers Equal", "titleSlug": "digit-operations-to-make-two-integers-equal", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" }, { "name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 29.267811328202093, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3378", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Connected Components in LCM Graph", "titleSlug": "count-connected-components-in-lcm-graph", "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": false, "hasVideoSolution": false }, { "acRate": 56.837498948077084, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3379", "isFavor": false, "paidOnly": false, "status": null, "title": "Transformed Array", "titleSlug": "transformed-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 50.331572041561756, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3380", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Area Rectangle With Point Constraints I", "titleSlug": "maximum-area-rectangle-with-point-constraints-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 27.449018689599384, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3381", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Subarray Sum With Length Divisible by K", "titleSlug": "maximum-subarray-sum-with-length-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": false, "hasVideoSolution": false }, { "acRate": 20.48213817800681, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3382", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Area Rectangle With Point Constraints II", "titleSlug": "maximum-area-rectangle-with-point-constraints-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 42.81524926686217, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3383", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Runes to Add to Cast Spell", "titleSlug": "minimum-runes-to-add-to-cast-spell", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search" }, { "name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 75.03410641200546, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3384", "isFavor": false, "paidOnly": true, "status": null, "title": "Team Dominance by Pass Success", "titleSlug": "team-dominance-by-pass-success", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 43.08681672025724, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3385", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Time to Break Locks II", "titleSlug": "minimum-time-to-break-locks-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 40.70240655028731, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3386", "isFavor": false, "paidOnly": false, "status": null, "title": "Button with Longest Push Time", "titleSlug": "button-with-longest-push-time", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 59.74703206479529, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3387", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Amount After Two Days of Conversions", "titleSlug": "maximize-amount-after-two-days-of-conversions", "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 16.25835744935635, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3388", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Beautiful Splits in an Array", "titleSlug": "count-beautiful-splits-in-an-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 25.29711375212224, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3389", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Operations to Make Character Frequencies Equal", "titleSlug": "minimum-operations-to-make-character-frequencies-equal", "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" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.661500309981406, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3390", "isFavor": false, "paidOnly": true, "status": null, "title": "Longest Team Pass Streak", "titleSlug": "longest-team-pass-streak", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 68.11832374691865, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3391", "isFavor": false, "paidOnly": true, "status": null, "title": "Design a 3D Binary Matrix with Efficient Layer Tracking", "titleSlug": "design-a-3d-binary-matrix-with-efficient-layer-tracking", "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": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 61.784966454425025, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3392", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Subarrays of Length Three With a Condition", "titleSlug": "count-subarrays-of-length-three-with-a-condition", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 39.977317833853135, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3393", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Paths With the Given XOR Value", "titleSlug": "count-paths-with-the-given-xor-value", "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 68.28868737192153, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3394", "isFavor": false, "paidOnly": false, "status": null, "title": "Check if Grid can be Cut into Sections", "titleSlug": "check-if-grid-can-be-cut-into-sections", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 17.96993751055565, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3395", "isFavor": false, "paidOnly": false, "status": null, "title": "Subsequences with a Unique Middle Mode I", "titleSlug": "subsequences-with-a-unique-middle-mode-i", "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 }, { "acRate": 71.33261902096561, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3396", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Number of Operations to Make Elements in Array Distinct", "titleSlug": "minimum-number-of-operations-to-make-elements-in-array-distinct", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 31.486123410834093, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3397", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Number of Distinct Elements After Operations", "titleSlug": "maximum-number-of-distinct-elements-after-operations", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 19.545047258432813, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3398", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Substring With Identical Characters I", "titleSlug": "smallest-substring-with-identical-characters-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 39.89385510582518, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3399", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Substring With Identical Characters II", "titleSlug": "smallest-substring-with-identical-characters-ii", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 83.76623376623377, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3400", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximum Number of Matching Indices After Right Shifts", "titleSlug": "maximum-number-of-matching-indices-after-right-shifts", "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 }, { "acRate": 54.163090128755364, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3401", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Circular Gift Exchange Chains", "titleSlug": "find-circular-gift-exchange-chains", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 72.17844433146924, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3402", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Operations to Make Columns Strictly Increasing", "titleSlug": "minimum-operations-to-make-columns-strictly-increasing", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.038887485745335, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3403", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Lexicographically Largest String From the Box I", "titleSlug": "find-the-lexicographically-largest-string-from-the-box-i", "topicTags": [ { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 29.212244785495827, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3404", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Special Subsequences", "titleSlug": "count-special-subsequences", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 58.38960221110451, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3405", "isFavor": false, "paidOnly": false, "status": null, "title": "Count the Number of Arrays with K Matching Adjacent Elements", "titleSlug": "count-the-number-of-arrays-with-k-matching-adjacent-elements", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 48.08467741935484, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3406", "isFavor": false, "paidOnly": true, "status": null, "title": "Find the Lexicographically Largest String From the Box II", "titleSlug": "find-the-lexicographically-largest-string-from-the-box-ii", "topicTags": [ { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 27.408559538681736, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3407", "isFavor": false, "paidOnly": false, "status": null, "title": "Substring Matching Pattern", "titleSlug": "substring-matching-pattern", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 34.40005404918476, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3408", "isFavor": false, "paidOnly": false, "status": null, "title": "Design Task Manager", "titleSlug": "design-task-manager", "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 }, { "acRate": 15.085858585858587, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3409", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Subsequence With Decreasing Adjacent Difference", "titleSlug": "longest-subsequence-with-decreasing-adjacent-difference", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.465974918836334, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3410", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Subarray Sum After Removing All Occurrences of One Element", "titleSlug": "maximize-subarray-sum-after-removing-all-occurrences-of-one-element", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 45.525510742290514, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3411", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Subarray With Equal Products", "titleSlug": "maximum-subarray-with-equal-products", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 34.4610022833794, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3412", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Mirror Score of a String", "titleSlug": "find-mirror-score-of-a-string", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 23.734109358247817, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3413", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Coins From K Consecutive Bags", "titleSlug": "maximum-coins-from-k-consecutive-bags", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 30.46496069576852, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3414", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Score of Non-overlapping Intervals", "titleSlug": "maximum-score-of-non-overlapping-intervals", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 82.212086659065, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3415", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Products with Three Consecutive Digits ", "titleSlug": "find-products-with-three-consecutive-digits", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 46.01063829787234, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3416", "isFavor": false, "paidOnly": true, "status": null, "title": "Subsequences with a Unique Middle Mode II", "titleSlug": "subsequences-with-a-unique-middle-mode-ii", "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 }, { "acRate": 63.981320391905506, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3417", "isFavor": false, "paidOnly": false, "status": null, "title": "Zigzag Grid Traversal With Skip", "titleSlug": "zigzag-grid-traversal-with-skip", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 28.9294627610666, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3418", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Amount of Money Robot Can Earn", "titleSlug": "maximum-amount-of-money-robot-can-earn", "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 }, { "acRate": 43.06759663646438, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3419", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimize the Maximum Edge Weight of Graph", "titleSlug": "minimize-the-maximum-edge-weight-of-graph", "topicTags": [ { "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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 21.90488252802229, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3420", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Non-Decreasing Subarrays After K Operations", "titleSlug": "count-non-decreasing-subarrays-after-k-operations", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack" }, { "name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 47.36134569645996, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3421", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Students Who Improved", "titleSlug": "find-students-who-improved", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 45.54537885095753, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3422", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Operations to Make Subarray Elements Equal", "titleSlug": "minimum-operations-to-make-subarray-elements-equal", "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" }, { "name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 75.90501809089015, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3423", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Difference Between Adjacent Elements in a Circular Array", "titleSlug": "maximum-difference-between-adjacent-elements-in-a-circular-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 37.09443174093072, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3424", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Cost to Make Arrays Identical", "titleSlug": "minimum-cost-to-make-arrays-identical", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.49554093862233, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3425", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Special Path", "titleSlug": "longest-special-path", "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": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 33.55600735792429, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3426", "isFavor": false, "paidOnly": false, "status": null, "title": "Manhattan Distances of All Arrangements of Pieces", "titleSlug": "manhattan-distances-of-all-arrangements-of-pieces", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 85.28074461066633, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3427", "isFavor": false, "paidOnly": false, "status": null, "title": "Sum of Variable Length Subarrays", "titleSlug": "sum-of-variable-length-subarrays", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.659932900278395, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3428", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum and Minimum Sums of at Most Size K Subsequences", "titleSlug": "maximum-and-minimum-sums-of-at-most-size-k-subsequences", "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 }, { "acRate": 44.20296486090776, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3429", "isFavor": false, "paidOnly": false, "status": null, "title": "Paint House IV", "titleSlug": "paint-house-iv", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 22.7197456448301, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3430", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum and Minimum Sums of at Most Size K Subarrays", "titleSlug": "maximum-and-minimum-sums-of-at-most-size-k-subarrays", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" }, { "name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 60.21947873799726, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3431", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Unlocked Indices to Sort Nums", "titleSlug": "minimum-unlocked-indices-to-sort-nums", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 73.64648852805162, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3432", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Partitions with Even Sum Difference", "titleSlug": "count-partitions-with-even-sum-difference", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 30.297195798463505, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3433", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Mentions Per User", "titleSlug": "count-mentions-per-user", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 29.417113257194817, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3434", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Frequency After Subarray Operation", "titleSlug": "maximum-frequency-after-subarray-operation", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 16.745424864679094, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3435", "isFavor": false, "paidOnly": false, "status": null, "title": "Frequencies of Shortest Supersequences", "titleSlug": "frequencies-of-shortest-supersequences", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 49.41936722224, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3436", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Valid Emails", "titleSlug": "find-valid-emails", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 86.39262934089298, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3437", "isFavor": false, "paidOnly": true, "status": null, "title": "Permutations III", "titleSlug": "permutations-iii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 59.93359314546196, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3438", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Valid Pair of Adjacent Digits in String", "titleSlug": "find-valid-pair-of-adjacent-digits-in-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 }, { "acRate": 53.84484973028513, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3439", "isFavor": false, "paidOnly": false, "status": null, "title": "Reschedule Meetings for Maximum Free Time I", "titleSlug": "reschedule-meetings-for-maximum-free-time-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 60.47036412924024, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3440", "isFavor": false, "paidOnly": false, "status": null, "title": "Reschedule Meetings for Maximum Free Time II", "titleSlug": "reschedule-meetings-for-maximum-free-time-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 19.45138841970137, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3441", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Cost Good Caption", "titleSlug": "minimum-cost-good-caption", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 61.1047325176707, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3442", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Difference Between Even and Odd Frequency I", "titleSlug": "maximum-difference-between-even-and-odd-frequency-i", "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 }, { "acRate": 54.06703836745488, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3443", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Manhattan Distance After K Changes", "titleSlug": "maximum-manhattan-distance-after-k-changes", "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" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 25.946206413176796, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3444", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Increments for Target Multiples in an Array", "titleSlug": "minimum-increments-for-target-multiples-in-an-array", "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": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" }, { "name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 48.99772926358402, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3445", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Difference Between Even and Odd Frequency II", "titleSlug": "maximum-difference-between-even-and-odd-frequency-ii", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 84.72243523488814, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3446", "isFavor": false, "paidOnly": false, "status": null, "title": "Sort Matrix by Diagonals", "titleSlug": "sort-matrix-by-diagonals", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 26.17053802134769, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3447", "isFavor": false, "paidOnly": false, "status": null, "title": "Assign Elements to Groups with Constraints", "titleSlug": "assign-elements-to-groups-with-constraints", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 21.310500654061126, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3448", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Substrings Divisible By Last Digit", "titleSlug": "count-substrings-divisible-by-last-digit", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 25.126020589279374, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3449", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize the Minimum Game Score", "titleSlug": "maximize-the-minimum-game-score", "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 }, { "acRate": 87.18647764449291, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3450", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximum Students on a Single Bench", "titleSlug": "maximum-students-on-a-single-bench", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 53.81914711423189, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3451", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Invalid IP Addresses", "titleSlug": "find-invalid-ip-addresses", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.36493203185819, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3452", "isFavor": false, "paidOnly": false, "status": null, "title": "Sum of Good Numbers", "titleSlug": "sum-of-good-numbers", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 38.90430777407069, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3453", "isFavor": false, "paidOnly": false, "status": null, "title": "Separate Squares I", "titleSlug": "separate-squares-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.055445544554455, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3454", "isFavor": false, "paidOnly": false, "status": null, "title": "Separate Squares II", "titleSlug": "separate-squares-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 22.315756035578143, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3455", "isFavor": false, "paidOnly": false, "status": null, "title": "Shortest Matching Substring", "titleSlug": "shortest-matching-substring", "topicTags": [ { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 35.06273069358504, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3456", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Special Substring of Length K", "titleSlug": "find-special-substring-of-length-k", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 32.54532022503836, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3457", "isFavor": false, "paidOnly": false, "status": null, "title": "Eat Pizzas!", "titleSlug": "eat-pizzas", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 18.134029401635036, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3458", "isFavor": false, "paidOnly": false, "status": null, "title": "Select K Disjoint Special Substrings", "titleSlug": "select-k-disjoint-special-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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.70377444438228, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3459", "isFavor": false, "paidOnly": false, "status": null, "title": "Length of Longest V-Shaped Diagonal Segment", "titleSlug": "length-of-longest-v-shaped-diagonal-segment", "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 }, { "acRate": 67.73675762439807, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3460", "isFavor": false, "paidOnly": true, "status": null, "title": "Longest Common Prefix After at Most One Removal", "titleSlug": "longest-common-prefix-after-at-most-one-removal", "topicTags": [ { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 77.63867967298945, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3461", "isFavor": false, "paidOnly": false, "status": null, "title": "Check If Digits Are Equal in String After Operations I", "titleSlug": "check-if-digits-are-equal-in-string-after-operations-i", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" }, { "name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 60.022950819672126, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3462", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Sum With at Most K Elements", "titleSlug": "maximum-sum-with-at-most-k-elements", "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 }, { "acRate": 11.41831280773774, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3463", "isFavor": false, "paidOnly": false, "status": null, "title": "Check If Digits Are Equal in String After Operations II", "titleSlug": "check-if-digits-are-equal-in-string-after-operations-ii", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 19.520913024393302, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3464", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize the Distance Between Points on a Square", "titleSlug": "maximize-the-distance-between-points-on-a-square", "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 }, { "acRate": 38.42399836188656, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3465", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Products with Valid Serial Numbers", "titleSlug": "find-products-with-valid-serial-numbers", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 52.78703086831001, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3466", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximum Coin Collection ", "titleSlug": "maximum-coin-collection", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 89.62165914612982, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3467", "isFavor": false, "paidOnly": false, "status": null, "title": "Transform Array by Parity", "titleSlug": "transform-array-by-parity", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 46.22548230587045, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3468", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Number of Copy Arrays", "titleSlug": "find-the-number-of-copy-arrays", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 19.952546487888316, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3469", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Minimum Cost to Remove Array Elements", "titleSlug": "find-minimum-cost-to-remove-array-elements", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 29.276468944966943, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3470", "isFavor": false, "paidOnly": false, "status": null, "title": "Permutations IV", "titleSlug": "permutations-iv", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 36.79993777224642, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3471", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Largest Almost Missing Integer", "titleSlug": "find-the-largest-almost-missing-integer", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 36.76770282471302, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3472", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Palindromic Subsequence After at Most K Operations", "titleSlug": "longest-palindromic-subsequence-after-at-most-k-operations", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 25.15773976444195, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3473", "isFavor": false, "paidOnly": false, "status": null, "title": "Sum of K Subarrays With Length at Least M", "titleSlug": "sum-of-k-subarrays-with-length-at-least-m", "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 }, { "acRate": 30.232101994115723, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3474", "isFavor": false, "paidOnly": false, "status": null, "title": "Lexicographically Smallest Generated String", "titleSlug": "lexicographically-smallest-generated-string", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 85.27728873239437, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3475", "isFavor": false, "paidOnly": false, "status": null, "title": "DNA Pattern Recognition ", "titleSlug": "dna-pattern-recognition", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 66.92439862542955, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3476", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximize Profit from Task Assignment", "titleSlug": "maximize-profit-from-task-assignment", "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 }, { "acRate": 70.32887785087888, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3477", "isFavor": false, "paidOnly": false, "status": null, "title": "Fruits Into Baskets II", "titleSlug": "fruits-into-baskets-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 32.11230807773523, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3478", "isFavor": false, "paidOnly": false, "status": null, "title": "Choose K Elements With Maximum Sum", "titleSlug": "choose-k-elements-with-maximum-sum", "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 }, { "acRate": 38.91062914431955, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3479", "isFavor": false, "paidOnly": false, "status": null, "title": "Fruits Into Baskets III", "titleSlug": "fruits-into-baskets-iii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 65.28218881595973, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3480", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Subarrays After Removing One Conflicting Pair", "titleSlug": "maximize-subarrays-after-removing-one-conflicting-pair", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 77.68384828308521, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3481", "isFavor": false, "paidOnly": true, "status": null, "title": "Apply Substitutions", "titleSlug": "apply-substitutions", "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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 59.04566744730679, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3482", "isFavor": false, "paidOnly": false, "status": null, "title": "Analyze Organization Hierarchy", "titleSlug": "analyze-organization-hierarchy", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 67.96159202521439, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3483", "isFavor": false, "paidOnly": false, "status": null, "title": "Unique 3-Digit Even Numbers", "titleSlug": "unique-3-digit-even-numbers", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 67.27852672123255, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3484", "isFavor": false, "paidOnly": false, "status": null, "title": "Design Spreadsheet", "titleSlug": "design-spreadsheet", "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": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.91341270163748, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3485", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Common Prefix of K Strings After Removal", "titleSlug": "longest-common-prefix-of-k-strings-after-removal", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 15.874658887738779, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3486", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Special Path II", "titleSlug": "longest-special-path-ii", "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": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 40.325275525613975, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3487", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Unique Subarray Sum After Deletion", "titleSlug": "maximum-unique-subarray-sum-after-deletion", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 31.850177591217303, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3488", "isFavor": false, "paidOnly": false, "status": null, "title": "Closest Equal Element Queries", "titleSlug": "closest-equal-element-queries", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 30.099423171686134, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3489", "isFavor": false, "paidOnly": false, "status": null, "title": "Zero Array Transformation IV", "titleSlug": "zero-array-transformation-iv", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 21.514971247273447, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3490", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Beautiful Numbers", "titleSlug": "count-beautiful-numbers", "topicTags": [ { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 71.44426139483801, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3491", "isFavor": false, "paidOnly": true, "status": null, "title": "Phone Number Prefix", "titleSlug": "phone-number-prefix", "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": false, "hasVideoSolution": false }, { "acRate": 74.74300780989253, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3492", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Containers on a Ship", "titleSlug": "maximum-containers-on-a-ship", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 47.312348668280876, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3493", "isFavor": false, "paidOnly": false, "status": null, "title": "Properties Graph", "titleSlug": "properties-graph", "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 }, { "acRate": 35.90201267926386, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3494", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Minimum Amount of Time to Brew Potions", "titleSlug": "find-the-minimum-amount-of-time-to-brew-potions", "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 }, { "acRate": 60.722959170253986, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3495", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Operations to Make Array Elements Zero", "titleSlug": "minimum-operations-to-make-array-elements-zero", "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 }, { "acRate": 53.69532428355958, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3496", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximize Score After Pair Deletions", "titleSlug": "maximize-score-after-pair-deletions", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 75.05944887396838, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3497", "isFavor": false, "paidOnly": false, "status": null, "title": "Analyze Subscription Conversion ", "titleSlug": "analyze-subscription-conversion", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 87.699912244569, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3498", "isFavor": false, "paidOnly": false, "status": null, "title": "Reverse Degree of a String", "titleSlug": "reverse-degree-of-a-string", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 30.427535040969172, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3499", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Active Section with Trade I", "titleSlug": "maximize-active-section-with-trade-i", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 24.132353932205675, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3500", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Cost to Divide Array Into Subarrays", "titleSlug": "minimum-cost-to-divide-array-into-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 }, { "acRate": 18.37653267111594, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3501", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Active Section with Trade II", "titleSlug": "maximize-active-section-with-trade-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 82.51404815203985, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3502", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Cost to Reach Every Position", "titleSlug": "minimum-cost-to-reach-every-position", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 43.40984014430553, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3503", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Palindrome After Substring Concatenation I", "titleSlug": "longest-palindrome-after-substring-concatenation-i", "topicTags": [ { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 16.162064577229277, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3504", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Palindrome After Substring Concatenation II", "titleSlug": "longest-palindrome-after-substring-concatenation-ii", "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 }, { "acRate": 27.132792158064024, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3505", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Operations to Make Elements Within K Subarrays Equal", "titleSlug": "minimum-operations-to-make-elements-within-k-subarrays-equal", "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": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 57.17171717171718, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3506", "isFavor": false, "paidOnly": true, "status": null, "title": "Find Time Required to Eliminate Bacterial Strains", "titleSlug": "find-time-required-to-eliminate-bacterial-strains", "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": false, "hasVideoSolution": false }, { "acRate": 55.69110051953226, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3507", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Pair Removal to Sort Array I", "titleSlug": "minimum-pair-removal-to-sort-array-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list" }, { "name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" }, { "name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 22.804432482821873, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3508", "isFavor": false, "paidOnly": false, "status": null, "title": "Implement Router", "titleSlug": "implement-router", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design" }, { "name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 11.367267747089706, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3509", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Product of Subsequences With an Alternating Sum Equal to K", "titleSlug": "maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k", "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 }, { "acRate": 14.205059690557256, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3510", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Pair Removal to Sort Array II", "titleSlug": "minimum-pair-removal-to-sort-array-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list" }, { "name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" }, { "name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 36.37005649717514, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3511", "isFavor": false, "paidOnly": true, "status": null, "title": "Make a Positive Array", "titleSlug": "make-a-positive-array", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 87.80691907337483, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3512", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Operations to Make Array Sum Divisible by K", "titleSlug": "minimum-operations-to-make-array-sum-divisible-by-k", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 25.472377490483865, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3513", "isFavor": false, "paidOnly": false, "status": null, "title": "Number of Unique XOR Triplets I", "titleSlug": "number-of-unique-xor-triplets-i", "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 }, { "acRate": 30.151016746411486, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3514", "isFavor": false, "paidOnly": false, "status": null, "title": "Number of Unique XOR Triplets II", "titleSlug": "number-of-unique-xor-triplets-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 35.065223836347464, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3515", "isFavor": false, "paidOnly": false, "status": null, "title": "Shortest Path in a Weighted Tree", "titleSlug": "shortest-path-in-a-weighted-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": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 89.11997701229149, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3516", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Closest Person", "titleSlug": "find-closest-person", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": true, "hasVideoSolution": false }, { "acRate": 63.05987741631306, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3517", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Palindromic Rearrangement I", "titleSlug": "smallest-palindromic-rearrangement-i", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 12.598526277953221, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3518", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Palindromic Rearrangement II", "titleSlug": "smallest-palindromic-rearrangement-ii", "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 }, { "acRate": 35.609334485738984, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3519", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Numbers with Non-Decreasing Digits ", "titleSlug": "count-numbers-with-non-decreasing-digits", "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 }, { "acRate": 54.42890442890443, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3520", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Threshold for Inversion Pairs Count", "titleSlug": "minimum-threshold-for-inversion-pairs-count", "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 }, { "acRate": 62.75215456009092, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3521", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Product Recommendation Pairs", "titleSlug": "find-product-recommendation-pairs", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.166173532989895, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3522", "isFavor": false, "paidOnly": false, "status": null, "title": "Calculate Score After Performing Instructions", "titleSlug": "calculate-score-after-performing-instructions", "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 }, { "acRate": 55.59602266157937, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3523", "isFavor": false, "paidOnly": false, "status": null, "title": "Make Array Non-decreasing", "titleSlug": "make-array-non-decreasing", "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 }, { "acRate": 34.404182440959076, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3524", "isFavor": false, "paidOnly": false, "status": null, "title": "Find X Value of Array I", "titleSlug": "find-x-value-of-array-i", "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 }, { "acRate": 28.343545320092968, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3525", "isFavor": false, "paidOnly": false, "status": null, "title": "Find X Value of Array II", "titleSlug": "find-x-value-of-array-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 62.327416173570015, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3526", "isFavor": false, "paidOnly": true, "status": null, "title": "Range XOR Queries with Subarray Reversals", "titleSlug": "range-xor-queries-with-subarray-reversals", "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 }, { "acRate": 74.97630550868027, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3527", "isFavor": false, "paidOnly": false, "status": null, "title": "Find the Most Common Response", "titleSlug": "find-the-most-common-response", "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 }, { "acRate": 55.589746843474394, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3528", "isFavor": false, "paidOnly": false, "status": null, "title": "Unit Conversion I", "titleSlug": "unit-conversion-i", "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 }, { "acRate": 23.824464019950927, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3529", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Cells in Overlapping Horizontal and Vertical Substrings", "titleSlug": "count-cells-in-overlapping-horizontal-and-vertical-substrings", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash" }, { "name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" }, { "name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 27.85117786364203, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3530", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Profit from Valid Topological Order in DAG", "titleSlug": "maximum-profit-from-valid-topological-order-in-dag", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort" }, { "name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 37.966063853538735, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3531", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Covered Buildings", "titleSlug": "count-covered-buildings", "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 }, { "acRate": 55.022154488753415, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3532", "isFavor": false, "paidOnly": false, "status": null, "title": "Path Existence Queries in a Graph I", "titleSlug": "path-existence-queries-in-a-graph-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": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 27.066830302354123, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3533", "isFavor": false, "paidOnly": false, "status": null, "title": "Concatenated Divisibility", "titleSlug": "concatenated-divisibility", "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 }, { "acRate": 23.355704697986575, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3534", "isFavor": false, "paidOnly": false, "status": null, "title": "Path Existence Queries in a Graph II", "titleSlug": "path-existence-queries-in-a-graph-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 67.50524109014675, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3535", "isFavor": false, "paidOnly": true, "status": null, "title": "Unit Conversion II", "titleSlug": "unit-conversion-ii", "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.48720709082427, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3536", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Product of Two Digits", "titleSlug": "maximum-product-of-two-digits", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 70.1715111030872, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3537", "isFavor": false, "paidOnly": false, "status": null, "title": "Fill a Special Grid", "titleSlug": "fill-a-special-grid", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 28.10346105387979, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3538", "isFavor": false, "paidOnly": false, "status": null, "title": "Merge Operations for Minimum Travel Time", "titleSlug": "merge-operations-for-minimum-travel-time", "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 }, { "acRate": 25.019414962464403, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3539", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Sum of Array Product of Magical Sequences", "titleSlug": "find-sum-of-array-product-of-magical-sequences", "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": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics" }, { "name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 67.86259541984732, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3540", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Time to Visit All Houses", "titleSlug": "minimum-time-to-visit-all-houses", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 87.70456410034976, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3541", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Most Frequent Vowel and Consonant", "titleSlug": "find-most-frequent-vowel-and-consonant", "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 }, { "acRate": 24.744729129242696, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3542", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Operations to Convert All Elements to Zero", "titleSlug": "minimum-operations-to-convert-all-elements-to-zero", "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": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 18.693165151070694, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3543", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Weighted K-Edge Path", "titleSlug": "maximum-weighted-k-edge-path", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.52859433458044, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3544", "isFavor": false, "paidOnly": false, "status": null, "title": "Subtree Inversion Sum", "titleSlug": "subtree-inversion-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 }, { "acRate": 72.68048271693993, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3545", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Deletions for At Most K Distinct Characters", "titleSlug": "minimum-deletions-for-at-most-k-distinct-characters", "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 }, { "acRate": 42.08661000811087, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3546", "isFavor": false, "paidOnly": false, "status": null, "title": "Equal Sum Grid Partition I", "titleSlug": "equal-sum-grid-partition-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 34.13801365760153, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3547", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Sum of Edge Values in a Graph", "titleSlug": "maximum-sum-of-edge-values-in-a-graph", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 19.64804896710023, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3548", "isFavor": false, "paidOnly": false, "status": null, "title": "Equal Sum Grid Partition II", "titleSlug": "equal-sum-grid-partition-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 63.44647519582245, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3549", "isFavor": false, "paidOnly": true, "status": null, "title": "Multiply Two Polynomials", "titleSlug": "multiply-two-polynomials", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 80.0738139601548, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3550", "isFavor": false, "paidOnly": false, "status": null, "title": "Smallest Index With Digit Sum Equal to Index", "titleSlug": "smallest-index-with-digit-sum-equal-to-index", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 50.73571809930593, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3551", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Swaps to Sort by Digit Sum", "titleSlug": "minimum-swaps-to-sort-by-digit-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 }, { "acRate": 22.06758656187516, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3552", "isFavor": false, "paidOnly": false, "status": null, "title": "Grid Teleportation Traversal", "titleSlug": "grid-teleportation-traversal", "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": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 48.950524737631184, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3553", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Weighted Subgraph With the Required Paths II", "titleSlug": "minimum-weighted-subgraph-with-the-required-paths-ii", "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 }, { "acRate": 65.32913281379538, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3554", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Category Recommendation Pairs", "titleSlug": "find-category-recommendation-pairs", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 62.68456375838927, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3555", "isFavor": false, "paidOnly": true, "status": null, "title": "Smallest Subarray to Sort in Every Sliding Window", "titleSlug": "smallest-subarray-to-sort-in-every-sliding-window", "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": false, "hasVideoSolution": false }, { "acRate": 37.33666944676119, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3556", "isFavor": false, "paidOnly": false, "status": null, "title": "Sum of Largest Prime Substrings", "titleSlug": "sum-of-largest-prime-substrings", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 29.331542094121478, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3557", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Maximum Number of Non Intersecting Substrings", "titleSlug": "find-maximum-number-of-non-intersecting-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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 53.62041189532808, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3558", "isFavor": false, "paidOnly": false, "status": null, "title": "Number of Ways to Assign Edge Weights I", "titleSlug": "number-of-ways-to-assign-edge-weights-i", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 60.293968575772936, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3559", "isFavor": false, "paidOnly": false, "status": null, "title": "Number of Ways to Assign Edge Weights II", "titleSlug": "number-of-ways-to-assign-edge-weights-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.58717323461407, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3560", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Minimum Log Transportation Cost", "titleSlug": "find-minimum-log-transportation-cost", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 55.6219374293253, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3561", "isFavor": false, "paidOnly": false, "status": null, "title": "Resulting String After Adjacent Removals", "titleSlug": "resulting-string-after-adjacent-removals", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.555686366847187, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3562", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Profit from Trading Stocks with Discounts", "titleSlug": "maximum-profit-from-trading-stocks-with-discounts", "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 }, { "acRate": 15.163040957372791, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3563", "isFavor": false, "paidOnly": false, "status": null, "title": "Lexicographically Smallest String After Adjacent Removals", "titleSlug": "lexicographically-smallest-string-after-adjacent-removals", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 61.7068563173686, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3564", "isFavor": false, "paidOnly": false, "status": null, "title": "Seasonal Sales Analysis", "titleSlug": "seasonal-sales-analysis", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 64.49612403100775, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3565", "isFavor": false, "paidOnly": true, "status": null, "title": "Sequential Grid Path Cover", "titleSlug": "sequential-grid-path-cover", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 34.86878060205891, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3566", "isFavor": false, "paidOnly": false, "status": null, "title": "Partition Array into Two Equal Product Subsets", "titleSlug": "partition-array-into-two-equal-product-subsets", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 68.70129399398311, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3567", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Absolute Difference in Sliding Submatrix", "titleSlug": "minimum-absolute-difference-in-sliding-submatrix", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 25.562731807136462, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3568", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Moves to Clean the Classroom", "titleSlug": "minimum-moves-to-clean-the-classroom", "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": false, "hasVideoSolution": false }, { "acRate": 15.075741103138363, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3569", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Count of Distinct Primes After Split", "titleSlug": "maximize-count-of-distinct-primes-after-split", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 54.23285881301149, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3570", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Books with No Available Copies", "titleSlug": "find-books-with-no-available-copies", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 51.41987829614605, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3571", "isFavor": false, "paidOnly": true, "status": null, "title": "Find the Shortest Superstring II", "titleSlug": "find-the-shortest-superstring-ii", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 62.564857972034126, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3572", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Y\u2011Sum by Picking a Triplet of Distinct X\u2011Values", "titleSlug": "maximize-ysum-by-picking-a-triplet-of-distinct-xvalues", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 40.32688284518828, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3573", "isFavor": false, "paidOnly": false, "status": null, "title": "Best Time to Buy and Sell Stock V", "titleSlug": "best-time-to-buy-and-sell-stock-v", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 22.55976753401136, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3574", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Subarray GCD Score", "titleSlug": "maximize-subarray-gcd-score", "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 }, { "acRate": 44.175407275161795, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3575", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Good Subtree Score", "titleSlug": "maximum-good-subtree-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": "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 }, { "acRate": 32.412977590007344, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3576", "isFavor": false, "paidOnly": false, "status": null, "title": "Transform Array to All Equal Elements", "titleSlug": "transform-array-to-all-equal-elements", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 38.93216652334463, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3577", "isFavor": false, "paidOnly": false, "status": null, "title": "Count the Number of Computer Unlocking Permutations", "titleSlug": "count-the-number-of-computer-unlocking-permutations", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser" }, { "name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 36.92356536233034, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3578", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Partitions With Max-Min Difference at Most K", "titleSlug": "count-partitions-with-max-min-difference-at-most-k", "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": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" }, { "name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 40.87016894237445, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3579", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Steps to Convert String with Operations", "titleSlug": "minimum-steps-to-convert-string-with-operations", "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 }, { "acRate": 57.24883691688672, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3580", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Consistently Improving Employees", "titleSlug": "find-consistently-improving-employees", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 85.22848034006375, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3581", "isFavor": false, "paidOnly": true, "status": null, "title": "Count Odd Letters from Number", "titleSlug": "count-odd-letters-from-number", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 31.730099553443402, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3582", "isFavor": false, "paidOnly": false, "status": null, "title": "Generate Tag for Video Caption", "titleSlug": "generate-tag-for-video-caption", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 36.97492140713239, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3583", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Special Triplets", "titleSlug": "count-special-triplets", "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 }, { "acRate": 30.33740497138464, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3584", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Product of First and Last Elements of a Subsequence", "titleSlug": "maximum-product-of-first-and-last-elements-of-a-subsequence", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 23.404255319148938, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3585", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Weighted Median Node in Tree", "titleSlug": "find-weighted-median-node-in-tree", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 40.919705406861866, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3586", "isFavor": false, "paidOnly": false, "status": null, "title": "Find COVID Recovery Patients", "titleSlug": "find-covid-recovery-patients", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.73494911160945, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3587", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Adjacent Swaps to Alternate Parity", "titleSlug": "minimum-adjacent-swaps-to-alternate-parity", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 27.870020853681073, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3588", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Maximum Area of a Triangle", "titleSlug": "find-maximum-area-of-a-triangle", "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" }, { "name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 19.368910862294605, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3589", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Prime-Gap Balanced Subarrays", "titleSlug": "count-prime-gap-balanced-subarrays", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" }, { "name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 27.42462311557789, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3590", "isFavor": false, "paidOnly": false, "status": null, "title": "Kth Smallest Path XOR Sum", "titleSlug": "kth-smallest-path-xor-sum", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree" }, { "name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 62.38728455655747, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3591", "isFavor": false, "paidOnly": false, "status": null, "title": "Check if Any Element Has Prime Frequency", "titleSlug": "check-if-any-element-has-prime-frequency", "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 }, { "acRate": 49.81793103448276, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3592", "isFavor": false, "paidOnly": false, "status": null, "title": "Inverse Coin Change", "titleSlug": "inverse-coin-change", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 40.659725260302736, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3593", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Increments to Equalize Leaf Paths", "titleSlug": "minimum-increments-to-equalize-leaf-paths", "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 }, { "acRate": 25.91484020469248, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3594", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Time to Transport All Individuals", "titleSlug": "minimum-time-to-transport-all-individuals", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "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": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path" }, { "name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 77.71929824561403, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3595", "isFavor": false, "paidOnly": true, "status": null, "title": "Once Twice", "titleSlug": "once-twice", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.86301369863014, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3596", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Cost Path with Alternating Directions I", "titleSlug": "minimum-cost-path-with-alternating-directions-i", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 57.52358063507218, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3597", "isFavor": false, "paidOnly": false, "status": null, "title": "Partition String ", "titleSlug": "partition-string", "topicTags": [ { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 31.661703183719776, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3598", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Common Prefix Between Adjacent Strings After Removals", "titleSlug": "longest-common-prefix-between-adjacent-strings-after-removals", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 40.10329732623689, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3599", "isFavor": false, "paidOnly": false, "status": null, "title": "Partition Array to Minimize XOR", "titleSlug": "partition-array-to-minimize-xor", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 38.35291012273987, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3600", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximize Spanning Tree Stability with Upgrades", "titleSlug": "maximize-spanning-tree-stability-with-upgrades", "topicTags": [ { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "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 }, { "acRate": 49.01639344262295, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3601", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Drivers with Improved Fuel Efficiency", "titleSlug": "find-drivers-with-improved-fuel-efficiency", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 79.98546088979354, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3602", "isFavor": false, "paidOnly": false, "status": null, "title": "Hexadecimal and Hexatrigesimal Conversion", "titleSlug": "hexadecimal-and-hexatrigesimal-conversion", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 44.012766064383186, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3603", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Cost Path with Alternating Directions II", "titleSlug": "minimum-cost-path-with-alternating-directions-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" }, { "name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 45.577755153983205, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3604", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Time to Reach Destination in Directed Graph", "titleSlug": "minimum-time-to-reach-destination-in-directed-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": false, "hasVideoSolution": false }, { "acRate": 17.890376758965047, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3605", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Stability Factor of Array", "titleSlug": "minimum-stability-factor-of-array", "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": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 53.772943575798784, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3606", "isFavor": false, "paidOnly": false, "status": null, "title": "Coupon Code Validator", "titleSlug": "coupon-code-validator", "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 }, { "acRate": 44.31243862128434, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3607", "isFavor": false, "paidOnly": false, "status": null, "title": "Power Grid Maintenance", "titleSlug": "power-grid-maintenance", "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" }, { "name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue" }, { "name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 44.30383551761452, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3608", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Time for K Connected Components", "titleSlug": "minimum-time-for-k-connected-components", "topicTags": [ { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 13.700428138379324, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3609", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Moves to Reach Target in Grid", "titleSlug": "minimum-moves-to-reach-target-in-grid", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 59.47940151670424, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3610", "isFavor": false, "paidOnly": true, "status": null, "title": "Minimum Number of Primes to Sum to Target", "titleSlug": "minimum-number-of-primes-to-sum-to-target", "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 }, { "acRate": 43.38689740420272, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3611", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Overbooked Employees", "titleSlug": "find-overbooked-employees", "topicTags": [ { "name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 64.81680494060669, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3612", "isFavor": false, "paidOnly": false, "status": null, "title": "Process String with Special Operations I", "titleSlug": "process-string-with-special-operations-i", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 42.89384111489307, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3613", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimize Maximum Component Cost", "titleSlug": "minimize-maximum-component-cost", "topicTags": [ { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find" }, { "name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 15.943470379698102, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3614", "isFavor": false, "paidOnly": false, "status": null, "title": "Process String with Special Operations II", "titleSlug": "process-string-with-special-operations-ii", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 18.09527130701632, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3615", "isFavor": false, "paidOnly": false, "status": null, "title": "Longest Palindromic Path in Graph", "titleSlug": "longest-palindromic-path-in-graph", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "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 }, { "acRate": 86.51315789473685, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3616", "isFavor": false, "paidOnly": true, "status": null, "title": "Number of Student Replacements", "titleSlug": "number-of-student-replacements", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 28.211881767632423, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3617", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Students with Study Spiral Pattern", "titleSlug": "find-students-with-study-spiral-pattern", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 48.953446668101286, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3618", "isFavor": false, "paidOnly": false, "status": null, "title": "Split Array by Prime Indices", "titleSlug": "split-array-by-prime-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 }, { "acRate": 55.5545546672672, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3619", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Islands With Total Value Divisible by K", "titleSlug": "count-islands-with-total-value-divisible-by-k", "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 }, { "acRate": 29.99404380097132, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3620", "isFavor": false, "paidOnly": false, "status": null, "title": "Network Recovery Pathways", "titleSlug": "network-recovery-pathways", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" }, { "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 }, { "acRate": 20.062963555840135, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3621", "isFavor": false, "paidOnly": false, "status": null, "title": "Number of Integers With Popcount-Depth Equal to K I", "titleSlug": "number-of-integers-with-popcount-depth-equal-to-k-i", "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 }, { "acRate": 64.0820304782477, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3622", "isFavor": false, "paidOnly": false, "status": null, "title": "Check Divisibility by Digit Sum and Product", "titleSlug": "check-divisibility-by-digit-sum-and-product", "topicTags": [ { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 29.895521845982493, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3623", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Number of Trapezoids I", "titleSlug": "count-number-of-trapezoids-i", "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": false, "hasVideoSolution": false }, { "acRate": 37.924380389555566, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3624", "isFavor": false, "paidOnly": false, "status": null, "title": "Number of Integers With Popcount-Depth Equal to K II", "titleSlug": "number-of-integers-with-popcount-depth-equal-to-k-ii", "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 12.713010549093859, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3625", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Number of Trapezoids II", "titleSlug": "count-number-of-trapezoids-ii", "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": false, "hasVideoSolution": false }, { "acRate": 51.81532944867773, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3626", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Stores with Inventory Imbalance", "titleSlug": "find-stores-with-inventory-imbalance", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 60.011987712594596, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3627", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Median Sum of Subsequences of Size 3", "titleSlug": "maximum-median-sum-of-subsequences-of-size-3", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" }, { "name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 24.787167308898646, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3628", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Number of Subsequences After One Inserting", "titleSlug": "maximum-number-of-subsequences-after-one-inserting", "topicTags": [ { "name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string" }, { "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 }, { "acRate": 18.569660032377868, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3629", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Jumps to Reach End via Prime Teleportation", "titleSlug": "minimum-jumps-to-reach-end-via-prime-teleportation", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search" }, { "name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 11.566726363243376, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3630", "isFavor": false, "paidOnly": false, "status": null, "title": "Partition Array for Maximum XOR and AND", "titleSlug": "partition-array-for-maximum-xor-and-and", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math" }, { "name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 71.7439293598234, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3631", "isFavor": false, "paidOnly": true, "status": null, "title": "Sort Threats by Severity and Exploitability", "titleSlug": "sort-threats-by-severity-and-exploitability", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 41.48936170212766, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3632", "isFavor": false, "paidOnly": true, "status": null, "title": "Subarrays with XOR at Least K", "titleSlug": "subarrays-with-xor-at-least-k", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 61.01060381067911, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3633", "isFavor": false, "paidOnly": false, "status": null, "title": "Earliest Finish Time for Land and Water Rides I", "titleSlug": "earliest-finish-time-for-land-and-water-rides-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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy" }, { "name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 37.79193798017262, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3634", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Removals to Balance Array", "titleSlug": "minimum-removals-to-balance-array", "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 }, { "acRate": 33.10064840235995, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3635", "isFavor": false, "paidOnly": false, "status": null, "title": "Earliest Finish Time for Land and Water Rides II", "titleSlug": "earliest-finish-time-for-land-and-water-rides-ii", "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 }, { "acRate": 19.97967805765014, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3636", "isFavor": false, "paidOnly": false, "status": null, "title": "Threshold Majority Queries", "titleSlug": "threshold-majority-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": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer" }, { "name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 39.627592617696614, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3637", "isFavor": false, "paidOnly": false, "status": null, "title": "Trionic Array I", "titleSlug": "trionic-array-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 55.137292807790075, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3638", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Balanced Shipments", "titleSlug": "maximum-balanced-shipments", "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 }, { "acRate": 34.07750437747673, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3639", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Time to Activate String", "titleSlug": "minimum-time-to-activate-string", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.486602271349472, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3640", "isFavor": false, "paidOnly": false, "status": null, "title": "Trionic Array II", "titleSlug": "trionic-array-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 68.49557522123894, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3641", "isFavor": false, "paidOnly": true, "status": null, "title": "Longest Semi-Repeating Subarray", "titleSlug": "longest-semi-repeating-subarray", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 45.85471772601658, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3642", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Books with Polarized Opinions", "titleSlug": "find-books-with-polarized-opinions", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 66.05465194167253, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3643", "isFavor": false, "paidOnly": false, "status": null, "title": "Flip Square Submatrix Vertically", "titleSlug": "flip-square-submatrix-vertically", "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 }, { "acRate": 32.869468410798774, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3644", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum K to Sort a Permutation", "titleSlug": "maximum-k-to-sort-a-permutation", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 37.43330624359563, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3645", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Total from Optimal Activation Order", "titleSlug": "maximum-total-from-optimal-activation-order", "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" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 26.24561806792713, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3646", "isFavor": false, "paidOnly": false, "status": null, "title": "Next Special Palindrome Number", "titleSlug": "next-special-palindrome-number", "topicTags": [ { "name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 66.66666666666666, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3647", "isFavor": false, "paidOnly": true, "status": null, "title": "Maximum Weight in Two Bags", "titleSlug": "maximum-weight-in-two-bags", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 68.4788661098456, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3648", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Sensors to Cover Grid", "titleSlug": "minimum-sensors-to-cover-grid", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 30.57284504595788, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3649", "isFavor": false, "paidOnly": false, "status": null, "title": "Number of Perfect Pairs", "titleSlug": "number-of-perfect-pairs", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 46.103616532721006, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3650", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Cost Path with Edge Reversals", "titleSlug": "minimum-cost-path-with-edge-reversals", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 17.7467073869059, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3651", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Cost Path with Teleportations", "titleSlug": "minimum-cost-path-with-teleportations", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 37.76499431153557, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3652", "isFavor": false, "paidOnly": false, "status": null, "title": "Best Time to Buy and Sell Stock using Strategy", "titleSlug": "best-time-to-buy-and-sell-stock-using-strategy", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window" }, { "name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 61.208727553581774, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3653", "isFavor": false, "paidOnly": false, "status": null, "title": "XOR After Range Multiplication Queries I", "titleSlug": "xor-after-range-multiplication-queries-i", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer" }, { "name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 28.02405498281787, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3654", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Sum After Divisible Sum Deletions", "titleSlug": "minimum-sum-after-divisible-sum-deletions", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 22.266238644901303, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3655", "isFavor": false, "paidOnly": false, "status": null, "title": "XOR After Range Multiplication Queries II", "titleSlug": "xor-after-range-multiplication-queries-ii", "topicTags": [ { "name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array" }, { "name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer" } ], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 55.27065527065527, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3656", "isFavor": false, "paidOnly": true, "status": null, "title": "Determine if a Simple Graph Exists", "titleSlug": "determine-if-a-simple-graph-exists", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 62.10443037974683, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3657", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Loyal Customers", "titleSlug": "find-loyal-customers", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 80.46087373979837, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3658", "isFavor": false, "paidOnly": false, "status": null, "title": "GCD of Odd and Even Sums", "titleSlug": "gcd-of-odd-and-even-sums", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 40.506146059291396, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3659", "isFavor": false, "paidOnly": false, "status": null, "title": "Partition Array Into K-Distinct Groups", "titleSlug": "partition-array-into-k-distinct-groups", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 20.62701555292485, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3660", "isFavor": false, "paidOnly": false, "status": null, "title": "Jump Game IX", "titleSlug": "jump-game-ix", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 27.23449001051525, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3661", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Walls Destroyed by Robots", "titleSlug": "maximum-walls-destroyed-by-robots", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 90.61224489795919, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3662", "isFavor": false, "paidOnly": true, "status": null, "title": "Filter Characters by Frequency", "titleSlug": "filter-characters-by-frequency", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 69.39300300365193, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3663", "isFavor": false, "paidOnly": false, "status": null, "title": "Find The Least Frequent Digit", "titleSlug": "find-the-least-frequent-digit", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 9.761928911944127, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3664", "isFavor": false, "paidOnly": false, "status": null, "title": "Two-Letter Card Game", "titleSlug": "two-letter-card-game", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 47.18240642149234, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3665", "isFavor": false, "paidOnly": false, "status": null, "title": "Twisted Mirror Path Count", "titleSlug": "twisted-mirror-path-count", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 16.899224806201552, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3666", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Operations to Equalize Binary String", "titleSlug": "minimum-operations-to-equalize-binary-string", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 84.25531914893617, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3667", "isFavor": false, "paidOnly": true, "status": null, "title": "Sort Array By Absolute Value", "titleSlug": "sort-array-by-absolute-value", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 89.02751452792069, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3668", "isFavor": false, "paidOnly": false, "status": null, "title": "Restore Finishing Order", "titleSlug": "restore-finishing-order", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 30.08149568552253, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3669", "isFavor": false, "paidOnly": false, "status": null, "title": "Balanced K-Factor Decomposition", "titleSlug": "balanced-k-factor-decomposition", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 11.425658249865052, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3670", "isFavor": false, "paidOnly": false, "status": null, "title": "Maximum Product of Two Integers With No Common Bits", "titleSlug": "maximum-product-of-two-integers-with-no-common-bits", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 16.332928802589, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3671", "isFavor": false, "paidOnly": false, "status": null, "title": "Sum of Beautiful Subsequences", "titleSlug": "sum-of-beautiful-subsequences", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 84.61538461538461, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3672", "isFavor": false, "paidOnly": true, "status": null, "title": "Sum of Weighted Modes in Subarrays", "titleSlug": "sum-of-weighted-modes-in-subarrays", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 72.72727272727273, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3673", "isFavor": false, "paidOnly": false, "status": null, "title": "Find Zombie Sessions", "titleSlug": "find-zombie-sessions", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 46.67801160059441, "difficulty": "Easy", "freqBar": null, "frontendQuestionId": "3674", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Operations to Equalize Array", "titleSlug": "minimum-operations-to-equalize-array", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 56.90628411040075, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3675", "isFavor": false, "paidOnly": false, "status": null, "title": "Minimum Operations to Transform String", "titleSlug": "minimum-operations-to-transform-string", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 29.153939393939392, "difficulty": "Medium", "freqBar": null, "frontendQuestionId": "3676", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Bowl Subarrays", "titleSlug": "count-bowl-subarrays", "topicTags": [], "hasSolution": false, "hasVideoSolution": false }, { "acRate": 15.609678949865572, "difficulty": "Hard", "freqBar": null, "frontendQuestionId": "3677", "isFavor": false, "paidOnly": false, "status": null, "title": "Count Binary Palindromic Numbers", "titleSlug": "count-binary-palindromic-numbers", "topicTags": [], "hasSolution": false, "hasVideoSolution": false } ] } } }