data.json

[{"questionId":"1","title":"Two Sum","titleSlug":"two-sum","isPaidOnly":false,"difficulty":"Easy","likes":69050,"dislikes":2577,"categoryTitle":"Algorithms","acRate":"57.6%","frontendQuestionId":"1","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":57.6122082510361,"totalAccepted":22090103,"totalSubmission":38342738},{"questionId":"2","title":"Add Two Numbers","titleSlug":"add-two-numbers","isPaidOnly":false,"difficulty":"Medium","likes":36910,"dislikes":7269,"categoryTitle":"Algorithms","acRate":"48.6%","frontendQuestionId":"2","paidOnly":false,"topicTags":"Linked List;Math;Recursion;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":48.60987298154571,"totalAccepted":7127952,"totalSubmission":14663615},{"questionId":"3","title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters","isPaidOnly":false,"difficulty":"Medium","likes":45206,"dislikes":2222,"categoryTitle":"Algorithms","acRate":"39.2%","frontendQuestionId":"3","paidOnly":false,"topicTags":"Hash Table;String;Sliding Window;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":39.20480659878784,"totalAccepted":9639580,"totalSubmission":24587835},{"questionId":"4","title":"Median of Two Sorted Arrays","titleSlug":"median-of-two-sorted-arrays","isPaidOnly":false,"difficulty":"Hard","likes":32307,"dislikes":3586,"categoryTitle":"Algorithms","acRate":"46.7%","frontendQuestionId":"4","paidOnly":false,"topicTags":"Array;Binary Search;Divide and Conquer;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":46.726666193208075,"totalAccepted":4322685,"totalSubmission":9251022},{"questionId":"5","title":"Longest Palindromic Substring","titleSlug":"longest-palindromic-substring","isPaidOnly":false,"difficulty":"Medium","likes":32760,"dislikes":2016,"categoryTitle":"Algorithms","acRate":"38.0%","frontendQuestionId":"5","paidOnly":false,"topicTags":"Two Pointers;String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":37.958350062134045,"totalAccepted":4808460,"totalSubmission":12667740},{"questionId":"6","title":"Zigzag Conversion","titleSlug":"zigzag-conversion","isPaidOnly":false,"difficulty":"Medium","likes":9420,"dislikes":15959,"categoryTitle":"Algorithms","acRate":"54.3%","frontendQuestionId":"6","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":54.277675416981744,"totalAccepted":2242386,"totalSubmission":4131323},{"questionId":"7","title":"Reverse Integer","titleSlug":"reverse-integer","isPaidOnly":false,"difficulty":"Medium","likes":15632,"dislikes":14014,"categoryTitle":"Algorithms","acRate":"32.0%","frontendQuestionId":"7","paidOnly":false,"topicTags":"Math;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":31.982933840658763,"totalAccepted":5064891,"totalSubmission":15836244},{"questionId":"8","title":"String to Integer (atoi)","titleSlug":"string-to-integer-atoi","isPaidOnly":false,"difficulty":"Medium","likes":6299,"dislikes":15680,"categoryTitle":"Algorithms","acRate":"21.1%","frontendQuestionId":"8","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":21.11307823361928,"totalAccepted":2481467,"totalSubmission":11753216},{"questionId":"9","title":"Palindrome Number","titleSlug":"palindrome-number","isPaidOnly":false,"difficulty":"Easy","likes":16034,"dislikes":2938,"categoryTitle":"Algorithms","acRate":"60.6%","frontendQuestionId":"9","paidOnly":false,"topicTags":"Math;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":60.640069371608305,"totalAccepted":8260178,"totalSubmission":13621643},{"questionId":"10","title":"Regular Expression Matching","titleSlug":"regular-expression-matching","isPaidOnly":false,"difficulty":"Hard","likes":13383,"dislikes":2408,"categoryTitle":"Algorithms","acRate":"31.0%","frontendQuestionId":"10","paidOnly":false,"topicTags":"String;Dynamic Programming;Recursion;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":31.049306745496253,"totalAccepted":1412290,"totalSubmission":4548533},{"questionId":"11","title":"Container With Most Water","titleSlug":"container-with-most-water","isPaidOnly":false,"difficulty":"Medium","likes":34462,"dislikes":2218,"categoryTitle":"Algorithms","acRate":"60.2%","frontendQuestionId":"11","paidOnly":false,"topicTags":"Array;Two Pointers;Greedy;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":60.15470243846934,"totalAccepted":5466458,"totalSubmission":9087341},{"questionId":"12","title":"Integer to Roman","titleSlug":"integer-to-roman","isPaidOnly":false,"difficulty":"Medium","likes":8605,"dislikes":5727,"categoryTitle":"Algorithms","acRate":"71.1%","frontendQuestionId":"12","paidOnly":false,"topicTags":"Hash Table;Math;String;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":71.09225659298981,"totalAccepted":2175283,"totalSubmission":3059803},{"questionId":"13","title":"Roman to Integer","titleSlug":"roman-to-integer","isPaidOnly":false,"difficulty":"Easy","likes":17824,"dislikes":1246,"categoryTitle":"Algorithms","acRate":"66.7%","frontendQuestionId":"13","paidOnly":false,"topicTags":"Hash Table;Math;String;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":66.72769372264183,"totalAccepted":5958709,"totalSubmission":8929893},{"questionId":"14","title":"Longest Common Prefix","titleSlug":"longest-common-prefix","isPaidOnly":false,"difficulty":"Easy","likes":21522,"dislikes":4944,"categoryTitle":"Algorithms","acRate":"47.7%","frontendQuestionId":"14","paidOnly":false,"topicTags":"Array;String;Trie;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":47.69647804375778,"totalAccepted":5869977,"totalSubmission":12306964},{"questionId":"15","title":"3Sum","titleSlug":"3sum","isPaidOnly":false,"difficulty":"Medium","likes":35790,"dislikes":3296,"categoryTitle":"Algorithms","acRate":"39.2%","frontendQuestionId":"15","paidOnly":false,"topicTags":"Array;Two Pointers;Sorting;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":39.21149578734539,"totalAccepted":6065269,"totalSubmission":15468133},{"questionId":"16","title":"3Sum Closest","titleSlug":"3sum-closest","isPaidOnly":false,"difficulty":"Medium","likes":11708,"dislikes":623,"categoryTitle":"Algorithms","acRate":"48.7%","frontendQuestionId":"16","paidOnly":false,"topicTags":"Array;Two Pointers;Sorting;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":48.67708924565968,"totalAccepted":1873897,"totalSubmission":3849650},{"questionId":"17","title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number","isPaidOnly":false,"difficulty":"Medium","likes":21079,"dislikes":1138,"categoryTitle":"Algorithms","acRate":"66.2%","frontendQuestionId":"17","paidOnly":false,"topicTags":"Hash Table;String;Backtracking;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":66.17969096553985,"totalAccepted":3062893,"totalSubmission":4628148},{"questionId":"18","title":"4Sum","titleSlug":"4sum","isPaidOnly":false,"difficulty":"Medium","likes":12956,"dislikes":1544,"categoryTitle":"Algorithms","acRate":"40.8%","frontendQuestionId":"18","paidOnly":false,"topicTags":"Array;Two Pointers;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":40.800958588803816,"totalAccepted":1735547,"totalSubmission":4253711},{"questionId":"19","title":"Remove Nth Node From End of List","titleSlug":"remove-nth-node-from-end-of-list","isPaidOnly":false,"difficulty":"Medium","likes":21351,"dislikes":913,"categoryTitle":"Algorithms","acRate":"51.8%","frontendQuestionId":"19","paidOnly":false,"topicTags":"Linked List;Two Pointers;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":51.77013523992093,"totalAccepted":4275543,"totalSubmission":8258737},{"questionId":"20","title":"Valid Parentheses","titleSlug":"valid-parentheses","isPaidOnly":false,"difficulty":"Easy","likes":28086,"dislikes":2013,"categoryTitle":"Algorithms","acRate":"44.3%","frontendQuestionId":"20","paidOnly":false,"topicTags":"String;Stack;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":44.28862445808623,"totalAccepted":7681408,"totalSubmission":17344000},{"questionId":"21","title":"Merge Two Sorted Lists","titleSlug":"merge-two-sorted-lists","isPaidOnly":false,"difficulty":"Easy","likes":25096,"dislikes":2450,"categoryTitle":"Algorithms","acRate":"68.4%","frontendQuestionId":"21","paidOnly":false,"topicTags":"Linked List;Recursion;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":68.38794284110902,"totalAccepted":6349082,"totalSubmission":9283927},{"questionId":"22","title":"Generate Parentheses","titleSlug":"generate-parentheses","isPaidOnly":false,"difficulty":"Medium","likes":23364,"dislikes":1087,"categoryTitle":"Algorithms","acRate":"78.7%","frontendQuestionId":"22","paidOnly":false,"topicTags":"String;Dynamic Programming;Backtracking;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":78.74439877531853,"totalAccepted":2939431,"totalSubmission":3732876},{"questionId":"23","title":"Merge k Sorted Lists","titleSlug":"merge-k-sorted-lists","isPaidOnly":false,"difficulty":"Hard","likes":21391,"dislikes":794,"categoryTitle":"Algorithms","acRate":"59.7%","frontendQuestionId":"23","paidOnly":false,"topicTags":"Linked List;Divide and Conquer;Heap (Priority Queue);Merge Sort;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":59.72577360342296,"totalAccepted":3036719,"totalSubmission":5084451},{"questionId":"24","title":"Swap Nodes in Pairs","titleSlug":"swap-nodes-in-pairs","isPaidOnly":false,"difficulty":"Medium","likes":13223,"dislikes":518,"categoryTitle":"Algorithms","acRate":"69.6%","frontendQuestionId":"24","paidOnly":false,"topicTags":"Linked List;Recursion;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":69.6386305201987,"totalAccepted":1950640,"totalSubmission":2801096},{"questionId":"25","title":"Reverse Nodes in k-Group","titleSlug":"reverse-nodes-in-k-group","isPaidOnly":false,"difficulty":"Hard","likes":15762,"dislikes":808,"categoryTitle":"Algorithms","acRate":"66.3%","frontendQuestionId":"25","paidOnly":false,"topicTags":"Linked List;Recursion;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":66.28810343781802,"totalAccepted":1573705,"totalSubmission":2374044},{"questionId":"26","title":"Remove Duplicates from Sorted Array","titleSlug":"remove-duplicates-from-sorted-array","isPaidOnly":false,"difficulty":"Easy","likes":19305,"dislikes":20558,"categoryTitle":"Algorithms","acRate":"63.0%","frontendQuestionId":"26","paidOnly":false,"topicTags":"Array;Two Pointers;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":62.972818649170236,"totalAccepted":7996740,"totalSubmission":12698749},{"questionId":"27","title":"Remove Element","titleSlug":"remove-element","isPaidOnly":false,"difficulty":"Easy","likes":5206,"dislikes":5384,"categoryTitle":"Algorithms","acRate":"61.9%","frontendQuestionId":"27","paidOnly":false,"topicTags":"Array;Two Pointers;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":61.896804137879194,"totalAccepted":5319134,"totalSubmission":8593556},{"questionId":"28","title":"Find the Index of the First Occurrence in a String","titleSlug":"find-the-index-of-the-first-occurrence-in-a-string","isPaidOnly":false,"difficulty":"Easy","likes":7688,"dislikes":586,"categoryTitle":"Algorithms","acRate":"46.8%","frontendQuestionId":"28","paidOnly":false,"topicTags":"Two Pointers;String;String Matching;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":46.75173554407392,"totalAccepted":4130996,"totalSubmission":8836051},{"questionId":"29","title":"Divide Two Integers","titleSlug":"divide-two-integers","isPaidOnly":false,"difficulty":"Medium","likes":6160,"dislikes":15288,"categoryTitle":"Algorithms","acRate":"19.9%","frontendQuestionId":"29","paidOnly":false,"topicTags":"Math;Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":19.8702842791493,"totalAccepted":1189926,"totalSubmission":5988467},{"questionId":"30","title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words","isPaidOnly":false,"difficulty":"Hard","likes":2690,"dislikes":443,"categoryTitle":"Algorithms","acRate":"34.5%","frontendQuestionId":"30","paidOnly":false,"topicTags":"Hash Table;String;Sliding Window;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":34.51482570184757,"totalAccepted":725518,"totalSubmission":2102054},{"questionId":"31","title":"Next Permutation","titleSlug":"next-permutation","isPaidOnly":false,"difficulty":"Medium","likes":21522,"dislikes":5127,"categoryTitle":"Algorithms","acRate":"45.4%","frontendQuestionId":"31","paidOnly":false,"topicTags":"Array;Two Pointers;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":45.42467369703525,"totalAccepted":2314553,"totalSubmission":5095367},{"questionId":"32","title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses","isPaidOnly":false,"difficulty":"Hard","likes":13359,"dislikes":468,"categoryTitle":"Algorithms","acRate":"38.9%","frontendQuestionId":"32","paidOnly":false,"topicTags":"String;Dynamic Programming;Stack;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":38.93676425024276,"totalAccepted":1124727,"totalSubmission":2888603},{"questionId":"33","title":"Search in Rotated Sorted Array","titleSlug":"search-in-rotated-sorted-array","isPaidOnly":false,"difficulty":"Medium","likes":30347,"dislikes":1837,"categoryTitle":"Algorithms","acRate":"45.0%","frontendQuestionId":"33","paidOnly":false,"topicTags":"Array;Binary Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.00826070410449,"totalAccepted":4625456,"totalSubmission":10276912},{"questionId":"34","title":"Find First and Last Position of Element in Sorted Array","titleSlug":"find-first-and-last-position-of-element-in-sorted-array","isPaidOnly":false,"difficulty":"Medium","likes":23438,"dislikes":654,"categoryTitle":"Algorithms","acRate":"49.0%","frontendQuestionId":"34","paidOnly":false,"topicTags":"Array;Binary Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.02219760431957,"totalAccepted":3379020,"totalSubmission":6892843},{"questionId":"35","title":"Search Insert Position","titleSlug":"search-insert-position","isPaidOnly":false,"difficulty":"Easy","likes":18928,"dislikes":903,"categoryTitle":"Algorithms","acRate":"51.4%","frontendQuestionId":"35","paidOnly":false,"topicTags":"Array;Binary Search;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":51.409301773724906,"totalAccepted":4831166,"totalSubmission":9397456},{"questionId":"36","title":"Valid Sudoku","titleSlug":"valid-sudoku","isPaidOnly":false,"difficulty":"Medium","likes":12561,"dislikes":1269,"categoryTitle":"Algorithms","acRate":"64.6%","frontendQuestionId":"36","paidOnly":false,"topicTags":"Array;Hash Table;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.60822807837049,"totalAccepted":2526960,"totalSubmission":3911207},{"questionId":"37","title":"Sudoku Solver","titleSlug":"sudoku-solver","isPaidOnly":false,"difficulty":"Hard","likes":11178,"dislikes":347,"categoryTitle":"Algorithms","acRate":"65.5%","frontendQuestionId":"37","paidOnly":false,"topicTags":"Array;Hash Table;Backtracking;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.53202819807171,"totalAccepted":1055823,"totalSubmission":1611159},{"questionId":"38","title":"Count and Say","titleSlug":"count-and-say","isPaidOnly":false,"difficulty":"Medium","likes":5154,"dislikes":9104,"categoryTitle":"Algorithms","acRate":"63.0%","frontendQuestionId":"38","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":63.02646376607858,"totalAccepted":1434674,"totalSubmission":2276310},{"questionId":"39","title":"Combination Sum","titleSlug":"combination-sum","isPaidOnly":false,"difficulty":"Medium","likes":21089,"dislikes":543,"categoryTitle":"Algorithms","acRate":"76.6%","frontendQuestionId":"39","paidOnly":false,"topicTags":"Array;Backtracking;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":76.63174074953682,"totalAccepted":3197642,"totalSubmission":4172738},{"questionId":"40","title":"Combination Sum II","titleSlug":"combination-sum-ii","isPaidOnly":false,"difficulty":"Medium","likes":12331,"dislikes":391,"categoryTitle":"Algorithms","acRate":"59.6%","frontendQuestionId":"40","paidOnly":false,"topicTags":"Array;Backtracking;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.55576930586643,"totalAccepted":1738577,"totalSubmission":2919244},{"questionId":"41","title":"First Missing Positive","titleSlug":"first-missing-positive","isPaidOnly":false,"difficulty":"Hard","likes":18491,"dislikes":1984,"categoryTitle":"Algorithms","acRate":"43.0%","frontendQuestionId":"41","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":43.02941010459467,"totalAccepted":1783875,"totalSubmission":4145713},{"questionId":"42","title":"Trapping Rain Water","titleSlug":"trapping-rain-water","isPaidOnly":false,"difficulty":"Hard","likes":36587,"dislikes":705,"categoryTitle":"Algorithms","acRate":"67.5%","frontendQuestionId":"42","paidOnly":false,"topicTags":"Array;Two Pointers;Dynamic Programming;Stack;Monotonic Stack;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":67.50283069244095,"totalAccepted":3621717,"totalSubmission":5365286},{"questionId":"43","title":"Multiply Strings","titleSlug":"multiply-strings","isPaidOnly":false,"difficulty":"Medium","likes":7780,"dislikes":3695,"categoryTitle":"Algorithms","acRate":"44.3%","frontendQuestionId":"43","paidOnly":false,"topicTags":"Math;String;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":44.25976548584628,"totalAccepted":1180304,"totalSubmission":2666776},{"questionId":"44","title":"Wildcard Matching","titleSlug":"wildcard-matching","isPaidOnly":false,"difficulty":"Hard","likes":9164,"dislikes":421,"categoryTitle":"Algorithms","acRate":"32.1%","frontendQuestionId":"44","paidOnly":false,"topicTags":"String;Dynamic Programming;Greedy;Recursion;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":32.11035102283882,"totalAccepted":890759,"totalSubmission":2774067},{"questionId":"45","title":"Jump Game II","titleSlug":"jump-game-ii","isPaidOnly":false,"difficulty":"Medium","likes":16613,"dislikes":711,"categoryTitle":"Algorithms","acRate":"43.0%","frontendQuestionId":"45","paidOnly":false,"topicTags":"Array;Dynamic Programming;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":42.972640287718875,"totalAccepted":2186086,"totalSubmission":5087167},{"questionId":"46","title":"Permutations","titleSlug":"permutations","isPaidOnly":false,"difficulty":"Medium","likes":20955,"dislikes":386,"categoryTitle":"Algorithms","acRate":"82.0%","frontendQuestionId":"46","paidOnly":false,"topicTags":"Array;Backtracking;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":81.99137660171343,"totalAccepted":3134029,"totalSubmission":3822389},{"questionId":"47","title":"Permutations II","titleSlug":"permutations-ii","isPaidOnly":false,"difficulty":"Medium","likes":9192,"dislikes":163,"categoryTitle":"Algorithms","acRate":"63.5%","frontendQuestionId":"47","paidOnly":false,"topicTags":"Array;Backtracking;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":63.54609667251356,"totalAccepted":1308186,"totalSubmission":2058641},{"questionId":"48","title":"Rotate Image","titleSlug":"rotate-image","isPaidOnly":false,"difficulty":"Medium","likes":20141,"dislikes":972,"categoryTitle":"Algorithms","acRate":"80.2%","frontendQuestionId":"48","paidOnly":false,"topicTags":"Array;Math;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":80.21420716599704,"totalAccepted":2968778,"totalSubmission":3701068},{"questionId":"49","title":"Group Anagrams","titleSlug":"group-anagrams","isPaidOnly":false,"difficulty":"Medium","likes":22195,"dislikes":758,"categoryTitle":"Algorithms","acRate":"72.7%","frontendQuestionId":"49","paidOnly":false,"topicTags":"Array;Hash Table;String;Sorting;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":72.71904304116265,"totalAccepted":4835777,"totalSubmission":6649950},{"questionId":"50","title":"Pow(x, n)","titleSlug":"powx-n","isPaidOnly":false,"difficulty":"Medium","likes":11782,"dislikes":10573,"categoryTitle":"Algorithms","acRate":"38.8%","frontendQuestionId":"50","paidOnly":false,"topicTags":"Math;Recursion;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":38.76607410647777,"totalAccepted":2761319,"totalSubmission":7123013},{"questionId":"51","title":"N-Queens","titleSlug":"n-queens","isPaidOnly":false,"difficulty":"Hard","likes":14460,"dislikes":352,"categoryTitle":"Algorithms","acRate":"75.7%","frontendQuestionId":"51","paidOnly":false,"topicTags":"Array;Backtracking;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.70238924140456,"totalAccepted":1306865,"totalSubmission":1726320},{"questionId":"52","title":"N-Queens II","titleSlug":"n-queens-ii","isPaidOnly":false,"difficulty":"Hard","likes":4316,"dislikes":283,"categoryTitle":"Algorithms","acRate":"78.8%","frontendQuestionId":"52","paidOnly":false,"topicTags":"Backtracking;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":78.78133357974116,"totalAccepted":613858,"totalSubmission":779192},{"questionId":"53","title":"Maximum Subarray","titleSlug":"maximum-subarray","isPaidOnly":false,"difficulty":"Medium","likes":37989,"dislikes":1616,"categoryTitle":"Algorithms","acRate":"53.4%","frontendQuestionId":"53","paidOnly":false,"topicTags":"Array;Divide and Conquer;Dynamic Programming;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":53.4105096107523,"totalAccepted":6219506,"totalSubmission":11644724},{"questionId":"54","title":"Spiral Matrix","titleSlug":"spiral-matrix","isPaidOnly":false,"difficulty":"Medium","likes":17576,"dislikes":1578,"categoryTitle":"Algorithms","acRate":"57.0%","frontendQuestionId":"54","paidOnly":false,"topicTags":"Array;Matrix;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":56.95617793315395,"totalAccepted":2435948,"totalSubmission":4276897},{"questionId":"55","title":"Jump Game","titleSlug":"jump-game","isPaidOnly":false,"difficulty":"Medium","likes":21865,"dislikes":1494,"categoryTitle":"Algorithms","acRate":"41.0%","frontendQuestionId":"55","paidOnly":false,"topicTags":"Array;Dynamic Programming;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":40.99742465889424,"totalAccepted":3254029,"totalSubmission":7937163},{"questionId":"56","title":"Merge Intervals","titleSlug":"merge-intervals","isPaidOnly":false,"difficulty":"Medium","likes":24782,"dislikes":910,"categoryTitle":"Algorithms","acRate":"52.0%","frontendQuestionId":"56","paidOnly":false,"topicTags":"Array;Sorting;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":52.005326382376296,"totalAccepted":4080831,"totalSubmission":7846959},{"questionId":"57","title":"Insert Interval","titleSlug":"insert-interval","isPaidOnly":false,"difficulty":"Medium","likes":11920,"dislikes":923,"categoryTitle":"Algorithms","acRate":"45.3%","frontendQuestionId":"57","paidOnly":false,"topicTags":"Array;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.337261606470136,"totalAccepted":1811205,"totalSubmission":3994965},{"questionId":"58","title":"Length of Last Word","titleSlug":"length-of-last-word","isPaidOnly":false,"difficulty":"Easy","likes":6491,"dislikes":365,"categoryTitle":"Algorithms","acRate":"59.0%","frontendQuestionId":"58","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.95910973734957,"totalAccepted":3473876,"totalSubmission":5892011},{"questionId":"59","title":"Spiral Matrix II","titleSlug":"spiral-matrix-ii","isPaidOnly":false,"difficulty":"Medium","likes":6941,"dislikes":289,"categoryTitle":"Algorithms","acRate":"75.2%","frontendQuestionId":"59","paidOnly":false,"topicTags":"Array;Matrix;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.15714681167857,"totalAccepted":817217,"totalSubmission":1087347},{"questionId":"60","title":"Permutation Sequence","titleSlug":"permutation-sequence","isPaidOnly":false,"difficulty":"Hard","likes":7302,"dislikes":511,"categoryTitle":"Algorithms","acRate":"53.3%","frontendQuestionId":"60","paidOnly":false,"topicTags":"Math;Recursion;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.26178544503082,"totalAccepted":588484,"totalSubmission":1104891},{"questionId":"61","title":"Rotate List","titleSlug":"rotate-list","isPaidOnly":false,"difficulty":"Medium","likes":11499,"dislikes":1558,"categoryTitle":"Algorithms","acRate":"42.7%","frontendQuestionId":"61","paidOnly":false,"topicTags":"Linked List;Two Pointers;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":42.68399871039396,"totalAccepted":1740950,"totalSubmission":4078717},{"questionId":"62","title":"Unique Paths","titleSlug":"unique-paths","isPaidOnly":false,"difficulty":"Medium","likes":18467,"dislikes":498,"categoryTitle":"Algorithms","acRate":"66.9%","frontendQuestionId":"62","paidOnly":false,"topicTags":"Math;Dynamic Programming;Combinatorics;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":66.91323834519292,"totalAccepted":2881978,"totalSubmission":4307033},{"questionId":"63","title":"Unique Paths II","titleSlug":"unique-paths-ii","isPaidOnly":false,"difficulty":"Medium","likes":9736,"dislikes":562,"categoryTitle":"Algorithms","acRate":"44.6%","frontendQuestionId":"63","paidOnly":false,"topicTags":"Array;Dynamic Programming;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":44.57306855229406,"totalAccepted":1513478,"totalSubmission":3395499},{"questionId":"64","title":"Minimum Path Sum","titleSlug":"minimum-path-sum","isPaidOnly":false,"difficulty":"Medium","likes":13754,"dislikes":203,"categoryTitle":"Algorithms","acRate":"68.3%","frontendQuestionId":"64","paidOnly":false,"topicTags":"Array;Dynamic Programming;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.34057164552412,"totalAccepted":1886414,"totalSubmission":2760313},{"questionId":"65","title":"Valid Number","titleSlug":"valid-number","isPaidOnly":false,"difficulty":"Hard","likes":1515,"dislikes":2217,"categoryTitle":"Algorithms","acRate":"23.1%","frontendQuestionId":"65","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":23.07489979795199,"totalAccepted":526371,"totalSubmission":2281141},{"questionId":"66","title":"Plus One","titleSlug":"plus-one","isPaidOnly":false,"difficulty":"Easy","likes":11920,"dislikes":5612,"categoryTitle":"Algorithms","acRate":"50.1%","frontendQuestionId":"66","paidOnly":false,"topicTags":"Array;Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":50.05326314343673,"totalAccepted":3789937,"totalSubmission":7571806},{"questionId":"67","title":"Add Binary","titleSlug":"add-binary","isPaidOnly":false,"difficulty":"Easy","likes":10821,"dislikes":1118,"categoryTitle":"Algorithms","acRate":"58.1%","frontendQuestionId":"67","paidOnly":false,"topicTags":"Math;String;Bit Manipulation;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.12420121733254,"totalAccepted":2373974,"totalSubmission":4084321},{"questionId":"68","title":"Text Justification","titleSlug":"text-justification","isPaidOnly":false,"difficulty":"Hard","likes":4591,"dislikes":5418,"categoryTitle":"Algorithms","acRate":"51.3%","frontendQuestionId":"68","paidOnly":false,"topicTags":"Array;String;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.288740776742614,"totalAccepted":662707,"totalSubmission":1292112},{"questionId":"69","title":"Sqrt(x)","titleSlug":"sqrtx","isPaidOnly":false,"difficulty":"Easy","likes":9766,"dislikes":4644,"categoryTitle":"Algorithms","acRate":"41.9%","frontendQuestionId":"69","paidOnly":false,"topicTags":"Math;Binary Search;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":41.89185105636176,"totalAccepted":3243956,"totalSubmission":7743644},{"questionId":"70","title":"Climbing Stairs","titleSlug":"climbing-stairs","isPaidOnly":false,"difficulty":"Easy","likes":24616,"dislikes":1050,"categoryTitle":"Algorithms","acRate":"54.1%","frontendQuestionId":"70","paidOnly":false,"topicTags":"Math;Dynamic Programming;Memoization;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":54.13140637756165,"totalAccepted":5209619,"totalSubmission":9624024},{"questionId":"71","title":"Simplify Path","titleSlug":"simplify-path","isPaidOnly":false,"difficulty":"Medium","likes":6607,"dislikes":1419,"categoryTitle":"Algorithms","acRate":"50.7%","frontendQuestionId":"71","paidOnly":false,"topicTags":"String;Stack;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":50.71546141509189,"totalAccepted":1346769,"totalSubmission":2655543},{"questionId":"72","title":"Edit Distance","titleSlug":"edit-distance","isPaidOnly":false,"difficulty":"Medium","likes":16528,"dislikes":328,"categoryTitle":"Algorithms","acRate":"60.7%","frontendQuestionId":"72","paidOnly":false,"topicTags":"String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.72935253671429,"totalAccepted":1488317,"totalSubmission":2450736},{"questionId":"73","title":"Set Matrix Zeroes","titleSlug":"set-matrix-zeroes","isPaidOnly":false,"difficulty":"Medium","likes":17257,"dislikes":868,"categoryTitle":"Algorithms","acRate":"63.1%","frontendQuestionId":"73","paidOnly":false,"topicTags":"Array;Hash Table;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":63.08538761695941,"totalAccepted":2643790,"totalSubmission":4190818},{"questionId":"74","title":"Search a 2D Matrix","titleSlug":"search-a-2d-matrix","isPaidOnly":false,"difficulty":"Medium","likes":18030,"dislikes":486,"categoryTitle":"Algorithms","acRate":"54.1%","frontendQuestionId":"74","paidOnly":false,"topicTags":"Array;Binary Search;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":54.07575074447737,"totalAccepted":2944449,"totalSubmission":5445049},{"questionId":"75","title":"Sort Colors","titleSlug":"sort-colors","isPaidOnly":false,"difficulty":"Medium","likes":21801,"dislikes":774,"categoryTitle":"Algorithms","acRate":"69.8%","frontendQuestionId":"75","paidOnly":false,"topicTags":"Array;Two Pointers;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":69.77703651685393,"totalAccepted":3831418,"totalSubmission":5490942},{"questionId":"76","title":"Minimum Window Substring","titleSlug":"minimum-window-substring","isPaidOnly":false,"difficulty":"Hard","likes":20351,"dislikes":860,"categoryTitle":"Algorithms","acRate":"47.7%","frontendQuestionId":"76","paidOnly":false,"topicTags":"Hash Table;String;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.697713323108296,"totalAccepted":2207683,"totalSubmission":4628496},{"questionId":"77","title":"Combinations","titleSlug":"combinations","isPaidOnly":false,"difficulty":"Medium","likes":8956,"dislikes":256,"categoryTitle":"Algorithms","acRate":"74.7%","frontendQuestionId":"77","paidOnly":false,"topicTags":"Backtracking;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":74.66191277523,"totalAccepted":1356317,"totalSubmission":1816613},{"questionId":"78","title":"Subsets","titleSlug":"subsets","isPaidOnly":false,"difficulty":"Medium","likes":19313,"dislikes":342,"categoryTitle":"Algorithms","acRate":"82.4%","frontendQuestionId":"78","paidOnly":false,"topicTags":"Array;Backtracking;Bit Manipulation;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":82.41959793366877,"totalAccepted":3090746,"totalSubmission":3750009},{"questionId":"79","title":"Word Search","titleSlug":"word-search","isPaidOnly":false,"difficulty":"Medium","likes":17773,"dislikes":759,"categoryTitle":"Algorithms","acRate":"47.5%","frontendQuestionId":"79","paidOnly":false,"topicTags":"Array;String;Backtracking;Depth-First Search;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.501498106759406,"totalAccepted":2541361,"totalSubmission":5350072},{"questionId":"80","title":"Remove Duplicates from Sorted Array II","titleSlug":"remove-duplicates-from-sorted-array-ii","isPaidOnly":false,"difficulty":"Medium","likes":8338,"dislikes":1521,"categoryTitle":"Algorithms","acRate":"64.8%","frontendQuestionId":"80","paidOnly":false,"topicTags":"Array;Two Pointers;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.79908435937186,"totalAccepted":1972455,"totalSubmission":3043960},{"questionId":"81","title":"Search in Rotated Sorted Array II","titleSlug":"search-in-rotated-sorted-array-ii","isPaidOnly":false,"difficulty":"Medium","likes":9719,"dislikes":1126,"categoryTitle":"Algorithms","acRate":"40.1%","frontendQuestionId":"81","paidOnly":false,"topicTags":"Array;Binary Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":40.12165301072729,"totalAccepted":1270594,"totalSubmission":3166847},{"questionId":"82","title":"Remove Duplicates from Sorted List II","titleSlug":"remove-duplicates-from-sorted-list-ii","isPaidOnly":false,"difficulty":"Medium","likes":9726,"dislikes":284,"categoryTitle":"Algorithms","acRate":"51.9%","frontendQuestionId":"82","paidOnly":false,"topicTags":"Linked List;Two Pointers;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.90929031509314,"totalAccepted":1118185,"totalSubmission":2154118},{"questionId":"83","title":"Remove Duplicates from Sorted List","titleSlug":"remove-duplicates-from-sorted-list","isPaidOnly":false,"difficulty":"Easy","likes":9934,"dislikes":380,"categoryTitle":"Algorithms","acRate":"56.9%","frontendQuestionId":"83","paidOnly":false,"topicTags":"Linked List;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":56.85143936517713,"totalAccepted":2418327,"totalSubmission":4253765},{"questionId":"84","title":"Largest Rectangle in Histogram","titleSlug":"largest-rectangle-in-histogram","isPaidOnly":false,"difficulty":"Hard","likes":19785,"dislikes":393,"categoryTitle":"Algorithms","acRate":"50.1%","frontendQuestionId":"84","paidOnly":false,"topicTags":"Array;Stack;Monotonic Stack;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":50.0611869135081,"totalAccepted":1600322,"totalSubmission":3196739},{"questionId":"85","title":"Maximal Rectangle","titleSlug":"maximal-rectangle","isPaidOnly":false,"difficulty":"Hard","likes":12147,"dislikes":228,"categoryTitle":"Algorithms","acRate":"58.9%","frontendQuestionId":"85","paidOnly":false,"topicTags":"Array;Dynamic Programming;Stack;Matrix;Monotonic Stack;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.93898929881294,"totalAccepted":820536,"totalSubmission":1392180},{"questionId":"86","title":"Partition List","titleSlug":"partition-list","isPaidOnly":false,"difficulty":"Medium","likes":8100,"dislikes":984,"categoryTitle":"Algorithms","acRate":"61.3%","frontendQuestionId":"86","paidOnly":false,"topicTags":"Linked List;Two Pointers;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.32531262155481,"totalAccepted":925454,"totalSubmission":1509090},{"questionId":"87","title":"Scramble String","titleSlug":"scramble-string","isPaidOnly":false,"difficulty":"Hard","likes":3653,"dislikes":1317,"categoryTitle":"Algorithms","acRate":"44.7%","frontendQuestionId":"87","paidOnly":false,"topicTags":"String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":44.7416404925369,"totalAccepted":321930,"totalSubmission":719536},{"questionId":"88","title":"Merge Sorted Array","titleSlug":"merge-sorted-array","isPaidOnly":false,"difficulty":"Easy","likes":19148,"dislikes":2662,"categoryTitle":"Algorithms","acRate":"55.0%","frontendQuestionId":"88","paidOnly":false,"topicTags":"Array;Two Pointers;Sorting;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":55.001909570317686,"totalAccepted":5785106,"totalSubmission":10518016},{"questionId":"89","title":"Gray Code","titleSlug":"gray-code","isPaidOnly":false,"difficulty":"Medium","likes":2559,"dislikes":2841,"categoryTitle":"Algorithms","acRate":"65.1%","frontendQuestionId":"89","paidOnly":false,"topicTags":"Math;Backtracking;Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.0669023770976,"totalAccepted":432839,"totalSubmission":665222},{"questionId":"90","title":"Subsets II","titleSlug":"subsets-ii","isPaidOnly":false,"difficulty":"Medium","likes":11006,"dislikes":418,"categoryTitle":"Algorithms","acRate":"61.4%","frontendQuestionId":"90","paidOnly":false,"topicTags":"Array;Backtracking;Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.400240077487965,"totalAccepted":1525805,"totalSubmission":2485012},{"questionId":"91","title":"Decode Ways","titleSlug":"decode-ways","isPaidOnly":false,"difficulty":"Medium","likes":12952,"dislikes":4617,"categoryTitle":"Algorithms","acRate":"38.1%","frontendQuestionId":"91","paidOnly":false,"topicTags":"String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":38.07368686406864,"totalAccepted":1677980,"totalSubmission":4407202},{"questionId":"92","title":"Reverse Linked List II","titleSlug":"reverse-linked-list-ii","isPaidOnly":false,"difficulty":"Medium","likes":13014,"dislikes":791,"categoryTitle":"Algorithms","acRate":"51.7%","frontendQuestionId":"92","paidOnly":false,"topicTags":"Linked List;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":51.654774037472684,"totalAccepted":1338570,"totalSubmission":2591379},{"questionId":"93","title":"Restore IP Addresses","titleSlug":"restore-ip-addresses","isPaidOnly":false,"difficulty":"Medium","likes":5694,"dislikes":824,"categoryTitle":"Algorithms","acRate":"56.2%","frontendQuestionId":"93","paidOnly":false,"topicTags":"String;Backtracking;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":56.164956494961245,"totalAccepted":636523,"totalSubmission":1133313},{"questionId":"94","title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal","isPaidOnly":false,"difficulty":"Easy","likes":14984,"dislikes":904,"categoryTitle":"Algorithms","acRate":"80.2%","frontendQuestionId":"94","paidOnly":false,"topicTags":"Stack;Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":80.16021111291474,"totalAccepted":3767861,"totalSubmission":4700415},{"questionId":"95","title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii","isPaidOnly":false,"difficulty":"Medium","likes":7975,"dislikes":584,"categoryTitle":"Algorithms","acRate":"62.6%","frontendQuestionId":"95","paidOnly":false,"topicTags":"Dynamic Programming;Backtracking;Tree;Binary Search Tree;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.61610055141785,"totalAccepted":589348,"totalSubmission":941209},{"questionId":"96","title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees","isPaidOnly":false,"difficulty":"Medium","likes":11054,"dislikes":448,"categoryTitle":"Algorithms","acRate":"63.8%","frontendQuestionId":"96","paidOnly":false,"topicTags":"Math;Dynamic Programming;Tree;Binary Search Tree;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":63.773846999958586,"totalAccepted":877803,"totalSubmission":1376431},{"questionId":"97","title":"Interleaving String","titleSlug":"interleaving-string","isPaidOnly":false,"difficulty":"Medium","likes":8872,"dislikes":557,"categoryTitle":"Algorithms","acRate":"44.1%","frontendQuestionId":"97","paidOnly":false,"topicTags":"String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":44.140530456664855,"totalAccepted":798802,"totalSubmission":1809683},{"questionId":"98","title":"Validate Binary Search Tree","titleSlug":"validate-binary-search-tree","isPaidOnly":false,"difficulty":"Medium","likes":18467,"dislikes":1462,"categoryTitle":"Algorithms","acRate":"35.8%","frontendQuestionId":"98","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Search Tree;Binary Tree;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":35.84273800745496,"totalAccepted":3390906,"totalSubmission":9460520},{"questionId":"99","title":"Recover Binary Search Tree","titleSlug":"recover-binary-search-tree","isPaidOnly":false,"difficulty":"Medium","likes":8663,"dislikes":293,"categoryTitle":"Algorithms","acRate":"59.9%","frontendQuestionId":"99","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Search Tree;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.86021986287348,"totalAccepted":681253,"totalSubmission":1138073},{"questionId":"100","title":"Same Tree","titleSlug":"same-tree","isPaidOnly":false,"difficulty":"Easy","likes":12964,"dislikes":302,"categoryTitle":"Algorithms","acRate":"67.3%","frontendQuestionId":"100","paidOnly":false,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":67.26385032366433,"totalAccepted":3479108,"totalSubmission":5172330},{"questionId":"401","title":"Binary Watch","titleSlug":"binary-watch","isPaidOnly":false,"difficulty":"Easy","likes":1975,"dislikes":3082,"categoryTitle":"Algorithms","acRate":"65.6%","frontendQuestionId":"401","paidOnly":false,"topicTags":"Backtracking;Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.60419391102852,"totalAccepted":285947,"totalSubmission":435867},{"questionId":"402","title":"Remove K Digits","titleSlug":"remove-k-digits","isPaidOnly":false,"difficulty":"Medium","likes":10673,"dislikes":551,"categoryTitle":"Algorithms","acRate":"37.0%","frontendQuestionId":"402","paidOnly":false,"topicTags":"String;Stack;Greedy;Monotonic Stack;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":36.99123442594547,"totalAccepted":751508,"totalSubmission":2031584},{"questionId":"403","title":"Frog Jump","titleSlug":"frog-jump","isPaidOnly":false,"difficulty":"Hard","likes":6023,"dislikes":279,"categoryTitle":"Algorithms","acRate":"47.3%","frontendQuestionId":"403","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.34295926526916,"totalAccepted":343981,"totalSubmission":726571},{"questionId":"404","title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves","isPaidOnly":false,"difficulty":"Easy","likes":5809,"dislikes":328,"categoryTitle":"Algorithms","acRate":"62.8%","frontendQuestionId":"404","paidOnly":false,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.77607752231148,"totalAccepted":806736,"totalSubmission":1285101},{"questionId":"405","title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal","isPaidOnly":false,"difficulty":"Easy","likes":1449,"dislikes":232,"categoryTitle":"Algorithms","acRate":"54.2%","frontendQuestionId":"405","paidOnly":false,"topicTags":"Math;String;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":54.23111941844388,"totalAccepted":225147,"totalSubmission":415162},{"questionId":"406","title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height","isPaidOnly":false,"difficulty":"Medium","likes":7264,"dislikes":756,"categoryTitle":"Algorithms","acRate":"74.8%","frontendQuestionId":"406","paidOnly":false,"topicTags":"Array;Binary Indexed Tree;Segment Tree;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":74.77241438650834,"totalAccepted":347602,"totalSubmission":464880},{"questionId":"407","title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii","isPaidOnly":false,"difficulty":"Hard","likes":5019,"dislikes":175,"categoryTitle":"Algorithms","acRate":"64.1%","frontendQuestionId":"407","paidOnly":false,"topicTags":"Array;Breadth-First Search;Heap (Priority Queue);Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.09045796791648,"totalAccepted":268639,"totalSubmission":419156},{"questionId":"408","title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation","isPaidOnly":true,"difficulty":"Easy","likes":929,"dislikes":2406,"categoryTitle":"Algorithms","acRate":"37.0%","frontendQuestionId":"408","paidOnly":true,"topicTags":"Two Pointers;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.03991309328001,"totalAccepted":363466,"totalSubmission":981282},{"questionId":"409","title":"Longest Palindrome","titleSlug":"longest-palindrome","isPaidOnly":false,"difficulty":"Easy","likes":6411,"dislikes":453,"categoryTitle":"Algorithms","acRate":"56.0%","frontendQuestionId":"409","paidOnly":false,"topicTags":"Hash Table;String;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":56.00918219383607,"totalAccepted":1069163,"totalSubmission":1908908},{"questionId":"410","title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum","isPaidOnly":false,"difficulty":"Hard","likes":11458,"dislikes":271,"categoryTitle":"Algorithms","acRate":"60.6%","frontendQuestionId":"410","paidOnly":false,"topicTags":"Array;Binary Search;Dynamic Programming;Greedy;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.60769700220073,"totalAccepted":655432,"totalSubmission":1081435},{"questionId":"411","title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation","isPaidOnly":true,"difficulty":"Hard","likes":185,"dislikes":146,"categoryTitle":"Algorithms","acRate":"40.5%","frontendQuestionId":"411","paidOnly":true,"topicTags":"Array;String;Backtracking;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.52931220187721,"totalAccepted":15804,"totalSubmission":38994},{"questionId":"412","title":"Fizz Buzz","titleSlug":"fizz-buzz","isPaidOnly":false,"difficulty":"Easy","likes":3409,"dislikes":467,"categoryTitle":"Algorithms","acRate":"75.6%","frontendQuestionId":"412","paidOnly":false,"topicTags":"Math;String;Simulation;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":75.5672730688543,"totalAccepted":1810035,"totalSubmission":2395260},{"questionId":"413","title":"Arithmetic Slices","titleSlug":"arithmetic-slices","isPaidOnly":false,"difficulty":"Medium","likes":5654,"dislikes":307,"categoryTitle":"Algorithms","acRate":"64.8%","frontendQuestionId":"413","paidOnly":false,"topicTags":"Array;Dynamic Programming;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.82878406723205,"totalAccepted":372125,"totalSubmission":574012},{"questionId":"414","title":"Third Maximum Number","titleSlug":"third-maximum-number","isPaidOnly":false,"difficulty":"Easy","likes":3580,"dislikes":3560,"categoryTitle":"Algorithms","acRate":"39.5%","frontendQuestionId":"414","paidOnly":false,"topicTags":"Array;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":39.5495236595181,"totalAccepted":858755,"totalSubmission":2171344},{"questionId":"415","title":"Add Strings","titleSlug":"add-strings","isPaidOnly":false,"difficulty":"Easy","likes":5487,"dislikes":834,"categoryTitle":"Algorithms","acRate":"52.2%","frontendQuestionId":"415","paidOnly":false,"topicTags":"Math;String;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":52.16685948689197,"totalAccepted":952767,"totalSubmission":1826384},{"questionId":"416","title":"Partition Equal Subset Sum","titleSlug":"partition-equal-subset-sum","isPaidOnly":false,"difficulty":"Medium","likes":13946,"dislikes":300,"categoryTitle":"Algorithms","acRate":"49.6%","frontendQuestionId":"416","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":49.571171631716545,"totalAccepted":1535962,"totalSubmission":3098502},{"questionId":"417","title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow","isPaidOnly":false,"difficulty":"Medium","likes":8774,"dislikes":1842,"categoryTitle":"Algorithms","acRate":"61.0%","frontendQuestionId":"417","paidOnly":false,"topicTags":"Array;Depth-First Search;Breadth-First Search;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.04084060122334,"totalAccepted":821599,"totalSubmission":1345980},{"questionId":"418","title":"Sentence Screen Fitting","titleSlug":"sentence-screen-fitting","isPaidOnly":true,"difficulty":"Medium","likes":1143,"dislikes":543,"categoryTitle":"Algorithms","acRate":"36.4%","frontendQuestionId":"418","paidOnly":true,"topicTags":"Array;String;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":36.41138643107909,"totalAccepted":107241,"totalSubmission":294526},{"questionId":"419","title":"Battleships in a Board","titleSlug":"battleships-in-a-board","isPaidOnly":false,"difficulty":"Medium","likes":2533,"dislikes":1030,"categoryTitle":"Algorithms","acRate":"77.6%","frontendQuestionId":"419","paidOnly":false,"topicTags":"Array;Depth-First Search;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":77.56193465913688,"totalAccepted":287594,"totalSubmission":370793},{"questionId":"420","title":"Strong Password Checker","titleSlug":"strong-password-checker","isPaidOnly":false,"difficulty":"Hard","likes":971,"dislikes":1754,"categoryTitle":"Algorithms","acRate":"15.9%","frontendQuestionId":"420","paidOnly":false,"topicTags":"String;Greedy;Heap (Priority Queue);","hasSolution":false,"hasVideoSolution":false,"acRateRaw":15.876502175492513,"totalAccepted":57033,"totalSubmission":359229},{"questionId":"421","title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array","isPaidOnly":false,"difficulty":"Medium","likes":5970,"dislikes":424,"categoryTitle":"Algorithms","acRate":"53.5%","frontendQuestionId":"421","paidOnly":false,"topicTags":"Array;Hash Table;Bit Manipulation;Trie;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.523384037159175,"totalAccepted":226427,"totalSubmission":423044},{"questionId":"422","title":"Valid Word Square","titleSlug":"valid-word-square","isPaidOnly":true,"difficulty":"Easy","likes":452,"dislikes":274,"categoryTitle":"Algorithms","acRate":"42.9%","frontendQuestionId":"422","paidOnly":true,"topicTags":"Array;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":42.88230747568918,"totalAccepted":71571,"totalSubmission":166901},{"questionId":"423","title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english","isPaidOnly":false,"difficulty":"Medium","likes":901,"dislikes":2813,"categoryTitle":"Algorithms","acRate":"52.9%","frontendQuestionId":"423","paidOnly":false,"topicTags":"Hash Table;Math;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":52.94471940712808,"totalAccepted":101090,"totalSubmission":190935},{"questionId":"424","title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement","isPaidOnly":false,"difficulty":"Medium","likes":13210,"dislikes":771,"categoryTitle":"Algorithms","acRate":"59.8%","frontendQuestionId":"424","paidOnly":false,"topicTags":"Hash Table;String;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.81756817032918,"totalAccepted":1609284,"totalSubmission":2690321},{"questionId":"425","title":"Word Squares","titleSlug":"word-squares","isPaidOnly":true,"difficulty":"Hard","likes":1125,"dislikes":75,"categoryTitle":"Algorithms","acRate":"54.7%","frontendQuestionId":"425","paidOnly":true,"topicTags":"Array;String;Backtracking;Trie;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":54.708514321173126,"totalAccepted":83756,"totalSubmission":153095},{"questionId":"758","title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list","isPaidOnly":true,"difficulty":"Medium","likes":2731,"dislikes":245,"categoryTitle":"Algorithms","acRate":"65.6%","frontendQuestionId":"426","paidOnly":true,"topicTags":"Linked List;Stack;Tree;Depth-First Search;Binary Search Tree;Binary Tree;Doubly-Linked List;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.63758554651196,"totalAccepted":372895,"totalSubmission":568112},{"questionId":"772","title":"Construct Quad Tree","titleSlug":"construct-quad-tree","isPaidOnly":false,"difficulty":"Medium","likes":1770,"dislikes":1967,"categoryTitle":"Algorithms","acRate":"78.4%","frontendQuestionId":"427","paidOnly":false,"topicTags":"Array;Divide and Conquer;Tree;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":78.39516352705711,"totalAccepted":209162,"totalSubmission":266805},{"questionId":"765","title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree","isPaidOnly":true,"difficulty":"Hard","likes":1076,"dislikes":58,"categoryTitle":"Algorithms","acRate":"68.8%","frontendQuestionId":"428","paidOnly":true,"topicTags":"String;Tree;Depth-First Search;Breadth-First Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.81497592471,"totalAccepted":100613,"totalSubmission":146208},{"questionId":"764","title":"N-ary Tree Level Order Traversal","titleSlug":"n-ary-tree-level-order-traversal","isPaidOnly":false,"difficulty":"Medium","likes":3764,"dislikes":146,"categoryTitle":"Algorithms","acRate":"71.6%","frontendQuestionId":"429","paidOnly":false,"topicTags":"Tree;Breadth-First Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":71.55192753236406,"totalAccepted":369983,"totalSubmission":517083},{"questionId":"766","title":"Flatten a Multilevel Doubly Linked List","titleSlug":"flatten-a-multilevel-doubly-linked-list","isPaidOnly":false,"difficulty":"Medium","likes":5491,"dislikes":351,"categoryTitle":"Algorithms","acRate":"63.0%","frontendQuestionId":"430","paidOnly":false,"topicTags":"Linked List;Depth-First Search;Doubly-Linked List;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.97965019852948,"totalAccepted":446185,"totalSubmission":708458},{"questionId":"771","title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree","isPaidOnly":true,"difficulty":"Hard","likes":538,"dislikes":30,"categoryTitle":"Algorithms","acRate":"80.6%","frontendQuestionId":"431","paidOnly":true,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Design;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":80.63432119311273,"totalAccepted":25195,"totalSubmission":31246},{"questionId":"432","title":"All O`one Data Structure","titleSlug":"all-oone-data-structure","isPaidOnly":false,"difficulty":"Hard","likes":2244,"dislikes":224,"categoryTitle":"Algorithms","acRate":"44.3%","frontendQuestionId":"432","paidOnly":false,"topicTags":"Hash Table;Linked List;Design;Doubly-Linked List;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":44.31866078004794,"totalAccepted":208194,"totalSubmission":469765},{"questionId":"433","title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation","isPaidOnly":false,"difficulty":"Medium","likes":3338,"dislikes":348,"categoryTitle":"Algorithms","acRate":"56.7%","frontendQuestionId":"433","paidOnly":false,"topicTags":"Hash Table;String;Breadth-First Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":56.737098296329414,"totalAccepted":285572,"totalSubmission":503325},{"questionId":"434","title":"Number of Segments in a String","titleSlug":"number-of-segments-in-a-string","isPaidOnly":false,"difficulty":"Easy","likes":923,"dislikes":1342,"categoryTitle":"Algorithms","acRate":"37.3%","frontendQuestionId":"434","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":37.34320575824222,"totalAccepted":283894,"totalSubmission":760223},{"questionId":"435","title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals","isPaidOnly":false,"difficulty":"Medium","likes":9206,"dislikes":261,"categoryTitle":"Algorithms","acRate":"57.2%","frontendQuestionId":"435","paidOnly":false,"topicTags":"Array;Dynamic Programming;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":57.202388784801805,"totalAccepted":1038961,"totalSubmission":1816297},{"questionId":"436","title":"Find Right Interval","titleSlug":"find-right-interval","isPaidOnly":false,"difficulty":"Medium","likes":2373,"dislikes":402,"categoryTitle":"Algorithms","acRate":"56.0%","frontendQuestionId":"436","paidOnly":false,"topicTags":"Array;Binary Search;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":55.956155603286625,"totalAccepted":164124,"totalSubmission":293308},{"questionId":"437","title":"Path Sum III","titleSlug":"path-sum-iii","isPaidOnly":false,"difficulty":"Medium","likes":11970,"dislikes":574,"categoryTitle":"Algorithms","acRate":"46.5%","frontendQuestionId":"437","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":46.455524591398664,"totalAccepted":801820,"totalSubmission":1726002},{"questionId":"438","title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string","isPaidOnly":false,"difficulty":"Medium","likes":13285,"dislikes":378,"categoryTitle":"Algorithms","acRate":"53.9%","frontendQuestionId":"438","paidOnly":false,"topicTags":"Hash Table;String;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.88282433225454,"totalAccepted":1226705,"totalSubmission":2276616},{"questionId":"439","title":"Ternary Expression Parser","titleSlug":"ternary-expression-parser","isPaidOnly":true,"difficulty":"Medium","likes":514,"dislikes":74,"categoryTitle":"Algorithms","acRate":"62.6%","frontendQuestionId":"439","paidOnly":true,"topicTags":"String;Stack;Recursion;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.623288442663835,"totalAccepted":38921,"totalSubmission":62151},{"questionId":"440","title":"K-th Smallest in Lexicographical Order","titleSlug":"k-th-smallest-in-lexicographical-order","isPaidOnly":false,"difficulty":"Hard","likes":1653,"dislikes":148,"categoryTitle":"Algorithms","acRate":"46.4%","frontendQuestionId":"440","paidOnly":false,"topicTags":"Trie;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":46.35911438431978,"totalAccepted":170462,"totalSubmission":367699},{"questionId":"441","title":"Arranging Coins","titleSlug":"arranging-coins","isPaidOnly":false,"difficulty":"Easy","likes":4370,"dislikes":1381,"categoryTitle":"Algorithms","acRate":"48.3%","frontendQuestionId":"441","paidOnly":false,"topicTags":"Math;Binary Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":48.29321958098646,"totalAccepted":633874,"totalSubmission":1312549},{"questionId":"442","title":"Find All Duplicates in an Array","titleSlug":"find-all-duplicates-in-an-array","isPaidOnly":false,"difficulty":"Medium","likes":11202,"dislikes":448,"categoryTitle":"Algorithms","acRate":"77.0%","frontendQuestionId":"442","paidOnly":false,"topicTags":"Array;Hash Table;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":76.97862726994722,"totalAccepted":1052199,"totalSubmission":1366872},{"questionId":"443","title":"String Compression","titleSlug":"string-compression","isPaidOnly":false,"difficulty":"Medium","likes":6275,"dislikes":8929,"categoryTitle":"Algorithms","acRate":"60.1%","frontendQuestionId":"443","paidOnly":false,"topicTags":"Two Pointers;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.1153799536791,"totalAccepted":1096114,"totalSubmission":1823356},{"questionId":"444","title":"Sequence Reconstruction","titleSlug":"sequence-reconstruction","isPaidOnly":true,"difficulty":"Medium","likes":620,"dislikes":1550,"categoryTitle":"Algorithms","acRate":"30.9%","frontendQuestionId":"444","paidOnly":true,"topicTags":"Array;Graph Theory;Topological Sort;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":30.881183022134866,"totalAccepted":65990,"totalSubmission":213690},{"questionId":"445","title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii","isPaidOnly":false,"difficulty":"Medium","likes":6188,"dislikes":303,"categoryTitle":"Algorithms","acRate":"62.7%","frontendQuestionId":"445","paidOnly":false,"topicTags":"Linked List;Math;Stack;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.7028574419427,"totalAccepted":587016,"totalSubmission":936187},{"questionId":"446","title":"Arithmetic Slices II - Subsequence","titleSlug":"arithmetic-slices-ii-subsequence","isPaidOnly":false,"difficulty":"Hard","likes":3523,"dislikes":165,"categoryTitle":"Algorithms","acRate":"55.1%","frontendQuestionId":"446","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.083858458555504,"totalAccepted":170457,"totalSubmission":309450},{"questionId":"447","title":"Number of Boomerangs","titleSlug":"number-of-boomerangs","isPaidOnly":false,"difficulty":"Medium","likes":904,"dislikes":1046,"categoryTitle":"Algorithms","acRate":"57.7%","frontendQuestionId":"447","paidOnly":false,"topicTags":"Array;Hash Table;Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":57.6621542422874,"totalAccepted":120033,"totalSubmission":208166},{"questionId":"448","title":"Find All Numbers Disappeared in an Array","titleSlug":"find-all-numbers-disappeared-in-an-array","isPaidOnly":false,"difficulty":"Easy","likes":10474,"dislikes":557,"categoryTitle":"Algorithms","acRate":"64.2%","frontendQuestionId":"448","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.22452416352338,"totalAccepted":1419856,"totalSubmission":2210772},{"questionId":"449","title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst","isPaidOnly":false,"difficulty":"Medium","likes":3607,"dislikes":180,"categoryTitle":"Algorithms","acRate":"59.7%","frontendQuestionId":"449","paidOnly":false,"topicTags":"String;Tree;Depth-First Search;Breadth-First Search;Design;Binary Search Tree;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.68814928777611,"totalAccepted":278945,"totalSubmission":467338},{"questionId":"450","title":"Delete Node in a BST","titleSlug":"delete-node-in-a-bst","isPaidOnly":false,"difficulty":"Medium","likes":10509,"dislikes":390,"categoryTitle":"Algorithms","acRate":"54.8%","frontendQuestionId":"450","paidOnly":false,"topicTags":"Tree;Binary Search Tree;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":54.78358213104616,"totalAccepted":886745,"totalSubmission":1618637},{"questionId":"451","title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency","isPaidOnly":false,"difficulty":"Medium","likes":9288,"dislikes":337,"categoryTitle":"Algorithms","acRate":"75.4%","frontendQuestionId":"451","paidOnly":false,"topicTags":"Hash Table;String;Sorting;Heap (Priority Queue);Bucket Sort;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.39593838176768,"totalAccepted":1135352,"totalSubmission":1505853},{"questionId":"452","title":"Minimum Number of Arrows to Burst Balloons","titleSlug":"minimum-number-of-arrows-to-burst-balloons","isPaidOnly":false,"difficulty":"Medium","likes":8137,"dislikes":275,"categoryTitle":"Algorithms","acRate":"61.5%","frontendQuestionId":"452","paidOnly":false,"topicTags":"Array;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.52158089210479,"totalAccepted":797855,"totalSubmission":1296874},{"questionId":"453","title":"Minimum Moves to Equal Array Elements","titleSlug":"minimum-moves-to-equal-array-elements","isPaidOnly":false,"difficulty":"Medium","likes":2839,"dislikes":1914,"categoryTitle":"Algorithms","acRate":"58.8%","frontendQuestionId":"453","paidOnly":false,"topicTags":"Array;Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.79874695145364,"totalAccepted":222047,"totalSubmission":377639},{"questionId":"454","title":"4Sum II","titleSlug":"4sum-ii","isPaidOnly":false,"difficulty":"Medium","likes":5090,"dislikes":151,"categoryTitle":"Algorithms","acRate":"58.0%","frontendQuestionId":"454","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.019323743207075,"totalAccepted":390864,"totalSubmission":673679},{"questionId":"455","title":"Assign Cookies","titleSlug":"assign-cookies","isPaidOnly":false,"difficulty":"Easy","likes":5070,"dislikes":460,"categoryTitle":"Algorithms","acRate":"55.1%","frontendQuestionId":"455","paidOnly":false,"topicTags":"Array;Two Pointers;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.05471083187727,"totalAccepted":977388,"totalSubmission":1775306},{"questionId":"456","title":"132 Pattern","titleSlug":"132-pattern","isPaidOnly":false,"difficulty":"Medium","likes":7656,"dislikes":473,"categoryTitle":"Algorithms","acRate":"34.8%","frontendQuestionId":"456","paidOnly":false,"topicTags":"Array;Binary Search;Stack;Monotonic Stack;Ordered Set;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":34.81281944728632,"totalAccepted":330065,"totalSubmission":948119},{"questionId":"457","title":"Circular Array Loop","titleSlug":"circular-array-loop","isPaidOnly":false,"difficulty":"Medium","likes":838,"dislikes":911,"categoryTitle":"Algorithms","acRate":"37.6%","frontendQuestionId":"457","paidOnly":false,"topicTags":"Array;Hash Table;Two Pointers;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.59814213478974,"totalAccepted":111386,"totalSubmission":296254},{"questionId":"458","title":"Poor Pigs","titleSlug":"poor-pigs","isPaidOnly":false,"difficulty":"Hard","likes":1880,"dislikes":3370,"categoryTitle":"Algorithms","acRate":"59.1%","frontendQuestionId":"458","paidOnly":false,"topicTags":"Math;Dynamic Programming;Combinatorics;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.122714486638536,"totalAccepted":134516,"totalSubmission":227520},{"questionId":"459","title":"Repeated Substring Pattern","titleSlug":"repeated-substring-pattern","isPaidOnly":false,"difficulty":"Easy","likes":6893,"dislikes":571,"categoryTitle":"Algorithms","acRate":"48.3%","frontendQuestionId":"459","paidOnly":false,"topicTags":"String;String Matching;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":48.342922953396304,"totalAccepted":623762,"totalSubmission":1290285},{"questionId":"460","title":"LFU Cache","titleSlug":"lfu-cache","isPaidOnly":false,"difficulty":"Hard","likes":6394,"dislikes":355,"categoryTitle":"Algorithms","acRate":"49.4%","frontendQuestionId":"460","paidOnly":false,"topicTags":"Hash Table;Linked List;Design;Doubly-Linked List;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.400360804662476,"totalAccepted":391851,"totalSubmission":793221},{"questionId":"461","title":"Hamming Distance","titleSlug":"hamming-distance","isPaidOnly":false,"difficulty":"Easy","likes":4040,"dislikes":231,"categoryTitle":"Algorithms","acRate":"76.8%","frontendQuestionId":"461","paidOnly":false,"topicTags":"Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":76.82640274211147,"totalAccepted":697065,"totalSubmission":907326},{"questionId":"462","title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii","isPaidOnly":false,"difficulty":"Medium","likes":3540,"dislikes":132,"categoryTitle":"Algorithms","acRate":"61.9%","frontendQuestionId":"462","paidOnly":false,"topicTags":"Array;Math;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.94322920319133,"totalAccepted":229656,"totalSubmission":370752},{"questionId":"463","title":"Island Perimeter","titleSlug":"island-perimeter","isPaidOnly":false,"difficulty":"Easy","likes":7337,"dislikes":431,"categoryTitle":"Algorithms","acRate":"74.5%","frontendQuestionId":"463","paidOnly":false,"topicTags":"Array;Depth-First Search;Breadth-First Search;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":74.49249441981647,"totalAccepted":838013,"totalSubmission":1124963},{"questionId":"464","title":"Can I Win","titleSlug":"can-i-win","isPaidOnly":false,"difficulty":"Medium","likes":2846,"dislikes":433,"categoryTitle":"Algorithms","acRate":"31.4%","frontendQuestionId":"464","paidOnly":false,"topicTags":"Math;Dynamic Programming;Bit Manipulation;Memoization;Game Theory;Bitmask;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":31.435649166928638,"totalAccepted":124996,"totalSubmission":397625},{"questionId":"465","title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing","isPaidOnly":true,"difficulty":"Hard","likes":1532,"dislikes":164,"categoryTitle":"Algorithms","acRate":"50.5%","frontendQuestionId":"465","paidOnly":true,"topicTags":"Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":50.483256815857615,"totalAccepted":116008,"totalSubmission":229795},{"questionId":"466","title":"Count The Repetitions","titleSlug":"count-the-repetitions","isPaidOnly":false,"difficulty":"Hard","likes":449,"dislikes":370,"categoryTitle":"Algorithms","acRate":"34.4%","frontendQuestionId":"466","paidOnly":false,"topicTags":"Two Pointers;String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":34.389214536928485,"totalAccepted":29334,"totalSubmission":85300},{"questionId":"467","title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string","isPaidOnly":false,"difficulty":"Medium","likes":1532,"dislikes":191,"categoryTitle":"Algorithms","acRate":"43.2%","frontendQuestionId":"467","paidOnly":false,"topicTags":"String;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":43.23159462149159,"totalAccepted":57776,"totalSubmission":133643},{"questionId":"468","title":"Validate IP Address","titleSlug":"validate-ip-address","isPaidOnly":false,"difficulty":"Medium","likes":1126,"dislikes":2746,"categoryTitle":"Algorithms","acRate":"28.3%","frontendQuestionId":"468","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":28.348068038931963,"totalAccepted":203356,"totalSubmission":717353},{"questionId":"469","title":"Convex Polygon","titleSlug":"convex-polygon","isPaidOnly":true,"difficulty":"Medium","likes":103,"dislikes":243,"categoryTitle":"Algorithms","acRate":"40.3%","frontendQuestionId":"469","paidOnly":true,"topicTags":"Array;Math;Geometry;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.260678175940576,"totalAccepted":11707,"totalSubmission":29078},{"questionId":"903","title":"Implement Rand10() Using Rand7()","titleSlug":"implement-rand10-using-rand7","isPaidOnly":false,"difficulty":"Medium","likes":1181,"dislikes":389,"categoryTitle":"Algorithms","acRate":"46.4%","frontendQuestionId":"470","paidOnly":false,"topicTags":"Math;Rejection Sampling;Randomized;Probability and Statistics;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":46.43708818372926,"totalAccepted":111775,"totalSubmission":240702},{"questionId":"471","title":"Encode String with Shortest Length","titleSlug":"encode-string-with-shortest-length","isPaidOnly":true,"difficulty":"Hard","likes":633,"dislikes":54,"categoryTitle":"Algorithms","acRate":"50.6%","frontendQuestionId":"471","paidOnly":true,"topicTags":"String;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.58588527658504,"totalAccepted":32162,"totalSubmission":63579},{"questionId":"472","title":"Concatenated Words","titleSlug":"concatenated-words","isPaidOnly":false,"difficulty":"Hard","likes":4075,"dislikes":294,"categoryTitle":"Algorithms","acRate":"49.8%","frontendQuestionId":"472","paidOnly":false,"topicTags":"Array;String;Dynamic Programming;Depth-First Search;Trie;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.81806769617028,"totalAccepted":269856,"totalSubmission":541684},{"questionId":"473","title":"Matchsticks to Square","titleSlug":"matchsticks-to-square","isPaidOnly":false,"difficulty":"Medium","likes":4058,"dislikes":309,"categoryTitle":"Algorithms","acRate":"41.9%","frontendQuestionId":"473","paidOnly":false,"topicTags":"Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":41.92934996817999,"totalAccepted":218080,"totalSubmission":520113},{"questionId":"474","title":"Ones and Zeroes","titleSlug":"ones-and-zeroes","isPaidOnly":false,"difficulty":"Medium","likes":6102,"dislikes":509,"categoryTitle":"Algorithms","acRate":"53.4%","frontendQuestionId":"474","paidOnly":false,"topicTags":"Array;String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.43255405024968,"totalAccepted":354921,"totalSubmission":664242},{"questionId":"475","title":"Heaters","titleSlug":"heaters","isPaidOnly":false,"difficulty":"Medium","likes":2379,"dislikes":1201,"categoryTitle":"Algorithms","acRate":"42.0%","frontendQuestionId":"475","paidOnly":false,"topicTags":"Array;Two Pointers;Binary Search;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":42.04041125990602,"totalAccepted":174107,"totalSubmission":414142},{"questionId":"476","title":"Number Complement","titleSlug":"number-complement","isPaidOnly":false,"difficulty":"Easy","likes":3242,"dislikes":146,"categoryTitle":"Algorithms","acRate":"70.4%","frontendQuestionId":"476","paidOnly":false,"topicTags":"Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":70.4489121802427,"totalAccepted":557079,"totalSubmission":790756},{"questionId":"477","title":"Total Hamming Distance","titleSlug":"total-hamming-distance","isPaidOnly":false,"difficulty":"Medium","likes":2313,"dislikes":97,"categoryTitle":"Algorithms","acRate":"54.9%","frontendQuestionId":"477","paidOnly":false,"topicTags":"Array;Math;Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":54.94855071885303,"totalAccepted":137666,"totalSubmission":250537},{"questionId":"915","title":"Generate Random Point in a Circle","titleSlug":"generate-random-point-in-a-circle","isPaidOnly":false,"difficulty":"Medium","likes":486,"dislikes":784,"categoryTitle":"Algorithms","acRate":"43.0%","frontendQuestionId":"478","paidOnly":false,"topicTags":"Math;Geometry;Rejection Sampling;Randomized;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":43.04793666625109,"totalAccepted":55246,"totalSubmission":128336},{"questionId":"479","title":"Largest Palindrome Product","titleSlug":"largest-palindrome-product","isPaidOnly":false,"difficulty":"Hard","likes":195,"dislikes":1569,"categoryTitle":"Algorithms","acRate":"39.1%","frontendQuestionId":"479","paidOnly":false,"topicTags":"Math;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":39.05697489391796,"totalAccepted":35345,"totalSubmission":90496},{"questionId":"480","title":"Sliding Window Median","titleSlug":"sliding-window-median","isPaidOnly":false,"difficulty":"Hard","likes":3602,"dislikes":241,"categoryTitle":"Algorithms","acRate":"39.0%","frontendQuestionId":"480","paidOnly":false,"topicTags":"Array;Hash Table;Sliding Window;Heap (Priority Queue);","hasSolution":true,"hasVideoSolution":false,"acRateRaw":38.995346171120396,"totalAccepted":223136,"totalSubmission":572213},{"questionId":"481","title":"Magical String","titleSlug":"magical-string","isPaidOnly":false,"difficulty":"Medium","likes":387,"dislikes":1427,"categoryTitle":"Algorithms","acRate":"55.4%","frontendQuestionId":"481","paidOnly":false,"topicTags":"Two Pointers;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":55.421239140374944,"totalAccepted":58179,"totalSubmission":104976},{"questionId":"482","title":"License Key Formatting","titleSlug":"license-key-formatting","isPaidOnly":false,"difficulty":"Easy","likes":1213,"dislikes":1475,"categoryTitle":"Algorithms","acRate":"46.1%","frontendQuestionId":"482","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":46.11412643751862,"totalAccepted":366782,"totalSubmission":795380},{"questionId":"483","title":"Smallest Good Base","titleSlug":"smallest-good-base","isPaidOnly":false,"difficulty":"Hard","likes":428,"dislikes":540,"categoryTitle":"Algorithms","acRate":"46.3%","frontendQuestionId":"483","paidOnly":false,"topicTags":"Math;Binary Search;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":46.336647828886186,"totalAccepted":32386,"totalSubmission":69894},{"questionId":"484","title":"Find Permutation","titleSlug":"find-permutation","isPaidOnly":true,"difficulty":"Medium","likes":729,"dislikes":151,"categoryTitle":"Algorithms","acRate":"66.8%","frontendQuestionId":"484","paidOnly":true,"topicTags":"Array;String;Stack;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":66.83541973490426,"totalAccepted":43566,"totalSubmission":65184},{"questionId":"485","title":"Max Consecutive Ones","titleSlug":"max-consecutive-ones","isPaidOnly":false,"difficulty":"Easy","likes":6952,"dislikes":500,"categoryTitle":"Algorithms","acRate":"65.3%","frontendQuestionId":"485","paidOnly":false,"topicTags":"Array;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.31815431110232,"totalAccepted":2349751,"totalSubmission":3597390},{"questionId":"486","title":"Predict the Winner","titleSlug":"predict-the-winner","isPaidOnly":false,"difficulty":"Medium","likes":6190,"dislikes":297,"categoryTitle":"Algorithms","acRate":"56.3%","frontendQuestionId":"486","paidOnly":false,"topicTags":"Array;Math;Dynamic Programming;Recursion;Game Theory;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":56.27692625553829,"totalAccepted":294170,"totalSubmission":522719},{"questionId":"487","title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii","isPaidOnly":true,"difficulty":"Medium","likes":1611,"dislikes":27,"categoryTitle":"Algorithms","acRate":"52.1%","frontendQuestionId":"487","paidOnly":true,"topicTags":"Array;Dynamic Programming;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":52.053094556035184,"totalAccepted":184979,"totalSubmission":355366},{"questionId":"488","title":"Zuma Game","titleSlug":"zuma-game","isPaidOnly":false,"difficulty":"Hard","likes":497,"dislikes":516,"categoryTitle":"Algorithms","acRate":"29.6%","frontendQuestionId":"488","paidOnly":false,"topicTags":"String;Dynamic Programming;Stack;Breadth-First Search;Memoization;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":29.63883966595851,"totalAccepted":30274,"totalSubmission":102143},{"questionId":"865","title":"Robot Room Cleaner","titleSlug":"robot-room-cleaner","isPaidOnly":true,"difficulty":"Hard","likes":2910,"dislikes":193,"categoryTitle":"Algorithms","acRate":"78.0%","frontendQuestionId":"489","paidOnly":true,"topicTags":"Backtracking;Interactive;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":78.04679693369219,"totalAccepted":214009,"totalSubmission":274206},{"questionId":"490","title":"The Maze","titleSlug":"the-maze","isPaidOnly":true,"difficulty":"Medium","likes":1931,"dislikes":199,"categoryTitle":"Algorithms","acRate":"60.4%","frontendQuestionId":"490","paidOnly":true,"topicTags":"Array;Depth-First Search;Breadth-First Search;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.43148343580802,"totalAccepted":210727,"totalSubmission":348704},{"questionId":"491","title":"Non-decreasing Subsequences","titleSlug":"non-decreasing-subsequences","isPaidOnly":false,"difficulty":"Medium","likes":3831,"dislikes":239,"categoryTitle":"Algorithms","acRate":"62.8%","frontendQuestionId":"491","paidOnly":false,"topicTags":"Array;Hash Table;Backtracking;Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.76512384229256,"totalAccepted":213065,"totalSubmission":339464},{"questionId":"492","title":"Construct the Rectangle","titleSlug":"construct-the-rectangle","isPaidOnly":false,"difficulty":"Easy","likes":803,"dislikes":394,"categoryTitle":"Algorithms","acRate":"64.0%","frontendQuestionId":"492","paidOnly":false,"topicTags":"Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":63.95935027314261,"totalAccepted":175972,"totalSubmission":275131},{"questionId":"493","title":"Reverse Pairs","titleSlug":"reverse-pairs","isPaidOnly":false,"difficulty":"Hard","likes":7077,"dislikes":301,"categoryTitle":"Algorithms","acRate":"34.5%","frontendQuestionId":"493","paidOnly":false,"topicTags":"Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":34.48057963433582,"totalAccepted":377051,"totalSubmission":1093519},{"questionId":"494","title":"Target Sum","titleSlug":"target-sum","isPaidOnly":false,"difficulty":"Medium","likes":12470,"dislikes":420,"categoryTitle":"Algorithms","acRate":"52.3%","frontendQuestionId":"494","paidOnly":false,"topicTags":"Array;Dynamic Programming;Backtracking;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":52.33373816458159,"totalAccepted":1109585,"totalSubmission":2120216},{"questionId":"495","title":"Teemo Attacking","titleSlug":"teemo-attacking","isPaidOnly":false,"difficulty":"Easy","likes":1376,"dislikes":159,"categoryTitle":"Algorithms","acRate":"57.8%","frontendQuestionId":"495","paidOnly":false,"topicTags":"Array;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":57.77828816414026,"totalAccepted":226410,"totalSubmission":391860},{"questionId":"496","title":"Next Greater Element I","titleSlug":"next-greater-element-i","isPaidOnly":false,"difficulty":"Easy","likes":10007,"dislikes":1120,"categoryTitle":"Algorithms","acRate":"76.3%","frontendQuestionId":"496","paidOnly":false,"topicTags":"Array;Hash Table;Stack;Monotonic Stack;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":76.2588230156857,"totalAccepted":1466961,"totalSubmission":1923661},{"questionId":"914","title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles","isPaidOnly":false,"difficulty":"Medium","likes":526,"dislikes":690,"categoryTitle":"Algorithms","acRate":"39.9%","frontendQuestionId":"497","paidOnly":false,"topicTags":"Array;Math;Binary Search;Reservoir Sampling;Prefix Sum;Ordered Set;Randomized;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":39.919399481853816,"totalAccepted":54084,"totalSubmission":135483},{"questionId":"498","title":"Diagonal Traverse","titleSlug":"diagonal-traverse","isPaidOnly":false,"difficulty":"Medium","likes":4341,"dislikes":786,"categoryTitle":"Algorithms","acRate":"67.2%","frontendQuestionId":"498","paidOnly":false,"topicTags":"Array;Matrix;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":67.20611758269857,"totalAccepted":565099,"totalSubmission":840846},{"questionId":"499","title":"The Maze III","titleSlug":"the-maze-iii","isPaidOnly":true,"difficulty":"Hard","likes":521,"dislikes":78,"categoryTitle":"Algorithms","acRate":"52.4%","frontendQuestionId":"499","paidOnly":true,"topicTags":"Array;String;Depth-First Search;Breadth-First Search;Graph Theory;Heap (Priority Queue);Matrix;Shortest Path;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":52.41114140219124,"totalAccepted":40757,"totalSubmission":77764},{"questionId":"500","title":"Keyboard Row","titleSlug":"keyboard-row","isPaidOnly":false,"difficulty":"Easy","likes":1839,"dislikes":1158,"categoryTitle":"Algorithms","acRate":"74.0%","frontendQuestionId":"500","paidOnly":false,"topicTags":"Array;Hash Table;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":73.95951920785788,"totalAccepted":335222,"totalSubmission":453251},{"questionId":"937","title":"Online Stock Span","titleSlug":"online-stock-span","isPaidOnly":false,"difficulty":"Medium","likes":7319,"dislikes":506,"categoryTitle":"Algorithms","acRate":"69.2%","frontendQuestionId":"901","paidOnly":false,"topicTags":"Stack;Design;Monotonic Stack;Data Stream;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":69.17508710025217,"totalAccepted":621058,"totalSubmission":897808},{"questionId":"938","title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set","isPaidOnly":false,"difficulty":"Hard","likes":1482,"dislikes":98,"categoryTitle":"Algorithms","acRate":"45.3%","frontendQuestionId":"902","paidOnly":false,"topicTags":"Array;Math;String;Binary Search;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.26502960865088,"totalAccepted":56259,"totalSubmission":124288},{"questionId":"939","title":"Valid Permutations for DI Sequence","titleSlug":"valid-permutations-for-di-sequence","isPaidOnly":false,"difficulty":"Hard","likes":752,"dislikes":45,"categoryTitle":"Algorithms","acRate":"56.4%","frontendQuestionId":"903","paidOnly":false,"topicTags":"String;Dynamic Programming;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":56.40466760585843,"totalAccepted":21220,"totalSubmission":37621},{"questionId":"940","title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets","isPaidOnly":false,"difficulty":"Medium","likes":6284,"dislikes":601,"categoryTitle":"Algorithms","acRate":"51.3%","frontendQuestionId":"904","paidOnly":false,"topicTags":"Array;Hash Table;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.3269902162611,"totalAccepted":858393,"totalSubmission":1672427},{"questionId":"941","title":"Sort Array By Parity","titleSlug":"sort-array-by-parity","isPaidOnly":false,"difficulty":"Easy","likes":5721,"dislikes":157,"categoryTitle":"Algorithms","acRate":"76.5%","frontendQuestionId":"905","paidOnly":false,"topicTags":"Array;Two Pointers;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":76.54389304365003,"totalAccepted":1034663,"totalSubmission":1351725},{"questionId":"942","title":"Super Palindromes","titleSlug":"super-palindromes","isPaidOnly":false,"difficulty":"Hard","likes":377,"dislikes":423,"categoryTitle":"Algorithms","acRate":"40.0%","frontendQuestionId":"906","paidOnly":false,"topicTags":"Math;String;Enumeration;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":40.02102438552084,"totalAccepted":28934,"totalSubmission":72297},{"questionId":"943","title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums","isPaidOnly":false,"difficulty":"Medium","likes":9320,"dislikes":744,"categoryTitle":"Algorithms","acRate":"38.7%","frontendQuestionId":"907","paidOnly":false,"topicTags":"Array;Dynamic Programming;Stack;Monotonic Stack;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":38.660082732696196,"totalAccepted":460746,"totalSubmission":1191786},{"questionId":"944","title":"Smallest Range I","titleSlug":"smallest-range-i","isPaidOnly":false,"difficulty":"Easy","likes":799,"dislikes":2090,"categoryTitle":"Algorithms","acRate":"73.6%","frontendQuestionId":"908","paidOnly":false,"topicTags":"Array;Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":73.64605913465707,"totalAccepted":127402,"totalSubmission":172992},{"questionId":"945","title":"Snakes and Ladders","titleSlug":"snakes-and-ladders","isPaidOnly":false,"difficulty":"Medium","likes":3670,"dislikes":1356,"categoryTitle":"Algorithms","acRate":"48.1%","frontendQuestionId":"909","paidOnly":false,"topicTags":"Array;Breadth-First Search;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":48.105056961027216,"totalAccepted":369100,"totalSubmission":767279},{"questionId":"946","title":"Smallest Range II","titleSlug":"smallest-range-ii","isPaidOnly":false,"difficulty":"Medium","likes":1719,"dislikes":468,"categoryTitle":"Algorithms","acRate":"38.0%","frontendQuestionId":"910","paidOnly":false,"topicTags":"Array;Math;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":37.95675589692314,"totalAccepted":66813,"totalSubmission":176024},{"questionId":"947","title":"Online Election","titleSlug":"online-election","isPaidOnly":false,"difficulty":"Medium","likes":1095,"dislikes":685,"categoryTitle":"Algorithms","acRate":"52.9%","frontendQuestionId":"911","paidOnly":false,"topicTags":"Array;Hash Table;Binary Search;Design;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":52.88939712257,"totalAccepted":79552,"totalSubmission":150412},{"questionId":"948","title":"Sort an Array","titleSlug":"sort-an-array","isPaidOnly":false,"difficulty":"Medium","likes":7277,"dislikes":845,"categoryTitle":"Algorithms","acRate":"55.9%","frontendQuestionId":"912","paidOnly":false,"topicTags":"Array;Divide and Conquer;Sorting;Heap (Priority Queue);Merge Sort;Bucket Sort;Radix Sort;Counting Sort;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.922861398866154,"totalAccepted":1150658,"totalSubmission":2057581},{"questionId":"949","title":"Cat and Mouse","titleSlug":"cat-and-mouse","isPaidOnly":false,"difficulty":"Hard","likes":1018,"dislikes":182,"categoryTitle":"Algorithms","acRate":"35.4%","frontendQuestionId":"913","paidOnly":false,"topicTags":"Math;Dynamic Programming;Graph Theory;Topological Sort;Memoization;Game Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":35.36760751847729,"totalAccepted":28281,"totalSubmission":79963},{"questionId":"950","title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards","isPaidOnly":false,"difficulty":"Easy","likes":1910,"dislikes":581,"categoryTitle":"Algorithms","acRate":"30.3%","frontendQuestionId":"914","paidOnly":false,"topicTags":"Array;Hash Table;Math;Counting;Number Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":30.31772907424399,"totalAccepted":160258,"totalSubmission":528595},{"questionId":"951","title":"Partition Array into Disjoint Intervals","titleSlug":"partition-array-into-disjoint-intervals","isPaidOnly":false,"difficulty":"Medium","likes":1773,"dislikes":83,"categoryTitle":"Algorithms","acRate":"49.5%","frontendQuestionId":"915","paidOnly":false,"topicTags":"Array;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.48422723959218,"totalAccepted":99108,"totalSubmission":200281},{"questionId":"952","title":"Word Subsets","titleSlug":"word-subsets","isPaidOnly":false,"difficulty":"Medium","likes":3542,"dislikes":317,"categoryTitle":"Algorithms","acRate":"55.9%","frontendQuestionId":"916","paidOnly":false,"topicTags":"Array;Hash Table;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.941262010630425,"totalAccepted":266592,"totalSubmission":476557},{"questionId":"953","title":"Reverse Only Letters","titleSlug":"reverse-only-letters","isPaidOnly":false,"difficulty":"Easy","likes":2463,"dislikes":87,"categoryTitle":"Algorithms","acRate":"68.6%","frontendQuestionId":"917","paidOnly":false,"topicTags":"Two Pointers;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.56264206993329,"totalAccepted":334199,"totalSubmission":487436},{"questionId":"954","title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray","isPaidOnly":false,"difficulty":"Medium","likes":7369,"dislikes":350,"categoryTitle":"Algorithms","acRate":"50.3%","frontendQuestionId":"918","paidOnly":false,"topicTags":"Array;Divide and Conquer;Dynamic Programming;Queue;Monotonic Queue;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":50.34809137793631,"totalAccepted":430233,"totalSubmission":854517},{"questionId":"955","title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter","isPaidOnly":false,"difficulty":"Medium","likes":1157,"dislikes":120,"categoryTitle":"Algorithms","acRate":"65.1%","frontendQuestionId":"919","paidOnly":false,"topicTags":"Tree;Breadth-First Search;Design;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.08301824757521,"totalAccepted":67303,"totalSubmission":103411},{"questionId":"956","title":"Number of Music Playlists","titleSlug":"number-of-music-playlists","isPaidOnly":false,"difficulty":"Hard","likes":2475,"dislikes":206,"categoryTitle":"Algorithms","acRate":"60.1%","frontendQuestionId":"920","paidOnly":false,"topicTags":"Math;Dynamic Programming;Combinatorics;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.06845193320295,"totalAccepted":79855,"totalSubmission":132940},{"questionId":"957","title":"Minimum Add to Make Parentheses Valid","titleSlug":"minimum-add-to-make-parentheses-valid","isPaidOnly":false,"difficulty":"Medium","likes":4966,"dislikes":250,"categoryTitle":"Algorithms","acRate":"74.4%","frontendQuestionId":"921","paidOnly":false,"topicTags":"String;Stack;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":74.38402980324224,"totalAccepted":712808,"totalSubmission":958280},{"questionId":"958","title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii","isPaidOnly":false,"difficulty":"Easy","likes":2839,"dislikes":105,"categoryTitle":"Algorithms","acRate":"71.3%","frontendQuestionId":"922","paidOnly":false,"topicTags":"Array;Two Pointers;Sorting;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":71.31902488062327,"totalAccepted":354723,"totalSubmission":497375},{"questionId":"959","title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity","isPaidOnly":false,"difficulty":"Medium","likes":2685,"dislikes":333,"categoryTitle":"Algorithms","acRate":"46.3%","frontendQuestionId":"923","paidOnly":false,"topicTags":"Array;Hash Table;Two Pointers;Sorting;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":46.31131550137698,"totalAccepted":122254,"totalSubmission":263983},{"questionId":"960","title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread","isPaidOnly":false,"difficulty":"Hard","likes":1129,"dislikes":654,"categoryTitle":"Algorithms","acRate":"43.2%","frontendQuestionId":"924","paidOnly":false,"topicTags":"Array;Hash Table;Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":43.2121305191075,"totalAccepted":75976,"totalSubmission":175821},{"questionId":"961","title":"Long Pressed Name","titleSlug":"long-pressed-name","isPaidOnly":false,"difficulty":"Easy","likes":2608,"dislikes":409,"categoryTitle":"Algorithms","acRate":"32.9%","frontendQuestionId":"925","paidOnly":false,"topicTags":"Two Pointers;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":32.92920490942858,"totalAccepted":195747,"totalSubmission":594448},{"questionId":"962","title":"Flip String to Monotone Increasing","titleSlug":"flip-string-to-monotone-increasing","isPaidOnly":false,"difficulty":"Medium","likes":4596,"dislikes":185,"categoryTitle":"Algorithms","acRate":"61.9%","frontendQuestionId":"926","paidOnly":false,"topicTags":"String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.90439768387893,"totalAccepted":218525,"totalSubmission":353004},{"questionId":"963","title":"Three Equal Parts","titleSlug":"three-equal-parts","isPaidOnly":false,"difficulty":"Hard","likes":857,"dislikes":127,"categoryTitle":"Algorithms","acRate":"41.4%","frontendQuestionId":"927","paidOnly":false,"topicTags":"Array;Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":41.386444124969316,"totalAccepted":35409,"totalSubmission":85557},{"questionId":"964","title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii","isPaidOnly":false,"difficulty":"Hard","likes":710,"dislikes":92,"categoryTitle":"Algorithms","acRate":"45.7%","frontendQuestionId":"928","paidOnly":false,"topicTags":"Array;Hash Table;Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.674065092344776,"totalAccepted":30888,"totalSubmission":67627},{"questionId":"965","title":"Unique Email Addresses","titleSlug":"unique-email-addresses","isPaidOnly":false,"difficulty":"Easy","likes":2822,"dislikes":363,"categoryTitle":"Algorithms","acRate":"67.9%","frontendQuestionId":"929","paidOnly":false,"topicTags":"Array;Hash Table;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":67.90694534330957,"totalAccepted":583393,"totalSubmission":859105},{"questionId":"966","title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum","isPaidOnly":false,"difficulty":"Medium","likes":4932,"dislikes":170,"categoryTitle":"Algorithms","acRate":"69.0%","frontendQuestionId":"930","paidOnly":false,"topicTags":"Array;Hash Table;Sliding Window;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":69.0097584632794,"totalAccepted":537867,"totalSubmission":779412},{"questionId":"967","title":"Minimum Falling Path Sum","titleSlug":"minimum-falling-path-sum","isPaidOnly":false,"difficulty":"Medium","likes":7018,"dislikes":175,"categoryTitle":"Algorithms","acRate":"60.8%","frontendQuestionId":"931","paidOnly":false,"topicTags":"Array;Dynamic Programming;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.837742963070426,"totalAccepted":666719,"totalSubmission":1095897},{"questionId":"968","title":"Beautiful Array","titleSlug":"beautiful-array","isPaidOnly":false,"difficulty":"Medium","likes":1169,"dislikes":1608,"categoryTitle":"Algorithms","acRate":"69.5%","frontendQuestionId":"932","paidOnly":false,"topicTags":"Array;Math;Divide and Conquer;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":69.47943508698201,"totalAccepted":62824,"totalSubmission":90421},{"questionId":"969","title":"Number of Recent Calls","titleSlug":"number-of-recent-calls","isPaidOnly":false,"difficulty":"Easy","likes":870,"dislikes":1214,"categoryTitle":"Algorithms","acRate":"78.6%","frontendQuestionId":"933","paidOnly":false,"topicTags":"Design;Queue;Data Stream;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":78.56634113303184,"totalAccepted":539409,"totalSubmission":686565},{"questionId":"971","title":"Shortest Bridge","titleSlug":"shortest-bridge","isPaidOnly":false,"difficulty":"Medium","likes":5811,"dislikes":221,"categoryTitle":"Algorithms","acRate":"59.5%","frontendQuestionId":"934","paidOnly":false,"topicTags":"Array;Depth-First Search;Breadth-First Search;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.52077464639126,"totalAccepted":280175,"totalSubmission":470718},{"questionId":"972","title":"Knight Dialer","titleSlug":"knight-dialer","isPaidOnly":false,"difficulty":"Medium","likes":3212,"dislikes":452,"categoryTitle":"Algorithms","acRate":"61.9%","frontendQuestionId":"935","paidOnly":false,"topicTags":"Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.94174638439552,"totalAccepted":202406,"totalSubmission":326771},{"questionId":"973","title":"Stamping The Sequence","titleSlug":"stamping-the-sequence","isPaidOnly":false,"difficulty":"Hard","likes":1582,"dislikes":222,"categoryTitle":"Algorithms","acRate":"62.3%","frontendQuestionId":"936","paidOnly":false,"topicTags":"String;Stack;Greedy;Queue;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.346045549447396,"totalAccepted":65098,"totalSubmission":104414},{"questionId":"974","title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files","isPaidOnly":false,"difficulty":"Medium","likes":2200,"dislikes":4425,"categoryTitle":"Algorithms","acRate":"56.8%","frontendQuestionId":"937","paidOnly":false,"topicTags":"Array;String;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":56.80652014390268,"totalAccepted":413389,"totalSubmission":727714},{"questionId":"975","title":"Range Sum of BST","titleSlug":"range-sum-of-bst","isPaidOnly":false,"difficulty":"Easy","likes":7271,"dislikes":389,"categoryTitle":"Algorithms","acRate":"87.6%","frontendQuestionId":"938","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Search Tree;Binary Tree;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":87.58938783259894,"totalAccepted":1356276,"totalSubmission":1548448},{"questionId":"976","title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle","isPaidOnly":false,"difficulty":"Medium","likes":2111,"dislikes":298,"categoryTitle":"Algorithms","acRate":"55.5%","frontendQuestionId":"939","paidOnly":false,"topicTags":"Array;Hash Table;Math;Geometry;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.46912607427893,"totalAccepted":180912,"totalSubmission":326149},{"questionId":"977","title":"Distinct Subsequences II","titleSlug":"distinct-subsequences-ii","isPaidOnly":false,"difficulty":"Hard","likes":1837,"dislikes":40,"categoryTitle":"Algorithms","acRate":"44.1%","frontendQuestionId":"940","paidOnly":false,"topicTags":"String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":44.12406981236667,"totalAccepted":52534,"totalSubmission":119061},{"questionId":"978","title":"Valid Mountain Array","titleSlug":"valid-mountain-array","isPaidOnly":false,"difficulty":"Easy","likes":3171,"dislikes":211,"categoryTitle":"Algorithms","acRate":"35.3%","frontendQuestionId":"941","paidOnly":false,"topicTags":"Array;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":35.31423230131636,"totalAccepted":570479,"totalSubmission":1615440},{"questionId":"979","title":"DI String Match","titleSlug":"di-string-match","isPaidOnly":false,"difficulty":"Easy","likes":2623,"dislikes":1082,"categoryTitle":"Algorithms","acRate":"81.1%","frontendQuestionId":"942","paidOnly":false,"topicTags":"Array;Two Pointers;String;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":81.12051613693242,"totalAccepted":211989,"totalSubmission":261326},{"questionId":"980","title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring","isPaidOnly":false,"difficulty":"Hard","likes":1528,"dislikes":152,"categoryTitle":"Algorithms","acRate":"45.4%","frontendQuestionId":"943","paidOnly":false,"topicTags":"Array;String;Dynamic Programming;Bit Manipulation;Bitmask;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.426168060274044,"totalAccepted":36236,"totalSubmission":79769},{"questionId":"981","title":"Delete Columns to Make Sorted","titleSlug":"delete-columns-to-make-sorted","isPaidOnly":false,"difficulty":"Easy","likes":2070,"dislikes":3019,"categoryTitle":"Algorithms","acRate":"78.2%","frontendQuestionId":"944","paidOnly":false,"topicTags":"Array;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":78.15096753096869,"totalAccepted":325033,"totalSubmission":415904},{"questionId":"982","title":"Minimum Increment to Make Array Unique","titleSlug":"minimum-increment-to-make-array-unique","isPaidOnly":false,"difficulty":"Medium","likes":2789,"dislikes":86,"categoryTitle":"Algorithms","acRate":"60.7%","frontendQuestionId":"945","paidOnly":false,"topicTags":"Array;Greedy;Sorting;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.689216910453084,"totalAccepted":272177,"totalSubmission":448478},{"questionId":"983","title":"Validate Stack Sequences","titleSlug":"validate-stack-sequences","isPaidOnly":false,"difficulty":"Medium","likes":6124,"dislikes":132,"categoryTitle":"Algorithms","acRate":"70.5%","frontendQuestionId":"946","paidOnly":false,"topicTags":"Array;Stack;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":70.46548836792493,"totalAccepted":377435,"totalSubmission":535631},{"questionId":"984","title":"Most Stones Removed with Same Row or Column","titleSlug":"most-stones-removed-with-same-row-or-column","isPaidOnly":false,"difficulty":"Medium","likes":6482,"dislikes":709,"categoryTitle":"Algorithms","acRate":"63.0%","frontendQuestionId":"947","paidOnly":false,"topicTags":"Hash Table;Depth-First Search;Union-Find;Graph Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":63.04263491601052,"totalAccepted":411141,"totalSubmission":652164},{"questionId":"985","title":"Bag of Tokens","titleSlug":"bag-of-tokens","isPaidOnly":false,"difficulty":"Medium","likes":3489,"dislikes":547,"categoryTitle":"Algorithms","acRate":"59.7%","frontendQuestionId":"948","paidOnly":false,"topicTags":"Array;Two Pointers;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.667982549102724,"totalAccepted":270253,"totalSubmission":452928},{"questionId":"986","title":"Largest Time for Given Digits","titleSlug":"largest-time-for-given-digits","isPaidOnly":false,"difficulty":"Medium","likes":749,"dislikes":1073,"categoryTitle":"Algorithms","acRate":"36.0%","frontendQuestionId":"949","paidOnly":false,"topicTags":"Array;String;Backtracking;Enumeration;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":35.97375310002756,"totalAccepted":104439,"totalSubmission":290320},{"questionId":"987","title":"Reveal Cards In Increasing Order","titleSlug":"reveal-cards-in-increasing-order","isPaidOnly":false,"difficulty":"Medium","likes":3715,"dislikes":715,"categoryTitle":"Algorithms","acRate":"83.7%","frontendQuestionId":"950","paidOnly":false,"topicTags":"Array;Queue;Sorting;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":83.65404683391075,"totalAccepted":240492,"totalSubmission":287484},{"questionId":"988","title":"Flip Equivalent Binary Trees","titleSlug":"flip-equivalent-binary-trees","isPaidOnly":false,"difficulty":"Medium","likes":2897,"dislikes":124,"categoryTitle":"Algorithms","acRate":"69.5%","frontendQuestionId":"951","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":69.50853818390763,"totalAccepted":270969,"totalSubmission":389836},{"questionId":"989","title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor","isPaidOnly":false,"difficulty":"Hard","likes":1734,"dislikes":95,"categoryTitle":"Algorithms","acRate":"43.2%","frontendQuestionId":"952","paidOnly":false,"topicTags":"Array;Hash Table;Math;Union-Find;Number Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":43.20037117383726,"totalAccepted":68902,"totalSubmission":159494},{"questionId":"990","title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary","isPaidOnly":false,"difficulty":"Easy","likes":5108,"dislikes":1683,"categoryTitle":"Algorithms","acRate":"56.0%","frontendQuestionId":"953","paidOnly":false,"topicTags":"Array;Hash Table;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.99535186354782,"totalAccepted":586922,"totalSubmission":1048162},{"questionId":"991","title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs","isPaidOnly":false,"difficulty":"Medium","likes":1577,"dislikes":188,"categoryTitle":"Algorithms","acRate":"39.8%","frontendQuestionId":"954","paidOnly":false,"topicTags":"Array;Hash Table;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":39.82951105696376,"totalAccepted":105923,"totalSubmission":265941},{"questionId":"992","title":"Delete Columns to Make Sorted II","titleSlug":"delete-columns-to-make-sorted-ii","isPaidOnly":false,"difficulty":"Medium","likes":1047,"dislikes":136,"categoryTitle":"Algorithms","acRate":"49.7%","frontendQuestionId":"955","paidOnly":false,"topicTags":"Array;String;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.711615282748355,"totalAccepted":90844,"totalSubmission":182742},{"questionId":"993","title":"Tallest Billboard","titleSlug":"tallest-billboard","isPaidOnly":false,"difficulty":"Hard","likes":2490,"dislikes":63,"categoryTitle":"Algorithms","acRate":"51.9%","frontendQuestionId":"956","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.90153535644778,"totalAccepted":72003,"totalSubmission":138730},{"questionId":"994","title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days","isPaidOnly":false,"difficulty":"Medium","likes":1567,"dislikes":1781,"categoryTitle":"Algorithms","acRate":"39.2%","frontendQuestionId":"957","paidOnly":false,"topicTags":"Array;Hash Table;Math;Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":39.213581424936386,"totalAccepted":177533,"totalSubmission":452734},{"questionId":"998","title":"Check Completeness of a Binary Tree","titleSlug":"check-completeness-of-a-binary-tree","isPaidOnly":false,"difficulty":"Medium","likes":4564,"dislikes":62,"categoryTitle":"Algorithms","acRate":"59.2%","frontendQuestionId":"958","paidOnly":false,"topicTags":"Tree;Breadth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.2355757200496,"totalAccepted":324312,"totalSubmission":547496},{"questionId":"999","title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes","isPaidOnly":false,"difficulty":"Medium","likes":3998,"dislikes":876,"categoryTitle":"Algorithms","acRate":"77.5%","frontendQuestionId":"959","paidOnly":false,"topicTags":"Array;Hash Table;Depth-First Search;Breadth-First Search;Union-Find;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":77.54592136525049,"totalAccepted":151769,"totalSubmission":195715},{"questionId":"1000","title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii","isPaidOnly":false,"difficulty":"Hard","likes":872,"dislikes":31,"categoryTitle":"Algorithms","acRate":"72.7%","frontendQuestionId":"960","paidOnly":false,"topicTags":"Array;String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.6715257531584,"totalAccepted":74779,"totalSubmission":102900},{"questionId":"1001","title":"N-Repeated Element in Size 2N Array","titleSlug":"n-repeated-element-in-size-2n-array","isPaidOnly":false,"difficulty":"Easy","likes":1855,"dislikes":348,"categoryTitle":"Algorithms","acRate":"79.9%","frontendQuestionId":"961","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":79.94593933340819,"totalAccepted":477067,"totalSubmission":596737},{"questionId":"1002","title":"Maximum Width Ramp","titleSlug":"maximum-width-ramp","isPaidOnly":false,"difficulty":"Medium","likes":2872,"dislikes":99,"categoryTitle":"Algorithms","acRate":"55.9%","frontendQuestionId":"962","paidOnly":false,"topicTags":"Array;Two Pointers;Stack;Monotonic Stack;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.89150508586561,"totalAccepted":209791,"totalSubmission":375354},{"questionId":"1003","title":"Minimum Area Rectangle II","titleSlug":"minimum-area-rectangle-ii","isPaidOnly":false,"difficulty":"Medium","likes":414,"dislikes":487,"categoryTitle":"Algorithms","acRate":"55.9%","frontendQuestionId":"963","paidOnly":false,"topicTags":"Array;Hash Table;Math;Geometry;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.9228228962818,"totalAccepted":36578,"totalSubmission":65408},{"questionId":"1004","title":"Least Operators to Express Number","titleSlug":"least-operators-to-express-number","isPaidOnly":false,"difficulty":"Hard","likes":328,"dislikes":70,"categoryTitle":"Algorithms","acRate":"48.6%","frontendQuestionId":"964","paidOnly":false,"topicTags":"Math;Dynamic Programming;Memoization;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":48.571321010428036,"totalAccepted":12902,"totalSubmission":26563},{"questionId":"1005","title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree","isPaidOnly":false,"difficulty":"Easy","likes":1993,"dislikes":68,"categoryTitle":"Algorithms","acRate":"73.1%","frontendQuestionId":"965","paidOnly":false,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":73.10607746668796,"totalAccepted":279205,"totalSubmission":381918},{"questionId":"1006","title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker","isPaidOnly":false,"difficulty":"Medium","likes":855,"dislikes":1003,"categoryTitle":"Algorithms","acRate":"61.4%","frontendQuestionId":"966","paidOnly":false,"topicTags":"Array;Hash Table;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.4162050462778,"totalAccepted":141471,"totalSubmission":230348},{"questionId":"1007","title":"Numbers With Same Consecutive Differences","titleSlug":"numbers-with-same-consecutive-differences","isPaidOnly":false,"difficulty":"Medium","likes":2892,"dislikes":200,"categoryTitle":"Algorithms","acRate":"59.2%","frontendQuestionId":"967","paidOnly":false,"topicTags":"Backtracking;Breadth-First Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.24074386834056,"totalAccepted":157844,"totalSubmission":266445},{"questionId":"1008","title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras","isPaidOnly":false,"difficulty":"Hard","likes":5678,"dislikes":89,"categoryTitle":"Algorithms","acRate":"47.9%","frontendQuestionId":"968","paidOnly":false,"topicTags":"Dynamic Programming;Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.933767835124186,"totalAccepted":190484,"totalSubmission":397390},{"questionId":"1009","title":"Pancake Sorting","titleSlug":"pancake-sorting","isPaidOnly":false,"difficulty":"Medium","likes":1605,"dislikes":1561,"categoryTitle":"Algorithms","acRate":"71.8%","frontendQuestionId":"969","paidOnly":false,"topicTags":"Array;Two Pointers;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":71.84773347761463,"totalAccepted":115529,"totalSubmission":160797},{"questionId":"1010","title":"Powerful Integers","titleSlug":"powerful-integers","isPaidOnly":false,"difficulty":"Medium","likes":425,"dislikes":86,"categoryTitle":"Algorithms","acRate":"44.6%","frontendQuestionId":"970","paidOnly":false,"topicTags":"Hash Table;Math;Enumeration;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":44.62092319151431,"totalAccepted":64699,"totalSubmission":144997},{"questionId":"1011","title":"Flip Binary Tree To Match Preorder Traversal","titleSlug":"flip-binary-tree-to-match-preorder-traversal","isPaidOnly":false,"difficulty":"Medium","likes":1003,"dislikes":284,"categoryTitle":"Algorithms","acRate":"52.0%","frontendQuestionId":"971","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.9519207813911,"totalAccepted":50051,"totalSubmission":96341},{"questionId":"1012","title":"Equal Rational Numbers","titleSlug":"equal-rational-numbers","isPaidOnly":false,"difficulty":"Hard","likes":107,"dislikes":218,"categoryTitle":"Algorithms","acRate":"46.2%","frontendQuestionId":"972","paidOnly":false,"topicTags":"Math;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":46.22837996921126,"totalAccepted":10210,"totalSubmission":22086},{"questionId":"1014","title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin","isPaidOnly":false,"difficulty":"Medium","likes":9140,"dislikes":339,"categoryTitle":"Algorithms","acRate":"69.1%","frontendQuestionId":"973","paidOnly":false,"topicTags":"Array;Math;Divide and Conquer;Geometry;Sorting;Heap (Priority Queue);Quickselect;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":69.05587782644726,"totalAccepted":1749933,"totalSubmission":2534084},{"questionId":"1016","title":"Subarray Sums Divisible by K","titleSlug":"subarray-sums-divisible-by-k","isPaidOnly":false,"difficulty":"Medium","likes":7940,"dislikes":346,"categoryTitle":"Algorithms","acRate":"56.4%","frontendQuestionId":"974","paidOnly":false,"topicTags":"Array;Hash Table;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":56.35490069026342,"totalAccepted":500959,"totalSubmission":888936},{"questionId":"1017","title":"Odd Even Jump","titleSlug":"odd-even-jump","isPaidOnly":false,"difficulty":"Hard","likes":2119,"dislikes":533,"categoryTitle":"Algorithms","acRate":"41.3%","frontendQuestionId":"975","paidOnly":false,"topicTags":"Array;Dynamic Programming;Stack;Sorting;Monotonic Stack;Ordered Set;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":41.253780588397035,"totalAccepted":105028,"totalSubmission":254590},{"questionId":"1018","title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle","isPaidOnly":false,"difficulty":"Easy","likes":3406,"dislikes":444,"categoryTitle":"Algorithms","acRate":"62.2%","frontendQuestionId":"976","paidOnly":false,"topicTags":"Array;Math;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.22609626222264,"totalAccepted":432610,"totalSubmission":695224},{"questionId":"1019","title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array","isPaidOnly":false,"difficulty":"Easy","likes":10320,"dislikes":279,"categoryTitle":"Algorithms","acRate":"73.8%","frontendQuestionId":"977","paidOnly":false,"topicTags":"Array;Two Pointers;Sorting;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":73.80896672622143,"totalAccepted":2678216,"totalSubmission":3628575},{"questionId":"1020","title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray","isPaidOnly":false,"difficulty":"Medium","likes":2127,"dislikes":262,"categoryTitle":"Algorithms","acRate":"49.2%","frontendQuestionId":"978","paidOnly":false,"topicTags":"Array;Dynamic Programming;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.18566210267422,"totalAccepted":141788,"totalSubmission":288271},{"questionId":"1021","title":"Distribute Coins in Binary Tree","titleSlug":"distribute-coins-in-binary-tree","isPaidOnly":false,"difficulty":"Medium","likes":6101,"dislikes":249,"categoryTitle":"Algorithms","acRate":"77.3%","frontendQuestionId":"979","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":77.31542713738257,"totalAccepted":227980,"totalSubmission":294870},{"questionId":"1022","title":"Unique Paths III","titleSlug":"unique-paths-iii","isPaidOnly":false,"difficulty":"Hard","likes":5508,"dislikes":200,"categoryTitle":"Algorithms","acRate":"82.9%","frontendQuestionId":"980","paidOnly":false,"topicTags":"Array;Backtracking;Bit Manipulation;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":82.86719581565907,"totalAccepted":262365,"totalSubmission":316609},{"questionId":"1023","title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store","isPaidOnly":false,"difficulty":"Medium","likes":5309,"dislikes":734,"categoryTitle":"Algorithms","acRate":"50.0%","frontendQuestionId":"981","paidOnly":false,"topicTags":"Hash Table;String;Binary Search;Design;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.967582707319394,"totalAccepted":751426,"totalSubmission":1503827},{"questionId":"1024","title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero","isPaidOnly":false,"difficulty":"Hard","likes":484,"dislikes":222,"categoryTitle":"Algorithms","acRate":"60.1%","frontendQuestionId":"982","paidOnly":false,"topicTags":"Array;Hash Table;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":60.0525749790895,"totalAccepted":25129,"totalSubmission":41845},{"questionId":"1025","title":"Minimum Cost For Tickets","titleSlug":"minimum-cost-for-tickets","isPaidOnly":false,"difficulty":"Medium","likes":8835,"dislikes":192,"categoryTitle":"Algorithms","acRate":"67.4%","frontendQuestionId":"983","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":67.4337201102816,"totalAccepted":477190,"totalSubmission":707643},{"questionId":"1026","title":"String Without AAA or BBB","titleSlug":"string-without-aaa-or-bbb","isPaidOnly":false,"difficulty":"Medium","likes":876,"dislikes":377,"categoryTitle":"Algorithms","acRate":"45.2%","frontendQuestionId":"984","paidOnly":false,"topicTags":"String;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.23952490443901,"totalAccepted":61780,"totalSubmission":136562},{"questionId":"1027","title":"Sum of Even Numbers After Queries","titleSlug":"sum-of-even-numbers-after-queries","isPaidOnly":false,"difficulty":"Medium","likes":2143,"dislikes":323,"categoryTitle":"Algorithms","acRate":"68.9%","frontendQuestionId":"985","paidOnly":false,"topicTags":"Array;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.88448769519928,"totalAccepted":156861,"totalSubmission":227716},{"questionId":"1028","title":"Interval List Intersections","titleSlug":"interval-list-intersections","isPaidOnly":false,"difficulty":"Medium","likes":5942,"dislikes":131,"categoryTitle":"Algorithms","acRate":"73.0%","frontendQuestionId":"986","paidOnly":false,"topicTags":"Array;Two Pointers;Sweep Line;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":73.04555942139775,"totalAccepted":577138,"totalSubmission":790107},{"questionId":"1029","title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree","isPaidOnly":false,"difficulty":"Hard","likes":8718,"dislikes":4394,"categoryTitle":"Algorithms","acRate":"53.9%","frontendQuestionId":"987","paidOnly":false,"topicTags":"Hash Table;Tree;Depth-First Search;Breadth-First Search;Sorting;Binary Tree;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":53.92453312244372,"totalAccepted":730270,"totalSubmission":1354252},{"questionId":"1030","title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf","isPaidOnly":false,"difficulty":"Medium","likes":2429,"dislikes":336,"categoryTitle":"Algorithms","acRate":"61.3%","frontendQuestionId":"988","paidOnly":false,"topicTags":"String;Backtracking;Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.26115043207497,"totalAccepted":224089,"totalSubmission":365793},{"questionId":"1031","title":"Add to Array-Form of Integer","titleSlug":"add-to-array-form-of-integer","isPaidOnly":false,"difficulty":"Easy","likes":3708,"dislikes":317,"categoryTitle":"Algorithms","acRate":"45.5%","frontendQuestionId":"989","paidOnly":false,"topicTags":"Array;Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.53667287774563,"totalAccepted":344824,"totalSubmission":757245},{"questionId":"1032","title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations","isPaidOnly":false,"difficulty":"Medium","likes":4064,"dislikes":68,"categoryTitle":"Algorithms","acRate":"51.9%","frontendQuestionId":"990","paidOnly":false,"topicTags":"Array;String;Union-Find;Graph Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.91715602625842,"totalAccepted":170985,"totalSubmission":329342},{"questionId":"1033","title":"Broken Calculator","titleSlug":"broken-calculator","isPaidOnly":false,"difficulty":"Medium","likes":2850,"dislikes":218,"categoryTitle":"Algorithms","acRate":"56.2%","frontendQuestionId":"991","paidOnly":false,"topicTags":"Math;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":56.17733509723269,"totalAccepted":124421,"totalSubmission":221479},{"questionId":"1034","title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers","isPaidOnly":false,"difficulty":"Hard","likes":7011,"dislikes":124,"categoryTitle":"Algorithms","acRate":"68.3%","frontendQuestionId":"992","paidOnly":false,"topicTags":"Array;Hash Table;Sliding Window;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.2877751651032,"totalAccepted":412661,"totalSubmission":604303},{"questionId":"1035","title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree","isPaidOnly":false,"difficulty":"Easy","likes":4338,"dislikes":233,"categoryTitle":"Algorithms","acRate":"59.4%","frontendQuestionId":"993","paidOnly":false,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.38895082269515,"totalAccepted":354261,"totalSubmission":596512},{"questionId":"1036","title":"Rotting Oranges","titleSlug":"rotting-oranges","isPaidOnly":false,"difficulty":"Medium","likes":15270,"dislikes":477,"categoryTitle":"Algorithms","acRate":"58.8%","frontendQuestionId":"994","paidOnly":false,"topicTags":"Array;Breadth-First Search;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.77634750215305,"totalAccepted":1693862,"totalSubmission":2881901},{"questionId":"1037","title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips","isPaidOnly":false,"difficulty":"Hard","likes":2076,"dislikes":91,"categoryTitle":"Algorithms","acRate":"62.3%","frontendQuestionId":"995","paidOnly":false,"topicTags":"Array;Bit Manipulation;Queue;Sliding Window;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.33286691542289,"totalAccepted":144333,"totalSubmission":231552},{"questionId":"1038","title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays","isPaidOnly":false,"difficulty":"Hard","likes":1044,"dislikes":49,"categoryTitle":"Algorithms","acRate":"51.5%","frontendQuestionId":"996","paidOnly":false,"topicTags":"Array;Hash Table;Math;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.53183050710267,"totalAccepted":50932,"totalSubmission":98836},{"questionId":"1039","title":"Find the Town Judge","titleSlug":"find-the-town-judge","isPaidOnly":false,"difficulty":"Easy","likes":6990,"dislikes":634,"categoryTitle":"Algorithms","acRate":"50.8%","frontendQuestionId":"997","paidOnly":false,"topicTags":"Array;Hash Table;Graph Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":50.825413540959694,"totalAccepted":761599,"totalSubmission":1498461},{"questionId":"1040","title":"Maximum Binary Tree II","titleSlug":"maximum-binary-tree-ii","isPaidOnly":false,"difficulty":"Medium","likes":572,"dislikes":806,"categoryTitle":"Algorithms","acRate":"70.6%","frontendQuestionId":"998","paidOnly":false,"topicTags":"Tree;Binary Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":70.6138607807771,"totalAccepted":46197,"totalSubmission":65422},{"questionId":"1041","title":"Available Captures for Rook","titleSlug":"available-captures-for-rook","isPaidOnly":false,"difficulty":"Easy","likes":815,"dislikes":649,"categoryTitle":"Algorithms","acRate":"71.8%","frontendQuestionId":"999","paidOnly":false,"topicTags":"Array;Matrix;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":71.80898389827172,"totalAccepted":91201,"totalSubmission":127005},{"questionId":"1042","title":"Minimum Cost to Merge Stones","titleSlug":"minimum-cost-to-merge-stones","isPaidOnly":false,"difficulty":"Hard","likes":2646,"dislikes":116,"categoryTitle":"Algorithms","acRate":"46.2%","frontendQuestionId":"1000","paidOnly":false,"topicTags":"Array;Dynamic Programming;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":46.24760578095072,"totalAccepted":53120,"totalSubmission":114860},{"questionId":"1234","title":"Number of Paths with Max Score","titleSlug":"number-of-paths-with-max-score","isPaidOnly":false,"difficulty":"Hard","likes":555,"dislikes":28,"categoryTitle":"Algorithms","acRate":"42.6%","frontendQuestionId":"1301","paidOnly":false,"topicTags":"Array;Dynamic Programming;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":42.58640641034039,"totalAccepted":19505,"totalSubmission":45801},{"questionId":"1254","title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum","isPaidOnly":false,"difficulty":"Medium","likes":4854,"dislikes":127,"categoryTitle":"Algorithms","acRate":"86.5%","frontendQuestionId":"1302","paidOnly":false,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":86.54870845045734,"totalAccepted":409809,"totalSubmission":473501},{"questionId":"1438","title":"Find the Team Size","titleSlug":"find-the-team-size","isPaidOnly":true,"difficulty":"Easy","likes":344,"dislikes":16,"categoryTitle":"Database","acRate":"89.5%","frontendQuestionId":"1303","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":89.53021744345816,"totalAccepted":82101,"totalSubmission":91702},{"questionId":"1426","title":"Find N Unique Integers Sum up to Zero","titleSlug":"find-n-unique-integers-sum-up-to-zero","isPaidOnly":false,"difficulty":"Easy","likes":2497,"dislikes":621,"categoryTitle":"Algorithms","acRate":"78.4%","frontendQuestionId":"1304","paidOnly":false,"topicTags":"Array;Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":78.43935849926001,"totalAccepted":401746,"totalSubmission":512174},{"questionId":"1427","title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees","isPaidOnly":false,"difficulty":"Medium","likes":3196,"dislikes":99,"categoryTitle":"Algorithms","acRate":"80.3%","frontendQuestionId":"1305","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Search Tree;Sorting;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":80.28951578998308,"totalAccepted":265454,"totalSubmission":330621},{"questionId":"1428","title":"Jump Game III","titleSlug":"jump-game-iii","isPaidOnly":false,"difficulty":"Medium","likes":4565,"dislikes":120,"categoryTitle":"Algorithms","acRate":"70.3%","frontendQuestionId":"1306","paidOnly":false,"topicTags":"Array;Depth-First Search;Breadth-First Search;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":70.29169472163842,"totalAccepted":395659,"totalSubmission":562882},{"questionId":"1429","title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle","isPaidOnly":false,"difficulty":"Hard","likes":533,"dislikes":138,"categoryTitle":"Algorithms","acRate":"34.5%","frontendQuestionId":"1307","paidOnly":false,"topicTags":"Array;Math;String;Backtracking;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":34.45193604315161,"totalAccepted":17884,"totalSubmission":51910},{"questionId":"1439","title":"Running Total for Different Genders","titleSlug":"running-total-for-different-genders","isPaidOnly":true,"difficulty":"Medium","likes":225,"dislikes":70,"categoryTitle":"Database","acRate":"86.1%","frontendQuestionId":"1308","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":86.06877122011124,"totalAccepted":47658,"totalSubmission":55372},{"questionId":"1434","title":"Decrypt String from Alphabet to Integer Mapping","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping","isPaidOnly":false,"difficulty":"Easy","likes":1614,"dislikes":120,"categoryTitle":"Algorithms","acRate":"80.6%","frontendQuestionId":"1309","paidOnly":false,"topicTags":"String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":80.59201921793674,"totalAccepted":150969,"totalSubmission":187325},{"questionId":"1435","title":"XOR Queries of a Subarray","titleSlug":"xor-queries-of-a-subarray","isPaidOnly":false,"difficulty":"Medium","likes":2109,"dislikes":61,"categoryTitle":"Algorithms","acRate":"78.1%","frontendQuestionId":"1310","paidOnly":false,"topicTags":"Array;Bit Manipulation;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":78.06166148378499,"totalAccepted":219646,"totalSubmission":281375},{"questionId":"1436","title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends","isPaidOnly":false,"difficulty":"Medium","likes":486,"dislikes":457,"categoryTitle":"Algorithms","acRate":"53.3%","frontendQuestionId":"1311","paidOnly":false,"topicTags":"Array;Hash Table;Breadth-First Search;Graph Theory;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.25040177640376,"totalAccepted":43406,"totalSubmission":81513},{"questionId":"1437","title":"Minimum Insertion Steps to Make a String Palindrome","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome","isPaidOnly":false,"difficulty":"Hard","likes":5632,"dislikes":78,"categoryTitle":"Algorithms","acRate":"74.0%","frontendQuestionId":"1312","paidOnly":false,"topicTags":"String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":74.00573316602005,"totalAccepted":321413,"totalSubmission":434309},{"questionId":"1241","title":"Decompress Run-Length Encoded List","titleSlug":"decompress-run-length-encoded-list","isPaidOnly":false,"difficulty":"Easy","likes":1354,"dislikes":1325,"categoryTitle":"Algorithms","acRate":"86.2%","frontendQuestionId":"1313","paidOnly":false,"topicTags":"Array;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":86.22664263969853,"totalAccepted":309587,"totalSubmission":359039},{"questionId":"1242","title":"Matrix Block Sum","titleSlug":"matrix-block-sum","isPaidOnly":false,"difficulty":"Medium","likes":2521,"dislikes":402,"categoryTitle":"Algorithms","acRate":"76.6%","frontendQuestionId":"1314","paidOnly":false,"topicTags":"Array;Matrix;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":76.58745144583513,"totalAccepted":113569,"totalSubmission":148287},{"questionId":"1243","title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent","isPaidOnly":false,"difficulty":"Medium","likes":2835,"dislikes":79,"categoryTitle":"Algorithms","acRate":"85.9%","frontendQuestionId":"1315","paidOnly":false,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":85.94423472731133,"totalAccepted":186235,"totalSubmission":216693},{"questionId":"1244","title":"Distinct Echo Substrings","titleSlug":"distinct-echo-substrings","isPaidOnly":false,"difficulty":"Hard","likes":342,"dislikes":208,"categoryTitle":"Algorithms","acRate":"53.3%","frontendQuestionId":"1316","paidOnly":false,"topicTags":"String;Trie;Rolling Hash;Hash Function;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.26722603610475,"totalAccepted":23045,"totalSubmission":43263},{"questionId":"1440","title":"Convert Integer to the Sum of Two No-Zero Integers","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers","isPaidOnly":false,"difficulty":"Easy","likes":869,"dislikes":371,"categoryTitle":"Algorithms","acRate":"59.2%","frontendQuestionId":"1317","paidOnly":false,"topicTags":"Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.18126060143112,"totalAccepted":210735,"totalSubmission":356084},{"questionId":"1441","title":"Minimum Flips to Make a OR b Equal to c","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c","isPaidOnly":false,"difficulty":"Medium","likes":2149,"dislikes":112,"categoryTitle":"Algorithms","acRate":"72.0%","frontendQuestionId":"1318","paidOnly":false,"topicTags":"Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.0003003453972,"totalAccepted":201368,"totalSubmission":279676},{"questionId":"1442","title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected","isPaidOnly":false,"difficulty":"Medium","likes":5634,"dislikes":85,"categoryTitle":"Algorithms","acRate":"66.7%","frontendQuestionId":"1319","paidOnly":false,"topicTags":"Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":66.66236309254836,"totalAccepted":371757,"totalSubmission":557673},{"questionId":"1443","title":"Minimum Distance to Type a Word Using Two Fingers","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers","isPaidOnly":false,"difficulty":"Hard","likes":1370,"dislikes":54,"categoryTitle":"Algorithms","acRate":"72.3%","frontendQuestionId":"1320","paidOnly":false,"topicTags":"String;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.3012021577556,"totalAccepted":101461,"totalSubmission":140331},{"questionId":"1452","title":"Restaurant Growth","titleSlug":"restaurant-growth","isPaidOnly":false,"difficulty":"Medium","likes":1188,"dislikes":389,"categoryTitle":"Database","acRate":"58.9%","frontendQuestionId":"1321","paidOnly":false,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":58.89814526854897,"totalAccepted":267034,"totalSubmission":453382},{"questionId":"1453","title":"Ads Performance","titleSlug":"ads-performance","isPaidOnly":true,"difficulty":"Easy","likes":273,"dislikes":68,"categoryTitle":"Database","acRate":"58.5%","frontendQuestionId":"1322","paidOnly":true,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.51900536751013,"totalAccepted":53422,"totalSubmission":91290},{"questionId":"1448","title":"Maximum 69 Number","titleSlug":"maximum-69-number","isPaidOnly":false,"difficulty":"Easy","likes":3324,"dislikes":240,"categoryTitle":"Algorithms","acRate":"84.5%","frontendQuestionId":"1323","paidOnly":false,"topicTags":"Math;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":84.54967778050845,"totalAccepted":495405,"totalSubmission":585934},{"questionId":"1449","title":"Print Words Vertically","titleSlug":"print-words-vertically","isPaidOnly":false,"difficulty":"Medium","likes":829,"dislikes":121,"categoryTitle":"Algorithms","acRate":"67.7%","frontendQuestionId":"1324","paidOnly":false,"topicTags":"Array;String;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":67.70259087147495,"totalAccepted":53177,"totalSubmission":78545},{"questionId":"1450","title":"Delete Leaves With a Given Value","titleSlug":"delete-leaves-with-a-given-value","isPaidOnly":false,"difficulty":"Medium","likes":2920,"dislikes":59,"categoryTitle":"Algorithms","acRate":"77.2%","frontendQuestionId":"1325","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":77.24013111947862,"totalAccepted":259900,"totalSubmission":336484},{"questionId":"1451","title":"Minimum Number of Taps to Open to Water a Garden","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden","isPaidOnly":false,"difficulty":"Hard","likes":3630,"dislikes":198,"categoryTitle":"Algorithms","acRate":"51.0%","frontendQuestionId":"1326","paidOnly":false,"topicTags":"Array;Dynamic Programming;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.012500591137666,"totalAccepted":161804,"totalSubmission":317185},{"questionId":"1462","title":"List the Products Ordered in a Period","titleSlug":"list-the-products-ordered-in-a-period","isPaidOnly":false,"difficulty":"Easy","likes":595,"dislikes":48,"categoryTitle":"Database","acRate":"71.8%","frontendQuestionId":"1327","paidOnly":false,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":71.75461018805916,"totalAccepted":330120,"totalSubmission":460068},{"questionId":"1252","title":"Break a Palindrome","titleSlug":"break-a-palindrome","isPaidOnly":false,"difficulty":"Medium","likes":2451,"dislikes":755,"categoryTitle":"Algorithms","acRate":"51.6%","frontendQuestionId":"1328","paidOnly":false,"topicTags":"String;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.60350909862098,"totalAccepted":199525,"totalSubmission":386651},{"questionId":"1253","title":"Sort the Matrix Diagonally","titleSlug":"sort-the-matrix-diagonally","isPaidOnly":false,"difficulty":"Medium","likes":3593,"dislikes":239,"categoryTitle":"Algorithms","acRate":"83.2%","frontendQuestionId":"1329","paidOnly":false,"topicTags":"Array;Sorting;Matrix;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":83.19854554573382,"totalAccepted":199065,"totalSubmission":239265},{"questionId":"1255","title":"Reverse Subarray To Maximize Array Value","titleSlug":"reverse-subarray-to-maximize-array-value","isPaidOnly":false,"difficulty":"Hard","likes":495,"dislikes":61,"categoryTitle":"Algorithms","acRate":"44.0%","frontendQuestionId":"1330","paidOnly":false,"topicTags":"Array;Math;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":44.00334103080627,"totalAccepted":8956,"totalSubmission":20353},{"questionId":"1256","title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array","isPaidOnly":false,"difficulty":"Easy","likes":2399,"dislikes":115,"categoryTitle":"Algorithms","acRate":"70.9%","frontendQuestionId":"1331","paidOnly":false,"topicTags":"Array;Hash Table;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":70.9009211021877,"totalAccepted":325676,"totalSubmission":459337},{"questionId":"1454","title":"Remove Palindromic Subsequences","titleSlug":"remove-palindromic-subsequences","isPaidOnly":false,"difficulty":"Easy","likes":1754,"dislikes":1804,"categoryTitle":"Algorithms","acRate":"77.1%","frontendQuestionId":"1332","paidOnly":false,"topicTags":"Two Pointers;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":77.10015111146458,"totalAccepted":155106,"totalSubmission":201175},{"questionId":"1455","title":"Filter Restaurants by Vegan-Friendly, Price and Distance","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance","isPaidOnly":false,"difficulty":"Medium","likes":320,"dislikes":230,"categoryTitle":"Algorithms","acRate":"64.3%","frontendQuestionId":"1333","paidOnly":false,"topicTags":"Array;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.26422874138164,"totalAccepted":38029,"totalSubmission":59176},{"questionId":"1456","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","isPaidOnly":false,"difficulty":"Medium","likes":3647,"dislikes":159,"categoryTitle":"Algorithms","acRate":"73.0%","frontendQuestionId":"1334","paidOnly":false,"topicTags":"Dynamic Programming;Graph Theory;Shortest Path;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.95657858444405,"totalAccepted":335917,"totalSubmission":460436},{"questionId":"1457","title":"Minimum Difficulty of a Job Schedule","titleSlug":"minimum-difficulty-of-a-job-schedule","isPaidOnly":false,"difficulty":"Hard","likes":3610,"dislikes":336,"categoryTitle":"Algorithms","acRate":"59.8%","frontendQuestionId":"1335","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.76590865908919,"totalAccepted":229624,"totalSubmission":384205},{"questionId":"1467","title":"Number of Transactions per Visit","titleSlug":"number-of-transactions-per-visit","isPaidOnly":true,"difficulty":"Hard","likes":95,"dislikes":327,"categoryTitle":"Database","acRate":"47.9%","frontendQuestionId":"1336","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":47.9270961359753,"totalAccepted":15988,"totalSubmission":33359},{"questionId":"1463","title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix","isPaidOnly":false,"difficulty":"Easy","likes":4358,"dislikes":242,"categoryTitle":"Algorithms","acRate":"74.4%","frontendQuestionId":"1337","paidOnly":false,"topicTags":"Array;Binary Search;Sorting;Heap (Priority Queue);Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":74.37797499694872,"totalAccepted":426576,"totalSubmission":573526},{"questionId":"1464","title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half","isPaidOnly":false,"difficulty":"Medium","likes":3372,"dislikes":154,"categoryTitle":"Algorithms","acRate":"69.4%","frontendQuestionId":"1338","paidOnly":false,"topicTags":"Array;Hash Table;Greedy;Sorting;Heap (Priority Queue);","hasSolution":true,"hasVideoSolution":false,"acRateRaw":69.40153332254219,"totalAccepted":235815,"totalSubmission":339784},{"questionId":"1465","title":"Maximum Product of Splitted Binary Tree","titleSlug":"maximum-product-of-splitted-binary-tree","isPaidOnly":false,"difficulty":"Medium","likes":3587,"dislikes":122,"categoryTitle":"Algorithms","acRate":"55.8%","frontendQuestionId":"1339","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.75082636946568,"totalAccepted":260920,"totalSubmission":468011},{"questionId":"1466","title":"Jump Game V","titleSlug":"jump-game-v","isPaidOnly":false,"difficulty":"Hard","likes":1428,"dislikes":58,"categoryTitle":"Algorithms","acRate":"75.8%","frontendQuestionId":"1340","paidOnly":false,"topicTags":"Array;Dynamic Programming;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.80894813391511,"totalAccepted":113627,"totalSubmission":149886},{"questionId":"1480","title":"Movie Rating","titleSlug":"movie-rating","isPaidOnly":false,"difficulty":"Medium","likes":1021,"dislikes":244,"categoryTitle":"Database","acRate":"43.6%","frontendQuestionId":"1341","paidOnly":false,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":43.560846951406475,"totalAccepted":306867,"totalSubmission":704456},{"questionId":"1444","title":"Number of Steps to Reduce a Number to Zero","titleSlug":"number-of-steps-to-reduce-a-number-to-zero","isPaidOnly":false,"difficulty":"Easy","likes":4296,"dislikes":182,"categoryTitle":"Algorithms","acRate":"85.8%","frontendQuestionId":"1342","paidOnly":false,"topicTags":"Math;Bit Manipulation;","hasSolution":true,"hasVideoSolution":true,"acRateRaw":85.81725680901623,"totalAccepted":932465,"totalSubmission":1086571},{"questionId":"1445","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","isPaidOnly":false,"difficulty":"Medium","likes":1870,"dislikes":112,"categoryTitle":"Algorithms","acRate":"73.0%","frontendQuestionId":"1343","paidOnly":false,"topicTags":"Array;Sliding Window;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":73.03961866851274,"totalAccepted":202570,"totalSubmission":277343},{"questionId":"1446","title":"Angle Between Hands of a Clock","titleSlug":"angle-between-hands-of-a-clock","isPaidOnly":false,"difficulty":"Medium","likes":1377,"dislikes":248,"categoryTitle":"Algorithms","acRate":"64.5%","frontendQuestionId":"1344","paidOnly":false,"topicTags":"Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.46311550267072,"totalAccepted":144701,"totalSubmission":224471},{"questionId":"1447","title":"Jump Game IV","titleSlug":"jump-game-iv","isPaidOnly":false,"difficulty":"Hard","likes":4146,"dislikes":138,"categoryTitle":"Algorithms","acRate":"51.0%","frontendQuestionId":"1345","paidOnly":false,"topicTags":"Array;Hash Table;Breadth-First Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.017126197382446,"totalAccepted":240784,"totalSubmission":471967},{"questionId":"1468","title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist","isPaidOnly":false,"difficulty":"Easy","likes":2538,"dislikes":259,"categoryTitle":"Algorithms","acRate":"41.8%","frontendQuestionId":"1346","paidOnly":false,"topicTags":"Array;Hash Table;Two Pointers;Binary Search;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":41.847151344789296,"totalAccepted":638059,"totalSubmission":1524737},{"questionId":"1469","title":"Minimum Number of Steps to Make Two Strings Anagram","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram","isPaidOnly":false,"difficulty":"Medium","likes":2830,"dislikes":122,"categoryTitle":"Algorithms","acRate":"82.5%","frontendQuestionId":"1347","paidOnly":false,"topicTags":"Hash Table;String;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":82.52895165432807,"totalAccepted":339003,"totalSubmission":410769},{"questionId":"1470","title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency","isPaidOnly":false,"difficulty":"Medium","likes":223,"dislikes":309,"categoryTitle":"Algorithms","acRate":"46.2%","frontendQuestionId":"1348","paidOnly":false,"topicTags":"Hash Table;String;Binary Search;Design;Sorting;Ordered Set;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":46.22503038781735,"totalAccepted":40311,"totalSubmission":87206},{"questionId":"1471","title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam","isPaidOnly":false,"difficulty":"Hard","likes":906,"dislikes":20,"categoryTitle":"Algorithms","acRate":"53.9%","frontendQuestionId":"1349","paidOnly":false,"topicTags":"Array;Dynamic Programming;Bit Manipulation;Matrix;Bitmask;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.91577060931899,"totalAccepted":24068,"totalSubmission":44640},{"questionId":"1481","title":"Students With Invalid Departments","titleSlug":"students-with-invalid-departments","isPaidOnly":true,"difficulty":"Easy","likes":184,"dislikes":9,"categoryTitle":"Database","acRate":"89.7%","frontendQuestionId":"1350","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":89.71524064171122,"totalAccepted":67107,"totalSubmission":74800},{"questionId":"1476","title":"Count Negative Numbers in a Sorted Matrix","titleSlug":"count-negative-numbers-in-a-sorted-matrix","isPaidOnly":false,"difficulty":"Easy","likes":5512,"dislikes":147,"categoryTitle":"Algorithms","acRate":"79.6%","frontendQuestionId":"1351","paidOnly":false,"topicTags":"Array;Binary Search;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":79.6353161097238,"totalAccepted":674801,"totalSubmission":847364},{"questionId":"1477","title":"Product of the Last K Numbers","titleSlug":"product-of-the-last-k-numbers","isPaidOnly":false,"difficulty":"Medium","likes":2173,"dislikes":110,"categoryTitle":"Algorithms","acRate":"62.9%","frontendQuestionId":"1352","paidOnly":false,"topicTags":"Array;Math;Design;Data Stream;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.9415216395695,"totalAccepted":263871,"totalSubmission":419232},{"questionId":"1478","title":"Maximum Number of Events That Can Be Attended","titleSlug":"maximum-number-of-events-that-can-be-attended","isPaidOnly":false,"difficulty":"Medium","likes":4020,"dislikes":637,"categoryTitle":"Algorithms","acRate":"39.0%","frontendQuestionId":"1353","paidOnly":false,"topicTags":"Array;Greedy;Sorting;Heap (Priority Queue);","hasSolution":true,"hasVideoSolution":false,"acRateRaw":39.001830570527815,"totalAccepted":230102,"totalSubmission":589978},{"questionId":"1479","title":"Construct Target Array With Multiple Sums","titleSlug":"construct-target-array-with-multiple-sums","isPaidOnly":false,"difficulty":"Hard","likes":2136,"dislikes":180,"categoryTitle":"Algorithms","acRate":"37.0%","frontendQuestionId":"1354","paidOnly":false,"topicTags":"Array;Heap (Priority Queue);","hasSolution":true,"hasVideoSolution":false,"acRateRaw":37.02768753785488,"totalAccepted":87422,"totalSubmission":236095},{"questionId":"1494","title":"Activity Participants","titleSlug":"activity-participants","isPaidOnly":true,"difficulty":"Medium","likes":152,"dislikes":48,"categoryTitle":"Database","acRate":"72.0%","frontendQuestionId":"1355","paidOnly":true,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.04745025376621,"totalAccepted":35773,"totalSubmission":49652},{"questionId":"1458","title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits","isPaidOnly":false,"difficulty":"Easy","likes":2874,"dislikes":138,"categoryTitle":"Algorithms","acRate":"82.3%","frontendQuestionId":"1356","paidOnly":false,"topicTags":"Array;Bit Manipulation;Sorting;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":82.3498027148423,"totalAccepted":398212,"totalSubmission":483562},{"questionId":"1459","title":"Apply Discount Every n Orders","titleSlug":"apply-discount-every-n-orders","isPaidOnly":false,"difficulty":"Medium","likes":216,"dislikes":234,"categoryTitle":"Algorithms","acRate":"65.7%","frontendQuestionId":"1357","paidOnly":false,"topicTags":"Array;Hash Table;Design;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":65.69579288025889,"totalAccepted":30246,"totalSubmission":46039},{"questionId":"1460","title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters","isPaidOnly":false,"difficulty":"Medium","likes":4494,"dislikes":83,"categoryTitle":"Algorithms","acRate":"73.8%","frontendQuestionId":"1358","paidOnly":false,"topicTags":"Hash Table;String;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":73.77321787148594,"totalAccepted":470259,"totalSubmission":637439},{"questionId":"1461","title":"Count All Valid Pickup and Delivery Options","titleSlug":"count-all-valid-pickup-and-delivery-options","isPaidOnly":false,"difficulty":"Hard","likes":3101,"dislikes":233,"categoryTitle":"Algorithms","acRate":"64.9%","frontendQuestionId":"1359","paidOnly":false,"topicTags":"Math;Dynamic Programming;Combinatorics;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.87068965517241,"totalAccepted":135149,"totalSubmission":208336},{"questionId":"1274","title":"Number of Days Between Two Dates","titleSlug":"number-of-days-between-two-dates","isPaidOnly":false,"difficulty":"Easy","likes":440,"dislikes":1325,"categoryTitle":"Algorithms","acRate":"52.8%","frontendQuestionId":"1360","paidOnly":false,"topicTags":"Math;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":52.831142568250755,"totalAccepted":75240,"totalSubmission":142416},{"questionId":"1275","title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes","isPaidOnly":false,"difficulty":"Medium","likes":2256,"dislikes":525,"categoryTitle":"Algorithms","acRate":"44.1%","frontendQuestionId":"1361","paidOnly":false,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":44.14169990913368,"totalAccepted":136990,"totalSubmission":310344},{"questionId":"1276","title":"Closest Divisors","titleSlug":"closest-divisors","isPaidOnly":false,"difficulty":"Medium","likes":339,"dislikes":101,"categoryTitle":"Algorithms","acRate":"62.3%","frontendQuestionId":"1362","paidOnly":false,"topicTags":"Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":62.29380082374063,"totalAccepted":29493,"totalSubmission":47345},{"questionId":"1277","title":"Largest Multiple of Three","titleSlug":"largest-multiple-of-three","isPaidOnly":false,"difficulty":"Hard","likes":631,"dislikes":92,"categoryTitle":"Algorithms","acRate":"33.3%","frontendQuestionId":"1363","paidOnly":false,"topicTags":"Array;Math;Dynamic Programming;Greedy;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":33.28810774477831,"totalAccepted":26743,"totalSubmission":80338},{"questionId":"1495","title":"Number of Trusted Contacts of a Customer","titleSlug":"number-of-trusted-contacts-of-a-customer","isPaidOnly":true,"difficulty":"Medium","likes":95,"dislikes":403,"categoryTitle":"Database","acRate":"74.8%","frontendQuestionId":"1364","paidOnly":true,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":74.75432157234194,"totalAccepted":25255,"totalSubmission":33784},{"questionId":"1482","title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number","isPaidOnly":false,"difficulty":"Easy","likes":6075,"dislikes":163,"categoryTitle":"Algorithms","acRate":"87.4%","frontendQuestionId":"1365","paidOnly":false,"topicTags":"Array;Hash Table;Sorting;Counting Sort;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":87.43542871520775,"totalAccepted":917389,"totalSubmission":1049219},{"questionId":"1483","title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes","isPaidOnly":false,"difficulty":"Medium","likes":1571,"dislikes":198,"categoryTitle":"Algorithms","acRate":"60.1%","frontendQuestionId":"1366","paidOnly":false,"topicTags":"Array;Hash Table;String;Sorting;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":60.086303636090186,"totalAccepted":103876,"totalSubmission":172878},{"questionId":"1484","title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree","isPaidOnly":false,"difficulty":"Medium","likes":3033,"dislikes":90,"categoryTitle":"Algorithms","acRate":"52.0%","frontendQuestionId":"1367","paidOnly":false,"topicTags":"Linked List;Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":51.97717694032977,"totalAccepted":210887,"totalSubmission":405730},{"questionId":"1485","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","isPaidOnly":false,"difficulty":"Hard","likes":2615,"dislikes":36,"categoryTitle":"Algorithms","acRate":"71.0%","frontendQuestionId":"1368","paidOnly":false,"topicTags":"Array;Breadth-First Search;Graph Theory;Heap (Priority Queue);Matrix;Shortest Path;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":71.00684385103078,"totalAccepted":169117,"totalSubmission":238170},{"questionId":"1504","title":"Get the Second Most Recent Activity","titleSlug":"get-the-second-most-recent-activity","isPaidOnly":true,"difficulty":"Hard","likes":169,"dislikes":13,"categoryTitle":"Database","acRate":"67.4%","frontendQuestionId":"1369","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":67.35777496839444,"totalAccepted":26640,"totalSubmission":39550},{"questionId":"1472","title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string","isPaidOnly":false,"difficulty":"Easy","likes":846,"dislikes":878,"categoryTitle":"Algorithms","acRate":"77.3%","frontendQuestionId":"1370","paidOnly":false,"topicTags":"Hash Table;String;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":77.34855068562683,"totalAccepted":100574,"totalSubmission":130027},{"questionId":"1473","title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts","isPaidOnly":false,"difficulty":"Medium","likes":2573,"dislikes":142,"categoryTitle":"Algorithms","acRate":"75.6%","frontendQuestionId":"1371","paidOnly":false,"topicTags":"Hash Table;String;Bit Manipulation;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.60459202672654,"totalAccepted":142117,"totalSubmission":187975},{"questionId":"1474","title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree","isPaidOnly":false,"difficulty":"Medium","likes":3767,"dislikes":86,"categoryTitle":"Algorithms","acRate":"67.2%","frontendQuestionId":"1372","paidOnly":false,"topicTags":"Dynamic Programming;Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":67.16910795472941,"totalAccepted":290452,"totalSubmission":432420},{"questionId":"1475","title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree","isPaidOnly":false,"difficulty":"Hard","likes":3026,"dislikes":200,"categoryTitle":"Algorithms","acRate":"47.6%","frontendQuestionId":"1373","paidOnly":false,"topicTags":"Dynamic Programming;Tree;Depth-First Search;Binary Search Tree;Binary Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":47.6098484311418,"totalAccepted":134315,"totalSubmission":282116},{"questionId":"1490","title":"Generate a String With Characters That Have Odd Counts","titleSlug":"generate-a-string-with-characters-that-have-odd-counts","isPaidOnly":false,"difficulty":"Easy","likes":533,"dislikes":1288,"categoryTitle":"Algorithms","acRate":"78.5%","frontendQuestionId":"1374","paidOnly":false,"topicTags":"String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":78.51807040559004,"totalAccepted":115514,"totalSubmission":147118},{"questionId":"1491","title":"Number of Times Binary String Is Prefix-Aligned","titleSlug":"number-of-times-binary-string-is-prefix-aligned","isPaidOnly":false,"difficulty":"Medium","likes":970,"dislikes":139,"categoryTitle":"Algorithms","acRate":"66.1%","frontendQuestionId":"1375","paidOnly":false,"topicTags":"Array;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":66.10777661795407,"totalAccepted":60798,"totalSubmission":91968},{"questionId":"1492","title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees","isPaidOnly":false,"difficulty":"Medium","likes":4263,"dislikes":327,"categoryTitle":"Algorithms","acRate":"60.5%","frontendQuestionId":"1376","paidOnly":false,"topicTags":"Tree;Depth-First Search;Breadth-First Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.51509489807244,"totalAccepted":261706,"totalSubmission":432464},{"questionId":"1493","title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds","isPaidOnly":false,"difficulty":"Hard","likes":848,"dislikes":151,"categoryTitle":"Algorithms","acRate":"38.6%","frontendQuestionId":"1377","paidOnly":false,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Graph Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":38.61003861003861,"totalAccepted":44300,"totalSubmission":114737},{"questionId":"1509","title":"Replace Employee ID With The Unique Identifier","titleSlug":"replace-employee-id-with-the-unique-identifier","isPaidOnly":false,"difficulty":"Easy","likes":2080,"dislikes":163,"categoryTitle":"Database","acRate":"83.6%","frontendQuestionId":"1378","paidOnly":false,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":83.57529905543404,"totalAccepted":1365600,"totalSubmission":1633976},{"questionId":"1498","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","isPaidOnly":false,"difficulty":"Easy","likes":1817,"dislikes":2019,"categoryTitle":"Algorithms","acRate":"85.9%","frontendQuestionId":"1379","paidOnly":false,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":85.85121257412854,"totalAccepted":267096,"totalSubmission":311115},{"questionId":"1496","title":"Lucky Numbers in a Matrix","titleSlug":"lucky-numbers-in-a-matrix","isPaidOnly":false,"difficulty":"Easy","likes":2363,"dislikes":123,"categoryTitle":"Algorithms","acRate":"80.0%","frontendQuestionId":"1380","paidOnly":false,"topicTags":"Array;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":80.0254246096363,"totalAccepted":300277,"totalSubmission":375227},{"questionId":"1497","title":"Design a Stack With Increment Operation","titleSlug":"design-a-stack-with-increment-operation","isPaidOnly":false,"difficulty":"Medium","likes":2381,"dislikes":112,"categoryTitle":"Algorithms","acRate":"79.9%","frontendQuestionId":"1381","paidOnly":false,"topicTags":"Array;Stack;Design;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":79.90337024976795,"totalAccepted":264278,"totalSubmission":330747},{"questionId":"1285","title":"Balance a Binary Search Tree","titleSlug":"balance-a-binary-search-tree","isPaidOnly":false,"difficulty":"Medium","likes":4184,"dislikes":105,"categoryTitle":"Algorithms","acRate":"86.3%","frontendQuestionId":"1382","paidOnly":false,"topicTags":"Divide and Conquer;Greedy;Tree;Depth-First Search;Binary Search Tree;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":86.28500292725816,"totalAccepted":408247,"totalSubmission":473137},{"questionId":"1499","title":"Maximum Performance of a Team","titleSlug":"maximum-performance-of-a-team","isPaidOnly":false,"difficulty":"Hard","likes":3222,"dislikes":85,"categoryTitle":"Algorithms","acRate":"47.8%","frontendQuestionId":"1383","paidOnly":false,"topicTags":"Array;Greedy;Sorting;Heap (Priority Queue);","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.7862202189311,"totalAccepted":111316,"totalSubmission":232942},{"questionId":"1518","title":"Total Sales Amount by Year","titleSlug":"total-sales-amount-by-year","isPaidOnly":true,"difficulty":"Hard","likes":236,"dislikes":133,"categoryTitle":"Database","acRate":"61.4%","frontendQuestionId":"1384","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":61.360104810944215,"totalAccepted":20139,"totalSubmission":32821},{"questionId":"1486","title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays","isPaidOnly":false,"difficulty":"Easy","likes":1041,"dislikes":3175,"categoryTitle":"Algorithms","acRate":"71.9%","frontendQuestionId":"1385","paidOnly":false,"topicTags":"Array;Two Pointers;Binary Search;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":71.86824669310599,"totalAccepted":151315,"totalSubmission":210545},{"questionId":"1487","title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation","isPaidOnly":false,"difficulty":"Medium","likes":995,"dislikes":418,"categoryTitle":"Algorithms","acRate":"44.6%","frontendQuestionId":"1386","paidOnly":false,"topicTags":"Array;Hash Table;Greedy;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":44.64268976875594,"totalAccepted":66681,"totalSubmission":149358},{"questionId":"1488","title":"Sort Integers by The Power Value","titleSlug":"sort-integers-by-the-power-value","isPaidOnly":false,"difficulty":"Medium","likes":1515,"dislikes":121,"categoryTitle":"Algorithms","acRate":"71.8%","frontendQuestionId":"1387","paidOnly":false,"topicTags":"Dynamic Programming;Memoization;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":71.75755887830945,"totalAccepted":123672,"totalSubmission":172347},{"questionId":"1489","title":"Pizza With 3n Slices","titleSlug":"pizza-with-3n-slices","isPaidOnly":false,"difficulty":"Hard","likes":1144,"dislikes":24,"categoryTitle":"Algorithms","acRate":"54.0%","frontendQuestionId":"1388","paidOnly":false,"topicTags":"Array;Dynamic Programming;Greedy;Heap (Priority Queue);","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.9681210395556,"totalAccepted":38665,"totalSubmission":71645},{"questionId":"1505","title":"Create Target Array in the Given Order","titleSlug":"create-target-array-in-the-given-order","isPaidOnly":false,"difficulty":"Easy","likes":2308,"dislikes":1921,"categoryTitle":"Algorithms","acRate":"86.5%","frontendQuestionId":"1389","paidOnly":false,"topicTags":"Array;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":86.50119918358065,"totalAccepted":319550,"totalSubmission":369417},{"questionId":"1284","title":"Four Divisors","titleSlug":"four-divisors","isPaidOnly":false,"difficulty":"Medium","likes":896,"dislikes":223,"categoryTitle":"Algorithms","acRate":"56.6%","frontendQuestionId":"1390","paidOnly":false,"topicTags":"Array;Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":56.55607723640435,"totalAccepted":200079,"totalSubmission":353771},{"questionId":"1507","title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid","isPaidOnly":false,"difficulty":"Medium","likes":1071,"dislikes":349,"categoryTitle":"Algorithms","acRate":"64.5%","frontendQuestionId":"1391","paidOnly":false,"topicTags":"Array;Depth-First Search;Breadth-First Search;Union-Find;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.46603106074234,"totalAccepted":107510,"totalSubmission":166770},{"questionId":"1508","title":"Longest Happy Prefix","titleSlug":"longest-happy-prefix","isPaidOnly":false,"difficulty":"Hard","likes":1604,"dislikes":49,"categoryTitle":"Algorithms","acRate":"53.2%","frontendQuestionId":"1392","paidOnly":false,"topicTags":"String;Rolling Hash;String Matching;Hash Function;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.218639511365986,"totalAccepted":105510,"totalSubmission":198261},{"questionId":"1523","title":"Capital Gain/Loss","titleSlug":"capital-gainloss","isPaidOnly":false,"difficulty":"Medium","likes":934,"dislikes":51,"categoryTitle":"Database","acRate":"84.6%","frontendQuestionId":"1393","paidOnly":false,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":84.62343761465647,"totalAccepted":172980,"totalSubmission":204412},{"questionId":"1510","title":"Find Lucky Integer in an Array","titleSlug":"find-lucky-integer-in-an-array","isPaidOnly":false,"difficulty":"Easy","likes":1640,"dislikes":45,"categoryTitle":"Algorithms","acRate":"75.6%","frontendQuestionId":"1394","paidOnly":false,"topicTags":"Array;Hash Table;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.55764485178416,"totalAccepted":344763,"totalSubmission":456292},{"questionId":"1511","title":"Count Number of Teams","titleSlug":"count-number-of-teams","isPaidOnly":false,"difficulty":"Medium","likes":3465,"dislikes":237,"categoryTitle":"Algorithms","acRate":"70.2%","frontendQuestionId":"1395","paidOnly":false,"topicTags":"Array;Dynamic Programming;Binary Indexed Tree;Segment Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":70.16609302923409,"totalAccepted":245655,"totalSubmission":350105},{"questionId":"1512","title":"Design Underground System","titleSlug":"design-underground-system","isPaidOnly":false,"difficulty":"Medium","likes":3600,"dislikes":179,"categoryTitle":"Algorithms","acRate":"74.5%","frontendQuestionId":"1396","paidOnly":false,"topicTags":"Hash Table;String;Design;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":74.50164513390278,"totalAccepted":274660,"totalSubmission":368663},{"questionId":"1513","title":"Find All Good Strings","titleSlug":"find-all-good-strings","isPaidOnly":false,"difficulty":"Hard","likes":539,"dislikes":130,"categoryTitle":"Algorithms","acRate":"45.5%","frontendQuestionId":"1397","paidOnly":false,"topicTags":"String;Dynamic Programming;String Matching;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":45.53807601280802,"totalAccepted":9813,"totalSubmission":21549},{"questionId":"1536","title":"Customers Who Bought Products A and B but Not C","titleSlug":"customers-who-bought-products-a-and-b-but-not-c","isPaidOnly":true,"difficulty":"Medium","likes":327,"dislikes":18,"categoryTitle":"Database","acRate":"71.5%","frontendQuestionId":"1398","paidOnly":true,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":71.45969275034682,"totalAccepted":69541,"totalSubmission":97315},{"questionId":"1500","title":"Count Largest Group","titleSlug":"count-largest-group","isPaidOnly":false,"difficulty":"Easy","likes":811,"dislikes":1192,"categoryTitle":"Algorithms","acRate":"74.7%","frontendQuestionId":"1399","paidOnly":false,"topicTags":"Hash Table;Math;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":74.6802906231846,"totalAccepted":187688,"totalSubmission":251322},{"questionId":"1502","title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings","isPaidOnly":false,"difficulty":"Medium","likes":1797,"dislikes":160,"categoryTitle":"Algorithms","acRate":"68.5%","frontendQuestionId":"1400","paidOnly":false,"topicTags":"Hash Table;String;Greedy;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.53613397525496,"totalAccepted":211826,"totalSubmission":309072},{"questionId":"1928","title":"Number of Orders in the Backlog","titleSlug":"number-of-orders-in-the-backlog","isPaidOnly":false,"difficulty":"Medium","likes":347,"dislikes":246,"categoryTitle":"Algorithms","acRate":"54.0%","frontendQuestionId":"1801","paidOnly":false,"topicTags":"Array;Heap (Priority Queue);Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":54.01472253680634,"totalAccepted":38156,"totalSubmission":70640},{"questionId":"1929","title":"Maximum Value at a Given Index in a Bounded Array","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array","isPaidOnly":false,"difficulty":"Medium","likes":2734,"dislikes":479,"categoryTitle":"Algorithms","acRate":"38.9%","frontendQuestionId":"1802","paidOnly":false,"topicTags":"Math;Binary Search;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":38.850573714246,"totalAccepted":89455,"totalSubmission":230254},{"questionId":"1907","title":"Count Pairs With XOR in a Range","titleSlug":"count-pairs-with-xor-in-a-range","isPaidOnly":false,"difficulty":"Hard","likes":557,"dislikes":24,"categoryTitle":"Algorithms","acRate":"46.3%","frontendQuestionId":"1803","paidOnly":false,"topicTags":"Array;Bit Manipulation;Trie;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":46.25175756678754,"totalAccepted":12500,"totalSubmission":27026},{"questionId":"1949","title":"Implement Trie II (Prefix Tree)","titleSlug":"implement-trie-ii-prefix-tree","isPaidOnly":true,"difficulty":"Medium","likes":357,"dislikes":19,"categoryTitle":"Algorithms","acRate":"63.5%","frontendQuestionId":"1804","paidOnly":true,"topicTags":"Hash Table;String;Design;Trie;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":63.50957009259898,"totalAccepted":27640,"totalSubmission":43521},{"questionId":"1933","title":"Number of Different Integers in a String","titleSlug":"number-of-different-integers-in-a-string","isPaidOnly":false,"difficulty":"Easy","likes":668,"dislikes":106,"categoryTitle":"Algorithms","acRate":"40.4%","frontendQuestionId":"1805","paidOnly":false,"topicTags":"Hash Table;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.36564994122378,"totalAccepted":65243,"totalSubmission":161630},{"questionId":"1935","title":"Minimum Number of Operations to Reinitialize a Permutation","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation","isPaidOnly":false,"difficulty":"Medium","likes":328,"dislikes":177,"categoryTitle":"Algorithms","acRate":"72.6%","frontendQuestionId":"1806","paidOnly":false,"topicTags":"Array;Math;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":72.64371349523516,"totalAccepted":23631,"totalSubmission":32530},{"questionId":"1934","title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string","isPaidOnly":false,"difficulty":"Medium","likes":522,"dislikes":43,"categoryTitle":"Algorithms","acRate":"69.6%","frontendQuestionId":"1807","paidOnly":false,"topicTags":"Array;Hash Table;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":69.61550332190836,"totalAccepted":42856,"totalSubmission":61561},{"questionId":"1936","title":"Maximize Number of Nice Divisors","titleSlug":"maximize-number-of-nice-divisors","isPaidOnly":false,"difficulty":"Hard","likes":235,"dislikes":173,"categoryTitle":"Algorithms","acRate":"36.1%","frontendQuestionId":"1808","paidOnly":false,"topicTags":"Math;Recursion;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":36.10511529105423,"totalAccepted":10538,"totalSubmission":29187},{"questionId":"1958","title":"Ad-Free Sessions","titleSlug":"ad-free-sessions","isPaidOnly":true,"difficulty":"Easy","likes":99,"dislikes":61,"categoryTitle":"Database","acRate":"59.1%","frontendQuestionId":"1809","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":59.057625907846166,"totalAccepted":19841,"totalSubmission":33596},{"questionId":"1959","title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid","isPaidOnly":true,"difficulty":"Medium","likes":95,"dislikes":33,"categoryTitle":"Algorithms","acRate":"58.8%","frontendQuestionId":"1810","paidOnly":true,"topicTags":"Array;Depth-First Search;Breadth-First Search;Graph Theory;Heap (Priority Queue);Matrix;Interactive;Shortest Path;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":58.84514435695538,"totalAccepted":5605,"totalSubmission":9525},{"questionId":"1964","title":"Find Interview Candidates","titleSlug":"find-interview-candidates","isPaidOnly":true,"difficulty":"Medium","likes":212,"dislikes":30,"categoryTitle":"Database","acRate":"60.7%","frontendQuestionId":"1811","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":60.732245799092354,"totalAccepted":19806,"totalSubmission":32612},{"questionId":"1920","title":"Determine Color of a Chessboard Square","titleSlug":"determine-color-of-a-chessboard-square","isPaidOnly":false,"difficulty":"Easy","likes":905,"dislikes":24,"categoryTitle":"Algorithms","acRate":"79.9%","frontendQuestionId":"1812","paidOnly":false,"topicTags":"Math;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":79.88968494656407,"totalAccepted":120651,"totalSubmission":151022},{"questionId":"1923","title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii","isPaidOnly":false,"difficulty":"Medium","likes":1072,"dislikes":164,"categoryTitle":"Algorithms","acRate":"48.4%","frontendQuestionId":"1813","paidOnly":false,"topicTags":"Array;Two Pointers;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":48.389964906932605,"totalAccepted":133340,"totalSubmission":275553},{"questionId":"1925","title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array","isPaidOnly":false,"difficulty":"Medium","likes":2056,"dislikes":93,"categoryTitle":"Algorithms","acRate":"48.5%","frontendQuestionId":"1814","paidOnly":false,"topicTags":"Array;Hash Table;Math;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":48.45011066843736,"totalAccepted":136811,"totalSubmission":282375},{"questionId":"1924","title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts","isPaidOnly":false,"difficulty":"Hard","likes":359,"dislikes":34,"categoryTitle":"Algorithms","acRate":"41.4%","frontendQuestionId":"1815","paidOnly":false,"topicTags":"Array;Dynamic Programming;Bit Manipulation;Memoization;Bitmask;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":41.42864000768086,"totalAccepted":8630,"totalSubmission":20831},{"questionId":"1944","title":"Truncate Sentence","titleSlug":"truncate-sentence","isPaidOnly":false,"difficulty":"Easy","likes":1235,"dislikes":34,"categoryTitle":"Algorithms","acRate":"86.9%","frontendQuestionId":"1816","paidOnly":false,"topicTags":"Array;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":86.90017627472743,"totalAccepted":239586,"totalSubmission":275703},{"questionId":"1945","title":"Finding the Users Active Minutes","titleSlug":"finding-the-users-active-minutes","isPaidOnly":false,"difficulty":"Medium","likes":865,"dislikes":320,"categoryTitle":"Algorithms","acRate":"80.9%","frontendQuestionId":"1817","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":80.8777748848161,"totalAccepted":71445,"totalSubmission":88337},{"questionId":"1946","title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference","isPaidOnly":false,"difficulty":"Medium","likes":1106,"dislikes":80,"categoryTitle":"Algorithms","acRate":"32.5%","frontendQuestionId":"1818","paidOnly":false,"topicTags":"Array;Binary Search;Sorting;Ordered Set;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":32.5474876702964,"totalAccepted":33327,"totalSubmission":102395},{"questionId":"1947","title":"Number of Different Subsequences GCDs","titleSlug":"number-of-different-subsequences-gcds","isPaidOnly":false,"difficulty":"Hard","likes":437,"dislikes":48,"categoryTitle":"Algorithms","acRate":"46.0%","frontendQuestionId":"1819","paidOnly":false,"topicTags":"Array;Math;Counting;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":45.98446902208626,"totalAccepted":13677,"totalSubmission":29745},{"questionId":"1969","title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations","isPaidOnly":true,"difficulty":"Medium","likes":236,"dislikes":68,"categoryTitle":"Algorithms","acRate":"52.6%","frontendQuestionId":"1820","paidOnly":true,"topicTags":"Array;Depth-First Search;Graph Theory;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":52.61648408481828,"totalAccepted":11191,"totalSubmission":21269},{"questionId":"1974","title":"Find Customers With Positive Revenue this Year","titleSlug":"find-customers-with-positive-revenue-this-year","isPaidOnly":true,"difficulty":"Easy","likes":66,"dislikes":26,"categoryTitle":"Database","acRate":"87.7%","frontendQuestionId":"1821","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":87.69237933362825,"totalAccepted":37663,"totalSubmission":42949},{"questionId":"1950","title":"Sign of the Product of an Array","titleSlug":"sign-of-the-product-of-an-array","isPaidOnly":false,"difficulty":"Easy","likes":2301,"dislikes":232,"categoryTitle":"Algorithms","acRate":"64.8%","frontendQuestionId":"1822","paidOnly":false,"topicTags":"Array;Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.80024677698253,"totalAccepted":447443,"totalSubmission":690498},{"questionId":"1951","title":"Find the Winner of the Circular Game","titleSlug":"find-the-winner-of-the-circular-game","isPaidOnly":false,"difficulty":"Medium","likes":4119,"dislikes":130,"categoryTitle":"Algorithms","acRate":"82.3%","frontendQuestionId":"1823","paidOnly":false,"topicTags":"Array;Math;Recursion;Queue;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":82.26844302358808,"totalAccepted":382916,"totalSubmission":465447},{"questionId":"1952","title":"Minimum Sideway Jumps","titleSlug":"minimum-sideway-jumps","isPaidOnly":false,"difficulty":"Medium","likes":1289,"dislikes":51,"categoryTitle":"Algorithms","acRate":"51.7%","frontendQuestionId":"1824","paidOnly":false,"topicTags":"Array;Dynamic Programming;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":51.72184112869043,"totalAccepted":59790,"totalSubmission":115598},{"questionId":"1953","title":"Finding MK Average","titleSlug":"finding-mk-average","isPaidOnly":false,"difficulty":"Hard","likes":530,"dislikes":142,"categoryTitle":"Algorithms","acRate":"38.8%","frontendQuestionId":"1825","paidOnly":false,"topicTags":"Design;Queue;Heap (Priority Queue);Data Stream;Ordered Set;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":38.756335437426394,"totalAccepted":29286,"totalSubmission":75566},{"questionId":"1980","title":"Faulty Sensor","titleSlug":"faulty-sensor","isPaidOnly":true,"difficulty":"Easy","likes":72,"dislikes":85,"categoryTitle":"Algorithms","acRate":"50.5%","frontendQuestionId":"1826","paidOnly":true,"topicTags":"Array;Two Pointers;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.51347881899871,"totalAccepted":7083,"totalSubmission":14022},{"questionId":"1938","title":"Minimum Operations to Make the Array Increasing","titleSlug":"minimum-operations-to-make-the-array-increasing","isPaidOnly":false,"difficulty":"Easy","likes":1326,"dislikes":69,"categoryTitle":"Algorithms","acRate":"82.1%","frontendQuestionId":"1827","paidOnly":false,"topicTags":"Array;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":82.07583528504937,"totalAccepted":138425,"totalSubmission":168655},{"questionId":"1939","title":"Queries on Number of Points Inside a Circle","titleSlug":"queries-on-number-of-points-inside-a-circle","isPaidOnly":false,"difficulty":"Medium","likes":1200,"dislikes":90,"categoryTitle":"Algorithms","acRate":"86.8%","frontendQuestionId":"1828","paidOnly":false,"topicTags":"Array;Math;Geometry;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":86.8202369676716,"totalAccepted":97164,"totalSubmission":111914},{"questionId":"1940","title":"Maximum XOR for Each Query","titleSlug":"maximum-xor-for-each-query","isPaidOnly":false,"difficulty":"Medium","likes":1271,"dislikes":194,"categoryTitle":"Algorithms","acRate":"84.7%","frontendQuestionId":"1829","paidOnly":false,"topicTags":"Array;Bit Manipulation;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":84.6624378297129,"totalAccepted":145881,"totalSubmission":172309},{"questionId":"1941","title":"Minimum Number of Operations to Make String Sorted","titleSlug":"minimum-number-of-operations-to-make-string-sorted","isPaidOnly":false,"difficulty":"Hard","likes":190,"dislikes":132,"categoryTitle":"Algorithms","acRate":"50.3%","frontendQuestionId":"1830","paidOnly":false,"topicTags":"Hash Table;Math;String;Combinatorics;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.3351561121891,"totalAccepted":5707,"totalSubmission":11338},{"questionId":"1981","title":"Maximum Transaction Each Day","titleSlug":"maximum-transaction-each-day","isPaidOnly":true,"difficulty":"Medium","likes":96,"dislikes":3,"categoryTitle":"Database","acRate":"82.5%","frontendQuestionId":"1831","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":82.52278316215825,"totalAccepted":28524,"totalSubmission":34565},{"questionId":"1960","title":"Check if the Sentence Is Pangram","titleSlug":"check-if-the-sentence-is-pangram","isPaidOnly":false,"difficulty":"Easy","likes":3036,"dislikes":67,"categoryTitle":"Algorithms","acRate":"84.2%","frontendQuestionId":"1832","paidOnly":false,"topicTags":"Hash Table;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":84.21761081920553,"totalAccepted":557461,"totalSubmission":661930},{"questionId":"1961","title":"Maximum Ice Cream Bars","titleSlug":"maximum-ice-cream-bars","isPaidOnly":false,"difficulty":"Medium","likes":2268,"dislikes":679,"categoryTitle":"Algorithms","acRate":"74.4%","frontendQuestionId":"1833","paidOnly":false,"topicTags":"Array;Greedy;Sorting;Counting Sort;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":74.3605758361848,"totalAccepted":194063,"totalSubmission":260976},{"questionId":"1962","title":"Single-Threaded CPU","titleSlug":"single-threaded-cpu","isPaidOnly":false,"difficulty":"Medium","likes":3518,"dislikes":293,"categoryTitle":"Algorithms","acRate":"47.7%","frontendQuestionId":"1834","paidOnly":false,"topicTags":"Array;Sorting;Heap (Priority Queue);","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.72915541148928,"totalAccepted":159024,"totalSubmission":333180},{"questionId":"1963","title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and","isPaidOnly":false,"difficulty":"Hard","likes":630,"dislikes":51,"categoryTitle":"Algorithms","acRate":"62.6%","frontendQuestionId":"1835","paidOnly":false,"topicTags":"Array;Math;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":62.61193511812482,"totalAccepted":27059,"totalSubmission":43217},{"questionId":"1982","title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list","isPaidOnly":true,"difficulty":"Medium","likes":408,"dislikes":12,"categoryTitle":"Algorithms","acRate":"75.7%","frontendQuestionId":"1836","paidOnly":true,"topicTags":"Hash Table;Linked List;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.72764388252338,"totalAccepted":40250,"totalSubmission":53151},{"questionId":"1965","title":"Sum of Digits in Base K","titleSlug":"sum-of-digits-in-base-k","isPaidOnly":false,"difficulty":"Easy","likes":566,"dislikes":51,"categoryTitle":"Algorithms","acRate":"78.8%","frontendQuestionId":"1837","paidOnly":false,"topicTags":"Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":78.7627927692412,"totalAccepted":81347,"totalSubmission":103281},{"questionId":"1966","title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element","isPaidOnly":false,"difficulty":"Medium","likes":5811,"dislikes":315,"categoryTitle":"Algorithms","acRate":"44.9%","frontendQuestionId":"1838","paidOnly":false,"topicTags":"Array;Binary Search;Greedy;Sliding Window;Sorting;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":44.8991469051463,"totalAccepted":280047,"totalSubmission":623726},{"questionId":"1967","title":"Longest Substring Of All Vowels in Order","titleSlug":"longest-substring-of-all-vowels-in-order","isPaidOnly":false,"difficulty":"Medium","likes":858,"dislikes":31,"categoryTitle":"Algorithms","acRate":"52.0%","frontendQuestionId":"1839","paidOnly":false,"topicTags":"String;Sliding Window;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":51.96180782113184,"totalAccepted":47781,"totalSubmission":91955},{"questionId":"1968","title":"Maximum Building Height","titleSlug":"maximum-building-height","isPaidOnly":false,"difficulty":"Hard","likes":407,"dislikes":23,"categoryTitle":"Algorithms","acRate":"38.6%","frontendQuestionId":"1840","paidOnly":false,"topicTags":"Array;Math;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":38.62031078323654,"totalAccepted":9842,"totalSubmission":25484},{"questionId":"1991","title":"League Statistics","titleSlug":"league-statistics","isPaidOnly":true,"difficulty":"Medium","likes":114,"dislikes":98,"categoryTitle":"Database","acRate":"53.5%","frontendQuestionId":"1841","paidOnly":true,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.471125012091704,"totalAccepted":16583,"totalSubmission":31013},{"questionId":"1997","title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits","isPaidOnly":true,"difficulty":"Hard","likes":126,"dislikes":19,"categoryTitle":"Algorithms","acRate":"54.3%","frontendQuestionId":"1842","paidOnly":true,"topicTags":"Two Pointers;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":54.32637135643792,"totalAccepted":7101,"totalSubmission":13071},{"questionId":"1998","title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts","isPaidOnly":true,"difficulty":"Medium","likes":104,"dislikes":59,"categoryTitle":"Database","acRate":"44.1%","frontendQuestionId":"1843","paidOnly":true,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":44.107986631324195,"totalAccepted":15309,"totalSubmission":34708},{"questionId":"1954","title":"Replace All Digits with Characters","titleSlug":"replace-all-digits-with-characters","isPaidOnly":false,"difficulty":"Easy","likes":900,"dislikes":117,"categoryTitle":"Algorithms","acRate":"82.8%","frontendQuestionId":"1844","paidOnly":false,"topicTags":"String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":82.78506987440298,"totalAccepted":116996,"totalSubmission":141325},{"questionId":"1955","title":"Seat Reservation Manager","titleSlug":"seat-reservation-manager","isPaidOnly":false,"difficulty":"Medium","likes":1483,"dislikes":92,"categoryTitle":"Algorithms","acRate":"67.2%","frontendQuestionId":"1845","paidOnly":false,"topicTags":"Design;Heap (Priority Queue);","hasSolution":true,"hasVideoSolution":false,"acRateRaw":67.2477612472796,"totalAccepted":150791,"totalSubmission":224232},{"questionId":"1956","title":"Maximum Element After Decreasing and Rearranging","titleSlug":"maximum-element-after-decreasing-and-rearranging","isPaidOnly":false,"difficulty":"Medium","likes":1137,"dislikes":278,"categoryTitle":"Algorithms","acRate":"65.7%","frontendQuestionId":"1846","paidOnly":false,"topicTags":"Array;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.74296163987412,"totalAccepted":115941,"totalSubmission":176354},{"questionId":"1957","title":"Closest Room","titleSlug":"closest-room","isPaidOnly":false,"difficulty":"Hard","likes":538,"dislikes":21,"categoryTitle":"Algorithms","acRate":"41.4%","frontendQuestionId":"1847","paidOnly":false,"topicTags":"Array;Binary Search;Sorting;Ordered Set;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":41.374345549738216,"totalAccepted":12644,"totalSubmission":30560},{"questionId":"1975","title":"Minimum Distance to the Target Element","titleSlug":"minimum-distance-to-the-target-element","isPaidOnly":false,"difficulty":"Easy","likes":630,"dislikes":86,"categoryTitle":"Algorithms","acRate":"64.5%","frontendQuestionId":"1848","paidOnly":false,"topicTags":"Array;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.48472139005392,"totalAccepted":176505,"totalSubmission":273716},{"questionId":"1976","title":"Splitting a String Into Descending Consecutive Values","titleSlug":"splitting-a-string-into-descending-consecutive-values","isPaidOnly":false,"difficulty":"Medium","likes":557,"dislikes":128,"categoryTitle":"Algorithms","acRate":"37.7%","frontendQuestionId":"1849","paidOnly":false,"topicTags":"String;Backtracking;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.66751177109743,"totalAccepted":35360,"totalSubmission":93874},{"questionId":"1978","title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number","isPaidOnly":false,"difficulty":"Medium","likes":813,"dislikes":122,"categoryTitle":"Algorithms","acRate":"71.9%","frontendQuestionId":"1850","paidOnly":false,"topicTags":"Two Pointers;String;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":71.85910670225087,"totalAccepted":28541,"totalSubmission":39718},{"questionId":"1977","title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query","isPaidOnly":false,"difficulty":"Hard","likes":1165,"dislikes":49,"categoryTitle":"Algorithms","acRate":"54.5%","frontendQuestionId":"1851","paidOnly":false,"topicTags":"Array;Binary Search;Sweep Line;Sorting;Heap (Priority Queue);","hasSolution":false,"hasVideoSolution":false,"acRateRaw":54.50418917226083,"totalAccepted":73964,"totalSubmission":135705},{"questionId":"2003","title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray","isPaidOnly":true,"difficulty":"Medium","likes":157,"dislikes":10,"categoryTitle":"Algorithms","acRate":"77.3%","frontendQuestionId":"1852","paidOnly":true,"topicTags":"Array;Hash Table;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":77.33339406914772,"totalAccepted":16977,"totalSubmission":21953},{"questionId":"2004","title":"Convert Date Format","titleSlug":"convert-date-format","isPaidOnly":true,"difficulty":"Easy","likes":69,"dislikes":42,"categoryTitle":"Database","acRate":"84.9%","frontendQuestionId":"1853","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":84.90645144384466,"totalAccepted":16201,"totalSubmission":19081},{"questionId":"1983","title":"Maximum Population Year","titleSlug":"maximum-population-year","isPaidOnly":false,"difficulty":"Easy","likes":1566,"dislikes":292,"categoryTitle":"Algorithms","acRate":"64.2%","frontendQuestionId":"1854","paidOnly":false,"topicTags":"Array;Counting;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.1662494274057,"totalAccepted":120465,"totalSubmission":187738},{"questionId":"1984","title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values","isPaidOnly":false,"difficulty":"Medium","likes":1597,"dislikes":37,"categoryTitle":"Algorithms","acRate":"61.4%","frontendQuestionId":"1855","paidOnly":false,"topicTags":"Array;Two Pointers;Binary Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.35542257902065,"totalAccepted":165693,"totalSubmission":270054},{"questionId":"1985","title":"Maximum Subarray Min-Product","titleSlug":"maximum-subarray-min-product","isPaidOnly":false,"difficulty":"Medium","likes":1578,"dislikes":146,"categoryTitle":"Algorithms","acRate":"40.5%","frontendQuestionId":"1856","paidOnly":false,"topicTags":"Array;Stack;Monotonic Stack;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.460516748267,"totalAccepted":41733,"totalSubmission":103145},{"questionId":"1986","title":"Largest Color Value in a Directed Graph","titleSlug":"largest-color-value-in-a-directed-graph","isPaidOnly":false,"difficulty":"Hard","likes":2639,"dislikes":87,"categoryTitle":"Algorithms","acRate":"57.2%","frontendQuestionId":"1857","paidOnly":false,"topicTags":"Hash Table;String;Dynamic Programming;Graph Theory;Topological Sort;Memoization;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":57.23445681556114,"totalAccepted":151388,"totalSubmission":264505},{"questionId":"2009","title":"Longest Word With All Prefixes","titleSlug":"longest-word-with-all-prefixes","isPaidOnly":true,"difficulty":"Medium","likes":205,"dislikes":7,"categoryTitle":"Algorithms","acRate":"72.1%","frontendQuestionId":"1858","paidOnly":true,"topicTags":"Array;String;Depth-First Search;Trie;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.10334286559511,"totalAccepted":14624,"totalSubmission":20282},{"questionId":"1970","title":"Sorting the Sentence","titleSlug":"sorting-the-sentence","isPaidOnly":false,"difficulty":"Easy","likes":2402,"dislikes":84,"categoryTitle":"Algorithms","acRate":"84.1%","frontendQuestionId":"1859","paidOnly":false,"topicTags":"String;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":84.11344885066326,"totalAccepted":240191,"totalSubmission":285556},{"questionId":"1971","title":"Incremental Memory Leak","titleSlug":"incremental-memory-leak","isPaidOnly":false,"difficulty":"Medium","likes":236,"dislikes":93,"categoryTitle":"Algorithms","acRate":"72.8%","frontendQuestionId":"1860","paidOnly":false,"topicTags":"Math;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":72.82265956290095,"totalAccepted":26789,"totalSubmission":36787},{"questionId":"1972","title":"Rotating the Box","titleSlug":"rotating-the-box","isPaidOnly":false,"difficulty":"Medium","likes":1852,"dislikes":88,"categoryTitle":"Algorithms","acRate":"82.5%","frontendQuestionId":"1861","paidOnly":false,"topicTags":"Array;Two Pointers;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":82.48616826174735,"totalAccepted":267614,"totalSubmission":324435},{"questionId":"1326","title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs","isPaidOnly":false,"difficulty":"Hard","likes":467,"dislikes":39,"categoryTitle":"Algorithms","acRate":"31.0%","frontendQuestionId":"1862","paidOnly":false,"topicTags":"Array;Math;Binary Search;Counting;Enumeration;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":31.00952003173344,"totalAccepted":12508,"totalSubmission":40336},{"questionId":"1993","title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals","isPaidOnly":false,"difficulty":"Easy","likes":2717,"dislikes":358,"categoryTitle":"Algorithms","acRate":"90.1%","frontendQuestionId":"1863","paidOnly":false,"topicTags":"Array;Math;Backtracking;Bit Manipulation;Combinatorics;Enumeration;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":90.08740088018642,"totalAccepted":364572,"totalSubmission":404687},{"questionId":"1994","title":"Minimum Number of Swaps to Make the Binary String Alternating","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating","isPaidOnly":false,"difficulty":"Medium","likes":628,"dislikes":38,"categoryTitle":"Algorithms","acRate":"44.0%","frontendQuestionId":"1864","paidOnly":false,"topicTags":"String;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":43.9719648716464,"totalAccepted":36451,"totalSubmission":82896},{"questionId":"1995","title":"Finding Pairs With a Certain Sum","titleSlug":"finding-pairs-with-a-certain-sum","isPaidOnly":false,"difficulty":"Medium","likes":1045,"dislikes":146,"categoryTitle":"Algorithms","acRate":"61.6%","frontendQuestionId":"1865","paidOnly":false,"topicTags":"Array;Hash Table;Design;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.55873065394004,"totalAccepted":146013,"totalSubmission":237193},{"questionId":"1996","title":"Number of Ways to Rearrange Sticks With K Sticks Visible","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible","isPaidOnly":false,"difficulty":"Hard","likes":771,"dislikes":24,"categoryTitle":"Algorithms","acRate":"61.6%","frontendQuestionId":"1866","paidOnly":false,"topicTags":"Math;Dynamic Programming;Combinatorics;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":61.5642713708345,"totalAccepted":24220,"totalSubmission":39341},{"questionId":"2014","title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average","isPaidOnly":true,"difficulty":"Medium","likes":79,"dislikes":283,"categoryTitle":"Database","acRate":"70.6%","frontendQuestionId":"1867","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":70.60737139384406,"totalAccepted":19751,"totalSubmission":27973},{"questionId":"2019","title":"Product of Two Run-Length Encoded Arrays","titleSlug":"product-of-two-run-length-encoded-arrays","isPaidOnly":true,"difficulty":"Medium","likes":416,"dislikes":84,"categoryTitle":"Algorithms","acRate":"59.6%","frontendQuestionId":"1868","paidOnly":true,"topicTags":"Array;Two Pointers;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":59.63131924401824,"totalAccepted":64050,"totalSubmission":107410},{"questionId":"1999","title":"Longer Contiguous Segments of Ones than Zeros","titleSlug":"longer-contiguous-segments-of-ones-than-zeros","isPaidOnly":false,"difficulty":"Easy","likes":580,"dislikes":14,"categoryTitle":"Algorithms","acRate":"62.6%","frontendQuestionId":"1869","paidOnly":false,"topicTags":"String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":62.57276387025126,"totalAccepted":67613,"totalSubmission":108055},{"questionId":"2000","title":"Minimum Speed to Arrive on Time","titleSlug":"minimum-speed-to-arrive-on-time","isPaidOnly":false,"difficulty":"Medium","likes":2468,"dislikes":293,"categoryTitle":"Algorithms","acRate":"47.9%","frontendQuestionId":"1870","paidOnly":false,"topicTags":"Array;Binary Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.91312455437942,"totalAccepted":131039,"totalSubmission":273494},{"questionId":"2001","title":"Jump Game VII","titleSlug":"jump-game-vii","isPaidOnly":false,"difficulty":"Medium","likes":2083,"dislikes":131,"categoryTitle":"Algorithms","acRate":"35.6%","frontendQuestionId":"1871","paidOnly":false,"topicTags":"String;Dynamic Programming;Sliding Window;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":35.56707787762711,"totalAccepted":146520,"totalSubmission":411950},{"questionId":"2002","title":"Stone Game VIII","titleSlug":"stone-game-viii","isPaidOnly":false,"difficulty":"Hard","likes":480,"dislikes":25,"categoryTitle":"Algorithms","acRate":"54.0%","frontendQuestionId":"1872","paidOnly":false,"topicTags":"Array;Math;Dynamic Programming;Prefix Sum;Game Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.99595141700405,"totalAccepted":13337,"totalSubmission":24700},{"questionId":"2024","title":"Calculate Special Bonus","titleSlug":"calculate-special-bonus","isPaidOnly":false,"difficulty":"Easy","likes":1196,"dislikes":83,"categoryTitle":"Database","acRate":"57.0%","frontendQuestionId":"1873","paidOnly":false,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":57.02487908811783,"totalAccepted":351948,"totalSubmission":617183},{"questionId":"2029","title":"Minimize Product Sum of Two Arrays","titleSlug":"minimize-product-sum-of-two-arrays","isPaidOnly":true,"difficulty":"Medium","likes":257,"dislikes":28,"categoryTitle":"Algorithms","acRate":"89.9%","frontendQuestionId":"1874","paidOnly":true,"topicTags":"Array;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":89.85975888369478,"totalAccepted":25566,"totalSubmission":28451},{"questionId":"2030","title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary","isPaidOnly":true,"difficulty":"Medium","likes":78,"dislikes":6,"categoryTitle":"Database","acRate":"65.3%","frontendQuestionId":"1875","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":65.33266213608525,"totalAccepted":15574,"totalSubmission":23838},{"questionId":"1987","title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters","isPaidOnly":false,"difficulty":"Easy","likes":1715,"dislikes":58,"categoryTitle":"Algorithms","acRate":"76.8%","frontendQuestionId":"1876","paidOnly":false,"topicTags":"Hash Table;String;Sliding Window;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":76.78626951060258,"totalAccepted":222262,"totalSubmission":289456},{"questionId":"1988","title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array","isPaidOnly":false,"difficulty":"Medium","likes":2383,"dislikes":550,"categoryTitle":"Algorithms","acRate":"83.3%","frontendQuestionId":"1877","paidOnly":false,"topicTags":"Array;Two Pointers;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":83.2881537030808,"totalAccepted":336744,"totalSubmission":404312},{"questionId":"1990","title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid","isPaidOnly":false,"difficulty":"Medium","likes":478,"dislikes":602,"categoryTitle":"Algorithms","acRate":"71.3%","frontendQuestionId":"1878","paidOnly":false,"topicTags":"Array;Math;Sorting;Heap (Priority Queue);Matrix;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":71.33122219104501,"totalAccepted":88975,"totalSubmission":124735},{"questionId":"1989","title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays","isPaidOnly":false,"difficulty":"Hard","likes":724,"dislikes":13,"categoryTitle":"Algorithms","acRate":"51.3%","frontendQuestionId":"1879","paidOnly":false,"topicTags":"Array;Dynamic Programming;Bit Manipulation;Bitmask;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":51.30053274835474,"totalAccepted":21279,"totalSubmission":41479},{"questionId":"2010","title":"Check if Word Equals Summation of Two Words","titleSlug":"check-if-word-equals-summation-of-two-words","isPaidOnly":false,"difficulty":"Easy","likes":612,"dislikes":42,"categoryTitle":"Algorithms","acRate":"75.3%","frontendQuestionId":"1880","paidOnly":false,"topicTags":"String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":75.34152456924627,"totalAccepted":84436,"totalSubmission":112071},{"questionId":"2011","title":"Maximum Value after Insertion","titleSlug":"maximum-value-after-insertion","isPaidOnly":false,"difficulty":"Medium","likes":401,"dislikes":67,"categoryTitle":"Algorithms","acRate":"39.5%","frontendQuestionId":"1881","paidOnly":false,"topicTags":"String;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":39.46680426556588,"totalAccepted":34419,"totalSubmission":87210},{"questionId":"2012","title":"Process Tasks Using Servers","titleSlug":"process-tasks-using-servers","isPaidOnly":false,"difficulty":"Medium","likes":1044,"dislikes":290,"categoryTitle":"Algorithms","acRate":"42.0%","frontendQuestionId":"1882","paidOnly":false,"topicTags":"Array;Heap (Priority Queue);","hasSolution":false,"hasVideoSolution":false,"acRateRaw":41.987050485606794,"totalAccepted":47987,"totalSubmission":114290},{"questionId":"2013","title":"Minimum Skips to Arrive at Meeting On Time","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time","isPaidOnly":false,"difficulty":"Hard","likes":355,"dislikes":54,"categoryTitle":"Algorithms","acRate":"38.7%","frontendQuestionId":"1883","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":38.667543282927895,"totalAccepted":8822,"totalSubmission":22815},{"questionId":"2031","title":"Egg Drop With 2 Eggs and N Floors","titleSlug":"egg-drop-with-2-eggs-and-n-floors","isPaidOnly":false,"difficulty":"Medium","likes":1550,"dislikes":164,"categoryTitle":"Algorithms","acRate":"74.8%","frontendQuestionId":"1884","paidOnly":false,"topicTags":"Math;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":74.76326401159893,"totalAccepted":66004,"totalSubmission":88284},{"questionId":"2036","title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays","isPaidOnly":true,"difficulty":"Medium","likes":246,"dislikes":23,"categoryTitle":"Algorithms","acRate":"60.3%","frontendQuestionId":"1885","paidOnly":true,"topicTags":"Array;Two Pointers;Binary Search;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.33588540380342,"totalAccepted":12215,"totalSubmission":20245},{"questionId":"2015","title":"Determine Whether Matrix Can Be Obtained By Rotation","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation","isPaidOnly":false,"difficulty":"Easy","likes":1857,"dislikes":174,"categoryTitle":"Algorithms","acRate":"68.3%","frontendQuestionId":"1886","paidOnly":false,"topicTags":"Array;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.33556836338735,"totalAccepted":191602,"totalSubmission":280384},{"questionId":"2016","title":"Reduction Operations to Make the Array Elements Equal","titleSlug":"reduction-operations-to-make-the-array-elements-equal","isPaidOnly":false,"difficulty":"Medium","likes":1284,"dislikes":52,"categoryTitle":"Algorithms","acRate":"72.5%","frontendQuestionId":"1887","paidOnly":false,"topicTags":"Array;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.54290978440055,"totalAccepted":112213,"totalSubmission":154685},{"questionId":"2017","title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating","isPaidOnly":false,"difficulty":"Medium","likes":1822,"dislikes":122,"categoryTitle":"Algorithms","acRate":"53.5%","frontendQuestionId":"1888","paidOnly":false,"topicTags":"String;Dynamic Programming;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.53377144176867,"totalAccepted":127488,"totalSubmission":238145},{"questionId":"2018","title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging","isPaidOnly":false,"difficulty":"Hard","likes":426,"dislikes":39,"categoryTitle":"Algorithms","acRate":"33.6%","frontendQuestionId":"1889","paidOnly":false,"topicTags":"Array;Binary Search;Sorting;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":33.60782579860727,"totalAccepted":18243,"totalSubmission":54282},{"questionId":"2041","title":"The Latest Login in 2020","titleSlug":"the-latest-login-in-2020","isPaidOnly":false,"difficulty":"Easy","likes":472,"dislikes":20,"categoryTitle":"Database","acRate":"77.0%","frontendQuestionId":"1890","paidOnly":false,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":76.96242841367267,"totalAccepted":149842,"totalSubmission":194695},{"questionId":"2045","title":"Cutting Ribbons","titleSlug":"cutting-ribbons","isPaidOnly":true,"difficulty":"Medium","likes":630,"dislikes":70,"categoryTitle":"Algorithms","acRate":"53.1%","frontendQuestionId":"1891","paidOnly":true,"topicTags":"Array;Binary Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.05810766760434,"totalAccepted":87895,"totalSubmission":165658},{"questionId":"2046","title":"Page Recommendations II","titleSlug":"page-recommendations-ii","isPaidOnly":true,"difficulty":"Hard","likes":93,"dislikes":24,"categoryTitle":"Database","acRate":"45.8%","frontendQuestionId":"1892","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":45.82351176445378,"totalAccepted":10692,"totalSubmission":23333},{"questionId":"2005","title":"Check if All the Integers in a Range Are Covered","titleSlug":"check-if-all-the-integers-in-a-range-are-covered","isPaidOnly":false,"difficulty":"Easy","likes":679,"dislikes":127,"categoryTitle":"Algorithms","acRate":"51.1%","frontendQuestionId":"1893","paidOnly":false,"topicTags":"Array;Hash Table;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":51.11893331772145,"totalAccepted":69853,"totalSubmission":136648},{"questionId":"2006","title":"Find the Student that Will Replace the Chalk","titleSlug":"find-the-student-that-will-replace-the-chalk","isPaidOnly":false,"difficulty":"Medium","likes":1217,"dislikes":135,"categoryTitle":"Algorithms","acRate":"53.2%","frontendQuestionId":"1894","paidOnly":false,"topicTags":"Array;Binary Search;Simulation;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.18209393575667,"totalAccepted":204257,"totalSubmission":384071},{"questionId":"1311","title":"Largest Magic Square","titleSlug":"largest-magic-square","isPaidOnly":false,"difficulty":"Medium","likes":610,"dislikes":335,"categoryTitle":"Algorithms","acRate":"75.3%","frontendQuestionId":"1895","paidOnly":false,"topicTags":"Array;Matrix;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.26914125939692,"totalAccepted":89911,"totalSubmission":119453},{"questionId":"2008","title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression","isPaidOnly":false,"difficulty":"Hard","likes":249,"dislikes":43,"categoryTitle":"Algorithms","acRate":"49.8%","frontendQuestionId":"1896","paidOnly":false,"topicTags":"Math;String;Dynamic Programming;Stack;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":49.78086194302411,"totalAccepted":5452,"totalSubmission":10952},{"questionId":"2025","title":"Redistribute Characters to Make All Strings Equal","titleSlug":"redistribute-characters-to-make-all-strings-equal","isPaidOnly":false,"difficulty":"Easy","likes":1174,"dislikes":85,"categoryTitle":"Algorithms","acRate":"66.9%","frontendQuestionId":"1897","paidOnly":false,"topicTags":"Hash Table;String;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":66.88071674132722,"totalAccepted":160497,"totalSubmission":239975},{"questionId":"2027","title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters","isPaidOnly":false,"difficulty":"Medium","likes":1055,"dislikes":137,"categoryTitle":"Algorithms","acRate":"47.3%","frontendQuestionId":"1898","paidOnly":false,"topicTags":"Array;Two Pointers;String;Binary Search;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":47.260495504237014,"totalAccepted":43835,"totalSubmission":92753},{"questionId":"2026","title":"Merge Triplets to Form Target Triplet","titleSlug":"merge-triplets-to-form-target-triplet","isPaidOnly":false,"difficulty":"Medium","likes":951,"dislikes":82,"categoryTitle":"Algorithms","acRate":"69.1%","frontendQuestionId":"1899","paidOnly":false,"topicTags":"Array;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":69.10707636059988,"totalAccepted":122484,"totalSubmission":177239},{"questionId":"2028","title":"The Earliest and Latest Rounds Where Players Compete","titleSlug":"the-earliest-and-latest-rounds-where-players-compete","isPaidOnly":false,"difficulty":"Hard","likes":521,"dislikes":79,"categoryTitle":"Algorithms","acRate":"72.2%","frontendQuestionId":"1900","paidOnly":false,"topicTags":"Dynamic Programming;Memoization;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.24528018312773,"totalAccepted":62490,"totalSubmission":86497},{"questionId":"1312","title":"Count Artifacts That Can Be Extracted","titleSlug":"count-artifacts-that-can-be-extracted","isPaidOnly":false,"difficulty":"Medium","likes":225,"dislikes":204,"categoryTitle":"Algorithms","acRate":"57.3%","frontendQuestionId":"2201","paidOnly":false,"topicTags":"Array;Hash Table;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":57.25798621225362,"totalAccepted":23588,"totalSubmission":41196},{"questionId":"1346","title":"Maximize the Topmost Element After K Moves","titleSlug":"maximize-the-topmost-element-after-k-moves","isPaidOnly":false,"difficulty":"Medium","likes":653,"dislikes":337,"categoryTitle":"Algorithms","acRate":"24.1%","frontendQuestionId":"2202","paidOnly":false,"topicTags":"Array;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":24.107324595219737,"totalAccepted":39084,"totalSubmission":162125},{"questionId":"2321","title":"Minimum Weighted Subgraph With the Required Paths","titleSlug":"minimum-weighted-subgraph-with-the-required-paths","isPaidOnly":false,"difficulty":"Hard","likes":796,"dislikes":23,"categoryTitle":"Algorithms","acRate":"42.3%","frontendQuestionId":"2203","paidOnly":false,"topicTags":"Graph Theory;Heap (Priority Queue);Shortest Path;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":42.34815746768047,"totalAccepted":23225,"totalSubmission":54843},{"questionId":"1347","title":"Distance to a Cycle in Undirected Graph","titleSlug":"distance-to-a-cycle-in-undirected-graph","isPaidOnly":true,"difficulty":"Hard","likes":154,"dislikes":11,"categoryTitle":"Algorithms","acRate":"73.7%","frontendQuestionId":"2204","paidOnly":true,"topicTags":"Depth-First Search;Breadth-First Search;Graph Theory;Topological Sort;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":73.73957919809449,"totalAccepted":7430,"totalSubmission":10076},{"questionId":"2336","title":"The Number of Users That Are Eligible for Discount","titleSlug":"the-number-of-users-that-are-eligible-for-discount","isPaidOnly":true,"difficulty":"Easy","likes":32,"dislikes":77,"categoryTitle":"Database","acRate":"50.6%","frontendQuestionId":"2205","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.6040973559797,"totalAccepted":8670,"totalSubmission":17133},{"questionId":"2308","title":"Divide Array Into Equal Pairs","titleSlug":"divide-array-into-equal-pairs","isPaidOnly":false,"difficulty":"Easy","likes":1203,"dislikes":50,"categoryTitle":"Algorithms","acRate":"79.2%","frontendQuestionId":"2206","paidOnly":false,"topicTags":"Array;Hash Table;Bit Manipulation;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":79.24930117662355,"totalAccepted":304773,"totalSubmission":384575},{"questionId":"2309","title":"Maximize Number of Subsequences in a String","titleSlug":"maximize-number-of-subsequences-in-a-string","isPaidOnly":false,"difficulty":"Medium","likes":534,"dislikes":37,"categoryTitle":"Algorithms","acRate":"36.1%","frontendQuestionId":"2207","paidOnly":false,"topicTags":"String;Greedy;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":36.11063292591955,"totalAccepted":25172,"totalSubmission":69708},{"questionId":"2310","title":"Minimum Operations to Halve Array Sum","titleSlug":"minimum-operations-to-halve-array-sum","isPaidOnly":false,"difficulty":"Medium","likes":679,"dislikes":32,"categoryTitle":"Algorithms","acRate":"50.2%","frontendQuestionId":"2208","paidOnly":false,"topicTags":"Array;Greedy;Heap (Priority Queue);","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.20555829633284,"totalAccepted":54954,"totalSubmission":109458},{"questionId":"2311","title":"Minimum White Tiles After Covering With Carpets","titleSlug":"minimum-white-tiles-after-covering-with-carpets","isPaidOnly":false,"difficulty":"Hard","likes":524,"dislikes":17,"categoryTitle":"Algorithms","acRate":"38.9%","frontendQuestionId":"2209","paidOnly":false,"topicTags":"String;Dynamic Programming;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":38.92712359762421,"totalAccepted":16516,"totalSubmission":42428},{"questionId":"2316","title":"Count Hills and Valleys in an Array","titleSlug":"count-hills-and-valleys-in-an-array","isPaidOnly":false,"difficulty":"Easy","likes":1159,"dislikes":143,"categoryTitle":"Algorithms","acRate":"68.9%","frontendQuestionId":"2210","paidOnly":false,"topicTags":"Array;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.9082135770549,"totalAccepted":183362,"totalSubmission":266096},{"questionId":"2317","title":"Count Collisions on a Road","titleSlug":"count-collisions-on-a-road","isPaidOnly":false,"difficulty":"Medium","likes":1120,"dislikes":277,"categoryTitle":"Algorithms","acRate":"58.1%","frontendQuestionId":"2211","paidOnly":false,"topicTags":"String;Stack;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.10295412983506,"totalAccepted":129949,"totalSubmission":223653},{"questionId":"2318","title":"Maximum Points in an Archery Competition","titleSlug":"maximum-points-in-an-archery-competition","isPaidOnly":false,"difficulty":"Medium","likes":517,"dislikes":56,"categoryTitle":"Algorithms","acRate":"51.6%","frontendQuestionId":"2212","paidOnly":false,"topicTags":"Array;Backtracking;Bit Manipulation;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":51.56703200800842,"totalAccepted":20090,"totalSubmission":38959},{"questionId":"2319","title":"Longest Substring of One Repeating Character","titleSlug":"longest-substring-of-one-repeating-character","isPaidOnly":false,"difficulty":"Hard","likes":325,"dislikes":84,"categoryTitle":"Algorithms","acRate":"34.5%","frontendQuestionId":"2213","paidOnly":false,"topicTags":"Array;String;Segment Tree;Ordered Set;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":34.54536360908273,"totalAccepted":6907,"totalSubmission":19994},{"questionId":"2354","title":"Minimum Health to Beat Game","titleSlug":"minimum-health-to-beat-game","isPaidOnly":true,"difficulty":"Medium","likes":327,"dislikes":240,"categoryTitle":"Algorithms","acRate":"58.9%","frontendQuestionId":"2214","paidOnly":true,"topicTags":"Array;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.854662397969484,"totalAccepted":40811,"totalSubmission":69342},{"questionId":"1392","title":"Find the Difference of Two Arrays","titleSlug":"find-the-difference-of-two-arrays","isPaidOnly":false,"difficulty":"Easy","likes":2636,"dislikes":129,"categoryTitle":"Algorithms","acRate":"81.5%","frontendQuestionId":"2215","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":81.47214566624345,"totalAccepted":657743,"totalSubmission":807323},{"questionId":"1355","title":"Minimum Deletions to Make Array Beautiful","titleSlug":"minimum-deletions-to-make-array-beautiful","isPaidOnly":false,"difficulty":"Medium","likes":837,"dislikes":96,"categoryTitle":"Algorithms","acRate":"50.0%","frontendQuestionId":"2216","paidOnly":false,"topicTags":"Array;Stack;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.02377729816732,"totalAccepted":41025,"totalSubmission":82011},{"questionId":"1375","title":"Find Palindrome With Fixed Length","titleSlug":"find-palindrome-with-fixed-length","isPaidOnly":false,"difficulty":"Medium","likes":666,"dislikes":297,"categoryTitle":"Algorithms","acRate":"38.1%","frontendQuestionId":"2217","paidOnly":false,"topicTags":"Array;Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":38.07713640237551,"totalAccepted":28147,"totalSubmission":73921},{"questionId":"1393","title":"Maximum Value of K Coins From Piles","titleSlug":"maximum-value-of-k-coins-from-piles","isPaidOnly":false,"difficulty":"Hard","likes":2458,"dislikes":38,"categoryTitle":"Algorithms","acRate":"60.4%","frontendQuestionId":"2218","paidOnly":false,"topicTags":"Array;Dynamic Programming;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.44390502699913,"totalAccepted":83168,"totalSubmission":137593},{"questionId":"2369","title":"Maximum Sum Score of Array","titleSlug":"maximum-sum-score-of-array","isPaidOnly":true,"difficulty":"Medium","likes":73,"dislikes":19,"categoryTitle":"Algorithms","acRate":"62.7%","frontendQuestionId":"2219","paidOnly":true,"topicTags":"Array;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":62.693203472369255,"totalAccepted":5922,"totalSubmission":9446},{"questionId":"2323","title":"Minimum Bit Flips to Convert Number","titleSlug":"minimum-bit-flips-to-convert-number","isPaidOnly":false,"difficulty":"Easy","likes":1625,"dislikes":39,"categoryTitle":"Algorithms","acRate":"87.9%","frontendQuestionId":"2220","paidOnly":false,"topicTags":"Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":87.90359752285246,"totalAccepted":385234,"totalSubmission":438246},{"questionId":"2324","title":"Find Triangular Sum of an Array","titleSlug":"find-triangular-sum-of-an-array","isPaidOnly":false,"difficulty":"Medium","likes":1548,"dislikes":77,"categoryTitle":"Algorithms","acRate":"82.0%","frontendQuestionId":"2221","paidOnly":false,"topicTags":"Array;Math;Simulation;Combinatorics;Number Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":81.98924549359126,"totalAccepted":242434,"totalSubmission":295690},{"questionId":"2325","title":"Number of Ways to Select Buildings","titleSlug":"number-of-ways-to-select-buildings","isPaidOnly":false,"difficulty":"Medium","likes":1063,"dislikes":54,"categoryTitle":"Algorithms","acRate":"50.9%","frontendQuestionId":"2222","paidOnly":false,"topicTags":"String;Dynamic Programming;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.926455289277115,"totalAccepted":54337,"totalSubmission":106697},{"questionId":"2326","title":"Sum of Scores of Built Strings","titleSlug":"sum-of-scores-of-built-strings","isPaidOnly":false,"difficulty":"Hard","likes":303,"dislikes":190,"categoryTitle":"Algorithms","acRate":"49.2%","frontendQuestionId":"2223","paidOnly":false,"topicTags":"String;Binary Search;Rolling Hash;Suffix Array;String Matching;Hash Function;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":49.17793095216781,"totalAccepted":16481,"totalSubmission":33513},{"questionId":"2345","title":"Minimum Number of Operations to Convert Time","titleSlug":"minimum-number-of-operations-to-convert-time","isPaidOnly":false,"difficulty":"Easy","likes":502,"dislikes":39,"categoryTitle":"Algorithms","acRate":"66.5%","frontendQuestionId":"2224","paidOnly":false,"topicTags":"String;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":66.47265500230685,"totalAccepted":56190,"totalSubmission":84531},{"questionId":"1354","title":"Find Players With Zero or One Losses","titleSlug":"find-players-with-zero-or-one-losses","isPaidOnly":false,"difficulty":"Medium","likes":2281,"dislikes":160,"categoryTitle":"Algorithms","acRate":"72.4%","frontendQuestionId":"2225","paidOnly":false,"topicTags":"Array;Hash Table;Sorting;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.42734732737907,"totalAccepted":319506,"totalSubmission":441140},{"questionId":"1335","title":"Maximum Candies Allocated to K Children","titleSlug":"maximum-candies-allocated-to-k-children","isPaidOnly":false,"difficulty":"Medium","likes":1848,"dislikes":86,"categoryTitle":"Algorithms","acRate":"49.9%","frontendQuestionId":"2226","paidOnly":false,"topicTags":"Array;Binary Search;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.87368931854079,"totalAccepted":209665,"totalSubmission":420392},{"questionId":"1433","title":"Encrypt and Decrypt Strings","titleSlug":"encrypt-and-decrypt-strings","isPaidOnly":false,"difficulty":"Hard","likes":354,"dislikes":80,"categoryTitle":"Algorithms","acRate":"38.5%","frontendQuestionId":"2227","paidOnly":false,"topicTags":"Array;Hash Table;String;Design;Trie;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":38.495794161306286,"totalAccepted":17894,"totalSubmission":46483},{"questionId":"2370","title":"Users With Two Purchases Within Seven Days","titleSlug":"users-with-two-purchases-within-seven-days","isPaidOnly":true,"difficulty":"Medium","likes":68,"dislikes":11,"categoryTitle":"Database","acRate":"47.0%","frontendQuestionId":"2228","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":46.98575498575499,"totalAccepted":12369,"totalSubmission":26325},{"questionId":"1416","title":"Check if an Array Is Consecutive","titleSlug":"check-if-an-array-is-consecutive","isPaidOnly":true,"difficulty":"Easy","likes":90,"dislikes":11,"categoryTitle":"Algorithms","acRate":"62.2%","frontendQuestionId":"2229","paidOnly":true,"topicTags":"Array;Hash Table;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":62.20575750559543,"totalAccepted":8060,"totalSubmission":12957},{"questionId":"2371","title":"The Users That Are Eligible for Discount","titleSlug":"the-users-that-are-eligible-for-discount","isPaidOnly":true,"difficulty":"Easy","likes":25,"dislikes":45,"categoryTitle":"Database","acRate":"50.9%","frontendQuestionId":"2230","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.92961487383798,"totalAccepted":7670,"totalSubmission":15060},{"questionId":"2327","title":"Largest Number After Digit Swaps by Parity","titleSlug":"largest-number-after-digit-swaps-by-parity","isPaidOnly":false,"difficulty":"Easy","likes":698,"dislikes":314,"categoryTitle":"Algorithms","acRate":"65.5%","frontendQuestionId":"2231","paidOnly":false,"topicTags":"Sorting;Heap (Priority Queue);","hasSolution":false,"hasVideoSolution":false,"acRateRaw":65.46354325894222,"totalAccepted":68521,"totalSubmission":104671},{"questionId":"2328","title":"Minimize Result by Adding Parentheses to Expression","titleSlug":"minimize-result-by-adding-parentheses-to-expression","isPaidOnly":false,"difficulty":"Medium","likes":226,"dislikes":345,"categoryTitle":"Algorithms","acRate":"68.2%","frontendQuestionId":"2232","paidOnly":false,"topicTags":"String;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":68.20099255583126,"totalAccepted":27485,"totalSubmission":40300},{"questionId":"2329","title":"Maximum Product After K Increments","titleSlug":"maximum-product-after-k-increments","isPaidOnly":false,"difficulty":"Medium","likes":793,"dislikes":45,"categoryTitle":"Algorithms","acRate":"44.1%","frontendQuestionId":"2233","paidOnly":false,"topicTags":"Array;Greedy;Heap (Priority Queue);","hasSolution":false,"hasVideoSolution":false,"acRateRaw":44.06484635215747,"totalAccepted":46833,"totalSubmission":106282},{"questionId":"2330","title":"Maximum Total Beauty of the Gardens","titleSlug":"maximum-total-beauty-of-the-gardens","isPaidOnly":false,"difficulty":"Hard","likes":454,"dislikes":41,"categoryTitle":"Algorithms","acRate":"30.1%","frontendQuestionId":"2234","paidOnly":false,"topicTags":"Array;Two Pointers;Binary Search;Greedy;Sorting;Enumeration;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":30.11475814412636,"totalAccepted":9762,"totalSubmission":32416},{"questionId":"2383","title":"Add Two Integers","titleSlug":"add-two-integers","isPaidOnly":false,"difficulty":"Easy","likes":2163,"dislikes":3228,"categoryTitle":"Algorithms","acRate":"88.0%","frontendQuestionId":"2235","paidOnly":false,"topicTags":"Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":87.96650039042584,"totalAccepted":902359,"totalSubmission":1025799},{"questionId":"2384","title":"Root Equals Sum of Children","titleSlug":"root-equals-sum-of-children","isPaidOnly":false,"difficulty":"Easy","likes":1598,"dislikes":1653,"categoryTitle":"Algorithms","acRate":"85.0%","frontendQuestionId":"2236","paidOnly":false,"topicTags":"Tree;Binary Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":85.01065165290828,"totalAccepted":357551,"totalSubmission":420596},{"questionId":"2385","title":"Count Positions on Street With Required Brightness","titleSlug":"count-positions-on-street-with-required-brightness","isPaidOnly":true,"difficulty":"Medium","likes":89,"dislikes":6,"categoryTitle":"Algorithms","acRate":"63.0%","frontendQuestionId":"2237","paidOnly":true,"topicTags":"Array;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":63.0492515692902,"totalAccepted":5223,"totalSubmission":8284},{"questionId":"2376","title":"Number of Times a Driver Was a Passenger","titleSlug":"number-of-times-a-driver-was-a-passenger","isPaidOnly":true,"difficulty":"Medium","likes":73,"dislikes":6,"categoryTitle":"Database","acRate":"71.8%","frontendQuestionId":"2238","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":71.83696398476998,"totalAccepted":11509,"totalSubmission":16021},{"questionId":"2350","title":"Find Closest Number to Zero","titleSlug":"find-closest-number-to-zero","isPaidOnly":false,"difficulty":"Easy","likes":811,"dislikes":58,"categoryTitle":"Algorithms","acRate":"48.0%","frontendQuestionId":"2239","paidOnly":false,"topicTags":"Array;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":47.989592924615586,"totalAccepted":215252,"totalSubmission":448540},{"questionId":"2351","title":"Number of Ways to Buy Pens and Pencils","titleSlug":"number-of-ways-to-buy-pens-and-pencils","isPaidOnly":false,"difficulty":"Medium","likes":482,"dislikes":37,"categoryTitle":"Algorithms","acRate":"56.9%","frontendQuestionId":"2240","paidOnly":false,"topicTags":"Math;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":56.91408450704225,"totalAccepted":40409,"totalSubmission":71000},{"questionId":"2352","title":"Design an ATM Machine","titleSlug":"design-an-atm-machine","isPaidOnly":false,"difficulty":"Medium","likes":314,"dislikes":387,"categoryTitle":"Algorithms","acRate":"45.4%","frontendQuestionId":"2241","paidOnly":false,"topicTags":"Array;Greedy;Design;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":45.36964504283966,"totalAccepted":37067,"totalSubmission":81700},{"questionId":"2353","title":"Maximum Score of a Node Sequence","titleSlug":"maximum-score-of-a-node-sequence","isPaidOnly":false,"difficulty":"Hard","likes":586,"dislikes":21,"categoryTitle":"Algorithms","acRate":"40.2%","frontendQuestionId":"2242","paidOnly":false,"topicTags":"Array;Graph Theory;Sorting;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.15497626086177,"totalAccepted":17930,"totalSubmission":44652},{"questionId":"2361","title":"Calculate Digit Sum of a String","titleSlug":"calculate-digit-sum-of-a-string","isPaidOnly":false,"difficulty":"Easy","likes":604,"dislikes":52,"categoryTitle":"Algorithms","acRate":"67.9%","frontendQuestionId":"2243","paidOnly":false,"topicTags":"String;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":67.8637492089763,"totalAccepted":55765,"totalSubmission":82172},{"questionId":"2362","title":"Minimum Rounds to Complete All Tasks","titleSlug":"minimum-rounds-to-complete-all-tasks","isPaidOnly":false,"difficulty":"Medium","likes":2855,"dislikes":86,"categoryTitle":"Algorithms","acRate":"63.3%","frontendQuestionId":"2244","paidOnly":false,"topicTags":"Array;Hash Table;Greedy;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":63.33806365663644,"totalAccepted":174960,"totalSubmission":276232},{"questionId":"2363","title":"Maximum Trailing Zeros in a Cornered Path","titleSlug":"maximum-trailing-zeros-in-a-cornered-path","isPaidOnly":false,"difficulty":"Medium","likes":208,"dislikes":407,"categoryTitle":"Algorithms","acRate":"37.7%","frontendQuestionId":"2245","paidOnly":false,"topicTags":"Array;Matrix;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.71354484441733,"totalAccepted":9890,"totalSubmission":26224},{"questionId":"2364","title":"Longest Path With Different Adjacent Characters","titleSlug":"longest-path-with-different-adjacent-characters","isPaidOnly":false,"difficulty":"Hard","likes":2559,"dislikes":61,"categoryTitle":"Algorithms","acRate":"54.0%","frontendQuestionId":"2246","paidOnly":false,"topicTags":"Array;String;Tree;Depth-First Search;Graph Theory;Topological Sort;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.997864744171096,"totalAccepted":94074,"totalSubmission":174218},{"questionId":"2007","title":"Maximum Cost of Trip With K Highways","titleSlug":"maximum-cost-of-trip-with-k-highways","isPaidOnly":true,"difficulty":"Hard","likes":63,"dislikes":0,"categoryTitle":"Algorithms","acRate":"50.7%","frontendQuestionId":"2247","paidOnly":true,"topicTags":"Dynamic Programming;Bit Manipulation;Graph Theory;Bitmask;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.69545360182687,"totalAccepted":2442,"totalSubmission":4817},{"questionId":"2331","title":"Intersection of Multiple Arrays","titleSlug":"intersection-of-multiple-arrays","isPaidOnly":false,"difficulty":"Easy","likes":815,"dislikes":44,"categoryTitle":"Algorithms","acRate":"68.7%","frontendQuestionId":"2248","paidOnly":false,"topicTags":"Array;Hash Table;Sorting;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":68.72724237586988,"totalAccepted":131745,"totalSubmission":191693},{"questionId":"2332","title":"Count Lattice Points Inside a Circle","titleSlug":"count-lattice-points-inside-a-circle","isPaidOnly":false,"difficulty":"Medium","likes":257,"dislikes":223,"categoryTitle":"Algorithms","acRate":"56.8%","frontendQuestionId":"2249","paidOnly":false,"topicTags":"Array;Hash Table;Math;Geometry;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":56.80865264490955,"totalAccepted":33195,"totalSubmission":58433},{"questionId":"2333","title":"Count Number of Rectangles Containing Each Point","titleSlug":"count-number-of-rectangles-containing-each-point","isPaidOnly":false,"difficulty":"Medium","likes":556,"dislikes":141,"categoryTitle":"Algorithms","acRate":"37.7%","frontendQuestionId":"2250","paidOnly":false,"topicTags":"Array;Hash Table;Binary Search;Binary Indexed Tree;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.65133751256161,"totalAccepted":23604,"totalSubmission":62691},{"questionId":"2334","title":"Number of Flowers in Full Bloom","titleSlug":"number-of-flowers-in-full-bloom","isPaidOnly":false,"difficulty":"Hard","likes":1823,"dislikes":46,"categoryTitle":"Algorithms","acRate":"57.9%","frontendQuestionId":"2251","paidOnly":false,"topicTags":"Array;Hash Table;Binary Search;Sorting;Prefix Sum;Ordered Set;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":57.9244443280886,"totalAccepted":110627,"totalSubmission":190985},{"questionId":"2381","title":"Dynamic Pivoting of a Table","titleSlug":"dynamic-pivoting-of-a-table","isPaidOnly":true,"difficulty":"Hard","likes":34,"dislikes":10,"categoryTitle":"Database","acRate":"57.4%","frontendQuestionId":"2252","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":57.40081383519837,"totalAccepted":2257,"totalSubmission":3932},{"questionId":"2382","title":"Dynamic Unpivoting of a Table","titleSlug":"dynamic-unpivoting-of-a-table","isPaidOnly":true,"difficulty":"Hard","likes":20,"dislikes":13,"categoryTitle":"Database","acRate":"69.8%","frontendQuestionId":"2253","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":69.79648473635523,"totalAccepted":1509,"totalSubmission":2162},{"questionId":"2396","title":"Design Video Sharing Platform","titleSlug":"design-video-sharing-platform","isPaidOnly":true,"difficulty":"Hard","likes":88,"dislikes":15,"categoryTitle":"Algorithms","acRate":"64.3%","frontendQuestionId":"2254","paidOnly":true,"topicTags":"Hash Table;Design;Heap (Priority Queue);","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.25851254480287,"totalAccepted":5737,"totalSubmission":8928},{"questionId":"2341","title":"Count Prefixes of a Given String","titleSlug":"count-prefixes-of-a-given-string","isPaidOnly":false,"difficulty":"Easy","likes":610,"dislikes":24,"categoryTitle":"Algorithms","acRate":"74.3%","frontendQuestionId":"2255","paidOnly":false,"topicTags":"Array;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":74.31516601173188,"totalAccepted":91343,"totalSubmission":122913},{"questionId":"2342","title":"Minimum Average Difference","titleSlug":"minimum-average-difference","isPaidOnly":false,"difficulty":"Medium","likes":1574,"dislikes":182,"categoryTitle":"Algorithms","acRate":"43.9%","frontendQuestionId":"2256","paidOnly":false,"topicTags":"Array;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":43.91104506035783,"totalAccepted":98687,"totalSubmission":224743},{"questionId":"2343","title":"Count Unguarded Cells in the Grid","titleSlug":"count-unguarded-cells-in-the-grid","isPaidOnly":false,"difficulty":"Medium","likes":1298,"dislikes":93,"categoryTitle":"Algorithms","acRate":"69.0%","frontendQuestionId":"2257","paidOnly":false,"topicTags":"Array;Matrix;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.95595883405352,"totalAccepted":206972,"totalSubmission":300151},{"questionId":"2344","title":"Escape the Spreading Fire","titleSlug":"escape-the-spreading-fire","isPaidOnly":false,"difficulty":"Hard","likes":895,"dislikes":43,"categoryTitle":"Algorithms","acRate":"38.4%","frontendQuestionId":"2258","paidOnly":false,"topicTags":"Array;Binary Search;Breadth-First Search;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":38.35279874661729,"totalAccepted":21542,"totalSubmission":56168},{"questionId":"2337","title":"Remove Digit From Number to Maximize Result","titleSlug":"remove-digit-from-number-to-maximize-result","isPaidOnly":false,"difficulty":"Easy","likes":959,"dislikes":66,"categoryTitle":"Algorithms","acRate":"48.5%","frontendQuestionId":"2259","paidOnly":false,"topicTags":"String;Greedy;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":48.53565789766283,"totalAccepted":130955,"totalSubmission":269811},{"questionId":"2338","title":"Minimum Consecutive Cards to Pick Up","titleSlug":"minimum-consecutive-cards-to-pick-up","isPaidOnly":false,"difficulty":"Medium","likes":1097,"dislikes":45,"categoryTitle":"Algorithms","acRate":"53.8%","frontendQuestionId":"2260","paidOnly":false,"topicTags":"Array;Hash Table;Sliding Window;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.81775450965949,"totalAccepted":122740,"totalSubmission":228066},{"questionId":"2339","title":"K Divisible Elements Subarrays","titleSlug":"k-divisible-elements-subarrays","isPaidOnly":false,"difficulty":"Medium","likes":740,"dislikes":162,"categoryTitle":"Algorithms","acRate":"55.0%","frontendQuestionId":"2261","paidOnly":false,"topicTags":"Array;Hash Table;Trie;Rolling Hash;Hash Function;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":54.99158472849677,"totalAccepted":49664,"totalSubmission":90312},{"questionId":"2340","title":"Total Appeal of A String","titleSlug":"total-appeal-of-a-string","isPaidOnly":false,"difficulty":"Hard","likes":1230,"dislikes":35,"categoryTitle":"Algorithms","acRate":"56.5%","frontendQuestionId":"2262","paidOnly":false,"topicTags":"Hash Table;String;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":56.49232308553596,"totalAccepted":47427,"totalSubmission":83953},{"questionId":"1419","title":"Make Array Non-decreasing or Non-increasing","titleSlug":"make-array-non-decreasing-or-non-increasing","isPaidOnly":true,"difficulty":"Hard","likes":94,"dislikes":13,"categoryTitle":"Algorithms","acRate":"65.6%","frontendQuestionId":"2263","paidOnly":true,"topicTags":"Array;Dynamic Programming;Greedy;Heap (Priority Queue);","hasSolution":false,"hasVideoSolution":false,"acRateRaw":65.5739934711643,"totalAccepted":4821,"totalSubmission":7352},{"questionId":"2346","title":"Largest 3-Same-Digit Number in String","titleSlug":"largest-3-same-digit-number-in-string","isPaidOnly":false,"difficulty":"Easy","likes":1392,"dislikes":55,"categoryTitle":"Algorithms","acRate":"72.7%","frontendQuestionId":"2264","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.69319932198745,"totalAccepted":328936,"totalSubmission":452499},{"questionId":"2347","title":"Count Nodes Equal to Average of Subtree","titleSlug":"count-nodes-equal-to-average-of-subtree","isPaidOnly":false,"difficulty":"Medium","likes":2369,"dislikes":59,"categoryTitle":"Algorithms","acRate":"86.8%","frontendQuestionId":"2265","paidOnly":false,"topicTags":"Tree;Depth-First Search;Binary Tree;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":86.80355583227401,"totalAccepted":200761,"totalSubmission":231282},{"questionId":"2348","title":"Count Number of Texts","titleSlug":"count-number-of-texts","isPaidOnly":false,"difficulty":"Medium","likes":949,"dislikes":36,"categoryTitle":"Algorithms","acRate":"50.3%","frontendQuestionId":"2266","paidOnly":false,"topicTags":"Hash Table;Math;String;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.29419586463666,"totalAccepted":30259,"totalSubmission":60164},{"questionId":"2349","title":" Check if There Is a Valid Parentheses String Path","titleSlug":"check-if-there-is-a-valid-parentheses-string-path","isPaidOnly":false,"difficulty":"Hard","likes":544,"dislikes":9,"categoryTitle":"Algorithms","acRate":"40.4%","frontendQuestionId":"2267","paidOnly":false,"topicTags":"Array;Dynamic Programming;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.42185741452245,"totalAccepted":20831,"totalSubmission":51534},{"questionId":"2405","title":"Minimum Number of Keypresses","titleSlug":"minimum-number-of-keypresses","isPaidOnly":true,"difficulty":"Medium","likes":250,"dislikes":40,"categoryTitle":"Algorithms","acRate":"71.5%","frontendQuestionId":"2268","paidOnly":true,"topicTags":"Hash Table;String;Greedy;Sorting;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":71.46553706969256,"totalAccepted":37285,"totalSubmission":52172},{"questionId":"1430","title":"Find the K-Beauty of a Number","titleSlug":"find-the-k-beauty-of-a-number","isPaidOnly":false,"difficulty":"Easy","likes":742,"dislikes":47,"categoryTitle":"Algorithms","acRate":"63.5%","frontendQuestionId":"2269","paidOnly":false,"topicTags":"Math;String;Sliding Window;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":63.473227012344346,"totalAccepted":94405,"totalSubmission":148732},{"questionId":"2358","title":"Number of Ways to Split Array","titleSlug":"number-of-ways-to-split-array","isPaidOnly":false,"difficulty":"Medium","likes":1208,"dislikes":100,"categoryTitle":"Algorithms","acRate":"55.9%","frontendQuestionId":"2270","paidOnly":false,"topicTags":"Array;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.85383036156456,"totalAccepted":240229,"totalSubmission":430103},{"questionId":"2359","title":"Maximum White Tiles Covered by a Carpet","titleSlug":"maximum-white-tiles-covered-by-a-carpet","isPaidOnly":false,"difficulty":"Medium","likes":844,"dislikes":58,"categoryTitle":"Algorithms","acRate":"36.0%","frontendQuestionId":"2271","paidOnly":false,"topicTags":"Array;Binary Search;Greedy;Sliding Window;Sorting;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":35.95002015316405,"totalAccepted":22298,"totalSubmission":62025},{"questionId":"2360","title":"Substring With Largest Variance","titleSlug":"substring-with-largest-variance","isPaidOnly":false,"difficulty":"Hard","likes":1924,"dislikes":213,"categoryTitle":"Algorithms","acRate":"46.0%","frontendQuestionId":"2272","paidOnly":false,"topicTags":"Hash Table;String;Dynamic Programming;Enumeration;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":46.01114735942409,"totalAccepted":76442,"totalSubmission":166138},{"questionId":"1353","title":"Find Resultant Array After Removing Anagrams","titleSlug":"find-resultant-array-after-removing-anagrams","isPaidOnly":false,"difficulty":"Easy","likes":1073,"dislikes":238,"categoryTitle":"Algorithms","acRate":"70.0%","frontendQuestionId":"2273","paidOnly":false,"topicTags":"Array;Hash Table;String;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":69.95277253766241,"totalAccepted":210625,"totalSubmission":301096},{"questionId":"2355","title":"Maximum Consecutive Floors Without Special Floors","titleSlug":"maximum-consecutive-floors-without-special-floors","isPaidOnly":false,"difficulty":"Medium","likes":431,"dislikes":41,"categoryTitle":"Algorithms","acRate":"52.7%","frontendQuestionId":"2274","paidOnly":false,"topicTags":"Array;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":52.703513649222934,"totalAccepted":43034,"totalSubmission":81653},{"questionId":"2356","title":"Largest Combination With Bitwise AND Greater Than Zero","titleSlug":"largest-combination-with-bitwise-and-greater-than-zero","isPaidOnly":false,"difficulty":"Medium","likes":1141,"dislikes":60,"categoryTitle":"Algorithms","acRate":"80.8%","frontendQuestionId":"2275","paidOnly":false,"topicTags":"Array;Hash Table;Bit Manipulation;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":80.76366732665142,"totalAccepted":157450,"totalSubmission":194952},{"questionId":"2357","title":"Count Integers in Intervals","titleSlug":"count-integers-in-intervals","isPaidOnly":false,"difficulty":"Hard","likes":626,"dislikes":64,"categoryTitle":"Algorithms","acRate":"36.0%","frontendQuestionId":"2276","paidOnly":false,"topicTags":"Design;Segment Tree;Ordered Set;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":35.96579173058572,"totalAccepted":29775,"totalSubmission":82787},{"questionId":"2420","title":"Closest Node to Path in Tree","titleSlug":"closest-node-to-path-in-tree","isPaidOnly":true,"difficulty":"Hard","likes":140,"dislikes":3,"categoryTitle":"Algorithms","acRate":"62.5%","frontendQuestionId":"2277","paidOnly":true,"topicTags":"Array;Tree;Depth-First Search;Breadth-First Search;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":62.51734023860168,"totalAccepted":6758,"totalSubmission":10811},{"questionId":"2365","title":"Percentage of Letter in String","titleSlug":"percentage-of-letter-in-string","isPaidOnly":false,"difficulty":"Easy","likes":564,"dislikes":64,"categoryTitle":"Algorithms","acRate":"75.2%","frontendQuestionId":"2278","paidOnly":false,"topicTags":"String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":75.19232456781818,"totalAccepted":102824,"totalSubmission":136748},{"questionId":"2366","title":"Maximum Bags With Full Capacity of Rocks","titleSlug":"maximum-bags-with-full-capacity-of-rocks","isPaidOnly":false,"difficulty":"Medium","likes":1777,"dislikes":72,"categoryTitle":"Algorithms","acRate":"68.1%","frontendQuestionId":"2279","paidOnly":false,"topicTags":"Array;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.12121861112598,"totalAccepted":114506,"totalSubmission":168092},{"questionId":"2367","title":"Minimum Lines to Represent a Line Chart","titleSlug":"minimum-lines-to-represent-a-line-chart","isPaidOnly":false,"difficulty":"Medium","likes":366,"dislikes":534,"categoryTitle":"Algorithms","acRate":"27.1%","frontendQuestionId":"2280","paidOnly":false,"topicTags":"Array;Math;Geometry;Sorting;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":27.081624367164647,"totalAccepted":32684,"totalSubmission":120687},{"questionId":"2368","title":"Sum of Total Strength of Wizards","titleSlug":"sum-of-total-strength-of-wizards","isPaidOnly":false,"difficulty":"Hard","likes":1280,"dislikes":112,"categoryTitle":"Algorithms","acRate":"29.4%","frontendQuestionId":"2281","paidOnly":false,"topicTags":"Array;Stack;Monotonic Stack;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":29.405570652173914,"totalAccepted":25971,"totalSubmission":88320},{"questionId":"2425","title":"Number of People That Can Be Seen in a Grid","titleSlug":"number-of-people-that-can-be-seen-in-a-grid","isPaidOnly":true,"difficulty":"Medium","likes":67,"dislikes":34,"categoryTitle":"Algorithms","acRate":"47.3%","frontendQuestionId":"2282","paidOnly":true,"topicTags":"Array;Stack;Matrix;Monotonic Stack;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":47.33251705439916,"totalAccepted":2706,"totalSubmission":5717},{"questionId":"2377","title":"Check if Number Has Equal Digit Count and Digit Value","titleSlug":"check-if-number-has-equal-digit-count-and-digit-value","isPaidOnly":false,"difficulty":"Easy","likes":684,"dislikes":101,"categoryTitle":"Algorithms","acRate":"73.3%","frontendQuestionId":"2283","paidOnly":false,"topicTags":"Hash Table;String;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":73.25711686057778,"totalAccepted":86954,"totalSubmission":118697},{"questionId":"2378","title":"Sender With Largest Word Count","titleSlug":"sender-with-largest-word-count","isPaidOnly":false,"difficulty":"Medium","likes":472,"dislikes":42,"categoryTitle":"Algorithms","acRate":"59.8%","frontendQuestionId":"2284","paidOnly":false,"topicTags":"Array;Hash Table;String;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":59.838352235692874,"totalAccepted":45902,"totalSubmission":76710},{"questionId":"2379","title":"Maximum Total Importance of Roads","titleSlug":"maximum-total-importance-of-roads","isPaidOnly":false,"difficulty":"Medium","likes":1370,"dislikes":84,"categoryTitle":"Algorithms","acRate":"69.1%","frontendQuestionId":"2285","paidOnly":false,"topicTags":"Greedy;Graph Theory;Sorting;Heap (Priority Queue);","hasSolution":true,"hasVideoSolution":false,"acRateRaw":69.08948857637569,"totalAccepted":163597,"totalSubmission":236790},{"questionId":"2380","title":"Booking Concert Tickets in Groups","titleSlug":"booking-concert-tickets-in-groups","isPaidOnly":false,"difficulty":"Hard","likes":354,"dislikes":61,"categoryTitle":"Algorithms","acRate":"19.7%","frontendQuestionId":"2286","paidOnly":false,"topicTags":"Binary Search;Design;Binary Indexed Tree;Segment Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":19.691430817610062,"totalAccepted":10019,"totalSubmission":50880},{"questionId":"2372","title":"Rearrange Characters to Make Target String","titleSlug":"rearrange-characters-to-make-target-string","isPaidOnly":false,"difficulty":"Easy","likes":539,"dislikes":38,"categoryTitle":"Algorithms","acRate":"61.4%","frontendQuestionId":"2287","paidOnly":false,"topicTags":"Hash Table;String;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":61.38951190857631,"totalAccepted":57479,"totalSubmission":93630},{"questionId":"2373","title":"Apply Discount to Prices","titleSlug":"apply-discount-to-prices","isPaidOnly":false,"difficulty":"Medium","likes":225,"dislikes":1131,"categoryTitle":"Algorithms","acRate":"34.4%","frontendQuestionId":"2288","paidOnly":false,"topicTags":"String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":34.36947891334622,"totalAccepted":33071,"totalSubmission":96222},{"questionId":"2374","title":"Steps to Make Array Non-decreasing","titleSlug":"steps-to-make-array-non-decreasing","isPaidOnly":false,"difficulty":"Medium","likes":1416,"dislikes":150,"categoryTitle":"Algorithms","acRate":"24.9%","frontendQuestionId":"2289","paidOnly":false,"topicTags":"Array;Linked List;Dynamic Programming;Stack;Monotonic Stack;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":24.91888787121412,"totalAccepted":32104,"totalSubmission":128834},{"questionId":"2375","title":"Minimum Obstacle Removal to Reach Corner","titleSlug":"minimum-obstacle-removal-to-reach-corner","isPaidOnly":false,"difficulty":"Hard","likes":1690,"dislikes":29,"categoryTitle":"Algorithms","acRate":"70.7%","frontendQuestionId":"2290","paidOnly":false,"topicTags":"Array;Breadth-First Search;Graph Theory;Heap (Priority Queue);Matrix;Shortest Path;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":70.72247213870742,"totalAccepted":125141,"totalSubmission":176947},{"questionId":"2426","title":"Maximum Profit From Trading Stocks","titleSlug":"maximum-profit-from-trading-stocks","isPaidOnly":true,"difficulty":"Medium","likes":191,"dislikes":9,"categoryTitle":"Algorithms","acRate":"48.3%","frontendQuestionId":"2291","paidOnly":true,"topicTags":"Array;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":48.26843324177304,"totalAccepted":17924,"totalSubmission":37134},{"questionId":"2431","title":"Products With Three or More Orders in Two Consecutive Years","titleSlug":"products-with-three-or-more-orders-in-two-consecutive-years","isPaidOnly":true,"difficulty":"Medium","likes":65,"dislikes":29,"categoryTitle":"Database","acRate":"40.8%","frontendQuestionId":"2292","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.78012851828191,"totalAccepted":10852,"totalSubmission":26611},{"questionId":"2386","title":"Min Max Game","titleSlug":"min-max-game","isPaidOnly":false,"difficulty":"Easy","likes":594,"dislikes":33,"categoryTitle":"Algorithms","acRate":"64.4%","frontendQuestionId":"2293","paidOnly":false,"topicTags":"Array;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.44940617577197,"totalAccepted":67833,"totalSubmission":105250},{"questionId":"2387","title":"Partition Array Such That Maximum Difference Is K","titleSlug":"partition-array-such-that-maximum-difference-is-k","isPaidOnly":false,"difficulty":"Medium","likes":1183,"dislikes":47,"categoryTitle":"Algorithms","acRate":"81.8%","frontendQuestionId":"2294","paidOnly":false,"topicTags":"Array;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":81.8105423987777,"totalAccepted":171344,"totalSubmission":209440},{"questionId":"2388","title":"Replace Elements in an Array","titleSlug":"replace-elements-in-an-array","isPaidOnly":false,"difficulty":"Medium","likes":689,"dislikes":39,"categoryTitle":"Algorithms","acRate":"59.9%","frontendQuestionId":"2295","paidOnly":false,"topicTags":"Array;Hash Table;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":59.85880848133025,"totalAccepted":48670,"totalSubmission":81308},{"questionId":"2389","title":"Design a Text Editor","titleSlug":"design-a-text-editor","isPaidOnly":false,"difficulty":"Hard","likes":659,"dislikes":229,"categoryTitle":"Algorithms","acRate":"50.9%","frontendQuestionId":"2296","paidOnly":false,"topicTags":"Linked List;String;Stack;Design;Simulation;Doubly-Linked List;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.912033795185565,"totalAccepted":44350,"totalSubmission":87112},{"questionId":"2056","title":"Jump Game VIII","titleSlug":"jump-game-viii","isPaidOnly":true,"difficulty":"Medium","likes":173,"dislikes":49,"categoryTitle":"Algorithms","acRate":"45.8%","frontendQuestionId":"2297","paidOnly":true,"topicTags":"Array;Dynamic Programming;Stack;Graph Theory;Monotonic Stack;Shortest Path;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":45.83521444695259,"totalAccepted":8122,"totalSubmission":17720},{"questionId":"2440","title":"Tasks Count in the Weekend","titleSlug":"tasks-count-in-the-weekend","isPaidOnly":true,"difficulty":"Medium","likes":53,"dislikes":10,"categoryTitle":"Database","acRate":"81.8%","frontendQuestionId":"2298","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":81.77318513372698,"totalAccepted":9417,"totalSubmission":11516},{"questionId":"2391","title":"Strong Password Checker II","titleSlug":"strong-password-checker-ii","isPaidOnly":false,"difficulty":"Easy","likes":391,"dislikes":41,"categoryTitle":"Algorithms","acRate":"55.5%","frontendQuestionId":"2299","paidOnly":false,"topicTags":"String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":55.45388988265263,"totalAccepted":59212,"totalSubmission":106777},{"questionId":"2392","title":"Successful Pairs of Spells and Potions","titleSlug":"successful-pairs-of-spells-and-potions","isPaidOnly":false,"difficulty":"Medium","likes":3225,"dislikes":106,"categoryTitle":"Algorithms","acRate":"49.7%","frontendQuestionId":"2300","paidOnly":false,"topicTags":"Array;Two Pointers;Binary Search;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.6527539371931,"totalAccepted":390502,"totalSubmission":786468},{"questionId":"2853","title":"Consecutive Transactions with Increasing Amounts","titleSlug":"consecutive-transactions-with-increasing-amounts","isPaidOnly":true,"difficulty":"Hard","likes":53,"dislikes":6,"categoryTitle":"Database","acRate":"35.1%","frontendQuestionId":"2701","paidOnly":true,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":35.051169590643276,"totalAccepted":5754,"totalSubmission":16416},{"questionId":"2729","title":"Minimum Operations to Make Numbers Non-positive","titleSlug":"minimum-operations-to-make-numbers-non-positive","isPaidOnly":true,"difficulty":"Hard","likes":50,"dislikes":5,"categoryTitle":"Algorithms","acRate":"44.1%","frontendQuestionId":"2702","paidOnly":true,"topicTags":"Array;Binary Search;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":44.12493120528344,"totalAccepted":6414,"totalSubmission":14536},{"questionId":"2820","title":"Return Length of Arguments Passed","titleSlug":"return-length-of-arguments-passed","isPaidOnly":false,"difficulty":"Easy","likes":428,"dislikes":177,"categoryTitle":"JavaScript","acRate":"94.5%","frontendQuestionId":"2703","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":94.4808085039535,"totalAccepted":306730,"totalSubmission":324648},{"questionId":"2813","title":"To Be Or Not To Be","titleSlug":"to-be-or-not-to-be","isPaidOnly":false,"difficulty":"Easy","likes":937,"dislikes":224,"categoryTitle":"JavaScript","acRate":"63.4%","frontendQuestionId":"2704","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":63.36997998712336,"totalAccepted":363193,"totalSubmission":573131},{"questionId":"2804","title":"Compact Object","titleSlug":"compact-object","isPaidOnly":false,"difficulty":"Medium","likes":231,"dislikes":25,"categoryTitle":"JavaScript","acRate":"68.2%","frontendQuestionId":"2705","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.22114781736356,"totalAccepted":48963,"totalSubmission":71771},{"questionId":"2756","title":"Buy Two Chocolates","titleSlug":"buy-two-chocolates","isPaidOnly":false,"difficulty":"Easy","likes":1074,"dislikes":72,"categoryTitle":"Algorithms","acRate":"68.4%","frontendQuestionId":"2706","paidOnly":false,"topicTags":"Array;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.35037516108441,"totalAccepted":227008,"totalSubmission":332124},{"questionId":"2755","title":"Extra Characters in a String","titleSlug":"extra-characters-in-a-string","isPaidOnly":false,"difficulty":"Medium","likes":2641,"dislikes":138,"categoryTitle":"Algorithms","acRate":"57.4%","frontendQuestionId":"2707","paidOnly":false,"topicTags":"Array;Hash Table;String;Dynamic Programming;Trie;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":57.39841816959624,"totalAccepted":200661,"totalSubmission":349594},{"questionId":"2754","title":"Maximum Strength of a Group","titleSlug":"maximum-strength-of-a-group","isPaidOnly":false,"difficulty":"Medium","likes":387,"dislikes":68,"categoryTitle":"Algorithms","acRate":"25.8%","frontendQuestionId":"2708","paidOnly":false,"topicTags":"Array;Dynamic Programming;Backtracking;Greedy;Bit Manipulation;Sorting;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":25.7679451439443,"totalAccepted":39007,"totalSubmission":151378},{"questionId":"2827","title":"Greatest Common Divisor Traversal","titleSlug":"greatest-common-divisor-traversal","isPaidOnly":false,"difficulty":"Hard","likes":868,"dislikes":144,"categoryTitle":"Algorithms","acRate":"41.8%","frontendQuestionId":"2709","paidOnly":false,"topicTags":"Array;Math;Union-Find;Number Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":41.79840989303801,"totalAccepted":77335,"totalSubmission":185019},{"questionId":"2819","title":"Remove Trailing Zeros From a String","titleSlug":"remove-trailing-zeros-from-a-string","isPaidOnly":false,"difficulty":"Easy","likes":344,"dislikes":13,"categoryTitle":"Algorithms","acRate":"79.7%","frontendQuestionId":"2710","paidOnly":false,"topicTags":"String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":79.66810742795512,"totalAccepted":97505,"totalSubmission":122389},{"questionId":"2801","title":"Difference of Number of Distinct Values on Diagonals","titleSlug":"difference-of-number-of-distinct-values-on-diagonals","isPaidOnly":false,"difficulty":"Medium","likes":143,"dislikes":211,"categoryTitle":"Algorithms","acRate":"68.4%","frontendQuestionId":"2711","paidOnly":false,"topicTags":"Array;Hash Table;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":68.42480610941075,"totalAccepted":23027,"totalSubmission":33653},{"questionId":"2817","title":"Minimum Cost to Make All Characters Equal","titleSlug":"minimum-cost-to-make-all-characters-equal","isPaidOnly":false,"difficulty":"Medium","likes":586,"dislikes":27,"categoryTitle":"Algorithms","acRate":"54.4%","frontendQuestionId":"2712","paidOnly":false,"topicTags":"String;Dynamic Programming;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":54.429905667002174,"totalAccepted":23253,"totalSubmission":42721},{"questionId":"2818","title":"Maximum Strictly Increasing Cells in a Matrix","titleSlug":"maximum-strictly-increasing-cells-in-a-matrix","isPaidOnly":false,"difficulty":"Hard","likes":633,"dislikes":22,"categoryTitle":"Algorithms","acRate":"31.5%","frontendQuestionId":"2713","paidOnly":false,"topicTags":"Array;Hash Table;Binary Search;Dynamic Programming;Memoization;Sorting;Matrix;Ordered Set;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":31.46883407649903,"totalAccepted":16726,"totalSubmission":53151},{"questionId":"2865","title":"Find Shortest Path with K Hops","titleSlug":"find-shortest-path-with-k-hops","isPaidOnly":true,"difficulty":"Hard","likes":42,"dislikes":1,"categoryTitle":"Algorithms","acRate":"68.6%","frontendQuestionId":"2714","paidOnly":true,"topicTags":"Graph Theory;Heap (Priority Queue);Shortest Path;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":68.60269360269359,"totalAccepted":2445,"totalSubmission":3564},{"questionId":"2821","title":"Timeout Cancellation","titleSlug":"timeout-cancellation","isPaidOnly":false,"difficulty":"Easy","likes":324,"dislikes":375,"categoryTitle":"JavaScript","acRate":"89.6%","frontendQuestionId":"2715","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":89.5766756055141,"totalAccepted":104553,"totalSubmission":116719},{"questionId":"2825","title":"Minimize String Length","titleSlug":"minimize-string-length","isPaidOnly":false,"difficulty":"Easy","likes":382,"dislikes":109,"categoryTitle":"Algorithms","acRate":"79.3%","frontendQuestionId":"2716","paidOnly":false,"topicTags":"Hash Table;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":79.30317717793555,"totalAccepted":81645,"totalSubmission":102953},{"questionId":"2785","title":"Semi-Ordered Permutation","titleSlug":"semi-ordered-permutation","isPaidOnly":false,"difficulty":"Easy","likes":230,"dislikes":21,"categoryTitle":"Algorithms","acRate":"64.3%","frontendQuestionId":"2717","paidOnly":false,"topicTags":"Array;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.29212213841912,"totalAccepted":38700,"totalSubmission":60194},{"questionId":"2838","title":"Sum of Matrix After Queries","titleSlug":"sum-of-matrix-after-queries","isPaidOnly":false,"difficulty":"Medium","likes":734,"dislikes":28,"categoryTitle":"Algorithms","acRate":"32.2%","frontendQuestionId":"2718","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":32.18504939403198,"totalAccepted":25282,"totalSubmission":78552},{"questionId":"2757","title":"Count of Integers","titleSlug":"count-of-integers","isPaidOnly":false,"difficulty":"Hard","likes":590,"dislikes":12,"categoryTitle":"Algorithms","acRate":"38.8%","frontendQuestionId":"2719","paidOnly":false,"topicTags":"Math;String;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":38.816341418931245,"totalAccepted":21283,"totalSubmission":54830},{"questionId":"2874","title":"Popularity Percentage","titleSlug":"popularity-percentage","isPaidOnly":true,"difficulty":"Hard","likes":14,"dislikes":9,"categoryTitle":"Database","acRate":"53.4%","frontendQuestionId":"2720","paidOnly":true,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.40610205155182,"totalAccepted":4061,"totalSubmission":7604},{"questionId":"2807","title":"Execute Asynchronous Functions in Parallel","titleSlug":"execute-asynchronous-functions-in-parallel","isPaidOnly":false,"difficulty":"Medium","likes":263,"dislikes":49,"categoryTitle":"JavaScript","acRate":"78.6%","frontendQuestionId":"2721","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":78.63038826047081,"totalAccepted":56583,"totalSubmission":71961},{"questionId":"2858","title":"Join Two Arrays by ID","titleSlug":"join-two-arrays-by-id","isPaidOnly":false,"difficulty":"Medium","likes":245,"dislikes":65,"categoryTitle":"JavaScript","acRate":"57.6%","frontendQuestionId":"2722","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":57.5541221009299,"totalAccepted":62634,"totalSubmission":108827},{"questionId":"2859","title":"Add Two Promises","titleSlug":"add-two-promises","isPaidOnly":false,"difficulty":"Easy","likes":367,"dislikes":33,"categoryTitle":"JavaScript","acRate":"91.7%","frontendQuestionId":"2723","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":91.6820490258902,"totalAccepted":191719,"totalSubmission":209113},{"questionId":"2860","title":"Sort By","titleSlug":"sort-by","isPaidOnly":false,"difficulty":"Easy","likes":234,"dislikes":49,"categoryTitle":"JavaScript","acRate":"83.1%","frontendQuestionId":"2724","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":83.10643256216949,"totalAccepted":83448,"totalSubmission":100411},{"questionId":"2862","title":"Interval Cancellation","titleSlug":"interval-cancellation","isPaidOnly":false,"difficulty":"Easy","likes":217,"dislikes":99,"categoryTitle":"JavaScript","acRate":"85.0%","frontendQuestionId":"2725","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":84.95959675204958,"totalAccepted":86635,"totalSubmission":101972},{"questionId":"2863","title":"Calculator with Method Chaining","titleSlug":"calculator-with-method-chaining","isPaidOnly":false,"difficulty":"Easy","likes":154,"dislikes":22,"categoryTitle":"JavaScript","acRate":"77.7%","frontendQuestionId":"2726","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":77.67793294204952,"totalAccepted":57571,"totalSubmission":74115},{"questionId":"2864","title":"Is Object Empty","titleSlug":"is-object-empty","isPaidOnly":false,"difficulty":"Easy","likes":226,"dislikes":16,"categoryTitle":"JavaScript","acRate":"82.0%","frontendQuestionId":"2727","paidOnly":false,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":81.98617247040295,"totalAccepted":122852,"totalSubmission":149845},{"questionId":"2875","title":"Count Houses in a Circular Street","titleSlug":"count-houses-in-a-circular-street","isPaidOnly":true,"difficulty":"Easy","likes":60,"dislikes":12,"categoryTitle":"Algorithms","acRate":"86.1%","frontendQuestionId":"2728","paidOnly":true,"topicTags":"Array;Interactive;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":86.0753095779631,"totalAccepted":3406,"totalSubmission":3957},{"questionId":"2824","title":"Check if The Number is Fascinating","titleSlug":"check-if-the-number-is-fascinating","isPaidOnly":false,"difficulty":"Easy","likes":265,"dislikes":14,"categoryTitle":"Algorithms","acRate":"53.2%","frontendQuestionId":"2729","paidOnly":false,"topicTags":"Hash Table;Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.167384847090325,"totalAccepted":63543,"totalSubmission":119515},{"questionId":"2786","title":"Find the Longest Semi-Repetitive Substring","titleSlug":"find-the-longest-semi-repetitive-substring","isPaidOnly":false,"difficulty":"Medium","likes":319,"dislikes":89,"categoryTitle":"Algorithms","acRate":"39.0%","frontendQuestionId":"2730","paidOnly":false,"topicTags":"String;Sliding Window;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":39.03588842927461,"totalAccepted":33784,"totalSubmission":86546},{"questionId":"2787","title":"Movement of Robots","titleSlug":"movement-of-robots","isPaidOnly":false,"difficulty":"Medium","likes":550,"dislikes":103,"categoryTitle":"Algorithms","acRate":"28.1%","frontendQuestionId":"2731","paidOnly":false,"topicTags":"Array;Brainteaser;Sorting;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":28.064024615748757,"totalAccepted":18971,"totalSubmission":67599},{"questionId":"2826","title":"Find a Good Subset of the Matrix","titleSlug":"find-a-good-subset-of-the-matrix","isPaidOnly":false,"difficulty":"Hard","likes":214,"dislikes":30,"categoryTitle":"Algorithms","acRate":"46.7%","frontendQuestionId":"2732","paidOnly":false,"topicTags":"Array;Hash Table;Bit Manipulation;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":46.66408497455189,"totalAccepted":8435,"totalSubmission":18076},{"questionId":"2836","title":"Neither Minimum nor Maximum","titleSlug":"neither-minimum-nor-maximum","isPaidOnly":false,"difficulty":"Easy","likes":412,"dislikes":20,"categoryTitle":"Algorithms","acRate":"76.4%","frontendQuestionId":"2733","paidOnly":false,"topicTags":"Array;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":76.41429086184117,"totalAccepted":139965,"totalSubmission":183166},{"questionId":"2828","title":"Lexicographically Smallest String After Substring Operation","titleSlug":"lexicographically-smallest-string-after-substring-operation","isPaidOnly":false,"difficulty":"Medium","likes":281,"dislikes":195,"categoryTitle":"Algorithms","acRate":"35.0%","frontendQuestionId":"2734","paidOnly":false,"topicTags":"String;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":35.01346856217108,"totalAccepted":36525,"totalSubmission":104317},{"questionId":"2810","title":"Collecting Chocolates","titleSlug":"collecting-chocolates","isPaidOnly":false,"difficulty":"Medium","likes":315,"dislikes":557,"categoryTitle":"Algorithms","acRate":"35.1%","frontendQuestionId":"2735","paidOnly":false,"topicTags":"Array;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":35.07884154881851,"totalAccepted":15528,"totalSubmission":44266},{"questionId":"2839","title":"Maximum Sum Queries","titleSlug":"maximum-sum-queries","isPaidOnly":false,"difficulty":"Hard","likes":357,"dislikes":17,"categoryTitle":"Algorithms","acRate":"30.6%","frontendQuestionId":"2736","paidOnly":false,"topicTags":"Array;Binary Search;Stack;Binary Indexed Tree;Segment Tree;Sorting;Monotonic Stack;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":30.64942487675931,"totalAccepted":8580,"totalSubmission":27994},{"questionId":"2880","title":"Find the Closest Marked Node","titleSlug":"find-the-closest-marked-node","isPaidOnly":true,"difficulty":"Medium","likes":60,"dislikes":6,"categoryTitle":"Algorithms","acRate":"65.4%","frontendQuestionId":"2737","paidOnly":true,"topicTags":"Array;Graph Theory;Heap (Priority Queue);Shortest Path;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.40350877192982,"totalAccepted":7456,"totalSubmission":11400},{"questionId":"2885","title":"Count Occurrences in Text","titleSlug":"count-occurrences-in-text","isPaidOnly":true,"difficulty":"Medium","likes":29,"dislikes":48,"categoryTitle":"Database","acRate":"54.3%","frontendQuestionId":"2738","paidOnly":true,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":54.31258396775638,"totalAccepted":12128,"totalSubmission":22330},{"questionId":"2857","title":"Total Distance Traveled","titleSlug":"total-distance-traveled","isPaidOnly":false,"difficulty":"Easy","likes":333,"dislikes":107,"categoryTitle":"Algorithms","acRate":"41.5%","frontendQuestionId":"2739","paidOnly":false,"topicTags":"Math;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":41.504499455685036,"totalAccepted":64430,"totalSubmission":155239},{"questionId":"2845","title":"Find the Value of the Partition","titleSlug":"find-the-value-of-the-partition","isPaidOnly":false,"difficulty":"Medium","likes":327,"dislikes":26,"categoryTitle":"Algorithms","acRate":"65.0%","frontendQuestionId":"2740","paidOnly":false,"topicTags":"Array;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.98830865159782,"totalAccepted":41690,"totalSubmission":64150},{"questionId":"2848","title":"Special Permutations","titleSlug":"special-permutations","isPaidOnly":false,"difficulty":"Medium","likes":592,"dislikes":66,"categoryTitle":"Algorithms","acRate":"29.6%","frontendQuestionId":"2741","paidOnly":false,"topicTags":"Array;Dynamic Programming;Bit Manipulation;Bitmask;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":29.64789540084872,"totalAccepted":18095,"totalSubmission":61033},{"questionId":"2808","title":"Painting the Walls","titleSlug":"painting-the-walls","isPaidOnly":false,"difficulty":"Hard","likes":1513,"dislikes":96,"categoryTitle":"Algorithms","acRate":"49.1%","frontendQuestionId":"2742","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.09560723514212,"totalAccepted":81700,"totalSubmission":166410},{"questionId":"2890","title":"Count Substrings Without Repeating Character","titleSlug":"count-substrings-without-repeating-character","isPaidOnly":true,"difficulty":"Medium","likes":98,"dislikes":2,"categoryTitle":"Algorithms","acRate":"75.9%","frontendQuestionId":"2743","paidOnly":true,"topicTags":"Hash Table;String;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.93863544610416,"totalAccepted":9405,"totalSubmission":12385},{"questionId":"2847","title":"Find Maximum Number of String Pairs","titleSlug":"find-maximum-number-of-string-pairs","isPaidOnly":false,"difficulty":"Easy","likes":478,"dislikes":19,"categoryTitle":"Algorithms","acRate":"82.5%","frontendQuestionId":"2744","paidOnly":false,"topicTags":"Array;Hash Table;String;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":82.51809896646746,"totalAccepted":118883,"totalSubmission":144069},{"questionId":"2850","title":"Construct the Longest New String","titleSlug":"construct-the-longest-new-string","isPaidOnly":false,"difficulty":"Medium","likes":343,"dislikes":29,"categoryTitle":"Algorithms","acRate":"54.9%","frontendQuestionId":"2745","paidOnly":false,"topicTags":"Math;Dynamic Programming;Greedy;Brainteaser;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":54.88178193096226,"totalAccepted":27251,"totalSubmission":49654},{"questionId":"2854","title":"Decremental String Concatenation","titleSlug":"decremental-string-concatenation","isPaidOnly":false,"difficulty":"Medium","likes":380,"dislikes":33,"categoryTitle":"Algorithms","acRate":"27.8%","frontendQuestionId":"2746","paidOnly":false,"topicTags":"Array;String;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":27.817963367089227,"totalAccepted":11345,"totalSubmission":40783},{"questionId":"2833","title":"Count Zero Request Servers","titleSlug":"count-zero-request-servers","isPaidOnly":false,"difficulty":"Medium","likes":406,"dislikes":58,"categoryTitle":"Algorithms","acRate":"36.0%","frontendQuestionId":"2747","paidOnly":false,"topicTags":"Array;Hash Table;Sliding Window;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":36.01185575498106,"totalAccepted":13122,"totalSubmission":36438},{"questionId":"2831","title":"Number of Beautiful Pairs","titleSlug":"number-of-beautiful-pairs","isPaidOnly":false,"difficulty":"Easy","likes":245,"dislikes":43,"categoryTitle":"Algorithms","acRate":"52.5%","frontendQuestionId":"2748","paidOnly":false,"topicTags":"Array;Hash Table;Math;Counting;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":52.497813670765815,"totalAccepted":48624,"totalSubmission":92621},{"questionId":"2837","title":"Minimum Operations to Make the Integer Zero","titleSlug":"minimum-operations-to-make-the-integer-zero","isPaidOnly":false,"difficulty":"Medium","likes":773,"dislikes":377,"categoryTitle":"Algorithms","acRate":"58.2%","frontendQuestionId":"2749","paidOnly":false,"topicTags":"Bit Manipulation;Brainteaser;Enumeration;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.177602208822144,"totalAccepted":97348,"totalSubmission":167329},{"questionId":"2867","title":"Ways to Split Array Into Good Subarrays","titleSlug":"ways-to-split-array-into-good-subarrays","isPaidOnly":false,"difficulty":"Medium","likes":476,"dislikes":14,"categoryTitle":"Algorithms","acRate":"35.1%","frontendQuestionId":"2750","paidOnly":false,"topicTags":"Array;Math;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":35.13190629849496,"totalAccepted":28525,"totalSubmission":81194},{"questionId":"2846","title":"Robot Collisions","titleSlug":"robot-collisions","isPaidOnly":false,"difficulty":"Hard","likes":1521,"dislikes":114,"categoryTitle":"Algorithms","acRate":"61.6%","frontendQuestionId":"2751","paidOnly":false,"topicTags":"Array;Stack;Sorting;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.60379587588047,"totalAccepted":192932,"totalSubmission":313182},{"questionId":"2852","title":"Customers with Maximum Number of Transactions on Consecutive Days","titleSlug":"customers-with-maximum-number-of-transactions-on-consecutive-days","isPaidOnly":true,"difficulty":"Hard","likes":16,"dislikes":35,"categoryTitle":"Database","acRate":"42.4%","frontendQuestionId":"2752","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":42.42109364852578,"totalAccepted":3266,"totalSubmission":7699},{"questionId":"2897","title":"Count Houses in a Circular Street II","titleSlug":"count-houses-in-a-circular-street-ii","isPaidOnly":true,"difficulty":"Hard","likes":27,"dislikes":3,"categoryTitle":"Algorithms","acRate":"62.0%","frontendQuestionId":"2753","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.9781631342325,"totalAccepted":965,"totalSubmission":1557},{"questionId":"2770","title":"Bind Function to Context","titleSlug":"bind-function-to-context","isPaidOnly":true,"difficulty":"Medium","likes":17,"dislikes":0,"categoryTitle":"JavaScript","acRate":"86.1%","frontendQuestionId":"2754","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":86.13413715146947,"totalAccepted":1143,"totalSubmission":1327},{"questionId":"2795","title":"Deep Merge of Two Objects","titleSlug":"deep-merge-of-two-objects","isPaidOnly":true,"difficulty":"Medium","likes":15,"dislikes":4,"categoryTitle":"JavaScript","acRate":"65.3%","frontendQuestionId":"2755","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.26243093922652,"totalAccepted":945,"totalSubmission":1448},{"questionId":"2806","title":"Query Batching","titleSlug":"query-batching","isPaidOnly":true,"difficulty":"Hard","likes":15,"dislikes":5,"categoryTitle":"JavaScript","acRate":"69.7%","frontendQuestionId":"2756","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":69.73224679860303,"totalAccepted":599,"totalSubmission":859},{"questionId":"2814","title":"Generate Circular Array Values","titleSlug":"generate-circular-array-values","isPaidOnly":true,"difficulty":"Medium","likes":11,"dislikes":2,"categoryTitle":"JavaScript","acRate":"75.8%","frontendQuestionId":"2757","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.80477673935619,"totalAccepted":730,"totalSubmission":963},{"questionId":"2822","title":"Next Day","titleSlug":"next-day","isPaidOnly":true,"difficulty":"Easy","likes":14,"dislikes":1,"categoryTitle":"JavaScript","acRate":"85.6%","frontendQuestionId":"2758","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":85.57343020238713,"totalAccepted":1649,"totalSubmission":1927},{"questionId":"2851","title":"Convert JSON String to Object","titleSlug":"convert-json-string-to-object","isPaidOnly":true,"difficulty":"Hard","likes":17,"dislikes":4,"categoryTitle":"JavaScript","acRate":"62.0%","frontendQuestionId":"2759","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":62.02046035805626,"totalAccepted":970,"totalSubmission":1564},{"questionId":"2866","title":"Longest Even Odd Subarray With Threshold","titleSlug":"longest-even-odd-subarray-with-threshold","isPaidOnly":false,"difficulty":"Easy","likes":364,"dislikes":290,"categoryTitle":"Algorithms","acRate":"32.2%","frontendQuestionId":"2760","paidOnly":false,"topicTags":"Array;Sliding Window;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":32.18089667693727,"totalAccepted":54414,"totalSubmission":169090},{"questionId":"2873","title":"Prime Pairs With Target Sum","titleSlug":"prime-pairs-with-target-sum","isPaidOnly":false,"difficulty":"Medium","likes":415,"dislikes":34,"categoryTitle":"Algorithms","acRate":"37.8%","frontendQuestionId":"2761","paidOnly":false,"topicTags":"Array;Math;Enumeration;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.75391017100724,"totalAccepted":41373,"totalSubmission":109586},{"questionId":"2868","title":"Continuous Subarrays","titleSlug":"continuous-subarrays","isPaidOnly":false,"difficulty":"Medium","likes":1513,"dislikes":97,"categoryTitle":"Algorithms","acRate":"58.0%","frontendQuestionId":"2762","paidOnly":false,"topicTags":"Array;Queue;Sliding Window;Heap (Priority Queue);Ordered Set;Monotonic Queue;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":57.98498225131369,"totalAccepted":120389,"totalSubmission":207621},{"questionId":"2849","title":"Sum of Imbalance Numbers of All Subarrays","titleSlug":"sum-of-imbalance-numbers-of-all-subarrays","isPaidOnly":false,"difficulty":"Hard","likes":328,"dislikes":9,"categoryTitle":"Algorithms","acRate":"43.5%","frontendQuestionId":"2763","paidOnly":false,"topicTags":"Array;Hash Table;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":43.46072094738212,"totalAccepted":10019,"totalSubmission":23053},{"questionId":"2918","title":"Is Array a Preorder of Some ‌Binary Tree","titleSlug":"is-array-a-preorder-of-some-binary-tree","isPaidOnly":true,"difficulty":"Medium","likes":36,"dislikes":5,"categoryTitle":"Algorithms","acRate":"67.7%","frontendQuestionId":"2764","paidOnly":true,"topicTags":"Stack;Tree;Depth-First Search;Binary Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":67.74410774410774,"totalAccepted":2012,"totalSubmission":2970},{"questionId":"2870","title":"Longest Alternating Subarray","titleSlug":"longest-alternating-subarray","isPaidOnly":false,"difficulty":"Easy","likes":251,"dislikes":188,"categoryTitle":"Algorithms","acRate":"35.4%","frontendQuestionId":"2765","paidOnly":false,"topicTags":"Array;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":35.40100121546734,"totalAccepted":34368,"totalSubmission":97082},{"questionId":"2834","title":"Relocate Marbles","titleSlug":"relocate-marbles","isPaidOnly":false,"difficulty":"Medium","likes":213,"dislikes":19,"categoryTitle":"Algorithms","acRate":"51.6%","frontendQuestionId":"2766","paidOnly":false,"topicTags":"Array;Hash Table;Sorting;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":51.60685431586507,"totalAccepted":25870,"totalSubmission":50129},{"questionId":"2883","title":"Partition String Into Minimum Beautiful Substrings","titleSlug":"partition-string-into-minimum-beautiful-substrings","isPaidOnly":false,"difficulty":"Medium","likes":384,"dislikes":19,"categoryTitle":"Algorithms","acRate":"54.3%","frontendQuestionId":"2767","paidOnly":false,"topicTags":"Hash Table;String;Dynamic Programming;Backtracking;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":54.25412517611099,"totalAccepted":22720,"totalSubmission":41877},{"questionId":"2889","title":"Number of Black Blocks","titleSlug":"number-of-black-blocks","isPaidOnly":false,"difficulty":"Medium","likes":287,"dislikes":51,"categoryTitle":"Algorithms","acRate":"41.9%","frontendQuestionId":"2768","paidOnly":false,"topicTags":"Array;Hash Table;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":41.88807767574891,"totalAccepted":22261,"totalSubmission":53144},{"questionId":"2812","title":"Find the Maximum Achievable Number","titleSlug":"find-the-maximum-achievable-number","isPaidOnly":false,"difficulty":"Easy","likes":534,"dislikes":779,"categoryTitle":"Algorithms","acRate":"91.4%","frontendQuestionId":"2769","paidOnly":false,"topicTags":"Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":91.37768848670069,"totalAccepted":214674,"totalSubmission":234931},{"questionId":"2855","title":"Maximum Number of Jumps to Reach the Last Index","titleSlug":"maximum-number-of-jumps-to-reach-the-last-index","isPaidOnly":false,"difficulty":"Medium","likes":664,"dislikes":18,"categoryTitle":"Algorithms","acRate":"51.0%","frontendQuestionId":"2770","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":50.972315223163775,"totalAccepted":110378,"totalSubmission":216545},{"questionId":"2869","title":"Longest Non-decreasing Subarray From Two Arrays","titleSlug":"longest-non-decreasing-subarray-from-two-arrays","isPaidOnly":false,"difficulty":"Medium","likes":654,"dislikes":24,"categoryTitle":"Algorithms","acRate":"31.2%","frontendQuestionId":"2771","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":31.225339671055398,"totalAccepted":37116,"totalSubmission":118865},{"questionId":"2878","title":"Apply Operations to Make All Array Elements Equal to Zero","titleSlug":"apply-operations-to-make-all-array-elements-equal-to-zero","isPaidOnly":false,"difficulty":"Medium","likes":451,"dislikes":32,"categoryTitle":"Algorithms","acRate":"33.5%","frontendQuestionId":"2772","paidOnly":false,"topicTags":"Array;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":33.52986367940541,"totalAccepted":18767,"totalSubmission":55971},{"questionId":"2944","title":"Height of Special Binary Tree","titleSlug":"height-of-special-binary-tree","isPaidOnly":true,"difficulty":"Medium","likes":18,"dislikes":43,"categoryTitle":"Algorithms","acRate":"74.7%","frontendQuestionId":"2773","paidOnly":true,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Binary Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":74.713216957606,"totalAccepted":1498,"totalSubmission":2005},{"questionId":"2768","title":"Array Upper Bound","titleSlug":"array-upper-bound","isPaidOnly":true,"difficulty":"Easy","likes":23,"dislikes":2,"categoryTitle":"JavaScript","acRate":"82.4%","frontendQuestionId":"2774","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":82.40611961057024,"totalAccepted":2370,"totalSubmission":2876},{"questionId":"2781","title":"Undefined to Null","titleSlug":"undefined-to-null","isPaidOnly":true,"difficulty":"Medium","likes":15,"dislikes":1,"categoryTitle":"JavaScript","acRate":"72.1%","frontendQuestionId":"2775","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.05574912891987,"totalAccepted":1034,"totalSubmission":1435},{"questionId":"2782","title":"Convert Callback Based Function to Promise Based Function","titleSlug":"convert-callback-based-function-to-promise-based-function","isPaidOnly":true,"difficulty":"Medium","likes":19,"dislikes":12,"categoryTitle":"JavaScript","acRate":"90.5%","frontendQuestionId":"2776","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":90.50546448087432,"totalAccepted":1325,"totalSubmission":1464},{"questionId":"2799","title":"Date Range Generator","titleSlug":"date-range-generator","isPaidOnly":true,"difficulty":"Medium","likes":11,"dislikes":2,"categoryTitle":"JavaScript","acRate":"82.9%","frontendQuestionId":"2777","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":82.94051627384961,"totalAccepted":739,"totalSubmission":891},{"questionId":"2844","title":"Sum of Squares of Special Elements ","titleSlug":"sum-of-squares-of-special-elements","isPaidOnly":false,"difficulty":"Easy","likes":327,"dislikes":141,"categoryTitle":"Algorithms","acRate":"82.1%","frontendQuestionId":"2778","paidOnly":false,"topicTags":"Array;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":82.1467533083527,"totalAccepted":103914,"totalSubmission":126498},{"questionId":"2891","title":"Maximum Beauty of an Array After Applying Operation","titleSlug":"maximum-beauty-of-an-array-after-applying-operation","isPaidOnly":false,"difficulty":"Medium","likes":1283,"dislikes":48,"categoryTitle":"Algorithms","acRate":"58.4%","frontendQuestionId":"2779","paidOnly":false,"topicTags":"Array;Binary Search;Sliding Window;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.423863089245856,"totalAccepted":133481,"totalSubmission":228470},{"questionId":"2888","title":"Minimum Index of a Valid Split","titleSlug":"minimum-index-of-a-valid-split","isPaidOnly":false,"difficulty":"Medium","likes":823,"dislikes":47,"categoryTitle":"Algorithms","acRate":"75.5%","frontendQuestionId":"2780","paidOnly":false,"topicTags":"Array;Hash Table;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.49044778373481,"totalAccepted":149958,"totalSubmission":198645},{"questionId":"2884","title":"Length of the Longest Valid Substring","titleSlug":"length-of-the-longest-valid-substring","isPaidOnly":false,"difficulty":"Hard","likes":619,"dislikes":32,"categoryTitle":"Algorithms","acRate":"38.5%","frontendQuestionId":"2781","paidOnly":false,"topicTags":"Array;Hash Table;String;Sliding Window;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":38.51227519968638,"totalAccepted":39296,"totalSubmission":102035},{"questionId":"2995","title":"Number of Unique Categories","titleSlug":"number-of-unique-categories","isPaidOnly":true,"difficulty":"Medium","likes":35,"dislikes":4,"categoryTitle":"Algorithms","acRate":"83.9%","frontendQuestionId":"2782","paidOnly":true,"topicTags":"Union-Find;Interactive;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":83.9446366782007,"totalAccepted":3639,"totalSubmission":4335},{"questionId":"3002","title":"Flight Occupancy and Waitlist Analysis","titleSlug":"flight-occupancy-and-waitlist-analysis","isPaidOnly":true,"difficulty":"Medium","likes":21,"dislikes":8,"categoryTitle":"Database","acRate":"38.9%","frontendQuestionId":"2783","paidOnly":true,"topicTags":"Database;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":38.87749677223361,"totalAccepted":5119,"totalSubmission":13167},{"questionId":"2892","title":"Check if Array is Good","titleSlug":"check-if-array-is-good","isPaidOnly":false,"difficulty":"Easy","likes":476,"dislikes":71,"categoryTitle":"Algorithms","acRate":"57.2%","frontendQuestionId":"2784","paidOnly":false,"topicTags":"Array;Hash Table;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":57.23688021782088,"totalAccepted":177842,"totalSubmission":310713},{"questionId":"2887","title":"Sort Vowels in a String","titleSlug":"sort-vowels-in-a-string","isPaidOnly":false,"difficulty":"Medium","likes":1438,"dislikes":73,"categoryTitle":"Algorithms","acRate":"83.5%","frontendQuestionId":"2785","paidOnly":false,"topicTags":"String;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":83.46561269030128,"totalAccepted":313597,"totalSubmission":375720},{"questionId":"2893","title":"Visit Array Positions to Maximize Score","titleSlug":"visit-array-positions-to-maximize-score","isPaidOnly":false,"difficulty":"Medium","likes":541,"dislikes":34,"categoryTitle":"Algorithms","acRate":"37.7%","frontendQuestionId":"2786","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.721131486768904,"totalAccepted":25630,"totalSubmission":67945},{"questionId":"2882","title":"Ways to Express an Integer as Sum of Powers","titleSlug":"ways-to-express-an-integer-as-sum-of-powers","isPaidOnly":false,"difficulty":"Medium","likes":849,"dislikes":41,"categoryTitle":"Algorithms","acRate":"49.8%","frontendQuestionId":"2787","paidOnly":false,"topicTags":"Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.811006230334854,"totalAccepted":119524,"totalSubmission":239955},{"questionId":"2881","title":"Split Strings by Separator","titleSlug":"split-strings-by-separator","isPaidOnly":false,"difficulty":"Easy","likes":353,"dislikes":13,"categoryTitle":"Algorithms","acRate":"76.3%","frontendQuestionId":"2788","paidOnly":false,"topicTags":"Array;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":76.27843981903857,"totalAccepted":81099,"totalSubmission":106320},{"questionId":"2872","title":"Largest Element in an Array after Merge Operations","titleSlug":"largest-element-in-an-array-after-merge-operations","isPaidOnly":false,"difficulty":"Medium","likes":502,"dislikes":33,"categoryTitle":"Algorithms","acRate":"48.0%","frontendQuestionId":"2789","paidOnly":false,"topicTags":"Array;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":48.03259166405516,"totalAccepted":38318,"totalSubmission":79775},{"questionId":"2919","title":"Maximum Number of Groups With Increasing Length","titleSlug":"maximum-number-of-groups-with-increasing-length","isPaidOnly":false,"difficulty":"Hard","likes":422,"dislikes":44,"categoryTitle":"Algorithms","acRate":"23.2%","frontendQuestionId":"2790","paidOnly":false,"topicTags":"Array;Math;Binary Search;Greedy;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":23.183362195284403,"totalAccepted":13923,"totalSubmission":60056},{"questionId":"2905","title":"Count Paths That Can Form a Palindrome in a Tree","titleSlug":"count-paths-that-can-form-a-palindrome-in-a-tree","isPaidOnly":false,"difficulty":"Hard","likes":460,"dislikes":20,"categoryTitle":"Algorithms","acRate":"52.5%","frontendQuestionId":"2791","paidOnly":false,"topicTags":"Hash Table;Bit Manipulation;Tree;Depth-First Search;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":52.481901001073815,"totalAccepted":15151,"totalSubmission":28869},{"questionId":"3016","title":"Count Nodes That Are Great Enough","titleSlug":"count-nodes-that-are-great-enough","isPaidOnly":true,"difficulty":"Hard","likes":24,"dislikes":0,"categoryTitle":"Algorithms","acRate":"56.6%","frontendQuestionId":"2792","paidOnly":true,"topicTags":"Divide and Conquer;Tree;Depth-First Search;Binary Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":56.64717348927876,"totalAccepted":1453,"totalSubmission":2565},{"questionId":"3003","title":"Status of Flight Tickets","titleSlug":"status-of-flight-tickets","isPaidOnly":true,"difficulty":"Hard","likes":13,"dislikes":21,"categoryTitle":"Database","acRate":"79.7%","frontendQuestionId":"2793","paidOnly":true,"topicTags":"","hasSolution":false,"hasVideoSolution":false,"acRateRaw":79.6588486140725,"totalAccepted":3736,"totalSubmission":4690},{"questionId":"2861","title":"Create Object from Two Arrays","titleSlug":"create-object-from-two-arrays","isPaidOnly":true,"difficulty":"Easy","likes":11,"dislikes":3,"categoryTitle":"JavaScript","acRate":"65.1%","frontendQuestionId":"2794","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.13504033672396,"totalAccepted":1857,"totalSubmission":2851},{"questionId":"2898","title":"Parallel Execution of Promises for Individual Results Retrieval","titleSlug":"parallel-execution-of-promises-for-individual-results-retrieval","isPaidOnly":true,"difficulty":"Medium","likes":16,"dislikes":5,"categoryTitle":"JavaScript","acRate":"87.5%","frontendQuestionId":"2795","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":87.5,"totalAccepted":1120,"totalSubmission":1280},{"questionId":"2899","title":"Repeat String","titleSlug":"repeat-string","isPaidOnly":true,"difficulty":"Easy","likes":27,"dislikes":2,"categoryTitle":"JavaScript","acRate":"93.1%","frontendQuestionId":"2796","paidOnly":true,"topicTags":"","hasSolution":true,"hasVideoSolution":false,"acRateRaw":93.09202744263071,"totalAccepted":3935,"totalSubmission":4227},{"questionId":"2900","title":"Partial Function with Placeholders","titleSlug":"partial-function-with-placeholders","isPaidOnly":true,"difficulty":"Easy","likes":11,"dislikes":4,"categoryTitle":"JavaScript","acRate":"89.0%","frontendQuestionId":"2797","paidOnly":true,"topicTags":"","hasSolution":false,"hasVideoSolution":false,"acRateRaw":88.99402390438247,"totalAccepted":1787,"totalSubmission":2008},{"questionId":"2876","title":"Number of Employees Who Met the Target","titleSlug":"number-of-employees-who-met-the-target","isPaidOnly":false,"difficulty":"Easy","likes":615,"dislikes":78,"categoryTitle":"Algorithms","acRate":"87.9%","frontendQuestionId":"2798","paidOnly":false,"topicTags":"Array;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":87.8683822986704,"totalAccepted":250004,"totalSubmission":284521},{"questionId":"2856","title":"Count Complete Subarrays in an Array","titleSlug":"count-complete-subarrays-in-an-array","isPaidOnly":false,"difficulty":"Medium","likes":1147,"dislikes":28,"categoryTitle":"Algorithms","acRate":"76.0%","frontendQuestionId":"2799","paidOnly":false,"topicTags":"Array;Hash Table;Sliding Window;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":76.00119113828153,"totalAccepted":173551,"totalSubmission":228353},{"questionId":"2877","title":"Shortest String That Contains Three Strings","titleSlug":"shortest-string-that-contains-three-strings","isPaidOnly":false,"difficulty":"Medium","likes":374,"dislikes":296,"categoryTitle":"Algorithms","acRate":"31.9%","frontendQuestionId":"2800","paidOnly":false,"topicTags":"String;Greedy;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":31.875552697162153,"totalAccepted":19825,"totalSubmission":62195},{"questionId":"3374","title":"Count Alternating Subarrays","titleSlug":"count-alternating-subarrays","isPaidOnly":false,"difficulty":"Medium","likes":246,"dislikes":10,"categoryTitle":"Algorithms","acRate":"57.5%","frontendQuestionId":"3101","paidOnly":false,"topicTags":"Array;Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":57.501157682632254,"totalAccepted":45944,"totalSubmission":79901},{"questionId":"3344","title":"Minimize Manhattan Distances","titleSlug":"minimize-manhattan-distances","isPaidOnly":false,"difficulty":"Hard","likes":187,"dislikes":15,"categoryTitle":"Algorithms","acRate":"33.0%","frontendQuestionId":"3102","paidOnly":false,"topicTags":"Array;Math;Geometry;Sorting;Ordered Set;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":32.952612393681655,"totalAccepted":10848,"totalSubmission":32920},{"questionId":"3409","title":"Find Trending Hashtags II ","titleSlug":"find-trending-hashtags-ii","isPaidOnly":true,"difficulty":"Hard","likes":11,"dislikes":2,"categoryTitle":"Database","acRate":"66.9%","frontendQuestionId":"3103","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":66.88051323175621,"totalAccepted":1668,"totalSubmission":2494},{"questionId":"3410","title":"Find Longest Self-Contained Substring","titleSlug":"find-longest-self-contained-substring","isPaidOnly":true,"difficulty":"Hard","likes":19,"dislikes":6,"categoryTitle":"Algorithms","acRate":"58.6%","frontendQuestionId":"3104","paidOnly":true,"topicTags":"Hash Table;String;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":58.60411459334743,"totalAccepted":3048,"totalSubmission":5201},{"questionId":"3372","title":"Longest Strictly Increasing or Strictly Decreasing Subarray","titleSlug":"longest-strictly-increasing-or-strictly-decreasing-subarray","isPaidOnly":false,"difficulty":"Easy","likes":667,"dislikes":34,"categoryTitle":"Algorithms","acRate":"64.9%","frontendQuestionId":"3105","paidOnly":false,"topicTags":"Array;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.93006703633203,"totalAccepted":219673,"totalSubmission":338323},{"questionId":"3346","title":"Lexicographically Smallest String After Operations With Constraint","titleSlug":"lexicographically-smallest-string-after-operations-with-constraint","isPaidOnly":false,"difficulty":"Medium","likes":165,"dislikes":28,"categoryTitle":"Algorithms","acRate":"62.9%","frontendQuestionId":"3106","paidOnly":false,"topicTags":"String;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":62.85429395790902,"totalAccepted":29627,"totalSubmission":47136},{"questionId":"3387","title":"Minimum Operations to Make Median of Array Equal to K","titleSlug":"minimum-operations-to-make-median-of-array-equal-to-k","isPaidOnly":false,"difficulty":"Medium","likes":167,"dislikes":187,"categoryTitle":"Algorithms","acRate":"48.0%","frontendQuestionId":"3107","paidOnly":false,"topicTags":"Array;Greedy;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":47.994750335734345,"totalAccepted":31450,"totalSubmission":65528},{"questionId":"3348","title":"Minimum Cost Walk in Weighted Graph","titleSlug":"minimum-cost-walk-in-weighted-graph","isPaidOnly":false,"difficulty":"Hard","likes":792,"dislikes":43,"categoryTitle":"Algorithms","acRate":"68.2%","frontendQuestionId":"3108","paidOnly":false,"topicTags":"Array;Bit Manipulation;Union-Find;Graph Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":68.22908039093261,"totalAccepted":107091,"totalSubmission":156958},{"questionId":"3417","title":"Find the Index of Permutation","titleSlug":"find-the-index-of-permutation","isPaidOnly":true,"difficulty":"Medium","likes":16,"dislikes":5,"categoryTitle":"Algorithms","acRate":"37.1%","frontendQuestionId":"3109","paidOnly":true,"topicTags":"Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.07957342083675,"totalAccepted":904,"totalSubmission":2438},{"questionId":"3379","title":"Score of a String","titleSlug":"score-of-a-string","isPaidOnly":false,"difficulty":"Easy","likes":863,"dislikes":52,"categoryTitle":"Algorithms","acRate":"91.4%","frontendQuestionId":"3110","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":91.35091855523937,"totalAccepted":452947,"totalSubmission":495832},{"questionId":"3390","title":"Minimum Rectangles to Cover Points","titleSlug":"minimum-rectangles-to-cover-points","isPaidOnly":false,"difficulty":"Medium","likes":111,"dislikes":8,"categoryTitle":"Algorithms","acRate":"63.9%","frontendQuestionId":"3111","paidOnly":false,"topicTags":"Array;Greedy;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":63.924438654303,"totalAccepted":33366,"totalSubmission":52196},{"questionId":"3389","title":"Minimum Time to Visit Disappearing Nodes","titleSlug":"minimum-time-to-visit-disappearing-nodes","isPaidOnly":false,"difficulty":"Medium","likes":223,"dislikes":25,"categoryTitle":"Algorithms","acRate":"37.9%","frontendQuestionId":"3112","paidOnly":false,"topicTags":"Array;Graph Theory;Heap (Priority Queue);Shortest Path;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.92170950594536,"totalAccepted":28607,"totalSubmission":75437},{"questionId":"3382","title":"Find the Number of Subarrays Where Boundary Elements Are Maximum","titleSlug":"find-the-number-of-subarrays-where-boundary-elements-are-maximum","isPaidOnly":false,"difficulty":"Hard","likes":266,"dislikes":6,"categoryTitle":"Algorithms","acRate":"33.5%","frontendQuestionId":"3113","paidOnly":false,"topicTags":"Array;Binary Search;Stack;Monotonic Stack;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":33.47187340252928,"totalAccepted":15060,"totalSubmission":44993},{"questionId":"3361","title":"Latest Time You Can Obtain After Replacing Characters","titleSlug":"latest-time-you-can-obtain-after-replacing-characters","isPaidOnly":false,"difficulty":"Easy","likes":120,"dislikes":51,"categoryTitle":"Algorithms","acRate":"35.3%","frontendQuestionId":"3114","paidOnly":false,"topicTags":"String;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":35.333778314759584,"totalAccepted":41820,"totalSubmission":118357},{"questionId":"3373","title":"Maximum Prime Difference","titleSlug":"maximum-prime-difference","isPaidOnly":false,"difficulty":"Medium","likes":131,"dislikes":16,"categoryTitle":"Algorithms","acRate":"59.1%","frontendQuestionId":"3115","paidOnly":false,"topicTags":"Array;Math;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":59.118830517453205,"totalAccepted":52450,"totalSubmission":88720},{"questionId":"3375","title":"Kth Smallest Amount With Single Denomination Combination","titleSlug":"kth-smallest-amount-with-single-denomination-combination","isPaidOnly":false,"difficulty":"Hard","likes":256,"dislikes":19,"categoryTitle":"Algorithms","acRate":"20.3%","frontendQuestionId":"3116","paidOnly":false,"topicTags":"Array;Math;Binary Search;Bit Manipulation;Combinatorics;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":20.26912660798917,"totalAccepted":11975,"totalSubmission":59080},{"questionId":"3364","title":"Minimum Sum of Values by Dividing Array","titleSlug":"minimum-sum-of-values-by-dividing-array","isPaidOnly":false,"difficulty":"Hard","likes":149,"dislikes":4,"categoryTitle":"Algorithms","acRate":"28.2%","frontendQuestionId":"3117","paidOnly":false,"topicTags":"Array;Binary Search;Dynamic Programming;Bit Manipulation;Segment Tree;Queue;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":28.229609586393504,"totalAccepted":7303,"totalSubmission":25870},{"questionId":"3424","title":"Friday Purchase III ","titleSlug":"friday-purchase-iii","isPaidOnly":true,"difficulty":"Medium","likes":6,"dislikes":7,"categoryTitle":"Database","acRate":"55.6%","frontendQuestionId":"3118","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":55.56049822064056,"totalAccepted":2498,"totalSubmission":4496},{"questionId":"3425","title":"Maximum Number of Potholes That Can Be Fixed","titleSlug":"maximum-number-of-potholes-that-can-be-fixed","isPaidOnly":true,"difficulty":"Medium","likes":21,"dislikes":3,"categoryTitle":"Algorithms","acRate":"53.7%","frontendQuestionId":"3119","paidOnly":true,"topicTags":"String;Greedy;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.671373555840816,"totalAccepted":4181,"totalSubmission":7790},{"questionId":"3408","title":"Count the Number of Special Characters I","titleSlug":"count-the-number-of-special-characters-i","isPaidOnly":false,"difficulty":"Easy","likes":389,"dislikes":12,"categoryTitle":"Algorithms","acRate":"77.3%","frontendQuestionId":"3120","paidOnly":false,"topicTags":"Hash Table;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":77.25690866139236,"totalAccepted":194913,"totalSubmission":252292},{"questionId":"3405","title":"Count the Number of Special Characters II","titleSlug":"count-the-number-of-special-characters-ii","isPaidOnly":false,"difficulty":"Medium","likes":462,"dislikes":24,"categoryTitle":"Algorithms","acRate":"60.4%","frontendQuestionId":"3121","paidOnly":false,"topicTags":"Hash Table;String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":60.36164300400741,"totalAccepted":167043,"totalSubmission":276737},{"questionId":"3404","title":"Minimum Number of Operations to Satisfy Conditions","titleSlug":"minimum-number-of-operations-to-satisfy-conditions","isPaidOnly":false,"difficulty":"Medium","likes":298,"dislikes":13,"categoryTitle":"Algorithms","acRate":"42.2%","frontendQuestionId":"3122","paidOnly":false,"topicTags":"Array;Dynamic Programming;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":42.2426742832963,"totalAccepted":19966,"totalSubmission":47265},{"questionId":"3386","title":"Find Edges in Shortest Paths","titleSlug":"find-edges-in-shortest-paths","isPaidOnly":false,"difficulty":"Hard","likes":321,"dislikes":5,"categoryTitle":"Algorithms","acRate":"46.8%","frontendQuestionId":"3123","paidOnly":false,"topicTags":"Depth-First Search;Breadth-First Search;Graph Theory;Heap (Priority Queue);Shortest Path;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":46.75803777814098,"totalAccepted":20025,"totalSubmission":42828},{"questionId":"3432","title":"Find Longest Calls","titleSlug":"find-longest-calls","isPaidOnly":true,"difficulty":"Medium","likes":7,"dislikes":5,"categoryTitle":"Database","acRate":"64.1%","frontendQuestionId":"3124","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.10153907655408,"totalAccepted":3207,"totalSubmission":5003},{"questionId":"3433","title":"Maximum Number That Makes Result of Bitwise AND Zero","titleSlug":"maximum-number-that-makes-result-of-bitwise-and-zero","isPaidOnly":true,"difficulty":"Medium","likes":12,"dislikes":2,"categoryTitle":"Algorithms","acRate":"70.0%","frontendQuestionId":"3125","paidOnly":true,"topicTags":"String;Greedy;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":69.98476383951244,"totalAccepted":1378,"totalSubmission":1969},{"questionId":"3440","title":"Server Utilization Time","titleSlug":"server-utilization-time","isPaidOnly":true,"difficulty":"Medium","likes":11,"dislikes":16,"categoryTitle":"Database","acRate":"60.9%","frontendQuestionId":"3126","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":60.8740465883323,"totalAccepted":2953,"totalSubmission":4851},{"questionId":"3398","title":"Make a Square with the Same Color","titleSlug":"make-a-square-with-the-same-color","isPaidOnly":false,"difficulty":"Easy","likes":94,"dislikes":12,"categoryTitle":"Algorithms","acRate":"53.2%","frontendQuestionId":"3127","paidOnly":false,"topicTags":"Array;Matrix;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.20624980814686,"totalAccepted":34666,"totalSubmission":65154},{"questionId":"3388","title":"Right Triangles","titleSlug":"right-triangles","isPaidOnly":false,"difficulty":"Medium","likes":136,"dislikes":24,"categoryTitle":"Algorithms","acRate":"48.8%","frontendQuestionId":"3128","paidOnly":false,"topicTags":"Array;Hash Table;Math;Combinatorics;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":48.84160946840845,"totalAccepted":24265,"totalSubmission":49681},{"questionId":"3406","title":"Find All Possible Stable Binary Arrays I","titleSlug":"find-all-possible-stable-binary-arrays-i","isPaidOnly":false,"difficulty":"Medium","likes":502,"dislikes":188,"categoryTitle":"Algorithms","acRate":"53.6%","frontendQuestionId":"3129","paidOnly":false,"topicTags":"Dynamic Programming;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":53.62922216152064,"totalAccepted":85404,"totalSubmission":159249},{"questionId":"3407","title":"Find All Possible Stable Binary Arrays II","titleSlug":"find-all-possible-stable-binary-arrays-ii","isPaidOnly":false,"difficulty":"Hard","likes":266,"dislikes":30,"categoryTitle":"Algorithms","acRate":"58.9%","frontendQuestionId":"3130","paidOnly":false,"topicTags":"Dynamic Programming;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":58.86618268123277,"totalAccepted":67463,"totalSubmission":114604},{"questionId":"3397","title":"Find the Integer Added to Array I","titleSlug":"find-the-integer-added-to-array-i","isPaidOnly":false,"difficulty":"Easy","likes":173,"dislikes":12,"categoryTitle":"Algorithms","acRate":"83.0%","frontendQuestionId":"3131","paidOnly":false,"topicTags":"Array;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":82.9635421757404,"totalAccepted":84880,"totalSubmission":102310},{"questionId":"3399","title":"Find the Integer Added to Array II","titleSlug":"find-the-integer-added-to-array-ii","isPaidOnly":false,"difficulty":"Medium","likes":181,"dislikes":44,"categoryTitle":"Algorithms","acRate":"33.0%","frontendQuestionId":"3132","paidOnly":false,"topicTags":"Array;Two Pointers;Sorting;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":33.04795799009482,"totalAccepted":26558,"totalSubmission":80362},{"questionId":"3394","title":"Minimum Array End","titleSlug":"minimum-array-end","isPaidOnly":false,"difficulty":"Medium","likes":822,"dislikes":100,"categoryTitle":"Algorithms","acRate":"55.4%","frontendQuestionId":"3133","paidOnly":false,"topicTags":"Bit Manipulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":55.44644462648098,"totalAccepted":111006,"totalSubmission":200204},{"questionId":"3362","title":"Find the Median of the Uniqueness Array","titleSlug":"find-the-median-of-the-uniqueness-array","isPaidOnly":false,"difficulty":"Hard","likes":179,"dislikes":13,"categoryTitle":"Algorithms","acRate":"30.2%","frontendQuestionId":"3134","paidOnly":false,"topicTags":"Array;Hash Table;Binary Search;Sliding Window;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":30.197153330471256,"totalAccepted":9144,"totalSubmission":30281},{"questionId":"3441","title":"Equalize Strings by Adding or Removing Characters at Ends","titleSlug":"equalize-strings-by-adding-or-removing-characters-at-ends","isPaidOnly":true,"difficulty":"Medium","likes":16,"dislikes":2,"categoryTitle":"Algorithms","acRate":"56.3%","frontendQuestionId":"3135","paidOnly":true,"topicTags":"String;Binary Search;Dynamic Programming;Sliding Window;Hash Function;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":56.339084771192795,"totalAccepted":1502,"totalSubmission":2666},{"questionId":"3396","title":"Valid Word","titleSlug":"valid-word","isPaidOnly":false,"difficulty":"Easy","likes":483,"dislikes":170,"categoryTitle":"Algorithms","acRate":"50.9%","frontendQuestionId":"3136","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":50.87611636921076,"totalAccepted":209749,"totalSubmission":412270},{"questionId":"3384","title":"Minimum Number of Operations to Make Word K-Periodic","titleSlug":"minimum-number-of-operations-to-make-word-k-periodic","isPaidOnly":false,"difficulty":"Medium","likes":123,"dislikes":13,"categoryTitle":"Algorithms","acRate":"60.8%","frontendQuestionId":"3137","paidOnly":false,"topicTags":"Hash Table;String;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":60.809265689845006,"totalAccepted":28719,"totalSubmission":47228},{"questionId":"3395","title":"Minimum Length of Anagram Concatenation","titleSlug":"minimum-length-of-anagram-concatenation","isPaidOnly":false,"difficulty":"Medium","likes":204,"dislikes":104,"categoryTitle":"Algorithms","acRate":"39.9%","frontendQuestionId":"3138","paidOnly":false,"topicTags":"Hash Table;String;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":39.875338500326826,"totalAccepted":34162,"totalSubmission":85672},{"questionId":"3402","title":"Minimum Cost to Equalize Array","titleSlug":"minimum-cost-to-equalize-array","isPaidOnly":false,"difficulty":"Hard","likes":150,"dislikes":24,"categoryTitle":"Algorithms","acRate":"18.9%","frontendQuestionId":"3139","paidOnly":false,"topicTags":"Array;Greedy;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":18.902948721644137,"totalAccepted":6558,"totalSubmission":34693},{"questionId":"3448","title":"Consecutive Available Seats II","titleSlug":"consecutive-available-seats-ii","isPaidOnly":true,"difficulty":"Medium","likes":13,"dislikes":2,"categoryTitle":"Database","acRate":"55.5%","frontendQuestionId":"3140","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":55.49410029498525,"totalAccepted":3010,"totalSubmission":5424},{"questionId":"3449","title":"Maximum Hamming Distances","titleSlug":"maximum-hamming-distances","isPaidOnly":true,"difficulty":"Hard","likes":15,"dislikes":2,"categoryTitle":"Algorithms","acRate":"49.4%","frontendQuestionId":"3141","paidOnly":true,"topicTags":"Array;Bit Manipulation;Breadth-First Search;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":49.43651389932381,"totalAccepted":658,"totalSubmission":1331},{"questionId":"3415","title":"Check if Grid Satisfies Conditions","titleSlug":"check-if-grid-satisfies-conditions","isPaidOnly":false,"difficulty":"Easy","likes":118,"dislikes":6,"categoryTitle":"Algorithms","acRate":"45.6%","frontendQuestionId":"3142","paidOnly":false,"topicTags":"Array;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":45.58167933012871,"totalAccepted":47033,"totalSubmission":103184},{"questionId":"3419","title":"Maximum Points Inside the Square","titleSlug":"maximum-points-inside-the-square","isPaidOnly":false,"difficulty":"Medium","likes":178,"dislikes":24,"categoryTitle":"Algorithms","acRate":"39.7%","frontendQuestionId":"3143","paidOnly":false,"topicTags":"Array;Hash Table;String;Binary Search;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":39.723517352733076,"totalAccepted":21896,"totalSubmission":55121},{"questionId":"3403","title":"Minimum Substring Partition of Equal Character Frequency","titleSlug":"minimum-substring-partition-of-equal-character-frequency","isPaidOnly":false,"difficulty":"Medium","likes":179,"dislikes":36,"categoryTitle":"Algorithms","acRate":"40.3%","frontendQuestionId":"3144","paidOnly":false,"topicTags":"Hash Table;String;Dynamic Programming;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.3342787243716,"totalAccepted":18630,"totalSubmission":46189},{"questionId":"3411","title":"Find Products of Elements of Big Array","titleSlug":"find-products-of-elements-of-big-array","isPaidOnly":false,"difficulty":"Hard","likes":62,"dislikes":18,"categoryTitle":"Algorithms","acRate":"24.9%","frontendQuestionId":"3145","paidOnly":false,"topicTags":"Array;Binary Search;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":24.86653771760155,"totalAccepted":3214,"totalSubmission":12925},{"questionId":"3412","title":"Permutation Difference between Two Strings","titleSlug":"permutation-difference-between-two-strings","isPaidOnly":false,"difficulty":"Easy","likes":196,"dislikes":17,"categoryTitle":"Algorithms","acRate":"87.9%","frontendQuestionId":"3146","paidOnly":false,"topicTags":"Hash Table;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":87.87063245325044,"totalAccepted":113622,"totalSubmission":129306},{"questionId":"3383","title":"Taking Maximum Energy From the Mystic Dungeon","titleSlug":"taking-maximum-energy-from-the-mystic-dungeon","isPaidOnly":false,"difficulty":"Medium","likes":594,"dislikes":40,"categoryTitle":"Algorithms","acRate":"61.0%","frontendQuestionId":"3147","paidOnly":false,"topicTags":"Array;Dynamic Programming;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.026674277340916,"totalAccepted":143266,"totalSubmission":234759},{"questionId":"3391","title":"Maximum Difference Score in a Grid","titleSlug":"maximum-difference-score-in-a-grid","isPaidOnly":false,"difficulty":"Medium","likes":289,"dislikes":23,"categoryTitle":"Algorithms","acRate":"48.2%","frontendQuestionId":"3148","paidOnly":false,"topicTags":"Array;Dynamic Programming;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":48.190191880904216,"totalAccepted":24537,"totalSubmission":50917},{"questionId":"3431","title":"Find the Minimum Cost Array Permutation","titleSlug":"find-the-minimum-cost-array-permutation","isPaidOnly":false,"difficulty":"Hard","likes":151,"dislikes":8,"categoryTitle":"Algorithms","acRate":"25.9%","frontendQuestionId":"3149","paidOnly":false,"topicTags":"Array;Dynamic Programming;Bit Manipulation;Bitmask;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":25.89416952474277,"totalAccepted":7399,"totalSubmission":28574},{"questionId":"3457","title":"Invalid Tweets II","titleSlug":"invalid-tweets-ii","isPaidOnly":true,"difficulty":"Easy","likes":18,"dislikes":3,"categoryTitle":"Database","acRate":"85.0%","frontendQuestionId":"3150","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":85.01026694045176,"totalAccepted":4140,"totalSubmission":4870},{"questionId":"3429","title":"Special Array I","titleSlug":"special-array-i","isPaidOnly":false,"difficulty":"Easy","likes":586,"dislikes":33,"categoryTitle":"Algorithms","acRate":"81.6%","frontendQuestionId":"3151","paidOnly":false,"topicTags":"Array;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":81.62740528746005,"totalAccepted":264112,"totalSubmission":323558},{"questionId":"3427","title":"Special Array II","titleSlug":"special-array-ii","isPaidOnly":false,"difficulty":"Medium","likes":916,"dislikes":67,"categoryTitle":"Algorithms","acRate":"45.8%","frontendQuestionId":"3152","paidOnly":false,"topicTags":"Array;Binary Search;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.80180120740277,"totalAccepted":138839,"totalSubmission":303130},{"questionId":"3416","title":"Sum of Digit Differences of All Pairs","titleSlug":"sum-of-digit-differences-of-all-pairs","isPaidOnly":false,"difficulty":"Medium","likes":228,"dislikes":20,"categoryTitle":"Algorithms","acRate":"43.1%","frontendQuestionId":"3153","paidOnly":false,"topicTags":"Array;Hash Table;Math;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":43.1463073305152,"totalAccepted":29906,"totalSubmission":69313},{"questionId":"3414","title":"Find Number of Ways to Reach the K-th Stair","titleSlug":"find-number-of-ways-to-reach-the-k-th-stair","isPaidOnly":false,"difficulty":"Hard","likes":201,"dislikes":13,"categoryTitle":"Algorithms","acRate":"37.8%","frontendQuestionId":"3154","paidOnly":false,"topicTags":"Math;Dynamic Programming;Bit Manipulation;Memoization;Combinatorics;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.817092576991485,"totalAccepted":16160,"totalSubmission":42732},{"questionId":"3458","title":"Maximum Number of Upgradable Servers","titleSlug":"maximum-number-of-upgradable-servers","isPaidOnly":true,"difficulty":"Medium","likes":21,"dislikes":2,"categoryTitle":"Algorithms","acRate":"43.6%","frontendQuestionId":"3155","paidOnly":true,"topicTags":"Array;Math;Binary Search;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":43.55835806132542,"totalAccepted":3523,"totalSubmission":8088},{"questionId":"3465","title":"Employee Task Duration and Concurrent Tasks","titleSlug":"employee-task-duration-and-concurrent-tasks","isPaidOnly":true,"difficulty":"Hard","likes":13,"dislikes":2,"categoryTitle":"Database","acRate":"40.1%","frontendQuestionId":"3156","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.05119851058878,"totalAccepted":1721,"totalSubmission":4297},{"questionId":"3467","title":"Find the Level of Tree with Minimum Sum","titleSlug":"find-the-level-of-tree-with-minimum-sum","isPaidOnly":true,"difficulty":"Medium","likes":19,"dislikes":3,"categoryTitle":"Algorithms","acRate":"69.4%","frontendQuestionId":"3157","paidOnly":true,"topicTags":"Tree;Depth-First Search;Breadth-First Search;Binary Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":69.37888198757764,"totalAccepted":3351,"totalSubmission":4830},{"questionId":"3428","title":"Find the XOR of Numbers Which Appear Twice","titleSlug":"find-the-xor-of-numbers-which-appear-twice","isPaidOnly":false,"difficulty":"Easy","likes":173,"dislikes":14,"categoryTitle":"Algorithms","acRate":"79.0%","frontendQuestionId":"3158","paidOnly":false,"topicTags":"Array;Hash Table;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":79.03498095873739,"totalAccepted":80524,"totalSubmission":101884},{"questionId":"3420","title":"Find Occurrences of an Element in an Array","titleSlug":"find-occurrences-of-an-element-in-an-array","isPaidOnly":false,"difficulty":"Medium","likes":187,"dislikes":26,"categoryTitle":"Algorithms","acRate":"73.5%","frontendQuestionId":"3159","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":73.49229968908408,"totalAccepted":60748,"totalSubmission":82659},{"questionId":"3434","title":"Find the Number of Distinct Colors Among the Balls","titleSlug":"find-the-number-of-distinct-colors-among-the-balls","isPaidOnly":false,"difficulty":"Medium","likes":768,"dislikes":94,"categoryTitle":"Algorithms","acRate":"54.2%","frontendQuestionId":"3160","paidOnly":false,"topicTags":"Array;Hash Table;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":54.15316595610295,"totalAccepted":171476,"totalSubmission":316650},{"questionId":"3435","title":"Block Placement Queries","titleSlug":"block-placement-queries","isPaidOnly":false,"difficulty":"Hard","likes":328,"dislikes":47,"categoryTitle":"Algorithms","acRate":"41.5%","frontendQuestionId":"3161","paidOnly":false,"topicTags":"Array;Binary Search;Binary Indexed Tree;Segment Tree;Ordered Set;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":41.46515205002774,"totalAccepted":65775,"totalSubmission":158629},{"questionId":"3446","title":"Find the Number of Good Pairs I","titleSlug":"find-the-number-of-good-pairs-i","isPaidOnly":false,"difficulty":"Easy","likes":174,"dislikes":16,"categoryTitle":"Algorithms","acRate":"86.5%","frontendQuestionId":"3162","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":86.48168876141173,"totalAccepted":98897,"totalSubmission":114356},{"questionId":"3451","title":"String Compression III","titleSlug":"string-compression-iii","isPaidOnly":false,"difficulty":"Medium","likes":637,"dislikes":54,"categoryTitle":"Algorithms","acRate":"67.1%","frontendQuestionId":"3163","paidOnly":false,"topicTags":"String;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":67.0752604867672,"totalAccepted":204326,"totalSubmission":304622},{"questionId":"3444","title":"Find the Number of Good Pairs II","titleSlug":"find-the-number-of-good-pairs-ii","isPaidOnly":false,"difficulty":"Medium","likes":257,"dislikes":40,"categoryTitle":"Algorithms","acRate":"26.7%","frontendQuestionId":"3164","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":26.724522776378993,"totalAccepted":29931,"totalSubmission":112001},{"questionId":"3423","title":"Maximum Sum of Subsequence With Non-adjacent Elements","titleSlug":"maximum-sum-of-subsequence-with-non-adjacent-elements","isPaidOnly":false,"difficulty":"Hard","likes":160,"dislikes":32,"categoryTitle":"Algorithms","acRate":"15.9%","frontendQuestionId":"3165","paidOnly":false,"topicTags":"Array;Divide and Conquer;Dynamic Programming;Segment Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":15.85421332586786,"totalAccepted":9061,"totalSubmission":57152},{"questionId":"3473","title":"Calculate Parking Fees and Duration","titleSlug":"calculate-parking-fees-and-duration","isPaidOnly":true,"difficulty":"Medium","likes":15,"dislikes":5,"categoryTitle":"Database","acRate":"53.5%","frontendQuestionId":"3166","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.496838474803596,"totalAccepted":2792,"totalSubmission":5219},{"questionId":"3474","title":"Better Compression of String","titleSlug":"better-compression-of-string","isPaidOnly":true,"difficulty":"Medium","likes":19,"dislikes":4,"categoryTitle":"Algorithms","acRate":"75.3%","frontendQuestionId":"3167","paidOnly":true,"topicTags":"Hash Table;String;Sorting;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":75.25410967499059,"totalAccepted":5997,"totalSubmission":7969},{"questionId":"3426","title":"Minimum Number of Chairs in a Waiting Room","titleSlug":"minimum-number-of-chairs-in-a-waiting-room","isPaidOnly":false,"difficulty":"Easy","likes":160,"dislikes":15,"categoryTitle":"Algorithms","acRate":"79.4%","frontendQuestionId":"3168","paidOnly":false,"topicTags":"String;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":79.42164916750868,"totalAccepted":72314,"totalSubmission":91051},{"questionId":"3430","title":"Count Days Without Meetings","titleSlug":"count-days-without-meetings","isPaidOnly":false,"difficulty":"Medium","likes":792,"dislikes":19,"categoryTitle":"Algorithms","acRate":"48.2%","frontendQuestionId":"3169","paidOnly":false,"topicTags":"Array;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":48.16774277701689,"totalAccepted":184639,"totalSubmission":383325},{"questionId":"3445","title":"Lexicographically Minimum String After Removing Stars","titleSlug":"lexicographically-minimum-string-after-removing-stars","isPaidOnly":false,"difficulty":"Medium","likes":596,"dislikes":89,"categoryTitle":"Algorithms","acRate":"50.9%","frontendQuestionId":"3170","paidOnly":false,"topicTags":"Hash Table;String;Stack;Greedy;Heap (Priority Queue);","hasSolution":true,"hasVideoSolution":false,"acRateRaw":50.94883090477804,"totalAccepted":120280,"totalSubmission":236080},{"questionId":"3436","title":"Find Subarray With Bitwise OR Closest to K","titleSlug":"find-subarray-with-bitwise-or-closest-to-k","isPaidOnly":false,"difficulty":"Hard","likes":214,"dislikes":8,"categoryTitle":"Algorithms","acRate":"31.2%","frontendQuestionId":"3171","paidOnly":false,"topicTags":"Array;Binary Search;Bit Manipulation;Segment Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":31.206987308209698,"totalAccepted":16007,"totalSubmission":51293},{"questionId":"3481","title":"Second Day Verification","titleSlug":"second-day-verification","isPaidOnly":true,"difficulty":"Easy","likes":11,"dislikes":1,"categoryTitle":"Database","acRate":"67.1%","frontendQuestionId":"3172","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":67.05340385599727,"totalAccepted":3930,"totalSubmission":5861},{"questionId":"3472","title":"Bitwise OR of Adjacent Elements","titleSlug":"bitwise-or-of-adjacent-elements","isPaidOnly":true,"difficulty":"Easy","likes":24,"dislikes":2,"categoryTitle":"Algorithms","acRate":"94.8%","frontendQuestionId":"3173","paidOnly":true,"topicTags":"Array;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":94.82855536818437,"totalAccepted":6748,"totalSubmission":7116},{"questionId":"3447","title":"Clear Digits","titleSlug":"clear-digits","isPaidOnly":false,"difficulty":"Easy","likes":709,"dislikes":27,"categoryTitle":"Algorithms","acRate":"82.8%","frontendQuestionId":"3174","paidOnly":false,"topicTags":"String;Stack;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":82.75511537735439,"totalAccepted":284930,"totalSubmission":344305},{"questionId":"3413","title":"Find The First Player to win K Games in a Row","titleSlug":"find-the-first-player-to-win-k-games-in-a-row","isPaidOnly":false,"difficulty":"Medium","likes":141,"dislikes":16,"categoryTitle":"Algorithms","acRate":"40.3%","frontendQuestionId":"3175","paidOnly":false,"topicTags":"Array;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.32963080042294,"totalAccepted":36998,"totalSubmission":91739},{"questionId":"3456","title":"Find the Maximum Length of a Good Subsequence I","titleSlug":"find-the-maximum-length-of-a-good-subsequence-i","isPaidOnly":false,"difficulty":"Medium","likes":170,"dislikes":100,"categoryTitle":"Algorithms","acRate":"32.9%","frontendQuestionId":"3176","paidOnly":false,"topicTags":"Array;Hash Table;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":32.88131410080623,"totalAccepted":23981,"totalSubmission":72932},{"questionId":"3452","title":"Find the Maximum Length of a Good Subsequence II","titleSlug":"find-the-maximum-length-of-a-good-subsequence-ii","isPaidOnly":false,"difficulty":"Hard","likes":143,"dislikes":10,"categoryTitle":"Algorithms","acRate":"25.3%","frontendQuestionId":"3177","paidOnly":false,"topicTags":"Array;Hash Table;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":25.331520763331365,"totalAccepted":9876,"totalSubmission":38987},{"questionId":"3450","title":"Find the Child Who Has the Ball After K Seconds","titleSlug":"find-the-child-who-has-the-ball-after-k-seconds","isPaidOnly":false,"difficulty":"Easy","likes":186,"dislikes":11,"categoryTitle":"Algorithms","acRate":"62.1%","frontendQuestionId":"3178","paidOnly":false,"topicTags":"Math;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":62.10620231356141,"totalAccepted":60561,"totalSubmission":97512},{"questionId":"3422","title":"Find the N-th Value After K Seconds","titleSlug":"find-the-n-th-value-after-k-seconds","isPaidOnly":false,"difficulty":"Medium","likes":128,"dislikes":21,"categoryTitle":"Algorithms","acRate":"54.0%","frontendQuestionId":"3179","paidOnly":false,"topicTags":"Array;Math;Simulation;Combinatorics;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":54.01966520955954,"totalAccepted":47083,"totalSubmission":87159},{"questionId":"3442","title":"Maximum Total Reward Using Operations I","titleSlug":"maximum-total-reward-using-operations-i","isPaidOnly":false,"difficulty":"Medium","likes":220,"dislikes":18,"categoryTitle":"Algorithms","acRate":"31.0%","frontendQuestionId":"3180","paidOnly":false,"topicTags":"Array;Dynamic Programming;Bit Manipulation;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":30.995064165844028,"totalAccepted":31398,"totalSubmission":101300},{"questionId":"3443","title":"Maximum Total Reward Using Operations II","titleSlug":"maximum-total-reward-using-operations-ii","isPaidOnly":false,"difficulty":"Hard","likes":134,"dislikes":32,"categoryTitle":"Algorithms","acRate":"22.0%","frontendQuestionId":"3181","paidOnly":false,"topicTags":"Array;Dynamic Programming;Bit Manipulation;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":21.953831212490975,"totalAccepted":8816,"totalSubmission":40157},{"questionId":"3488","title":"Find Top Scoring Students","titleSlug":"find-top-scoring-students","isPaidOnly":true,"difficulty":"Medium","likes":17,"dislikes":3,"categoryTitle":"Database","acRate":"50.1%","frontendQuestionId":"3182","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.11160714285714,"totalAccepted":3143,"totalSubmission":6272},{"questionId":"3489","title":"The Number of Ways to Make the Sum","titleSlug":"the-number-of-ways-to-make-the-sum","isPaidOnly":true,"difficulty":"Medium","likes":21,"dislikes":1,"categoryTitle":"Algorithms","acRate":"50.8%","frontendQuestionId":"3183","paidOnly":true,"topicTags":"Array;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":50.79520430633717,"totalAccepted":2076,"totalSubmission":4087},{"questionId":"3421","title":"Count Pairs That Form a Complete Day I","titleSlug":"count-pairs-that-form-a-complete-day-i","isPaidOnly":false,"difficulty":"Easy","likes":168,"dislikes":12,"categoryTitle":"Algorithms","acRate":"78.3%","frontendQuestionId":"3184","paidOnly":false,"topicTags":"Array;Hash Table;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":78.25310323947926,"totalAccepted":77541,"totalSubmission":99090},{"questionId":"3418","title":"Count Pairs That Form a Complete Day II","titleSlug":"count-pairs-that-form-a-complete-day-ii","isPaidOnly":false,"difficulty":"Medium","likes":198,"dislikes":12,"categoryTitle":"Algorithms","acRate":"43.8%","frontendQuestionId":"3185","paidOnly":false,"topicTags":"Array;Hash Table;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":43.83280911691066,"totalAccepted":49194,"totalSubmission":112231},{"questionId":"3437","title":"Maximum Total Damage With Spell Casting","titleSlug":"maximum-total-damage-with-spell-casting","isPaidOnly":false,"difficulty":"Medium","likes":757,"dislikes":65,"categoryTitle":"Algorithms","acRate":"45.1%","frontendQuestionId":"3186","paidOnly":false,"topicTags":"Array;Hash Table;Two Pointers;Binary Search;Dynamic Programming;Sorting;Counting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.08505840559943,"totalAccepted":115365,"totalSubmission":255883},{"questionId":"3438","title":"Peaks in Array","titleSlug":"peaks-in-array","isPaidOnly":false,"difficulty":"Hard","likes":142,"dislikes":10,"categoryTitle":"Algorithms","acRate":"27.7%","frontendQuestionId":"3187","paidOnly":false,"topicTags":"Array;Binary Indexed Tree;Segment Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":27.66973729102695,"totalAccepted":12165,"totalSubmission":43965},{"questionId":"3503","title":"Find Top Scoring Students II","titleSlug":"find-top-scoring-students-ii","isPaidOnly":true,"difficulty":"Hard","likes":8,"dislikes":8,"categoryTitle":"Database","acRate":"39.9%","frontendQuestionId":"3188","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":39.943857331572,"totalAccepted":2419,"totalSubmission":6056},{"questionId":"3504","title":"Minimum Moves to Get a Peaceful Board","titleSlug":"minimum-moves-to-get-a-peaceful-board","isPaidOnly":true,"difficulty":"Medium","likes":61,"dislikes":13,"categoryTitle":"Algorithms","acRate":"75.8%","frontendQuestionId":"3189","paidOnly":true,"topicTags":"Array;Greedy;Sorting;Counting Sort;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":75.79707868697973,"totalAccepted":4826,"totalSubmission":6367},{"questionId":"3476","title":"Find Minimum Operations to Make All Elements Divisible by Three","titleSlug":"find-minimum-operations-to-make-all-elements-divisible-by-three","isPaidOnly":false,"difficulty":"Easy","likes":528,"dislikes":34,"categoryTitle":"Algorithms","acRate":"90.8%","frontendQuestionId":"3190","paidOnly":false,"topicTags":"Array;Math;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":90.83885281951935,"totalAccepted":277588,"totalSubmission":305583},{"questionId":"3475","title":"Minimum Operations to Make Binary Array Elements Equal to One I","titleSlug":"minimum-operations-to-make-binary-array-elements-equal-to-one-i","isPaidOnly":false,"difficulty":"Medium","likes":683,"dislikes":36,"categoryTitle":"Algorithms","acRate":"80.4%","frontendQuestionId":"3191","paidOnly":false,"topicTags":"Array;Bit Manipulation;Queue;Sliding Window;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":80.40957203762656,"totalAccepted":212935,"totalSubmission":264813},{"questionId":"3477","title":"Minimum Operations to Make Binary Array Elements Equal to One II","titleSlug":"minimum-operations-to-make-binary-array-elements-equal-to-one-ii","isPaidOnly":false,"difficulty":"Medium","likes":158,"dislikes":9,"categoryTitle":"Algorithms","acRate":"65.2%","frontendQuestionId":"3192","paidOnly":false,"topicTags":"Array;Dynamic Programming;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":65.1999409768334,"totalAccepted":44186,"totalSubmission":67770},{"questionId":"3460","title":"Count the Number of Inversions","titleSlug":"count-the-number-of-inversions","isPaidOnly":false,"difficulty":"Hard","likes":190,"dislikes":37,"categoryTitle":"Algorithms","acRate":"31.2%","frontendQuestionId":"3193","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":31.188945833451314,"totalAccepted":11015,"totalSubmission":35317},{"questionId":"3471","title":"Minimum Average of Smallest and Largest Elements","titleSlug":"minimum-average-of-smallest-and-largest-elements","isPaidOnly":false,"difficulty":"Easy","likes":215,"dislikes":19,"categoryTitle":"Algorithms","acRate":"85.4%","frontendQuestionId":"3194","paidOnly":false,"topicTags":"Array;Two Pointers;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":85.39517860923746,"totalAccepted":112930,"totalSubmission":132244},{"questionId":"3461","title":"Find the Minimum Area to Cover All Ones I","titleSlug":"find-the-minimum-area-to-cover-all-ones-i","isPaidOnly":false,"difficulty":"Medium","likes":496,"dislikes":32,"categoryTitle":"Algorithms","acRate":"78.2%","frontendQuestionId":"3195","paidOnly":false,"topicTags":"Array;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":78.15569967875344,"totalAccepted":167626,"totalSubmission":214477},{"questionId":"3464","title":"Maximize Total Cost of Alternating Subarrays","titleSlug":"maximize-total-cost-of-alternating-subarrays","isPaidOnly":false,"difficulty":"Medium","likes":197,"dislikes":29,"categoryTitle":"Algorithms","acRate":"29.8%","frontendQuestionId":"3196","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":29.77777268403379,"totalAccepted":25982,"totalSubmission":87253},{"questionId":"3459","title":"Find the Minimum Area to Cover All Ones II","titleSlug":"find-the-minimum-area-to-cover-all-ones-ii","isPaidOnly":false,"difficulty":"Hard","likes":403,"dislikes":69,"categoryTitle":"Algorithms","acRate":"63.5%","frontendQuestionId":"3197","paidOnly":false,"topicTags":"Array;Matrix;Enumeration;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":63.51035436675693,"totalAccepted":65201,"totalSubmission":102662},{"questionId":"3505","title":"Find Cities in Each State","titleSlug":"find-cities-in-each-state","isPaidOnly":true,"difficulty":"Easy","likes":9,"dislikes":2,"categoryTitle":"Database","acRate":"79.3%","frontendQuestionId":"3198","paidOnly":true,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":79.31858936043037,"totalAccepted":3981,"totalSubmission":5019},{"questionId":"3506","title":"Count Triplets with Even XOR Set Bits I","titleSlug":"count-triplets-with-even-xor-set-bits-i","isPaidOnly":true,"difficulty":"Easy","likes":9,"dislikes":4,"categoryTitle":"Algorithms","acRate":"83.1%","frontendQuestionId":"3199","paidOnly":true,"topicTags":"Array;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":83.1191088260497,"totalAccepted":1940,"totalSubmission":2334},{"questionId":"3469","title":"Maximum Height of a Triangle","titleSlug":"maximum-height-of-a-triangle","isPaidOnly":false,"difficulty":"Easy","likes":167,"dislikes":31,"categoryTitle":"Algorithms","acRate":"44.5%","frontendQuestionId":"3200","paidOnly":false,"topicTags":"Array;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":44.45094616574761,"totalAccepted":44819,"totalSubmission":100828},{"questionId":"3942","title":"Find Drivers with Improved Fuel Efficiency","titleSlug":"find-drivers-with-improved-fuel-efficiency","isPaidOnly":false,"difficulty":"Medium","likes":43,"dislikes":8,"categoryTitle":"Database","acRate":"47.0%","frontendQuestionId":"3601","paidOnly":false,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":46.95550351288056,"totalAccepted":11629,"totalSubmission":24766},{"questionId":"3912","title":"Hexadecimal and Hexatrigesimal Conversion","titleSlug":"hexadecimal-and-hexatrigesimal-conversion","isPaidOnly":false,"difficulty":"Easy","likes":53,"dislikes":0,"categoryTitle":"Algorithms","acRate":"81.0%","frontendQuestionId":"3602","paidOnly":false,"topicTags":"Math;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":80.98759665784421,"totalAccepted":31211,"totalSubmission":38538},{"questionId":"3927","title":"Minimum Cost Path with Alternating Directions II","titleSlug":"minimum-cost-path-with-alternating-directions-ii","isPaidOnly":false,"difficulty":"Medium","likes":74,"dislikes":12,"categoryTitle":"Algorithms","acRate":"44.9%","frontendQuestionId":"3603","paidOnly":false,"topicTags":"Array;Dynamic Programming;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":44.91796440489433,"totalAccepted":19383,"totalSubmission":43152},{"questionId":"3916","title":"Minimum Time to Reach Destination in Directed Graph","titleSlug":"minimum-time-to-reach-destination-in-directed-graph","isPaidOnly":false,"difficulty":"Medium","likes":109,"dislikes":4,"categoryTitle":"Algorithms","acRate":"45.8%","frontendQuestionId":"3604","paidOnly":false,"topicTags":"Graph Theory;Heap (Priority Queue);Shortest Path;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":45.7874075192511,"totalAccepted":18195,"totalSubmission":39738},{"questionId":"3920","title":"Minimum Stability Factor of Array","titleSlug":"minimum-stability-factor-of-array","isPaidOnly":false,"difficulty":"Hard","likes":41,"dislikes":2,"categoryTitle":"Algorithms","acRate":"20.7%","frontendQuestionId":"3605","paidOnly":false,"topicTags":"Array;Math;Binary Search;Greedy;Segment Tree;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":20.71545359956399,"totalAccepted":4181,"totalSubmission":20183},{"questionId":"3934","title":"Coupon Code Validator","titleSlug":"coupon-code-validator","isPaidOnly":false,"difficulty":"Easy","likes":338,"dislikes":107,"categoryTitle":"Algorithms","acRate":"64.8%","frontendQuestionId":"3606","paidOnly":false,"topicTags":"Array;Hash Table;String;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.77234032821211,"totalAccepted":127448,"totalSubmission":196763},{"questionId":"3863","title":"Power Grid Maintenance","titleSlug":"power-grid-maintenance","isPaidOnly":false,"difficulty":"Medium","likes":544,"dislikes":58,"categoryTitle":"Algorithms","acRate":"56.2%","frontendQuestionId":"3607","paidOnly":false,"topicTags":"Array;Hash Table;Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;Heap (Priority Queue);Ordered Set;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":56.15397935238868,"totalAccepted":94045,"totalSubmission":167477},{"questionId":"3908","title":"Minimum Time for K Connected Components","titleSlug":"minimum-time-for-k-connected-components","isPaidOnly":false,"difficulty":"Medium","likes":130,"dislikes":6,"categoryTitle":"Algorithms","acRate":"45.5%","frontendQuestionId":"3608","paidOnly":false,"topicTags":"Binary Search;Union-Find;Graph Theory;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":45.49651831668181,"totalAccepted":18033,"totalSubmission":39636},{"questionId":"3922","title":"Minimum Moves to Reach Target in Grid","titleSlug":"minimum-moves-to-reach-target-in-grid","isPaidOnly":false,"difficulty":"Hard","likes":57,"dislikes":3,"categoryTitle":"Algorithms","acRate":"15.2%","frontendQuestionId":"3609","paidOnly":false,"topicTags":"Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":15.203517231598354,"totalAccepted":5360,"totalSubmission":35255},{"questionId":"3949","title":"Minimum Number of Primes to Sum to Target","titleSlug":"minimum-number-of-primes-to-sum-to-target","isPaidOnly":true,"difficulty":"Medium","likes":16,"dislikes":1,"categoryTitle":"Algorithms","acRate":"59.8%","frontendQuestionId":"3610","paidOnly":true,"topicTags":"Array;Math;Dynamic Programming;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":59.84170681348934,"totalAccepted":3478,"totalSubmission":5812},{"questionId":"3943","title":"Find Overbooked Employees","titleSlug":"find-overbooked-employees","isPaidOnly":false,"difficulty":"Medium","likes":48,"dislikes":10,"categoryTitle":"Database","acRate":"44.1%","frontendQuestionId":"3611","paidOnly":false,"topicTags":"Database;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":44.124664479570534,"totalAccepted":11836,"totalSubmission":26824},{"questionId":"3931","title":"Process String with Special Operations I","titleSlug":"process-string-with-special-operations-i","isPaidOnly":false,"difficulty":"Medium","likes":59,"dislikes":11,"categoryTitle":"Algorithms","acRate":"65.1%","frontendQuestionId":"3612","paidOnly":false,"topicTags":"String;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":65.1029429333758,"totalAccepted":49044,"totalSubmission":75333},{"questionId":"3881","title":"Minimize Maximum Component Cost","titleSlug":"minimize-maximum-component-cost","isPaidOnly":false,"difficulty":"Medium","likes":124,"dislikes":9,"categoryTitle":"Algorithms","acRate":"43.6%","frontendQuestionId":"3613","paidOnly":false,"topicTags":"Binary Search;Union-Find;Graph Theory;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":43.59905735598987,"totalAccepted":24606,"totalSubmission":56437},{"questionId":"3939","title":"Process String with Special Operations II","titleSlug":"process-string-with-special-operations-ii","isPaidOnly":false,"difficulty":"Hard","likes":98,"dislikes":9,"categoryTitle":"Algorithms","acRate":"17.2%","frontendQuestionId":"3614","paidOnly":false,"topicTags":"String;Simulation;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":17.214039581618028,"totalAccepted":11290,"totalSubmission":65586},{"questionId":"3930","title":"Longest Palindromic Path in Graph","titleSlug":"longest-palindromic-path-in-graph","isPaidOnly":false,"difficulty":"Hard","likes":58,"dislikes":5,"categoryTitle":"Algorithms","acRate":"22.3%","frontendQuestionId":"3615","paidOnly":false,"topicTags":"String;Dynamic Programming;Bit Manipulation;Graph Theory;Bitmask;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":22.344745812953906,"totalAccepted":7538,"totalSubmission":33735},{"questionId":"3960","title":"Number of Student Replacements","titleSlug":"number-of-student-replacements","isPaidOnly":true,"difficulty":"Medium","likes":5,"dislikes":3,"categoryTitle":"Algorithms","acRate":"85.6%","frontendQuestionId":"3616","paidOnly":true,"topicTags":"Array;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":85.55194805194806,"totalAccepted":1054,"totalSubmission":1232},{"questionId":"3961","title":"Find Students with Study Spiral Pattern","titleSlug":"find-students-with-study-spiral-pattern","isPaidOnly":false,"difficulty":"Hard","likes":38,"dislikes":13,"categoryTitle":"Database","acRate":"30.1%","frontendQuestionId":"3617","paidOnly":false,"topicTags":"","hasSolution":false,"hasVideoSolution":false,"acRateRaw":30.07913767226088,"totalAccepted":4408,"totalSubmission":14657},{"questionId":"3936","title":"Split Array by Prime Indices","titleSlug":"split-array-by-prime-indices","isPaidOnly":false,"difficulty":"Medium","likes":57,"dislikes":3,"categoryTitle":"Algorithms","acRate":"49.5%","frontendQuestionId":"3618","paidOnly":false,"topicTags":"Array;Math;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":49.52052917922424,"totalAccepted":37955,"totalSubmission":76646},{"questionId":"3823","title":"Count Islands With Total Value Divisible by K","titleSlug":"count-islands-with-total-value-divisible-by-k","isPaidOnly":false,"difficulty":"Medium","likes":69,"dislikes":2,"categoryTitle":"Algorithms","acRate":"56.2%","frontendQuestionId":"3619","paidOnly":false,"topicTags":"Array;Depth-First Search;Breadth-First Search;Union-Find;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":56.23143053040558,"totalAccepted":31985,"totalSubmission":56881},{"questionId":"3919","title":"Network Recovery Pathways","titleSlug":"network-recovery-pathways","isPaidOnly":false,"difficulty":"Hard","likes":142,"dislikes":12,"categoryTitle":"Algorithms","acRate":"30.0%","frontendQuestionId":"3620","paidOnly":false,"topicTags":"Array;Binary Search;Dynamic Programming;Graph Theory;Topological Sort;Heap (Priority Queue);Shortest Path;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":30.004337881536397,"totalAccepted":15217,"totalSubmission":50714},{"questionId":"3937","title":"Number of Integers With Popcount-Depth Equal to K I","titleSlug":"number-of-integers-with-popcount-depth-equal-to-k-i","isPaidOnly":false,"difficulty":"Hard","likes":53,"dislikes":5,"categoryTitle":"Algorithms","acRate":"22.9%","frontendQuestionId":"3621","paidOnly":false,"topicTags":"Math;Dynamic Programming;Bit Manipulation;Combinatorics;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":22.899741947816114,"totalAccepted":4792,"totalSubmission":20926},{"questionId":"3918","title":"Check Divisibility by Digit Sum and Product","titleSlug":"check-divisibility-by-digit-sum-and-product","isPaidOnly":false,"difficulty":"Easy","likes":59,"dislikes":0,"categoryTitle":"Algorithms","acRate":"69.6%","frontendQuestionId":"3622","paidOnly":false,"topicTags":"Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":69.60878620058463,"totalAccepted":74534,"totalSubmission":107076},{"questionId":"3886","title":"Count Number of Trapezoids I","titleSlug":"count-number-of-trapezoids-i","isPaidOnly":false,"difficulty":"Medium","likes":399,"dislikes":51,"categoryTitle":"Algorithms","acRate":"48.1%","frontendQuestionId":"3623","paidOnly":false,"topicTags":"Array;Hash Table;Math;Geometry;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":48.14170770758599,"totalAccepted":118767,"totalSubmission":246704},{"questionId":"3941","title":"Number of Integers With Popcount-Depth Equal to K II","titleSlug":"number-of-integers-with-popcount-depth-equal-to-k-ii","isPaidOnly":false,"difficulty":"Hard","likes":36,"dislikes":9,"categoryTitle":"Algorithms","acRate":"59.5%","frontendQuestionId":"3624","paidOnly":false,"topicTags":"Array;Divide and Conquer;Binary Indexed Tree;Segment Tree;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":59.52020496098754,"totalAccepted":20444,"totalSubmission":34348},{"questionId":"3897","title":"Count Number of Trapezoids II","titleSlug":"count-number-of-trapezoids-ii","isPaidOnly":false,"difficulty":"Hard","likes":264,"dislikes":98,"categoryTitle":"Algorithms","acRate":"39.9%","frontendQuestionId":"3625","paidOnly":false,"topicTags":"Array;Hash Table;Math;Geometry;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":39.861691201643275,"totalAccepted":58218,"totalSubmission":146050},{"questionId":"3971","title":"Find Stores with Inventory Imbalance","titleSlug":"find-stores-with-inventory-imbalance","isPaidOnly":false,"difficulty":"Medium","likes":48,"dislikes":9,"categoryTitle":"Database","acRate":"49.2%","frontendQuestionId":"3626","paidOnly":false,"topicTags":"","hasSolution":false,"hasVideoSolution":false,"acRateRaw":49.17014613778706,"totalAccepted":9421,"totalSubmission":19160},{"questionId":"3766","title":"Maximum Median Sum of Subsequences of Size 3","titleSlug":"maximum-median-sum-of-subsequences-of-size-3","isPaidOnly":false,"difficulty":"Medium","likes":83,"dislikes":3,"categoryTitle":"Algorithms","acRate":"65.1%","frontendQuestionId":"3627","paidOnly":false,"topicTags":"Array;Math;Greedy;Sorting;Game Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":65.11043661942946,"totalAccepted":63497,"totalSubmission":97522},{"questionId":"3948","title":"Maximum Number of Subsequences After One Inserting","titleSlug":"maximum-number-of-subsequences-after-one-inserting","isPaidOnly":false,"difficulty":"Medium","likes":141,"dislikes":5,"categoryTitle":"Algorithms","acRate":"32.0%","frontendQuestionId":"3628","paidOnly":false,"topicTags":"String;Dynamic Programming;Greedy;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":31.9881586250848,"totalAccepted":31120,"totalSubmission":97286},{"questionId":"3933","title":"Minimum Jumps to Reach End via Prime Teleportation","titleSlug":"minimum-jumps-to-reach-end-via-prime-teleportation","isPaidOnly":false,"difficulty":"Medium","likes":388,"dislikes":54,"categoryTitle":"Algorithms","acRate":"44.6%","frontendQuestionId":"3629","paidOnly":false,"topicTags":"Array;Hash Table;Math;Breadth-First Search;Number Theory;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":44.63816085517435,"totalAccepted":89279,"totalSubmission":200006},{"questionId":"3882","title":"Partition Array for Maximum XOR and AND","titleSlug":"partition-array-for-maximum-xor-and-and","isPaidOnly":false,"difficulty":"Hard","likes":32,"dislikes":8,"categoryTitle":"Algorithms","acRate":"17.8%","frontendQuestionId":"3630","paidOnly":false,"topicTags":"Array;Math;Greedy;Bit Manipulation;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":17.796569908309184,"totalAccepted":7492,"totalSubmission":42098},{"questionId":"3969","title":"Sort Threats by Severity and Exploitability","titleSlug":"sort-threats-by-severity-and-exploitability","isPaidOnly":true,"difficulty":"Medium","likes":5,"dislikes":1,"categoryTitle":"Algorithms","acRate":"64.6%","frontendQuestionId":"3631","paidOnly":true,"topicTags":"Array;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.62793068297655,"totalAccepted":634,"totalSubmission":981},{"questionId":"3929","title":"Subarrays with XOR at Least K","titleSlug":"subarrays-with-xor-at-least-k","isPaidOnly":true,"difficulty":"Hard","likes":4,"dislikes":2,"categoryTitle":"Algorithms","acRate":"44.5%","frontendQuestionId":"3632","paidOnly":true,"topicTags":"Array;Bit Manipulation;Trie;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":44.460431654676256,"totalAccepted":309,"totalSubmission":695},{"questionId":"3965","title":"Earliest Finish Time for Land and Water Rides I","titleSlug":"earliest-finish-time-for-land-and-water-rides-i","isPaidOnly":false,"difficulty":"Easy","likes":372,"dislikes":62,"categoryTitle":"Algorithms","acRate":"73.0%","frontendQuestionId":"3633","paidOnly":false,"topicTags":"Array;Two Pointers;Binary Search;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":72.95798995573969,"totalAccepted":146868,"totalSubmission":201306},{"questionId":"3958","title":"Minimum Removals to Balance Array","titleSlug":"minimum-removals-to-balance-array","isPaidOnly":false,"difficulty":"Medium","likes":613,"dislikes":28,"categoryTitle":"Algorithms","acRate":"47.9%","frontendQuestionId":"3634","paidOnly":false,"topicTags":"Array;Binary Search;Sliding Window;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.8521708023879,"totalAccepted":145807,"totalSubmission":304703},{"questionId":"3967","title":"Earliest Finish Time for Land and Water Rides II","titleSlug":"earliest-finish-time-for-land-and-water-rides-ii","isPaidOnly":false,"difficulty":"Medium","likes":315,"dislikes":17,"categoryTitle":"Algorithms","acRate":"64.2%","frontendQuestionId":"3635","paidOnly":false,"topicTags":"Array;Two Pointers;Binary Search;Greedy;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":64.22955880047749,"totalAccepted":106534,"totalSubmission":165865},{"questionId":"3955","title":"Threshold Majority Queries","titleSlug":"threshold-majority-queries","isPaidOnly":false,"difficulty":"Hard","likes":44,"dislikes":10,"categoryTitle":"Algorithms","acRate":"22.2%","frontendQuestionId":"3636","paidOnly":false,"topicTags":"Array;Hash Table;Binary Search;Divide and Conquer;Counting;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":22.18918671667734,"totalAccepted":4851,"totalSubmission":21862},{"questionId":"3952","title":"Trionic Array I","titleSlug":"trionic-array-i","isPaidOnly":false,"difficulty":"Easy","likes":475,"dislikes":40,"categoryTitle":"Algorithms","acRate":"49.5%","frontendQuestionId":"3637","paidOnly":false,"topicTags":"Array;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":49.52259243730181,"totalAccepted":197246,"totalSubmission":398296},{"questionId":"3954","title":"Maximum Balanced Shipments","titleSlug":"maximum-balanced-shipments","isPaidOnly":false,"difficulty":"Medium","likes":84,"dislikes":11,"categoryTitle":"Algorithms","acRate":"61.5%","frontendQuestionId":"3638","paidOnly":false,"topicTags":"Array;Dynamic Programming;Stack;Greedy;Monotonic Stack;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":61.45268789926431,"totalAccepted":53293,"totalSubmission":86722},{"questionId":"3944","title":"Minimum Time to Activate String","titleSlug":"minimum-time-to-activate-string","isPaidOnly":false,"difficulty":"Medium","likes":123,"dislikes":6,"categoryTitle":"Algorithms","acRate":"49.2%","frontendQuestionId":"3639","paidOnly":false,"topicTags":"Array;Binary Search;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":49.21579006017384,"totalAccepted":35333,"totalSubmission":71792},{"questionId":"3956","title":"Trionic Array II","titleSlug":"trionic-array-ii","isPaidOnly":false,"difficulty":"Hard","likes":390,"dislikes":38,"categoryTitle":"Algorithms","acRate":"47.3%","frontendQuestionId":"3640","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.32203239503764,"totalAccepted":85366,"totalSubmission":180396},{"questionId":"3992","title":"Longest Semi-Repeating Subarray","titleSlug":"longest-semi-repeating-subarray","isPaidOnly":true,"difficulty":"Medium","likes":6,"dislikes":1,"categoryTitle":"Algorithms","acRate":"63.5%","frontendQuestionId":"3641","paidOnly":true,"topicTags":"Array;Hash Table;Sliding Window;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":63.49112426035502,"totalAccepted":1073,"totalSubmission":1690},{"questionId":"3996","title":"Find Books with Polarized Opinions","titleSlug":"find-books-with-polarized-opinions","isPaidOnly":false,"difficulty":"Medium","likes":53,"dislikes":13,"categoryTitle":"Database","acRate":"43.1%","frontendQuestionId":"3642","paidOnly":false,"topicTags":"","hasSolution":false,"hasVideoSolution":false,"acRateRaw":43.14775573107301,"totalAccepted":11199,"totalSubmission":25955},{"questionId":"3973","title":"Flip Square Submatrix Vertically","titleSlug":"flip-square-submatrix-vertically","isPaidOnly":false,"difficulty":"Easy","likes":287,"dislikes":28,"categoryTitle":"Algorithms","acRate":"79.4%","frontendQuestionId":"3643","paidOnly":false,"topicTags":"Array;Two Pointers;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":79.36479673597297,"totalAccepted":156005,"totalSubmission":196567},{"questionId":"3950","title":"Maximum K to Sort a Permutation","titleSlug":"maximum-k-to-sort-a-permutation","isPaidOnly":false,"difficulty":"Medium","likes":101,"dislikes":36,"categoryTitle":"Algorithms","acRate":"37.4%","frontendQuestionId":"3644","paidOnly":false,"topicTags":"Array;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":37.40938465861197,"totalAccepted":33285,"totalSubmission":88975},{"questionId":"3959","title":"Maximum Total from Optimal Activation Order","titleSlug":"maximum-total-from-optimal-activation-order","isPaidOnly":false,"difficulty":"Medium","likes":81,"dislikes":55,"categoryTitle":"Algorithms","acRate":"33.4%","frontendQuestionId":"3645","paidOnly":false,"topicTags":"Array;Two Pointers;Greedy;Sorting;Heap (Priority Queue);","hasSolution":false,"hasVideoSolution":false,"acRateRaw":33.35066864784547,"totalAccepted":17956,"totalSubmission":53840},{"questionId":"3951","title":"Next Special Palindrome Number","titleSlug":"next-special-palindrome-number","isPaidOnly":false,"difficulty":"Hard","likes":67,"dislikes":5,"categoryTitle":"Algorithms","acRate":"28.2%","frontendQuestionId":"3646","paidOnly":false,"topicTags":"Backtracking;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":28.168058577210097,"totalAccepted":12041,"totalSubmission":42747},{"questionId":"3987","title":"Maximum Weight in Two Bags","titleSlug":"maximum-weight-in-two-bags","isPaidOnly":true,"difficulty":"Medium","likes":6,"dislikes":3,"categoryTitle":"Algorithms","acRate":"58.0%","frontendQuestionId":"3647","paidOnly":true,"topicTags":"Array;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":57.96875,"totalAccepted":742,"totalSubmission":1280},{"questionId":"3945","title":"Minimum Sensors to Cover Grid","titleSlug":"minimum-sensors-to-cover-grid","isPaidOnly":false,"difficulty":"Medium","likes":53,"dislikes":9,"categoryTitle":"Algorithms","acRate":"68.7%","frontendQuestionId":"3648","paidOnly":false,"topicTags":"Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":68.7072155411656,"totalAccepted":29709,"totalSubmission":43240},{"questionId":"3963","title":"Number of Perfect Pairs","titleSlug":"number-of-perfect-pairs","isPaidOnly":false,"difficulty":"Medium","likes":104,"dislikes":11,"categoryTitle":"Algorithms","acRate":"34.2%","frontendQuestionId":"3649","paidOnly":false,"topicTags":"Array;Math;Two Pointers;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":34.18087171077377,"totalAccepted":22719,"totalSubmission":66467},{"questionId":"3887","title":"Minimum Cost Path with Edge Reversals","titleSlug":"minimum-cost-path-with-edge-reversals","isPaidOnly":false,"difficulty":"Medium","likes":463,"dislikes":25,"categoryTitle":"Algorithms","acRate":"61.8%","frontendQuestionId":"3650","paidOnly":false,"topicTags":"Graph Theory;Heap (Priority Queue);Shortest Path;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":61.7861053226433,"totalAccepted":104961,"totalSubmission":169878},{"questionId":"3889","title":"Minimum Cost Path with Teleportations","titleSlug":"minimum-cost-path-with-teleportations","isPaidOnly":false,"difficulty":"Hard","likes":424,"dislikes":34,"categoryTitle":"Algorithms","acRate":"45.5%","frontendQuestionId":"3651","paidOnly":false,"topicTags":"Array;Dynamic Programming;Matrix;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.46420443640152,"totalAccepted":66325,"totalSubmission":145884},{"questionId":"3980","title":"Best Time to Buy and Sell Stock using Strategy","titleSlug":"best-time-to-buy-and-sell-stock-using-strategy","isPaidOnly":false,"difficulty":"Medium","likes":361,"dislikes":43,"categoryTitle":"Algorithms","acRate":"59.7%","frontendQuestionId":"3652","paidOnly":false,"topicTags":"Array;Sliding Window;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":59.745891422526206,"totalAccepted":114080,"totalSubmission":190942},{"questionId":"3974","title":"XOR After Range Multiplication Queries I","titleSlug":"xor-after-range-multiplication-queries-i","isPaidOnly":false,"difficulty":"Medium","likes":240,"dislikes":119,"categoryTitle":"Algorithms","acRate":"73.3%","frontendQuestionId":"3653","paidOnly":false,"topicTags":"Array;Divide and Conquer;Simulation;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":73.30081018455711,"totalAccepted":135078,"totalSubmission":184279},{"questionId":"3966","title":"Minimum Sum After Divisible Sum Deletions","titleSlug":"minimum-sum-after-divisible-sum-deletions","isPaidOnly":false,"difficulty":"Medium","likes":154,"dislikes":12,"categoryTitle":"Algorithms","acRate":"46.5%","frontendQuestionId":"3654","paidOnly":false,"topicTags":"Array;Hash Table;Dynamic Programming;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":46.4702473254703,"totalAccepted":29668,"totalSubmission":63843},{"questionId":"3975","title":"XOR After Range Multiplication Queries II","titleSlug":"xor-after-range-multiplication-queries-ii","isPaidOnly":false,"difficulty":"Hard","likes":266,"dislikes":44,"categoryTitle":"Algorithms","acRate":"47.7%","frontendQuestionId":"3655","paidOnly":false,"topicTags":"Array;Divide and Conquer;Prefix Sum;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.70814294646722,"totalAccepted":69433,"totalSubmission":145535},{"questionId":"4006","title":"Determine if a Simple Graph Exists","titleSlug":"determine-if-a-simple-graph-exists","isPaidOnly":true,"difficulty":"Medium","likes":9,"dislikes":7,"categoryTitle":"Algorithms","acRate":"47.4%","frontendQuestionId":"3656","paidOnly":true,"topicTags":"Array;Binary Search;Graph Theory;Sorting;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":47.38598442714127,"totalAccepted":426,"totalSubmission":899},{"questionId":"4025","title":"Find Loyal Customers","titleSlug":"find-loyal-customers","isPaidOnly":false,"difficulty":"Medium","likes":48,"dislikes":1,"categoryTitle":"Database","acRate":"61.0%","frontendQuestionId":"3657","paidOnly":false,"topicTags":"","hasSolution":false,"hasVideoSolution":false,"acRateRaw":60.97914252607184,"totalAccepted":12630,"totalSubmission":20712},{"questionId":"3995","title":"GCD of Odd and Even Sums","titleSlug":"gcd-of-odd-and-even-sums","isPaidOnly":false,"difficulty":"Easy","likes":110,"dislikes":16,"categoryTitle":"Algorithms","acRate":"85.0%","frontendQuestionId":"3658","paidOnly":false,"topicTags":"Math;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":85.01484066952744,"totalAccepted":97670,"totalSubmission":114886},{"questionId":"3979","title":"Partition Array Into K-Distinct Groups","titleSlug":"partition-array-into-k-distinct-groups","isPaidOnly":false,"difficulty":"Medium","likes":117,"dislikes":73,"categoryTitle":"Algorithms","acRate":"47.2%","frontendQuestionId":"3659","paidOnly":false,"topicTags":"Array;Hash Table;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":47.17511220748963,"totalAccepted":55076,"totalSubmission":116748},{"questionId":"3981","title":"Jump Game IX","titleSlug":"jump-game-ix","isPaidOnly":false,"difficulty":"Medium","likes":453,"dislikes":39,"categoryTitle":"Algorithms","acRate":"46.3%","frontendQuestionId":"3660","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":46.2657757168792,"totalAccepted":84609,"totalSubmission":182876},{"questionId":"3982","title":"Maximum Walls Destroyed by Robots","titleSlug":"maximum-walls-destroyed-by-robots","isPaidOnly":false,"difficulty":"Hard","likes":343,"dislikes":31,"categoryTitle":"Algorithms","acRate":"48.0%","frontendQuestionId":"3661","paidOnly":false,"topicTags":"Array;Binary Search;Dynamic Programming;Sorting;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":47.98896874227175,"totalAccepted":64036,"totalSubmission":133439},{"questionId":"4017","title":"Filter Characters by Frequency","titleSlug":"filter-characters-by-frequency","isPaidOnly":true,"difficulty":"Easy","likes":9,"dislikes":0,"categoryTitle":"Algorithms","acRate":"86.2%","frontendQuestionId":"3662","paidOnly":true,"topicTags":"Hash Table;String;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":86.16422947131609,"totalAccepted":1532,"totalSubmission":1778},{"questionId":"3994","title":"Find The Least Frequent Digit","titleSlug":"find-the-least-frequent-digit","isPaidOnly":false,"difficulty":"Easy","likes":54,"dislikes":2,"categoryTitle":"Algorithms","acRate":"69.8%","frontendQuestionId":"3663","paidOnly":false,"topicTags":"Array;Hash Table;Math;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":69.78726032049897,"totalAccepted":45204,"totalSubmission":64774},{"questionId":"3877","title":"Two-Letter Card Game","titleSlug":"two-letter-card-game","isPaidOnly":false,"difficulty":"Medium","likes":128,"dislikes":60,"categoryTitle":"Algorithms","acRate":"12.8%","frontendQuestionId":"3664","paidOnly":false,"topicTags":"Array;Hash Table;String;Counting;Enumeration;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":12.814184655278302,"totalAccepted":11267,"totalSubmission":87926},{"questionId":"3938","title":"Twisted Mirror Path Count","titleSlug":"twisted-mirror-path-count","isPaidOnly":false,"difficulty":"Medium","likes":86,"dislikes":5,"categoryTitle":"Algorithms","acRate":"48.3%","frontendQuestionId":"3665","paidOnly":false,"topicTags":"Array;Dynamic Programming;Matrix;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":48.31849337005957,"totalAccepted":15086,"totalSubmission":31222},{"questionId":"3983","title":"Minimum Operations to Equalize Binary String","titleSlug":"minimum-operations-to-equalize-binary-string","isPaidOnly":false,"difficulty":"Hard","likes":309,"dislikes":37,"categoryTitle":"Algorithms","acRate":"45.1%","frontendQuestionId":"3666","paidOnly":false,"topicTags":"Math;String;Breadth-First Search;Union-Find;Ordered Set;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":45.07979895952738,"totalAccepted":61350,"totalSubmission":136092},{"questionId":"4029","title":"Sort Array By Absolute Value","titleSlug":"sort-array-by-absolute-value","isPaidOnly":true,"difficulty":"Easy","likes":7,"dislikes":0,"categoryTitle":"Algorithms","acRate":"86.6%","frontendQuestionId":"3667","paidOnly":true,"topicTags":"Array;Math;Two Pointers;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":86.58163265306122,"totalAccepted":1697,"totalSubmission":1960},{"questionId":"4008","title":"Restore Finishing Order","titleSlug":"restore-finishing-order","isPaidOnly":false,"difficulty":"Easy","likes":127,"dislikes":6,"categoryTitle":"Algorithms","acRate":"91.3%","frontendQuestionId":"3668","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":91.28493340518901,"totalAccepted":106713,"totalSubmission":116901},{"questionId":"3947","title":"Balanced K-Factor Decomposition","titleSlug":"balanced-k-factor-decomposition","isPaidOnly":false,"difficulty":"Medium","likes":124,"dislikes":12,"categoryTitle":"Algorithms","acRate":"40.3%","frontendQuestionId":"3669","paidOnly":false,"topicTags":"Math;Backtracking;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":40.31682767982209,"totalAccepted":27919,"totalSubmission":69249},{"questionId":"3915","title":"Maximum Product of Two Integers With No Common Bits","titleSlug":"maximum-product-of-two-integers-with-no-common-bits","isPaidOnly":false,"difficulty":"Medium","likes":105,"dislikes":21,"categoryTitle":"Algorithms","acRate":"15.3%","frontendQuestionId":"3670","paidOnly":false,"topicTags":"Array;Dynamic Programming;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":15.275221032435377,"totalAccepted":11783,"totalSubmission":77138},{"questionId":"3989","title":"Sum of Beautiful Subsequences","titleSlug":"sum-of-beautiful-subsequences","isPaidOnly":false,"difficulty":"Hard","likes":38,"dislikes":5,"categoryTitle":"Algorithms","acRate":"31.6%","frontendQuestionId":"3671","paidOnly":false,"topicTags":"Array;Math;Binary Indexed Tree;Number Theory;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":31.564466760669944,"totalAccepted":9178,"totalSubmission":29077},{"questionId":"4036","title":"Sum of Weighted Modes in Subarrays","titleSlug":"sum-of-weighted-modes-in-subarrays","isPaidOnly":true,"difficulty":"Medium","likes":7,"dislikes":1,"categoryTitle":"Algorithms","acRate":"53.9%","frontendQuestionId":"3672","paidOnly":true,"topicTags":"Array;Hash Table;Sliding Window;Counting;Ordered Set;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":53.87713997985901,"totalAccepted":535,"totalSubmission":993},{"questionId":"4043","title":"Find Zombie Sessions","titleSlug":"find-zombie-sessions","isPaidOnly":false,"difficulty":"Hard","likes":33,"dislikes":3,"categoryTitle":"Database","acRate":"48.8%","frontendQuestionId":"3673","paidOnly":false,"topicTags":"","hasSolution":false,"hasVideoSolution":false,"acRateRaw":48.75890064550476,"totalAccepted":7326,"totalSubmission":15026},{"questionId":"3998","title":"Minimum Operations to Equalize Array","titleSlug":"minimum-operations-to-equalize-array","isPaidOnly":false,"difficulty":"Easy","likes":61,"dislikes":12,"categoryTitle":"Algorithms","acRate":"60.6%","frontendQuestionId":"3674","paidOnly":false,"topicTags":"Array;Bit Manipulation;Brainteaser;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":60.56038458616836,"totalAccepted":55807,"totalSubmission":92151},{"questionId":"3999","title":"Minimum Operations to Transform String","titleSlug":"minimum-operations-to-transform-string","isPaidOnly":false,"difficulty":"Medium","likes":74,"dislikes":7,"categoryTitle":"Algorithms","acRate":"62.0%","frontendQuestionId":"3675","paidOnly":false,"topicTags":"String;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":62.01229321232202,"totalAccepted":51655,"totalSubmission":83298},{"questionId":"4000","title":"Count Bowl Subarrays","titleSlug":"count-bowl-subarrays","isPaidOnly":false,"difficulty":"Medium","likes":191,"dislikes":5,"categoryTitle":"Algorithms","acRate":"48.4%","frontendQuestionId":"3676","paidOnly":false,"topicTags":"Array;Stack;Monotonic Stack;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":48.3640017584626,"totalAccepted":30804,"totalSubmission":63692},{"questionId":"4023","title":"Count Binary Palindromic Numbers","titleSlug":"count-binary-palindromic-numbers","isPaidOnly":false,"difficulty":"Hard","likes":84,"dislikes":4,"categoryTitle":"Algorithms","acRate":"33.8%","frontendQuestionId":"3677","paidOnly":false,"topicTags":"Math;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":33.81812102975593,"totalAccepted":16184,"totalSubmission":47856},{"questionId":"4011","title":"Smallest Absent Positive Greater Than Average","titleSlug":"smallest-absent-positive-greater-than-average","isPaidOnly":false,"difficulty":"Easy","likes":65,"dislikes":6,"categoryTitle":"Algorithms","acRate":"34.4%","frontendQuestionId":"3678","paidOnly":false,"topicTags":"Array;Hash Table;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":34.41292994777598,"totalAccepted":38219,"totalSubmission":111060},{"questionId":"3953","title":" Minimum Discards to Balance Inventory","titleSlug":"minimum-discards-to-balance-inventory","isPaidOnly":false,"difficulty":"Medium","likes":85,"dislikes":18,"categoryTitle":"Algorithms","acRate":"35.3%","frontendQuestionId":"3679","paidOnly":false,"topicTags":"Array;Hash Table;Sliding Window;Simulation;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":35.25024601626297,"totalAccepted":20418,"totalSubmission":57923},{"questionId":"3991","title":"Generate Schedule","titleSlug":"generate-schedule","isPaidOnly":false,"difficulty":"Medium","likes":50,"dislikes":25,"categoryTitle":"Algorithms","acRate":"24.7%","frontendQuestionId":"3680","paidOnly":false,"topicTags":"Array;Math;Greedy;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":24.74174342272658,"totalAccepted":4862,"totalSubmission":19651},{"questionId":"3990","title":"Maximum XOR of Subsequences","titleSlug":"maximum-xor-of-subsequences","isPaidOnly":false,"difficulty":"Hard","likes":65,"dislikes":10,"categoryTitle":"Algorithms","acRate":"51.4%","frontendQuestionId":"3681","paidOnly":false,"topicTags":"Array;Math;Greedy;Bit Manipulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":51.44723946422738,"totalAccepted":7874,"totalSubmission":15305},{"questionId":"4050","title":"Minimum Index Sum of Common Elements","titleSlug":"minimum-index-sum-of-common-elements","isPaidOnly":true,"difficulty":"Medium","likes":6,"dislikes":1,"categoryTitle":"Algorithms","acRate":"77.4%","frontendQuestionId":"3682","paidOnly":true,"topicTags":"Array;Hash Table;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":77.42257742257742,"totalAccepted":774,"totalSubmission":1000},{"questionId":"4012","title":"Earliest Time to Finish One Task","titleSlug":"earliest-time-to-finish-one-task","isPaidOnly":false,"difficulty":"Easy","likes":53,"dislikes":4,"categoryTitle":"Algorithms","acRate":"84.7%","frontendQuestionId":"3683","paidOnly":false,"topicTags":"Array;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":84.70467302672611,"totalAccepted":73338,"totalSubmission":86581},{"questionId":"3997","title":"Maximize Sum of At Most K Distinct Elements","titleSlug":"maximize-sum-of-at-most-k-distinct-elements","isPaidOnly":false,"difficulty":"Easy","likes":56,"dislikes":4,"categoryTitle":"Algorithms","acRate":"77.0%","frontendQuestionId":"3684","paidOnly":false,"topicTags":"Array;Hash Table;Greedy;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":77.00617828773169,"totalAccepted":65435,"totalSubmission":84973},{"questionId":"3873","title":"Subsequence Sum After Capping Elements","titleSlug":"subsequence-sum-after-capping-elements","isPaidOnly":false,"difficulty":"Medium","likes":167,"dislikes":16,"categoryTitle":"Algorithms","acRate":"25.4%","frontendQuestionId":"3685","paidOnly":false,"topicTags":"Array;Two Pointers;Dynamic Programming;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":25.391054889886362,"totalAccepted":20534,"totalSubmission":80871},{"questionId":"4027","title":"Number of Stable Subsequences","titleSlug":"number-of-stable-subsequences","isPaidOnly":false,"difficulty":"Hard","likes":88,"dislikes":3,"categoryTitle":"Algorithms","acRate":"60.2%","frontendQuestionId":"3686","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":60.21586223623575,"totalAccepted":24827,"totalSubmission":41230},{"questionId":"4060","title":"Library Late Fee Calculator","titleSlug":"library-late-fee-calculator","isPaidOnly":true,"difficulty":"Easy","likes":5,"dislikes":3,"categoryTitle":"Algorithms","acRate":"94.3%","frontendQuestionId":"3687","paidOnly":true,"topicTags":"Array;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":94.25190194420964,"totalAccepted":2230,"totalSubmission":2366},{"questionId":"4009","title":"Bitwise OR of Even Numbers in an Array","titleSlug":"bitwise-or-of-even-numbers-in-an-array","isPaidOnly":false,"difficulty":"Easy","likes":42,"dislikes":4,"categoryTitle":"Algorithms","acRate":"85.1%","frontendQuestionId":"3688","paidOnly":false,"topicTags":"Array;Bit Manipulation;Simulation;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":85.14958726683997,"totalAccepted":74683,"totalSubmission":87708},{"questionId":"4005","title":"Maximum Total Subarray Value I","titleSlug":"maximum-total-subarray-value-i","isPaidOnly":false,"difficulty":"Medium","likes":283,"dislikes":88,"categoryTitle":"Algorithms","acRate":"71.9%","frontendQuestionId":"3689","paidOnly":false,"topicTags":"Array;Greedy;","hasSolution":true,"hasVideoSolution":false,"acRateRaw":71.89462021420657,"totalAccepted":175198,"totalSubmission":243688},{"questionId":"3928","title":"Split and Merge Array Transformation","titleSlug":"split-and-merge-array-transformation","isPaidOnly":false,"difficulty":"Medium","likes":102,"dislikes":12,"categoryTitle":"Algorithms","acRate":"58.8%","frontendQuestionId":"3690","paidOnly":false,"topicTags":"Array;Hash Table;Breadth-First Search;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":58.84852543821159,"totalAccepted":25482,"totalSubmission":43301},{"questionId":"4007","title":"Maximum Total Subarray Value II","titleSlug":"maximum-total-subarray-value-ii","isPaidOnly":false,"difficulty":"Hard","likes":331,"dislikes":10,"categoryTitle":"Algorithms","acRate":"41.7%","frontendQuestionId":"3691","paidOnly":false,"topicTags":"Array;Greedy;Segment Tree;Heap (Priority Queue);","hasSolution":true,"hasVideoSolution":false,"acRateRaw":41.71272792380689,"totalAccepted":72221,"totalSubmission":173139},{"questionId":"4053","title":"Majority Frequency Characters","titleSlug":"majority-frequency-characters","isPaidOnly":false,"difficulty":"Easy","likes":57,"dislikes":17,"categoryTitle":"Algorithms","acRate":"67.2%","frontendQuestionId":"3692","paidOnly":false,"topicTags":"Hash Table;String;Counting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":67.15142428785607,"totalAccepted":31353,"totalSubmission":46690},{"questionId":"4041","title":"Climbing Stairs II","titleSlug":"climbing-stairs-ii","isPaidOnly":false,"difficulty":"Medium","likes":94,"dislikes":12,"categoryTitle":"Algorithms","acRate":"64.1%","frontendQuestionId":"3693","paidOnly":false,"topicTags":"Array;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.14963010102616,"totalAccepted":32257,"totalSubmission":50284},{"questionId":"4021","title":"Distinct Points Reachable After Substring Removal","titleSlug":"distinct-points-reachable-after-substring-removal","isPaidOnly":false,"difficulty":"Medium","likes":66,"dislikes":1,"categoryTitle":"Algorithms","acRate":"54.1%","frontendQuestionId":"3694","paidOnly":false,"topicTags":"Hash Table;String;Sliding Window;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":54.14074026557187,"totalAccepted":16880,"totalSubmission":31178},{"questionId":"4010","title":"Maximize Alternating Sum Using Swaps","titleSlug":"maximize-alternating-sum-using-swaps","isPaidOnly":false,"difficulty":"Hard","likes":60,"dislikes":4,"categoryTitle":"Algorithms","acRate":"64.7%","frontendQuestionId":"3695","paidOnly":false,"topicTags":"Array;Greedy;Union-Find;Sorting;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.70387087949665,"totalAccepted":9461,"totalSubmission":14622},{"questionId":"4066","title":"Maximum Distance Between Unequal Words in Array I","titleSlug":"maximum-distance-between-unequal-words-in-array-i","isPaidOnly":true,"difficulty":"Easy","likes":6,"dislikes":1,"categoryTitle":"Algorithms","acRate":"82.8%","frontendQuestionId":"3696","paidOnly":true,"topicTags":"Array;String;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":82.8034682080925,"totalAccepted":1146,"totalSubmission":1384},{"questionId":"4039","title":"Compute Decimal Representation","titleSlug":"compute-decimal-representation","isPaidOnly":false,"difficulty":"Easy","likes":51,"dislikes":2,"categoryTitle":"Algorithms","acRate":"64.8%","frontendQuestionId":"3697","paidOnly":false,"topicTags":"Array;Math;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":64.8381753976604,"totalAccepted":62244,"totalSubmission":95999},{"questionId":"4015","title":"Split Array With Minimum Difference","titleSlug":"split-array-with-minimum-difference","isPaidOnly":false,"difficulty":"Medium","likes":103,"dislikes":16,"categoryTitle":"Algorithms","acRate":"33.6%","frontendQuestionId":"3698","paidOnly":false,"topicTags":"Array;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":33.60094084594464,"totalAccepted":41142,"totalSubmission":122443},{"questionId":"3962","title":"Number of ZigZag Arrays I","titleSlug":"number-of-zigzag-arrays-i","isPaidOnly":false,"difficulty":"Hard","likes":85,"dislikes":7,"categoryTitle":"Algorithms","acRate":"33.1%","frontendQuestionId":"3699","paidOnly":false,"topicTags":"Dynamic Programming;Prefix Sum;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":33.12075956072615,"totalAccepted":16256,"totalSubmission":49081},{"questionId":"3964","title":"Number of ZigZag Arrays II","titleSlug":"number-of-zigzag-arrays-ii","isPaidOnly":false,"difficulty":"Hard","likes":28,"dislikes":4,"categoryTitle":"Algorithms","acRate":"57.5%","frontendQuestionId":"3700","paidOnly":false,"topicTags":"Math;Dynamic Programming;","hasSolution":false,"hasVideoSolution":false,"acRateRaw":57.53784368242199,"totalAccepted":14900,"totalSubmission":25896}]