[
  {
    "path": ".gitignore",
    "content": "node_modules\npacakage*.json\nrun*.js\nleet.png\n"
  },
  {
    "path": "README.md",
    "content": "\n# Leetcode sorted\n\nA list of leetcode questions which can be sorted by metrics such as likes, dislikes, likes-dislikes ratio, acceptance rate and much more which is auto updated on daily basis.\n\nFeel free to suggest any changes by opening an issue.\n## Live URL\n\nhttps://adityarajput.com/leetcode\n  \n## Screenshot\n\n![App Screenshot](https://adityarajput.com/leetcode/leet.png)\n\n    \n## Acknowledgements\n \n - [Awesome README](https://github.com/matiassingers/awesome-readme)\n - [Leetcode](https://leetcode.com)\n\n## Technologies used\n\n- Nodejs\n- Google Sheets\n- Cron Jobs\n\n  \n## License\n\n[MIT](https://choosealicense.com/licenses/mit/)\n\n  \n## 🔗 Links\n[![linkedin](https://img.shields.io/badge/linkedin-0A66C2?style=for-the-badge&logo=linkedin&logoColor=white)](https://www.linkedin.com/in/aditya-kumar-rajput/)\n\n  \n"
  },
  {
    "path": "data.csv",
    "content": "questionId,title,titleSlug,isPaidOnly,difficulty,likes,dislikes,categoryTitle,acRate,frontendQuestionId,paidOnly,topicTags,hasSolution,hasVideoSolution,acRateRaw,totalAccepted,totalSubmission\r\n1,\"Two Sum\",two-sum,false,Easy,68699,2569,Algorithms,57.4%,1,false,Array;Hash Table;,true,true,57.35849959850313,21447113,37391339\r\n2,\"Add Two Numbers\",add-two-numbers,false,Medium,36765,7254,Algorithms,48.3%,2,false,Linked List;Math;Recursion;,true,true,48.30425147111061,6954341,14396951\r\n3,\"Longest Substring Without Repeating Characters\",longest-substring-without-repeating-characters,false,Medium,44998,2214,Algorithms,38.9%,3,false,Hash Table;String;Sliding Window;,true,true,38.87883960705547,9345737,24038142\r\n4,\"Median of Two Sorted Arrays\",median-of-two-sorted-arrays,false,Hard,32158,3583,Algorithms,46.3%,4,false,Array;Binary Search;Divide and Conquer;,true,true,46.34493519850407,4199732,9061899\r\n5,\"Longest Palindromic Substring\",longest-palindromic-substring,false,Medium,32650,2013,Algorithms,37.7%,5,false,Two Pointers;String;Dynamic Programming;,true,true,37.671255671811636,4686139,12439567\r\n6,\"Zigzag Conversion\",zigzag-conversion,false,Medium,9375,15937,Algorithms,53.9%,6,false,String;,true,true,53.934881004526204,2179451,4040893\r\n7,\"Reverse Integer\",reverse-integer,false,Medium,15539,14008,Algorithms,31.8%,7,false,Math;,true,true,31.769460187150607,4945457,15566730\r\n8,\"String to Integer (atoi)\",string-to-integer-atoi,false,Medium,6232,15626,Algorithms,20.9%,8,false,String;,true,false,20.862923595277895,2416993,11585147\r\n9,\"Palindrome Number\",palindrome-number,false,Easy,15971,2937,Algorithms,60.5%,9,false,Math;,true,true,60.46960363329371,8030806,13280732\r\n10,\"Regular Expression Matching\",regular-expression-matching,false,Hard,13333,2404,Algorithms,30.8%,10,false,String;Dynamic Programming;Recursion;,true,false,30.76961918299262,1377185,4475794\r\n11,\"Container With Most Water\",container-with-most-water,false,Medium,34282,2211,Algorithms,59.9%,11,false,Array;Two Pointers;Greedy;,true,true,59.867289276961344,5285810,8829234\r\n12,\"Integer to Roman\",integer-to-roman,false,Medium,8546,5722,Algorithms,70.8%,12,false,Hash Table;Math;String;,true,true,70.79756343685051,2118786,2992739\r\n13,\"Roman to Integer\",roman-to-integer,false,Easy,17740,1243,Algorithms,66.5%,13,false,Hash Table;Math;String;,true,true,66.51585561026612,5822333,8753307\r\n14,\"Longest Common Prefix\",longest-common-prefix,false,Easy,21393,4937,Algorithms,47.4%,14,false,Array;String;Trie;,true,true,47.41925094440872,5702274,12025238\r\n15,\"3Sum\",3sum,false,Medium,35608,3285,Algorithms,38.9%,15,false,Array;Two Pointers;Sorting;,true,true,38.91890593253369,5880410,15109392\r\n16,\"3Sum Closest\",3sum-closest,false,Medium,11650,622,Algorithms,48.4%,16,false,Array;Two Pointers;Sorting;,true,true,48.389814464470156,1817290,3755521\r\n17,\"Letter Combinations of a Phone Number\",letter-combinations-of-a-phone-number,false,Medium,20991,1135,Algorithms,65.9%,17,false,Hash Table;String;Backtracking;,true,false,65.88631268955211,2997960,4550202\r\n18,\"4Sum\",4sum,false,Medium,12881,1540,Algorithms,40.4%,18,false,Array;Two Pointers;Sorting;,true,false,40.43119992500787,1669168,4128424\r\n19,\"Remove Nth Node From End of List\",remove-nth-node-from-end-of-list,false,Medium,21267,908,Algorithms,51.4%,19,false,Linked List;Two Pointers;,true,true,51.383731553009284,4168348,8112201\r\n20,\"Valid Parentheses\",valid-parentheses,false,Easy,27957,2009,Algorithms,44.0%,20,false,String;Stack;,true,true,44.02938756470642,7475547,16978547\r\n21,\"Merge Two Sorted Lists\",merge-two-sorted-lists,false,Easy,25001,2447,Algorithms,68.2%,21,false,Linked List;Recursion;,true,true,68.1707958651683,6208099,9106678\r\n22,\"Generate Parentheses\",generate-parentheses,false,Medium,23293,1085,Algorithms,78.6%,22,false,String;Dynamic Programming;Backtracking;,true,true,78.55013669249351,2868346,3651602\r\n23,\"Merge k Sorted Lists\",merge-k-sorted-lists,false,Hard,21307,794,Algorithms,59.3%,23,false,Linked List;Divide and Conquer;Heap (Priority Queue);Merge Sort;,true,true,59.343334472828644,2964998,4996353\r\n24,\"Swap Nodes in Pairs\",swap-nodes-in-pairs,false,Medium,13176,515,Algorithms,69.3%,24,false,Linked List;Recursion;,true,false,69.33657257610587,1909342,2753730\r\n25,\"Reverse Nodes in k-Group\",reverse-nodes-in-k-group,false,Hard,15674,804,Algorithms,65.8%,25,false,Linked List;Recursion;,true,false,65.84817341739355,1524913,2315801\r\n26,\"Remove Duplicates from Sorted Array\",remove-duplicates-from-sorted-array,false,Easy,19158,20539,Algorithms,62.6%,26,false,Array;Two Pointers;,true,true,62.63324780213865,7765869,12398958\r\n27,\"Remove Element\",remove-element,false,Easy,5144,5363,Algorithms,61.7%,27,false,Array;Two Pointers;,true,true,61.664031809622045,5182244,8403998\r\n28,\"Find the Index of the First Occurrence in a String\",find-the-index-of-the-first-occurrence-in-a-string,false,Easy,7624,584,Algorithms,46.5%,28,false,Two Pointers;String;String Matching;,true,true,46.52594109499813,4030688,8663322\r\n29,\"Divide Two Integers\",divide-two-integers,false,Medium,6129,15280,Algorithms,19.6%,29,false,Math;Bit Manipulation;,true,false,19.64619650020539,1155950,5883833\r\n30,\"Substring with Concatenation of All Words\",substring-with-concatenation-of-all-words,false,Hard,2654,441,Algorithms,34.3%,30,false,Hash Table;String;Sliding Window;,true,true,34.264131020793705,704819,2057015\r\n31,\"Next Permutation\",next-permutation,false,Medium,21395,5116,Algorithms,45.1%,31,false,Array;Two Pointers;,true,true,45.081667876940365,2245503,4980966\r\n32,\"Longest Valid Parentheses\",longest-valid-parentheses,false,Hard,13327,466,Algorithms,38.6%,32,false,String;Dynamic Programming;Stack;,true,false,38.58607442943393,1096443,2841557\r\n33,\"Search in Rotated Sorted Array\",search-in-rotated-sorted-array,false,Medium,30047,1829,Algorithms,44.4%,33,false,Array;Binary Search;,true,false,44.39678194887695,4398740,9907806\r\n34,\"Find First and Last Position of Element in Sorted Array\",find-first-and-last-position-of-element-in-sorted-array,false,Medium,23326,650,Algorithms,48.7%,34,false,Array;Binary Search;,true,false,48.703744316856536,3284481,6743815\r\n35,\"Search Insert Position\",search-insert-position,false,Easy,18845,902,Algorithms,51.1%,35,false,Array;Binary Search;,true,true,51.07941961700778,4696614,9194732\r\n36,\"Valid Sudoku\",valid-sudoku,false,Medium,12496,1265,Algorithms,64.4%,36,false,Array;Hash Table;Matrix;,true,false,64.39874661957549,2473218,3840481\r\n37,\"Sudoku Solver\",sudoku-solver,false,Hard,11119,346,Algorithms,65.4%,37,false,Array;Hash Table;Backtracking;Matrix;,true,false,65.43889399770454,1026848,1569167\r\n38,\"Count and Say\",count-and-say,false,Medium,5119,9081,Algorithms,62.7%,38,false,String;,true,false,62.69199800911582,1406956,2244233\r\n39,\"Combination Sum\",combination-sum,false,Medium,21004,542,Algorithms,76.4%,39,false,Array;Backtracking;,true,true,76.40358006659127,3113408,4074957\r\n40,\"Combination Sum II\",combination-sum-ii,false,Medium,12277,389,Algorithms,59.3%,40,false,Array;Backtracking;,true,false,59.30248539846807,1691356,2852088\r\n41,\"First Missing Positive\",first-missing-positive,false,Hard,18415,1983,Algorithms,42.8%,41,false,Array;Hash Table;,true,false,42.75575003085709,1742395,4075233\r\n42,\"Trapping Rain Water\",trapping-rain-water,false,Hard,36428,702,Algorithms,67.2%,42,false,Array;Two Pointers;Dynamic Programming;Stack;Monotonic Stack;,true,false,67.18448817589812,3515076,5231976\r\n43,\"Multiply Strings\",multiply-strings,false,Medium,7748,3690,Algorithms,44.0%,43,false,Math;String;Simulation;,true,false,43.9828644178692,1154217,2624239\r\n44,\"Wildcard Matching\",wildcard-matching,false,Hard,9130,419,Algorithms,31.8%,44,false,String;Dynamic Programming;Greedy;Recursion;,true,false,31.77478208655832,866790,2727920\r\n45,\"Jump Game II\",jump-game-ii,false,Medium,16503,707,Algorithms,42.7%,45,false,Array;Dynamic Programming;Greedy;,true,false,42.721016229403844,2119493,4961242\r\n46,\"Permutations\",permutations,false,Medium,20885,385,Algorithms,81.8%,46,false,Array;Backtracking;,true,false,81.83332586078429,3066325,3747039\r\n47,\"Permutations II\",permutations-ii,false,Medium,9158,163,Algorithms,63.3%,47,false,Array;Backtracking;Sorting;,true,false,63.2826512300384,1281117,2024441\r\n48,\"Rotate Image\",rotate-image,false,Medium,19898,966,Algorithms,79.6%,48,false,Array;Math;Matrix;,true,false,79.59910423181967,2800549,3518318\r\n49,\"Group Anagrams\",group-anagrams,false,Medium,22083,758,Algorithms,72.5%,49,false,Array;Hash Table;String;Sorting;,true,true,72.45571477711128,4688837,6471317\r\n50,\"Pow(x, n)\",powx-n,false,Medium,11714,10553,Algorithms,38.5%,50,false,Math;Recursion;,true,false,38.53965131819274,2691370,6983380\r\n51,\"N-Queens\",n-queens,false,Hard,14352,351,Algorithms,75.3%,51,false,Array;Backtracking;,true,false,75.34238314311217,1261824,1674791\r\n52,\"N-Queens II\",n-queens-ii,false,Hard,4289,283,Algorithms,78.5%,52,false,Backtracking;,true,false,78.503809045464,597061,760552\r\n53,\"Maximum Subarray\",maximum-subarray,false,Medium,37851,1611,Algorithms,53.2%,53,false,Array;Divide and Conquer;Dynamic Programming;,true,true,53.199371952568185,6041887,11357074\r\n54,\"Spiral Matrix\",spiral-matrix,false,Medium,17486,1572,Algorithms,56.6%,54,false,Array;Matrix;Simulation;,true,false,56.58186170804501,2370161,4188906\r\n55,\"Jump Game\",jump-game,false,Medium,21760,1491,Algorithms,40.7%,55,false,Array;Dynamic Programming;Greedy;,true,false,40.739357219969676,3163825,7766016\r\n56,\"Merge Intervals\",merge-intervals,false,Medium,24659,908,Algorithms,51.6%,56,false,Array;Sorting;,true,true,51.608841497174375,3956930,7667158\r\n57,\"Insert Interval\",insert-interval,false,Medium,11859,920,Algorithms,45.1%,57,false,Array;,true,false,45.05625075509523,1760241,3906765\r\n58,\"Length of Last Word\",length-of-last-word,false,Easy,6446,365,Algorithms,58.7%,58,false,String;,true,false,58.659431254024064,3386433,5773056\r\n59,\"Spiral Matrix II\",spiral-matrix-ii,false,Medium,6916,289,Algorithms,74.9%,59,false,Array;Matrix;Simulation;,true,false,74.90262500514963,799982,1068031\r\n60,\"Permutation Sequence\",permutation-sequence,false,Hard,7272,511,Algorithms,52.8%,60,false,Math;Recursion;,true,false,52.792933923708866,572900,1085184\r\n61,\"Rotate List\",rotate-list,false,Medium,11282,1554,Algorithms,41.6%,61,false,Linked List;Two Pointers;,true,false,41.574168741080626,1598452,3844826\r\n62,\"Unique Paths\",unique-paths,false,Medium,18393,495,Algorithms,66.7%,62,false,Math;Dynamic Programming;Combinatorics;,true,false,66.74031169335495,2804813,4202576\r\n63,\"Unique Paths II\",unique-paths-ii,false,Medium,9706,561,Algorithms,44.4%,63,false,Array;Dynamic Programming;Matrix;,true,false,44.36997888446467,1472792,3319340\r\n64,\"Minimum Path Sum\",minimum-path-sum,false,Medium,13713,203,Algorithms,68.1%,64,false,Array;Dynamic Programming;Matrix;,true,false,68.0910039998294,1835959,2696335\r\n65,\"Valid Number\",valid-number,false,Hard,1509,2214,Algorithms,22.9%,65,false,String;,true,false,22.85469203722415,516623,2260468\r\n66,\"Plus One\",plus-one,false,Easy,11870,5611,Algorithms,49.8%,66,false,Array;Math;,true,false,49.83310929232771,3704531,7433879\r\n67,\"Add Binary\",add-binary,false,Easy,10780,1116,Algorithms,57.9%,67,false,Math;String;Bit Manipulation;Simulation;,true,false,57.92248518396489,2325810,4015383\r\n68,\"Text Justification\",text-justification,false,Hard,4569,5404,Algorithms,50.9%,68,false,Array;String;Simulation;,true,false,50.86396086050895,646867,1271759\r\n69,\"Sqrt(x)\",sqrtx,false,Easy,9715,4641,Algorithms,41.7%,69,false,Math;Binary Search;,true,true,41.68522859835111,3159934,7580470\r\n70,\"Climbing Stairs\",climbing-stairs,false,Easy,24527,1048,Algorithms,54.0%,70,false,Math;Dynamic Programming;Memoization;,true,false,54.01779638553948,5076413,9397674\r\n71,\"Simplify Path\",simplify-path,false,Medium,6564,1416,Algorithms,50.4%,71,false,String;Stack;,true,true,50.40143248496351,1317305,2613633\r\n72,\"Edit Distance\",edit-distance,false,Medium,16451,325,Algorithms,60.4%,72,false,String;Dynamic Programming;,true,false,60.42920099957352,1441003,2384615\r\n73,\"Set Matrix Zeroes\",set-matrix-zeroes,false,Medium,17137,867,Algorithms,62.7%,73,false,Array;Hash Table;Matrix;,true,false,62.74746748075001,2557317,4075568\r\n74,\"Search a 2D Matrix\",search-a-2d-matrix,false,Medium,17939,485,Algorithms,53.8%,74,false,Array;Binary Search;Matrix;,true,false,53.8076409455967,2863989,5322657\r\n75,\"Sort Colors\",sort-colors,false,Medium,21665,772,Algorithms,69.5%,75,false,Array;Two Pointers;Sorting;,true,false,69.46769801147713,3697221,5322221\r\n76,\"Minimum Window Substring\",minimum-window-substring,false,Hard,20216,855,Algorithms,47.3%,76,false,Hash Table;String;Sliding Window;,true,false,47.33563715475843,2140929,4522890\r\n77,\"Combinations\",combinations,false,Medium,8932,255,Algorithms,74.5%,77,false,Backtracking;,true,false,74.46689289796909,1326301,1781062\r\n78,\"Subsets\",subsets,false,Medium,19242,341,Algorithms,82.2%,78,false,Array;Backtracking;Bit Manipulation;,true,true,82.24396268906565,3019068,3670871\r\n79,\"Word Search\",word-search,false,Medium,17697,757,Algorithms,47.2%,79,false,Array;String;Backtracking;Depth-First Search;Matrix;,true,false,47.19732693492873,2482792,5260463\r\n80,\"Remove Duplicates from Sorted Array II\",remove-duplicates-from-sorted-array-ii,false,Medium,8280,1520,Algorithms,64.6%,80,false,Array;Two Pointers;,true,false,64.5591407256857,1918574,2971809\r\n81,\"Search in Rotated Sorted Array II\",search-in-rotated-sorted-array-ii,false,Medium,9646,1125,Algorithms,39.9%,81,false,Array;Binary Search;,true,false,39.93438043921437,1227235,3073139\r\n82,\"Remove Duplicates from Sorted List II\",remove-duplicates-from-sorted-list-ii,false,Medium,9693,283,Algorithms,51.6%,82,false,Linked List;Two Pointers;,true,false,51.62977720811154,1092808,2116631\r\n83,\"Remove Duplicates from Sorted List\",remove-duplicates-from-sorted-list,false,Easy,9891,377,Algorithms,56.6%,83,false,Linked List;,true,true,56.582774853733056,2356182,4164133\r\n84,\"Largest Rectangle in Histogram\",largest-rectangle-in-histogram,false,Hard,19667,391,Algorithms,49.7%,84,false,Array;Stack;Monotonic Stack;,true,true,49.6968277052588,1544218,3107287\r\n85,\"Maximal Rectangle\",maximal-rectangle,false,Hard,12093,228,Algorithms,58.5%,85,false,Array;Dynamic Programming;Stack;Matrix;Monotonic Stack;,true,false,58.53896598384423,799465,1365700\r\n86,\"Partition List\",partition-list,false,Medium,8058,984,Algorithms,61.0%,86,false,Linked List;Two Pointers;,true,false,60.9845554371909,903362,1481297\r\n87,\"Scramble String\",scramble-string,false,Hard,3639,1313,Algorithms,44.3%,87,false,String;Dynamic Programming;,true,false,44.349097381133994,313965,707940\r\n88,\"Merge Sorted Array\",merge-sorted-array,false,Easy,19017,2656,Algorithms,54.7%,88,false,Array;Two Pointers;Sorting;,true,true,54.69497399033146,5629175,10291941\r\n89,\"Gray Code\",gray-code,false,Medium,2542,2837,Algorithms,64.7%,89,false,Math;Backtracking;Bit Manipulation;,true,false,64.66586665357183,421399,651656\r\n90,\"Subsets II\",subsets-ii,false,Medium,10951,417,Algorithms,61.2%,90,false,Array;Backtracking;Bit Manipulation;,true,false,61.16009862165439,1483892,2426242\r\n91,\"Decode Ways\",decode-ways,false,Medium,12900,4614,Algorithms,37.9%,91,false,String;Dynamic Programming;,true,true,37.85758824971738,1648958,4355695\r\n92,\"Reverse Linked List II\",reverse-linked-list-ii,false,Medium,12964,787,Algorithms,51.4%,92,false,Linked List;,true,true,51.35918366383715,1305794,2542478\r\n93,\"Restore IP Addresses\",restore-ip-addresses,false,Medium,5664,821,Algorithms,55.8%,93,false,String;Backtracking;,true,false,55.784957865155974,623123,1117009\r\n94,\"Binary Tree Inorder Traversal\",binary-tree-inorder-traversal,false,Easy,14935,904,Algorithms,80.0%,94,false,Stack;Tree;Depth-First Search;Binary Tree;,true,false,79.95444790302155,3679295,4601744\r\n95,\"Unique Binary Search Trees II\",unique-binary-search-trees-ii,false,Medium,7960,584,Algorithms,62.3%,95,false,Dynamic Programming;Backtracking;Tree;Binary Search Tree;Binary Tree;,true,false,62.28923129988628,577878,927734\r\n96,\"Unique Binary Search Trees\",unique-binary-search-trees,false,Medium,11025,448,Algorithms,63.6%,96,false,Math;Dynamic Programming;Tree;Binary Search Tree;Binary Tree;,true,false,63.574816559524436,861564,1355198\r\n97,\"Interleaving String\",interleaving-string,false,Medium,8854,556,Algorithms,43.8%,97,false,String;Dynamic Programming;,true,false,43.841936831640076,779653,1778327\r\n98,\"Validate Binary Search Tree\",validate-binary-search-tree,false,Medium,18405,1461,Algorithms,35.6%,98,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,true,35.62306232614128,3319179,9317513\r\n99,\"Recover Binary Search Tree\",recover-binary-search-tree,false,Medium,8614,292,Algorithms,59.4%,99,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,59.376604261276945,661586,1114220\r\n100,\"Same Tree\",same-tree,false,Easy,12907,301,Algorithms,67.0%,100,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,true,66.96410686966449,3386529,5057239\r\n401,\"Binary Watch\",binary-watch,false,Easy,1968,3078,Algorithms,65.4%,401,false,Backtracking;Bit Manipulation;,true,false,65.39265042526661,281089,429848\r\n402,\"Remove K Digits\",remove-k-digits,false,Medium,10622,549,Algorithms,36.7%,402,false,String;Stack;Greedy;Monotonic Stack;,true,false,36.68201680384898,729410,1988469\r\n403,\"Frog Jump\",frog-jump,false,Hard,5997,278,Algorithms,47.2%,403,false,Array;Dynamic Programming;,true,false,47.23564849111723,337938,715429\r\n404,\"Sum of Left Leaves\",sum-of-left-leaves,false,Easy,5801,327,Algorithms,62.6%,404,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,62.578082743427466,792510,1266436\r\n405,\"Convert a Number to Hexadecimal\",convert-a-number-to-hexadecimal,false,Easy,1448,232,Algorithms,53.8%,405,false,Math;String;Bit Manipulation;,false,false,53.84228179679712,219275,407255\r\n406,\"Queue Reconstruction by Height\",queue-reconstruction-by-height,false,Medium,7250,754,Algorithms,74.7%,406,false,Array;Binary Indexed Tree;Segment Tree;Sorting;,true,false,74.67201956176784,344466,461306\r\n407,\"Trapping Rain Water II\",trapping-rain-water-ii,false,Hard,5010,174,Algorithms,64.1%,407,false,Array;Breadth-First Search;Heap (Priority Queue);Matrix;,true,false,64.06033916730603,266349,415778\r\n408,\"Valid Word Abbreviation\",valid-word-abbreviation,true,Easy,926,2406,Algorithms,37.0%,408,true,Two Pointers;String;,false,false,37.029378902533566,361573,976449\r\n409,\"Longest Palindrome\",longest-palindrome,false,Easy,6388,451,Algorithms,55.9%,409,false,Hash Table;String;Greedy;,true,false,55.92547316680474,1050384,1878185\r\n410,\"Split Array Largest Sum\",split-array-largest-sum,false,Hard,11372,269,Algorithms,60.2%,410,false,Array;Binary Search;Dynamic Programming;Greedy;Prefix Sum;,true,false,60.23429451701335,627960,1042531\r\n411,\"Minimum Unique Word Abbreviation\",minimum-unique-word-abbreviation,true,Hard,184,146,Algorithms,40.5%,411,true,Array;String;Backtracking;Bit Manipulation;,false,false,40.48555924182805,15742,38883\r\n412,\"Fizz Buzz\",fizz-buzz,false,Easy,3388,465,Algorithms,75.4%,412,false,Math;String;Simulation;,true,true,75.43889930707157,1774459,2352183\r\n413,\"Arithmetic Slices\",arithmetic-slices,false,Medium,5639,306,Algorithms,64.8%,413,false,Array;Dynamic Programming;Sliding Window;,true,false,64.82906864586255,367645,567099\r\n414,\"Third Maximum Number\",third-maximum-number,false,Easy,3547,3545,Algorithms,39.2%,414,false,Array;Sorting;,true,false,39.24332392995469,835500,2129023\r\n415,\"Add Strings\",add-strings,false,Easy,5468,833,Algorithms,52.1%,415,false,Math;String;Simulation;,true,false,52.131376193691246,938138,1799565\r\n416,\"Partition Equal Subset Sum\",partition-equal-subset-sum,false,Medium,13880,300,Algorithms,49.4%,416,false,Array;Dynamic Programming;,true,true,49.383316605397084,1492293,3021860\r\n417,\"Pacific Atlantic Water Flow\",pacific-atlantic-water-flow,false,Medium,8729,1837,Algorithms,60.8%,417,false,Array;Depth-First Search;Breadth-First Search;Matrix;,true,false,60.82233431753558,802555,1319508\r\n418,\"Sentence Screen Fitting\",sentence-screen-fitting,true,Medium,1143,543,Algorithms,36.4%,418,true,Array;String;Dynamic Programming;,false,false,36.39787690109217,106977,293910\r\n419,\"Battleships in a Board\",battleships-in-a-board,false,Medium,2524,1030,Algorithms,77.5%,419,false,Array;Depth-First Search;Matrix;,false,false,77.47761536695492,283472,365875\r\n420,\"Strong Password Checker\",strong-password-checker,false,Hard,967,1754,Algorithms,15.7%,420,false,String;Greedy;Heap (Priority Queue);,false,false,15.657968263417565,55760,356118\r\n421,\"Maximum XOR of Two Numbers in an Array\",maximum-xor-of-two-numbers-in-an-array,false,Medium,5942,424,Algorithms,53.4%,421,false,Array;Hash Table;Bit Manipulation;Trie;,true,false,53.4030983595073,221067,413960\r\n422,\"Valid Word Square\",valid-word-square,true,Easy,451,274,Algorithms,42.9%,422,true,Array;Matrix;,true,false,42.86876404765205,71142,165953\r\n423,\"Reconstruct Original Digits from English\",reconstruct-original-digits-from-english,false,Medium,895,2811,Algorithms,52.8%,423,false,Hash Table;Math;String;,true,false,52.81535823170732,99783,188928\r\n424,\"Longest Repeating Character Replacement\",longest-repeating-character-replacement,false,Medium,13075,769,Algorithms,59.4%,424,false,Hash Table;String;Sliding Window;,true,false,59.43754402173681,1534994,2582532\r\n425,\"Word Squares\",word-squares,true,Hard,1124,75,Algorithms,54.7%,425,true,Array;String;Backtracking;Trie;,true,false,54.682894236941735,83480,152662\r\n758,\"Convert Binary Search Tree to Sorted Doubly Linked List\",convert-binary-search-tree-to-sorted-doubly-linked-list,true,Medium,2730,245,Algorithms,65.6%,426,true,Linked List;Stack;Tree;Depth-First Search;Binary Search Tree;Binary Tree;Doubly-Linked List;,true,false,65.64106724896067,372154,566953\r\n772,\"Construct Quad Tree\",construct-quad-tree,false,Medium,1762,1964,Algorithms,78.2%,427,false,Array;Divide and Conquer;Tree;Matrix;,true,false,78.21371549485428,203295,259923\r\n765,\"Serialize and Deserialize N-ary Tree\",serialize-and-deserialize-n-ary-tree,true,Hard,1074,58,Algorithms,68.7%,428,true,String;Tree;Depth-First Search;Breadth-First Search;,true,false,68.73033468050095,99826,145243\r\n764,\"N-ary Tree Level Order Traversal\",n-ary-tree-level-order-traversal,false,Medium,3757,146,Algorithms,71.5%,429,false,Tree;Breadth-First Search;,true,false,71.51316893793599,366389,512339\r\n766,\"Flatten a Multilevel Doubly Linked List\",flatten-a-multilevel-doubly-linked-list,false,Medium,5465,351,Algorithms,62.8%,430,false,Linked List;Depth-First Search;Doubly-Linked List;,true,false,62.75894430509078,437346,696867\r\n771,\"Encode N-ary Tree to Binary Tree\",encode-n-ary-tree-to-binary-tree,true,Hard,538,30,Algorithms,80.6%,431,true,Tree;Depth-First Search;Breadth-First Search;Design;Binary Tree;,true,false,80.58102499758711,25047,31083\r\n432,\"All O`one Data Structure\",all-oone-data-structure,false,Hard,2233,224,Algorithms,44.2%,432,false,Hash Table;Linked List;Design;Doubly-Linked List;,true,false,44.21428448231256,205078,463829\r\n433,\"Minimum Genetic Mutation\",minimum-genetic-mutation,false,Medium,3317,348,Algorithms,56.5%,433,false,Hash Table;String;Breadth-First Search;,true,false,56.542663099737354,278571,492674\r\n434,\"Number of Segments in a String\",number-of-segments-in-a-string,false,Easy,918,1338,Algorithms,37.2%,434,false,String;,true,false,37.19508427909475,276935,744549\r\n435,\"Non-overlapping Intervals\",non-overlapping-intervals,false,Medium,9152,260,Algorithms,57.0%,435,false,Array;Dynamic Programming;Greedy;Sorting;,true,false,56.99165063348342,1003880,1761451\r\n436,\"Find Right Interval\",find-right-interval,false,Medium,2363,398,Algorithms,55.7%,436,false,Array;Binary Search;Sorting;,false,false,55.689031725725535,160629,288440\r\n437,\"Path Sum III\",path-sum-iii,false,Medium,11933,575,Algorithms,46.4%,437,false,Tree;Depth-First Search;Binary Tree;,true,false,46.374322865020254,788014,1699247\r\n438,\"Find All Anagrams in a String\",find-all-anagrams-in-a-string,false,Medium,13231,378,Algorithms,53.6%,438,false,Hash Table;String;Sliding Window;,true,false,53.598330002252624,1194438,2228502\r\n439,\"Ternary Expression Parser\",ternary-expression-parser,true,Medium,514,74,Algorithms,62.6%,439,true,String;Stack;Recursion;,true,false,62.567519487660505,38688,61834\r\n440,\"K-th Smallest in Lexicographical Order\",k-th-smallest-in-lexicographical-order,false,Hard,1650,147,Algorithms,46.3%,440,false,Trie;,true,false,46.27469526446862,169277,365809\r\n441,\"Arranging Coins\",arranging-coins,false,Easy,4359,1380,Algorithms,48.1%,441,false,Math;Binary Search;,true,false,48.119426946910146,619833,1288113\r\n442,\"Find All Duplicates in an Array\",find-all-duplicates-in-an-array,false,Medium,11158,449,Algorithms,76.9%,442,false,Array;Hash Table;Sorting;,true,false,76.89467599653031,1033623,1344208\r\n443,\"String Compression\",string-compression,false,Medium,6226,8905,Algorithms,59.9%,443,false,Two Pointers;String;,true,false,59.85032289689786,1064673,1778891\r\n444,\"Sequence Reconstruction\",sequence-reconstruction,true,Medium,616,1549,Algorithms,30.7%,444,true,Array;Graph Theory;Topological Sort;,false,false,30.680694817116226,65175,212430\r\n445,\"Add Two Numbers II\",add-two-numbers-ii,false,Medium,6175,303,Algorithms,62.5%,445,false,Linked List;Math;Stack;,true,false,62.54705672724916,579190,926008\r\n446,\"Arithmetic Slices II - Subsequence\",arithmetic-slices-ii-subsequence,false,Hard,3517,165,Algorithms,55.0%,446,false,Array;Dynamic Programming;,true,false,55.01472574320256,169052,307285\r\n447,\"Number of Boomerangs\",number-of-boomerangs,false,Medium,901,1046,Algorithms,57.5%,447,false,Array;Hash Table;Math;,false,false,57.49863070800878,118626,206311\r\n448,\"Find All Numbers Disappeared in an Array\",find-all-numbers-disappeared-in-an-array,false,Easy,10416,557,Algorithms,64.0%,448,false,Array;Hash Table;,true,false,64.01204339840668,1372149,2143580\r\n449,\"Serialize and Deserialize BST\",serialize-and-deserialize-bst,false,Medium,3605,180,Algorithms,59.5%,449,false,String;Tree;Depth-First Search;Breadth-First Search;Design;Binary Search Tree;Binary Tree;,true,false,59.53599903306153,275841,463318\r\n450,\"Delete Node in a BST\",delete-node-in-a-bst,false,Medium,10462,388,Algorithms,54.5%,450,false,Tree;Binary Search Tree;Binary Tree;,true,false,54.506529420412555,860151,1578077\r\n451,\"Sort Characters By Frequency\",sort-characters-by-frequency,false,Medium,9257,336,Algorithms,75.3%,451,false,Hash Table;String;Sorting;Heap (Priority Queue);Bucket Sort;Counting;,true,false,75.25839433130226,1106903,1470806\r\n452,\"Minimum Number of Arrows to Burst Balloons\",minimum-number-of-arrows-to-burst-balloons,false,Medium,8102,274,Algorithms,61.3%,452,false,Array;Greedy;Sorting;,true,false,61.345394317747484,780028,1271536\r\n453,\"Minimum Moves to Equal Array Elements\",minimum-moves-to-equal-array-elements,false,Medium,2825,1914,Algorithms,58.7%,453,false,Array;Math;,true,false,58.660325009908846,219039,373403\r\n454,\"4Sum II\",4sum-ii,false,Medium,5084,151,Algorithms,57.9%,454,false,Array;Hash Table;,true,false,57.917356710829495,386091,666624\r\n455,\"Assign Cookies\",assign-cookies,false,Easy,5018,460,Algorithms,54.8%,455,false,Array;Two Pointers;Greedy;Sorting;,true,false,54.848683396263375,935054,1704791\r\n456,\"132 Pattern\",132-pattern,false,Medium,7635,472,Algorithms,34.7%,456,false,Array;Binary Search;Stack;Monotonic Stack;Ordered Set;,true,true,34.67847401262938,324835,936705\r\n457,\"Circular Array Loop\",circular-array-loop,false,Medium,831,905,Algorithms,37.2%,457,false,Array;Hash Table;Two Pointers;,false,false,37.21150741028301,108316,291082\r\n458,\"Poor Pigs\",poor-pigs,false,Hard,1874,3369,Algorithms,59.1%,458,false,Math;Dynamic Programming;Combinatorics;,true,false,59.109794653269546,133304,225516\r\n459,\"Repeated Substring Pattern\",repeated-substring-pattern,false,Easy,6873,570,Algorithms,48.1%,459,false,String;String Matching;,true,false,48.10847053799565,610598,1269211\r\n460,\"LFU Cache\",lfu-cache,false,Hard,6359,356,Algorithms,49.0%,460,false,Hash Table;Linked List;Design;Doubly-Linked List;,true,false,49.01730830400343,379090,773383\r\n461,\"Hamming Distance\",hamming-distance,false,Easy,4037,231,Algorithms,76.7%,461,false,Bit Manipulation;,true,false,76.73416515689058,689524,898588\r\n462,\"Minimum Moves to Equal Array Elements II\",minimum-moves-to-equal-array-elements-ii,false,Medium,3521,132,Algorithms,61.7%,462,false,Array;Math;Sorting;,true,false,61.684568637941204,224830,364484\r\n463,\"Island Perimeter\",island-perimeter,false,Easy,7314,431,Algorithms,74.4%,463,false,Array;Depth-First Search;Breadth-First Search;Matrix;,true,false,74.36819261543403,824332,1108447\r\n464,\"Can I Win\",can-i-win,false,Medium,2835,433,Algorithms,31.3%,464,false,Math;Dynamic Programming;Bit Manipulation;Memoization;Game Theory;Bitmask;,false,false,31.2798402584354,122972,393135\r\n465,\"Optimal Account Balancing\",optimal-account-balancing,true,Hard,1532,164,Algorithms,50.4%,465,true,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,50.39537846505293,114715,227630\r\n466,\"Count The Repetitions\",count-the-repetitions,false,Hard,448,370,Algorithms,34.1%,466,false,Two Pointers;String;Dynamic Programming;,true,false,34.054525470706295,28502,83701\r\n467,\"Unique Substrings in Wraparound String\",unique-substrings-in-wraparound-string,false,Medium,1531,191,Algorithms,42.9%,467,false,String;Dynamic Programming;,false,false,42.940300425615554,56800,132278\r\n468,\"Validate IP Address\",validate-ip-address,false,Medium,1124,2746,Algorithms,28.3%,468,false,String;,true,false,28.28031481484079,201617,712924\r\n469,\"Convex Polygon\",convex-polygon,true,Medium,103,242,Algorithms,40.2%,469,true,Array;Math;Geometry;,false,false,40.1980402980955,11651,28984\r\n903,\"Implement Rand10() Using Rand7()\",implement-rand10-using-rand7,false,Medium,1176,388,Algorithms,46.3%,470,false,Math;Rejection Sampling;Randomized;Probability and Statistics;,true,false,46.313492431980684,109724,236917\r\n471,\"Encode String with Shortest Length\",encode-string-with-shortest-length,true,Hard,632,54,Algorithms,50.6%,471,true,String;Dynamic Programming;,false,false,50.589643065199255,32131,63513\r\n472,\"Concatenated Words\",concatenated-words,false,Hard,4069,293,Algorithms,49.8%,472,false,Array;String;Dynamic Programming;Depth-First Search;Trie;Sorting;,true,false,49.763770153940015,267536,537612\r\n473,\"Matchsticks to Square\",matchsticks-to-square,false,Medium,4039,308,Algorithms,41.8%,473,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,41.76906618652886,214352,513185\r\n474,\"Ones and Zeroes\",ones-and-zeroes,false,Medium,6089,509,Algorithms,53.2%,474,false,Array;String;Dynamic Programming;,true,false,53.23987652965363,349093,655701\r\n475,\"Heaters\",heaters,false,Medium,2365,1200,Algorithms,41.7%,475,false,Array;Two Pointers;Binary Search;Sorting;,false,false,41.733488505987516,169616,406428\r\n476,\"Number Complement\",number-complement,false,Easy,3236,145,Algorithms,70.4%,476,false,Bit Manipulation;,true,false,70.43155683537758,551546,783095\r\n477,\"Total Hamming Distance\",total-hamming-distance,false,Medium,2309,97,Algorithms,54.8%,477,false,Array;Math;Bit Manipulation;,true,false,54.77902642941835,135364,247110\r\n915,\"Generate Random Point in a Circle\",generate-random-point-in-a-circle,false,Medium,482,784,Algorithms,42.8%,478,false,Math;Geometry;Rejection Sampling;Randomized;,true,false,42.75008274362086,54249,126898\r\n479,\"Largest Palindrome Product\",largest-palindrome-product,false,Hard,194,1569,Algorithms,38.5%,479,false,Math;Enumeration;,false,false,38.518551842812634,34248,88913\r\n480,\"Sliding Window Median\",sliding-window-median,false,Hard,3586,241,Algorithms,38.9%,480,false,Array;Hash Table;Sliding Window;Heap (Priority Queue);,true,false,38.946711000237755,219501,563596\r\n481,\"Magical String\",magical-string,false,Medium,383,1425,Algorithms,55.0%,481,false,Two Pointers;String;,false,false,54.99729503762357,55912,101664\r\n482,\"License Key Formatting\",license-key-formatting,false,Easy,1208,1472,Algorithms,45.9%,482,false,String;,true,false,45.88645446268493,359848,784214\r\n483,\"Smallest Good Base\",smallest-good-base,false,Hard,427,540,Algorithms,45.9%,483,false,Math;Binary Search;,false,false,45.877630564726076,31544,68758\r\n484,\"Find Permutation\",find-permutation,true,Medium,728,151,Algorithms,66.9%,484,true,Array;String;Stack;Greedy;,true,false,66.86304750154225,43354,64840\r\n485,\"Max Consecutive Ones\",max-consecutive-ones,false,Easy,6895,500,Algorithms,65.0%,485,false,Array;,true,false,64.96435629189752,2246248,3457665\r\n486,\"Predict the Winner\",predict-the-winner,false,Medium,6171,296,Algorithms,56.2%,486,false,Array;Math;Dynamic Programming;Recursion;Game Theory;,true,true,56.179710111303805,290578,517231\r\n487,\"Max Consecutive Ones II\",max-consecutive-ones-ii,true,Medium,1607,27,Algorithms,52.0%,487,true,Array;Dynamic Programming;Sliding Window;,true,false,52.000475495024276,183726,353316\r\n488,\"Zuma Game\",zuma-game,false,Hard,496,516,Algorithms,29.8%,488,false,String;Dynamic Programming;Stack;Breadth-First Search;Memoization;,false,false,29.828019712360454,29658,99430\r\n865,\"Robot Room Cleaner\",robot-room-cleaner,true,Hard,2898,193,Algorithms,78.0%,489,true,Backtracking;Interactive;,true,false,77.96789394760015,211615,271413\r\n490,\"The Maze\",the-maze,true,Medium,1930,199,Algorithms,60.4%,490,true,Array;Depth-First Search;Breadth-First Search;Matrix;,true,false,60.38508654358886,209497,346935\r\n491,\"Non-decreasing Subsequences\",non-decreasing-subsequences,false,Medium,3827,239,Algorithms,62.6%,491,false,Array;Hash Table;Backtracking;Bit Manipulation;,true,false,62.60484560117433,210259,335851\r\n492,\"Construct the Rectangle\",construct-the-rectangle,false,Easy,800,394,Algorithms,63.6%,492,false,Math;,false,false,63.55567738565772,171572,269956\r\n493,\"Reverse Pairs\",reverse-pairs,false,Hard,7025,300,Algorithms,34.0%,493,false,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,true,false,34.04805644580636,358443,1052760\r\n494,\"Target Sum\",target-sum,false,Medium,12407,416,Algorithms,52.1%,494,false,Array;Dynamic Programming;Backtracking;,true,false,52.09162716762029,1079115,2071570\r\n495,\"Teemo Attacking\",teemo-attacking,false,Easy,1369,158,Algorithms,57.6%,495,false,Array;Simulation;,true,false,57.61289851900489,221115,383795\r\n496,\"Next Greater Element I\",next-greater-element-i,false,Easy,9903,1111,Algorithms,76.0%,496,false,Array;Hash Table;Stack;Monotonic Stack;,true,false,76.02372948857912,1408755,1853048\r\n914,\"Random Point in Non-overlapping Rectangles\",random-point-in-non-overlapping-rectangles,false,Medium,523,689,Algorithms,39.6%,497,false,Array;Math;Binary Search;Reservoir Sampling;Prefix Sum;Ordered Set;Randomized;,true,false,39.64354276067616,53072,133870\r\n498,\"Diagonal Traverse\",diagonal-traverse,false,Medium,4331,785,Algorithms,67.1%,498,false,Array;Matrix;Simulation;,true,false,67.11188856526093,558987,832918\r\n499,\"The Maze III\",the-maze-iii,true,Hard,521,78,Algorithms,52.3%,499,true,Array;String;Depth-First Search;Breadth-First Search;Graph Theory;Heap (Priority Queue);Matrix;Shortest Path;,true,false,52.333510163416875,40447,77287\r\n500,\"Keyboard Row\",keyboard-row,false,Easy,1830,1158,Algorithms,73.8%,500,false,Array;Hash Table;String;,false,false,73.76990959481755,328191,444885\r\n937,\"Online Stock Span\",online-stock-span,false,Medium,7262,506,Algorithms,68.9%,901,false,Stack;Design;Monotonic Stack;Data Stream;,true,false,68.9394665075553,597346,866479\r\n938,\"Numbers At Most N Given Digit Set\",numbers-at-most-n-given-digit-set,false,Hard,1472,98,Algorithms,44.9%,902,false,Array;Math;String;Binary Search;Dynamic Programming;,true,false,44.866014809966046,54833,122215\r\n939,\"Valid Permutations for DI Sequence\",valid-permutations-for-di-sequence,false,Hard,752,45,Algorithms,56.3%,903,false,String;Dynamic Programming;Prefix Sum;,true,false,56.332194820213545,20946,37183\r\n940,\"Fruit Into Baskets\",fruit-into-baskets,false,Medium,6220,595,Algorithms,50.9%,904,false,Array;Hash Table;Sliding Window;,true,false,50.90596207289231,821188,1613149\r\n941,\"Sort Array By Parity\",sort-array-by-parity,false,Easy,5701,157,Algorithms,76.5%,905,false,Array;Two Pointers;Sorting;,true,false,76.50859765560905,1016507,1328618\r\n942,\"Super Palindromes\",super-palindromes,false,Hard,376,423,Algorithms,39.9%,906,false,Math;String;Enumeration;,true,false,39.92871364326191,28678,71823\r\n943,\"Sum of Subarray Minimums\",sum-of-subarray-minimums,false,Medium,9246,740,Algorithms,38.5%,907,false,Array;Dynamic Programming;Stack;Monotonic Stack;,true,false,38.45230095593176,443480,1153325\r\n944,\"Smallest Range I\",smallest-range-i,false,Easy,794,2089,Algorithms,73.5%,908,false,Array;Math;,true,false,73.4504854254888,125059,170263\r\n945,\"Snakes and Ladders\",snakes-and-ladders,false,Medium,3654,1354,Algorithms,48.0%,909,false,Array;Breadth-First Search;Matrix;,true,false,48.041993486324856,363024,755638\r\n946,\"Smallest Range II\",smallest-range-ii,false,Medium,1715,468,Algorithms,37.8%,910,false,Array;Math;Greedy;Sorting;,true,false,37.83540964469038,66115,174747\r\n947,\"Online Election\",online-election,false,Medium,1090,684,Algorithms,52.8%,911,false,Array;Hash Table;Binary Search;Design;,true,false,52.78981217372585,78471,148648\r\n948,\"Sort an Array\",sort-an-array,false,Medium,7242,844,Algorithms,55.9%,912,false,Array;Divide and Conquer;Sorting;Heap (Priority Queue);Merge Sort;Bucket Sort;Radix Sort;Counting Sort;,true,false,55.89697876476365,1117421,1999072\r\n949,\"Cat and Mouse\",cat-and-mouse,false,Hard,1016,181,Algorithms,35.1%,913,false,Math;Dynamic Programming;Graph Theory;Topological Sort;Memoization;Game Theory;,true,false,35.11149360324718,27334,77851\r\n950,\"X of a Kind in a Deck of Cards\",x-of-a-kind-in-a-deck-of-cards,false,Easy,1908,580,Algorithms,30.2%,914,false,Array;Hash Table;Math;Counting;Number Theory;,true,false,30.223390527537074,157859,522310\r\n951,\"Partition Array into Disjoint Intervals\",partition-array-into-disjoint-intervals,false,Medium,1772,83,Algorithms,49.4%,915,false,Array;,true,false,49.42461557064834,98096,198476\r\n952,\"Word Subsets\",word-subsets,false,Medium,3540,317,Algorithms,55.9%,916,false,Array;Hash Table;String;,true,false,55.91531336663454,265742,475258\r\n953,\"Reverse Only Letters\",reverse-only-letters,false,Easy,2455,87,Algorithms,68.4%,917,false,Two Pointers;String;,true,false,68.36653102917043,326616,477743\r\n954,\"Maximum Sum Circular Subarray\",maximum-sum-circular-subarray,false,Medium,7338,346,Algorithms,49.9%,918,false,Array;Divide and Conquer;Dynamic Programming;Queue;Monotonic Queue;,true,false,49.89901703517853,416059,833802\r\n955,\"Complete Binary Tree Inserter\",complete-binary-tree-inserter,false,Medium,1155,120,Algorithms,65.0%,919,false,Tree;Breadth-First Search;Design;Binary Tree;,true,false,65.01067698938151,66673,102557\r\n956,\"Number of Music Playlists\",number-of-music-playlists,false,Hard,2469,206,Algorithms,60.0%,920,false,Math;Dynamic Programming;Combinatorics;,true,false,60.02485187374036,79222,131982\r\n957,\"Minimum Add to Make Parentheses Valid\",minimum-add-to-make-parentheses-valid,false,Medium,4956,249,Algorithms,74.4%,921,false,String;Stack;Greedy;,true,false,74.40648959910312,700859,941933\r\n958,\"Sort Array By Parity II\",sort-array-by-parity-ii,false,Easy,2829,104,Algorithms,71.2%,922,false,Array;Two Pointers;Sorting;,true,true,71.24643118500119,345619,485102\r\n959,\"3Sum With Multiplicity\",3sum-with-multiplicity,false,Medium,2683,332,Algorithms,46.3%,923,false,Array;Hash Table;Two Pointers;Sorting;Counting;,true,false,46.25936779767083,121231,262068\r\n960,\"Minimize Malware Spread\",minimize-malware-spread,false,Hard,1123,654,Algorithms,43.1%,924,false,Array;Hash Table;Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;,true,false,43.06945637786499,74186,172250\r\n961,\"Long Pressed Name\",long-pressed-name,false,Easy,2598,409,Algorithms,32.9%,925,false,Two Pointers;String;,true,false,32.85925845043028,192595,586122\r\n962,\"Flip String to Monotone Increasing\",flip-string-to-monotone-increasing,false,Medium,4590,185,Algorithms,61.9%,926,false,String;Dynamic Programming;,true,false,61.876049001364954,217140,350928\r\n963,\"Three Equal Parts\",three-equal-parts,false,Hard,856,126,Algorithms,41.3%,927,false,Array;Math;,true,false,41.29737729178656,35161,85141\r\n964,\"Minimize Malware Spread II\",minimize-malware-spread-ii,false,Hard,708,92,Algorithms,45.5%,928,false,Array;Hash Table;Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;,true,false,45.52685981364413,30391,66754\r\n965,\"Unique Email Addresses\",unique-email-addresses,false,Easy,2815,363,Algorithms,67.8%,929,false,Array;Hash Table;String;,true,false,67.84953851348816,578686,852896\r\n966,\"Binary Subarrays With Sum\",binary-subarrays-with-sum,false,Medium,4882,169,Algorithms,68.6%,930,false,Array;Hash Table;Sliding Window;Prefix Sum;,true,false,68.64384837751341,514332,749276\r\n967,\"Minimum Falling Path Sum\",minimum-falling-path-sum,false,Medium,7005,175,Algorithms,60.8%,931,false,Array;Dynamic Programming;Matrix;,true,false,60.81125098551615,657157,1080651\r\n968,\"Beautiful Array\",beautiful-array,false,Medium,1160,1602,Algorithms,69.1%,932,false,Array;Math;Divide and Conquer;,true,false,69.08810242673266,60866,88099\r\n969,\"Number of Recent Calls\",number-of-recent-calls,false,Easy,859,1209,Algorithms,78.4%,933,false,Design;Queue;Data Stream;,true,false,78.36056749702298,521168,665089\r\n971,\"Shortest Bridge\",shortest-bridge,false,Medium,5788,221,Algorithms,59.4%,934,false,Array;Depth-First Search;Breadth-First Search;Matrix;,true,false,59.371824679238784,275794,464516\r\n972,\"Knight Dialer\",knight-dialer,false,Medium,3204,452,Algorithms,61.8%,935,false,Dynamic Programming;,true,false,61.836124898835884,200946,324964\r\n973,\"Stamping The Sequence\",stamping-the-sequence,false,Hard,1580,222,Algorithms,62.3%,936,false,String;Stack;Greedy;Queue;,true,false,62.277305907051094,64670,103842\r\n974,\"Reorder Data in Log Files\",reorder-data-in-log-files,false,Medium,2198,4424,Algorithms,56.8%,937,false,Array;String;Sorting;,true,false,56.83035424428668,411383,723879\r\n975,\"Range Sum of BST\",range-sum-of-bst,false,Easy,7262,389,Algorithms,87.6%,938,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,true,87.58661898581421,1345612,1536322\r\n976,\"Minimum Area Rectangle\",minimum-area-rectangle,false,Medium,2108,298,Algorithms,55.4%,939,false,Array;Hash Table;Math;Geometry;Sorting;,true,false,55.38423924312714,178957,323119\r\n977,\"Distinct Subsequences II\",distinct-subsequences-ii,false,Hard,1833,40,Algorithms,44.1%,940,false,String;Dynamic Programming;,true,true,44.09531357860558,51740,117337\r\n978,\"Valid Mountain Array\",valid-mountain-array,false,Easy,3158,211,Algorithms,35.2%,941,false,Array;,true,false,35.16554955839673,561474,1596666\r\n979,\"DI String Match\",di-string-match,false,Easy,2615,1081,Algorithms,81.0%,942,false,Array;Two Pointers;String;Greedy;,true,false,81.00537832747608,208600,257514\r\n980,\"Find the Shortest Superstring\",find-the-shortest-superstring,false,Hard,1523,152,Algorithms,45.3%,943,false,Array;String;Dynamic Programming;Bit Manipulation;Bitmask;,true,false,45.267447913360336,35654,78763\r\n981,\"Delete Columns to Make Sorted\",delete-columns-to-make-sorted,false,Easy,2066,3018,Algorithms,78.1%,944,false,Array;String;,true,false,78.08614791710258,320945,411014\r\n982,\"Minimum Increment to Make Array Unique\",minimum-increment-to-make-array-unique,false,Medium,2782,86,Algorithms,60.6%,945,false,Array;Greedy;Sorting;Counting;,true,false,60.639326788218796,270224,445625\r\n983,\"Validate Stack Sequences\",validate-stack-sequences,false,Medium,6117,132,Algorithms,70.3%,946,false,Array;Stack;Simulation;,true,false,70.3330539320073,372553,529700\r\n984,\"Most Stones Removed with Same Row or Column\",most-stones-removed-with-same-row-or-column,false,Medium,6454,709,Algorithms,62.9%,947,false,Hash Table;Depth-First Search;Union-Find;Graph Theory;,true,false,62.86467539095707,401547,638749\r\n985,\"Bag of Tokens\",bag-of-tokens,false,Medium,3478,547,Algorithms,59.6%,948,false,Array;Two Pointers;Greedy;Sorting;,true,false,59.573141990380726,266675,447643\r\n986,\"Largest Time for Given Digits\",largest-time-for-given-digits,false,Medium,746,1072,Algorithms,35.9%,949,false,Array;String;Backtracking;Enumeration;,true,false,35.89314830875976,103462,288250\r\n987,\"Reveal Cards In Increasing Order\",reveal-cards-in-increasing-order,false,Medium,3705,715,Algorithms,83.5%,950,false,Array;Queue;Sorting;Simulation;,true,false,83.5221158747239,235960,282512\r\n988,\"Flip Equivalent Binary Trees\",flip-equivalent-binary-trees,false,Medium,2890,124,Algorithms,69.5%,951,false,Tree;Depth-First Search;Binary Tree;,true,false,69.51951370105428,269100,387086\r\n989,\"Largest Component Size by Common Factor\",largest-component-size-by-common-factor,false,Hard,1727,95,Algorithms,42.8%,952,false,Array;Hash Table;Math;Union-Find;Number Theory;,true,false,42.83021151114876,67249,157012\r\n990,\"Verifying an Alien Dictionary\",verifying-an-alien-dictionary,false,Easy,5094,1683,Algorithms,55.9%,953,false,Array;Hash Table;String;,true,false,55.925198437842006,582537,1041636\r\n991,\"Array of Doubled Pairs\",array-of-doubled-pairs,false,Medium,1576,186,Algorithms,39.8%,954,false,Array;Hash Table;Greedy;Sorting;,true,false,39.754349818583975,104965,264034\r\n992,\"Delete Columns to Make Sorted II\",delete-columns-to-make-sorted-ii,false,Medium,1045,136,Algorithms,49.7%,955,false,Array;String;Greedy;,true,false,49.66963532181406,89457,180104\r\n993,\"Tallest Billboard\",tallest-billboard,false,Hard,2487,63,Algorithms,51.8%,956,false,Array;Dynamic Programming;,true,false,51.82075692092045,70981,136974\r\n994,\"Prison Cells After N Days\",prison-cells-after-n-days,false,Medium,1564,1781,Algorithms,39.2%,957,false,Array;Hash Table;Math;Bit Manipulation;,true,false,39.161626981222874,176588,450921\r\n998,\"Check Completeness of a Binary Tree\",check-completeness-of-a-binary-tree,false,Medium,4548,62,Algorithms,59.1%,958,false,Tree;Breadth-First Search;Binary Tree;,true,false,59.097396997970705,320052,541567\r\n999,\"Regions Cut By Slashes\",regions-cut-by-slashes,false,Medium,3992,874,Algorithms,77.5%,959,false,Array;Hash Table;Depth-First Search;Breadth-First Search;Union-Find;Matrix;,true,false,77.50922300664878,150850,194621\r\n1000,\"Delete Columns to Make Sorted III\",delete-columns-to-make-sorted-iii,false,Hard,871,31,Algorithms,72.6%,960,false,Array;String;Dynamic Programming;,true,false,72.61401798288377,73732,101540\r\n1001,\"N-Repeated Element in Size 2N Array\",n-repeated-element-in-size-2n-array,false,Easy,1852,348,Algorithms,79.9%,961,false,Array;Hash Table;,true,false,79.87325371502124,470365,588890\r\n1002,\"Maximum Width Ramp\",maximum-width-ramp,false,Medium,2860,98,Algorithms,55.9%,962,false,Array;Two Pointers;Stack;Monotonic Stack;,true,false,55.87446749460422,207363,371123\r\n1003,\"Minimum Area Rectangle II\",minimum-area-rectangle-ii,false,Medium,413,487,Algorithms,55.9%,963,false,Array;Hash Table;Math;Geometry;,true,false,55.858777741741186,36168,64749\r\n1004,\"Least Operators to Express Number\",least-operators-to-express-number,false,Hard,328,70,Algorithms,48.5%,964,false,Math;Dynamic Programming;Memoization;,true,false,48.490960989533775,12741,26275\r\n1005,\"Univalued Binary Tree\",univalued-binary-tree,false,Easy,1984,68,Algorithms,73.0%,965,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,72.98350999306075,275558,377562\r\n1006,\"Vowel Spellchecker\",vowel-spellchecker,false,Medium,853,1003,Algorithms,61.4%,966,false,Array;Hash Table;String;,true,false,61.404686355870155,140882,229432\r\n1007,\"Numbers With Same Consecutive Differences\",numbers-with-same-consecutive-differences,false,Medium,2888,200,Algorithms,59.2%,967,false,Backtracking;Breadth-First Search;,true,false,59.16688386007456,156639,264741\r\n1008,\"Binary Tree Cameras\",binary-tree-cameras,false,Hard,5664,89,Algorithms,47.8%,968,false,Dynamic Programming;Tree;Depth-First Search;Binary Tree;,true,false,47.83104497455959,187072,391110\r\n1009,\"Pancake Sorting\",pancake-sorting,false,Medium,1601,1561,Algorithms,71.7%,969,false,Array;Two Pointers;Greedy;Sorting;,true,false,71.7433347147396,114257,159258\r\n1010,\"Powerful Integers\",powerful-integers,false,Medium,422,86,Algorithms,44.6%,970,false,Hash Table;Math;Enumeration;,true,false,44.56499090113493,64162,143974\r\n1011,\"Flip Binary Tree To Match Preorder Traversal\",flip-binary-tree-to-match-preorder-traversal,false,Medium,1003,284,Algorithms,51.9%,971,false,Tree;Depth-First Search;Binary Tree;,true,false,51.857858884342924,49559,95567\r\n1012,\"Equal Rational Numbers\",equal-rational-numbers,false,Hard,107,218,Algorithms,46.1%,972,false,Math;String;,true,false,46.090080132633325,10008,21714\r\n1014,\"K Closest Points to Origin\",k-closest-points-to-origin,false,Medium,9090,339,Algorithms,68.9%,973,false,Array;Math;Divide and Conquer;Geometry;Sorting;Heap (Priority Queue);Quickselect;,true,true,68.90525532399813,1720265,2496567\r\n1016,\"Subarray Sums Divisible by K\",subarray-sums-divisible-by-k,false,Medium,7906,345,Algorithms,56.2%,974,false,Array;Hash Table;Prefix Sum;,true,false,56.21036426447286,486341,865213\r\n1017,\"Odd Even Jump\",odd-even-jump,false,Hard,2116,532,Algorithms,41.2%,975,false,Array;Dynamic Programming;Stack;Sorting;Monotonic Stack;Ordered Set;,true,false,41.16725173045643,104021,252679\r\n1018,\"Largest Perimeter Triangle\",largest-perimeter-triangle,false,Easy,3402,444,Algorithms,62.1%,976,false,Array;Math;Greedy;Sorting;,true,false,62.09891533576952,427556,688508\r\n1019,\"Squares of a Sorted Array\",squares-of-a-sorted-array,false,Easy,10265,279,Algorithms,73.7%,977,false,Array;Two Pointers;Sorting;,true,true,73.69889231165178,2611581,3543585\r\n1020,\"Longest Turbulent Subarray\",longest-turbulent-subarray,false,Medium,2122,262,Algorithms,49.1%,978,false,Array;Dynamic Programming;Sliding Window;,true,false,49.05247350944354,139153,283684\r\n1021,\"Distribute Coins in Binary Tree\",distribute-coins-in-binary-tree,false,Medium,6087,249,Algorithms,77.3%,979,false,Tree;Depth-First Search;Binary Tree;,true,false,77.28379379697259,226331,292857\r\n1022,\"Unique Paths III\",unique-paths-iii,false,Hard,5492,200,Algorithms,82.8%,980,false,Array;Backtracking;Bit Manipulation;Matrix;,true,false,82.82047673273027,258920,312628\r\n1023,\"Time Based Key-Value Store\",time-based-key-value-store,false,Medium,5286,731,Algorithms,49.9%,981,false,Hash Table;String;Binary Search;Design;,true,false,49.85824618288187,730707,1465569\r\n1024,\"Triples with Bitwise AND Equal To Zero\",triples-with-bitwise-and-equal-to-zero,false,Hard,479,222,Algorithms,60.0%,982,false,Array;Hash Table;Bit Manipulation;,false,false,59.96172758762687,24754,41283\r\n1025,\"Minimum Cost For Tickets\",minimum-cost-for-tickets,false,Medium,8818,191,Algorithms,67.4%,983,false,Array;Dynamic Programming;,true,false,67.41700129274348,471439,699288\r\n1026,\"String Without AAA or BBB\",string-without-aaa-or-bbb,false,Medium,875,377,Algorithms,45.1%,984,false,String;Greedy;,true,false,45.131381298051664,60991,135140\r\n1027,\"Sum of Even Numbers After Queries\",sum-of-even-numbers-after-queries,false,Medium,2140,323,Algorithms,68.8%,985,false,Array;Simulation;,true,false,68.8219495171707,155795,226374\r\n1028,\"Interval List Intersections\",interval-list-intersections,false,Medium,5926,131,Algorithms,73.0%,986,false,Array;Two Pointers;Sweep Line;,true,false,72.98794136575634,569319,780019\r\n1029,\"Vertical Order Traversal of a Binary Tree\",vertical-order-traversal-of-a-binary-tree,false,Hard,8673,4392,Algorithms,53.6%,987,false,Hash Table;Tree;Depth-First Search;Breadth-First Search;Sorting;Binary Tree;,true,true,53.57604417663134,712621,1330111\r\n1030,\"Smallest String Starting From Leaf\",smallest-string-starting-from-leaf,false,Medium,2421,336,Algorithms,61.2%,988,false,String;Backtracking;Tree;Depth-First Search;Binary Tree;,true,false,61.1972432804962,221993,362749\r\n1031,\"Add to Array-Form of Integer\",add-to-array-form-of-integer,false,Easy,3695,317,Algorithms,45.5%,989,false,Array;Math;,true,false,45.47703298393947,339933,747480\r\n1032,\"Satisfiability of Equality Equations\",satisfiability-of-equality-equations,false,Medium,4037,68,Algorithms,51.7%,990,false,Array;String;Union-Find;Graph Theory;,true,false,51.74942539374027,167737,324134\r\n1033,\"Broken Calculator\",broken-calculator,false,Medium,2842,218,Algorithms,56.0%,991,false,Math;Greedy;,true,false,56.022867780246656,122787,219173\r\n1034,\"Subarrays with K Different Integers\",subarrays-with-k-different-integers,false,Hard,6971,121,Algorithms,68.0%,992,false,Array;Hash Table;Sliding Window;Counting;,true,false,67.95021506171524,395103,581457\r\n1035,\"Cousins in Binary Tree\",cousins-in-binary-tree,false,Easy,4326,233,Algorithms,59.2%,993,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,59.23412711174453,349955,590801\r\n1036,\"Rotting Oranges\",rotting-oranges,false,Medium,15171,477,Algorithms,58.5%,994,false,Array;Breadth-First Search;Matrix;,true,false,58.486655923488264,1628124,2783757\r\n1037,\"Minimum Number of K Consecutive Bit Flips\",minimum-number-of-k-consecutive-bit-flips,false,Hard,2067,91,Algorithms,62.3%,995,false,Array;Bit Manipulation;Queue;Sliding Window;Prefix Sum;,true,false,62.29562417042017,143146,229785\r\n1038,\"Number of Squareful Arrays\",number-of-squareful-arrays,false,Hard,1040,49,Algorithms,51.4%,996,false,Array;Hash Table;Math;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,51.3718747761301,50196,97712\r\n1039,\"Find the Town Judge\",find-the-town-judge,false,Easy,6972,634,Algorithms,50.7%,997,false,Array;Hash Table;Graph Theory;,true,false,50.66967033175125,749218,1478633\r\n1040,\"Maximum Binary Tree II\",maximum-binary-tree-ii,false,Medium,570,806,Algorithms,70.4%,998,false,Tree;Binary Tree;,false,false,70.40360822353686,45580,64741\r\n1041,\"Available Captures for Rook\",available-captures-for-rook,false,Easy,810,648,Algorithms,71.7%,999,false,Array;Matrix;Simulation;,false,false,71.65648769753314,89873,125422\r\n1042,\"Minimum Cost to Merge Stones\",minimum-cost-to-merge-stones,false,Hard,2636,117,Algorithms,46.0%,1000,false,Array;Dynamic Programming;Prefix Sum;,false,false,45.97005977465484,52142,113426\r\n1234,\"Number of Paths with Max Score\",number-of-paths-with-max-score,false,Hard,551,28,Algorithms,42.4%,1301,false,Array;Dynamic Programming;Matrix;,false,false,42.3525764520915,19126,45159\r\n1254,\"Deepest Leaves Sum\",deepest-leaves-sum,false,Medium,4843,127,Algorithms,86.5%,1302,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,86.52508285596072,405698,468880\r\n1438,\"Find the Team Size\",find-the-team-size,true,Easy,344,16,Database,89.5%,1303,true,Database;,false,false,89.52826151364519,81588,91131\r\n1426,\"Find N Unique Integers Sum up to Zero\",find-n-unique-integers-sum-up-to-zero,false,Easy,2492,620,Algorithms,78.4%,1304,false,Array;Math;,true,false,78.43804795397679,398128,507570\r\n1427,\"All Elements in Two Binary Search Trees\",all-elements-in-two-binary-search-trees,false,Medium,3192,99,Algorithms,80.2%,1305,false,Tree;Depth-First Search;Binary Search Tree;Sorting;Binary Tree;,true,false,80.23670954174207,262495,327151\r\n1428,\"Jump Game III\",jump-game-iii,false,Medium,4342,118,Algorithms,66.8%,1306,false,Array;Depth-First Search;Breadth-First Search;,true,true,66.81716782959643,299824,448723\r\n1429,\"Verbal Arithmetic Puzzle\",verbal-arithmetic-puzzle,false,Hard,531,138,Algorithms,34.8%,1307,false,Array;Math;String;Backtracking;,false,false,34.80926832144331,17712,50883\r\n1439,\"Running Total for Different Genders\",running-total-for-different-genders,true,Medium,225,70,Database,86.1%,1308,true,Database;,false,false,86.06806082959356,47371,55039\r\n1434,\"Decrypt String from Alphabet to Integer Mapping\",decrypt-string-from-alphabet-to-integer-mapping,false,Easy,1610,120,Algorithms,80.6%,1309,false,String;,false,false,80.55381996811307,149553,185656\r\n1435,\"XOR Queries of a Subarray\",xor-queries-of-a-subarray,false,Medium,2105,61,Algorithms,78.1%,1310,false,Array;Bit Manipulation;Prefix Sum;,true,false,78.06540632559806,217821,279022\r\n1436,\"Get Watched Videos by Your Friends\",get-watched-videos-by-your-friends,false,Medium,485,456,Algorithms,52.7%,1311,false,Array;Hash Table;Breadth-First Search;Graph Theory;Sorting;,false,false,52.707745632566315,41665,79050\r\n1437,\"Minimum Insertion Steps to Make a String Palindrome\",minimum-insertion-steps-to-make-a-string-palindrome,false,Hard,5601,76,Algorithms,73.8%,1312,false,String;Dynamic Programming;,true,false,73.8283447598524,309702,419490\r\n1241,\"Decompress Run-Length Encoded List\",decompress-run-length-encoded-list,false,Easy,1349,1325,Algorithms,86.2%,1313,false,Array;,false,false,86.19259541941892,307168,356374\r\n1242,\"Matrix Block Sum\",matrix-block-sum,false,Medium,2512,401,Algorithms,76.5%,1314,false,Array;Matrix;Prefix Sum;,false,false,76.47564371411873,111230,145445\r\n1243,\"Sum of Nodes with Even-Valued Grandparent\",sum-of-nodes-with-even-valued-grandparent,false,Medium,2831,79,Algorithms,85.9%,1315,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,85.9145026936168,184516,214767\r\n1244,\"Distinct Echo Substrings\",distinct-echo-substrings,false,Hard,338,208,Algorithms,53.2%,1316,false,String;Trie;Rolling Hash;Hash Function;,false,false,53.15330227718792,22478,42289\r\n1440,\"Convert Integer to the Sum of Two No-Zero Integers\",convert-integer-to-the-sum-of-two-no-zero-integers,false,Easy,867,371,Algorithms,59.1%,1317,false,Math;,true,false,59.1237915906906,208490,352633\r\n1441,\"Minimum Flips to Make a OR b Equal to c\",minimum-flips-to-make-a-or-b-equal-to-c,false,Medium,2146,112,Algorithms,71.9%,1318,false,Bit Manipulation;,true,false,71.93918038396295,197626,274713\r\n1442,\"Number of Operations to Make Network Connected\",number-of-operations-to-make-network-connected,false,Medium,5609,85,Algorithms,66.4%,1319,false,Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;,true,false,66.39623038659956,359595,541591\r\n1443,\"Minimum Distance to Type a Word Using Two Fingers\",minimum-distance-to-type-a-word-using-two-fingers,false,Hard,1363,54,Algorithms,72.2%,1320,false,String;Dynamic Programming;,true,false,72.24969457211007,99352,137512\r\n1452,\"Restaurant Growth\",restaurant-growth,false,Medium,1172,388,Database,58.6%,1321,false,Database;,false,false,58.58627525122317,255649,436364\r\n1453,\"Ads Performance\",ads-performance,true,Easy,273,68,Database,58.6%,1322,true,Database;,true,false,58.59021579232615,52972,90411\r\n1448,\"Maximum 69 Number\",maximum-69-number,false,Easy,3319,240,Algorithms,84.5%,1323,false,Math;Greedy;,true,false,84.54692920412137,488896,578254\r\n1449,\"Print Words Vertically\",print-words-vertically,false,Medium,826,121,Algorithms,67.5%,1324,false,Array;String;Simulation;,false,false,67.4908342445488,52463,77734\r\n1450,\"Delete Leaves With a Given Value\",delete-leaves-with-a-given-value,false,Medium,2908,59,Algorithms,77.2%,1325,false,Tree;Depth-First Search;Binary Tree;,true,false,77.249341461579,256601,332173\r\n1451,\"Minimum Number of Taps to Open to Water a Garden\",minimum-number-of-taps-to-open-to-water-a-garden,false,Hard,3626,197,Algorithms,51.0%,1326,false,Array;Dynamic Programming;Greedy;,true,false,50.994659694867,160136,314025\r\n1462,\"List the Products Ordered in a Period\",list-the-products-ordered-in-a-period,false,Easy,586,48,Database,71.7%,1327,false,Database;,false,false,71.69966210853346,316172,440968\r\n1252,\"Break a Palindrome\",break-a-palindrome,false,Medium,2447,755,Algorithms,51.6%,1328,false,String;Greedy;,true,false,51.55900838902466,197041,382166\r\n1253,\"Sort the Matrix Diagonally\",sort-the-matrix-diagonally,false,Medium,3587,239,Algorithms,83.2%,1329,false,Array;Sorting;Matrix;,true,true,83.17664063783971,197379,237301\r\n1255,\"Reverse Subarray To Maximize Array Value\",reverse-subarray-to-maximize-array-value,false,Hard,495,61,Algorithms,44.0%,1330,false,Array;Math;Greedy;,false,false,43.95856160972208,8826,20078\r\n1256,\"Rank Transform of an Array\",rank-transform-of-an-array,false,Easy,2388,114,Algorithms,70.8%,1331,false,Array;Hash Table;Sorting;,true,false,70.83684837698596,321597,453998\r\n1454,\"Remove Palindromic Subsequences\",remove-palindromic-subsequences,false,Easy,1751,1803,Algorithms,77.0%,1332,false,Two Pointers;String;,true,false,77.01898242182602,153572,199395\r\n1455,\"Filter Restaurants by Vegan-Friendly, Price and Distance\",filter-restaurants-by-vegan-friendly-price-and-distance,false,Medium,320,230,Algorithms,64.1%,1333,false,Array;Sorting;,false,false,64.14644529587058,37670,58725\r\n1456,\"Find the City With the Smallest Number of Neighbors at a Threshold Distance\",find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance,false,Medium,3619,157,Algorithms,72.5%,1334,false,Dynamic Programming;Graph Theory;Shortest Path;,true,false,72.52569259519328,323284,445751\r\n1457,\"Minimum Difficulty of a Job Schedule\",minimum-difficulty-of-a-job-schedule,false,Hard,3600,336,Algorithms,59.7%,1335,false,Array;Dynamic Programming;,true,false,59.74586052758599,227754,381205\r\n1467,\"Number of Transactions per Visit\",number-of-transactions-per-visit,true,Hard,95,327,Database,47.9%,1336,true,Database;,false,false,47.85748821467424,15837,33092\r\n1463,\"The K Weakest Rows in a Matrix\",the-k-weakest-rows-in-a-matrix,false,Easy,4348,242,Algorithms,74.3%,1337,false,Array;Binary Search;Sorting;Heap (Priority Queue);Matrix;,true,false,74.32792460727092,422665,568649\r\n1464,\"Reduce Array Size to The Half\",reduce-array-size-to-the-half,false,Medium,3367,154,Algorithms,69.4%,1338,false,Array;Hash Table;Greedy;Sorting;Heap (Priority Queue);,true,false,69.35934558280307,232831,335688\r\n1465,\"Maximum Product of Splitted Binary Tree\",maximum-product-of-splitted-binary-tree,false,Medium,3582,122,Algorithms,55.7%,1339,false,Tree;Depth-First Search;Binary Tree;,true,false,55.664988503069445,258063,463601\r\n1466,\"Jump Game V\",jump-game-v,false,Hard,1195,46,Algorithms,64.9%,1340,false,Array;Dynamic Programming;Sorting;,false,false,64.91948984872006,42656,65706\r\n1480,\"Movie Rating\",movie-rating,false,Medium,1007,242,Database,43.2%,1341,false,Database;,false,false,43.19080124045491,292194,676521\r\n1444,\"Number of Steps to Reduce a Number to Zero\",number-of-steps-to-reduce-a-number-to-zero,false,Easy,4285,181,Algorithms,85.8%,1342,false,Math;Bit Manipulation;,true,true,85.76692996353201,918158,1070527\r\n1445,\"Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold\",number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold,false,Medium,1851,112,Algorithms,72.7%,1343,false,Array;Sliding Window;,false,false,72.67326138864003,193875,266777\r\n1446,\"Angle Between Hands of a Clock\",angle-between-hands-of-a-clock,false,Medium,1376,248,Algorithms,64.4%,1344,false,Math;,true,false,64.42485336585891,143670,223004\r\n1447,\"Jump Game IV\",jump-game-iv,false,Hard,3875,133,Algorithms,46.3%,1345,false,Array;Hash Table;Breadth-First Search;,true,false,46.28751617624621,163818,353914\r\n1468,\"Check If N and Its Double Exist\",check-if-n-and-its-double-exist,false,Easy,2530,259,Algorithms,41.7%,1346,false,Array;Hash Table;Two Pointers;Binary Search;Sorting;,true,false,41.7491324511042,629448,1507693\r\n1469,\"Minimum Number of Steps to Make Two Strings Anagram\",minimum-number-of-steps-to-make-two-strings-anagram,false,Medium,2825,122,Algorithms,82.5%,1347,false,Hash Table;String;Counting;,true,false,82.4865339521011,336290,407691\r\n1470,\"Tweet Counts Per Frequency\",tweet-counts-per-frequency,false,Medium,223,309,Algorithms,46.0%,1348,false,Hash Table;String;Binary Search;Design;Sorting;Ordered Set;,false,false,46.01223433274135,39640,86151\r\n1471,\"Maximum Students Taking Exam\",maximum-students-taking-exam,false,Hard,901,19,Algorithms,53.7%,1349,false,Array;Dynamic Programming;Bit Manipulation;Matrix;Bitmask;,false,false,53.71701546860782,23614,43960\r\n1481,\"Students With Invalid Departments\",students-with-invalid-departments,true,Easy,184,9,Database,89.7%,1350,true,Database;,false,false,89.72657144011093,66648,74279\r\n1476,\"Count Negative Numbers in a Sorted Matrix\",count-negative-numbers-in-a-sorted-matrix,false,Easy,5494,147,Algorithms,79.6%,1351,false,Array;Binary Search;Matrix;,true,false,79.57201760726575,662705,832836\r\n1477,\"Product of the Last K Numbers\",product-of-the-last-k-numbers,false,Medium,2168,110,Algorithms,62.9%,1352,false,Array;Math;Design;Data Stream;Prefix Sum;,true,false,62.908104624825064,261626,415886\r\n1478,\"Maximum Number of Events That Can Be Attended\",maximum-number-of-events-that-can-be-attended,false,Medium,4008,635,Algorithms,39.0%,1353,false,Array;Greedy;Sorting;Heap (Priority Queue);,true,false,38.95158867111375,226856,582405\r\n1479,\"Construct Target Array With Multiple Sums\",construct-target-array-with-multiple-sums,false,Hard,2126,180,Algorithms,36.9%,1354,false,Array;Heap (Priority Queue);,true,false,36.90759073013757,84184,228093\r\n1494,\"Activity Participants\",activity-participants,true,Medium,152,48,Database,72.0%,1355,true,Database;,true,false,71.99886520223717,35530,49348\r\n1458,\"Sort Integers by The Number of 1 Bits\",sort-integers-by-the-number-of-1-bits,false,Easy,2868,138,Algorithms,82.3%,1356,false,Array;Bit Manipulation;Sorting;Counting;,true,false,82.30906691076966,394736,479578\r\n1459,\"Apply Discount Every n Orders\",apply-discount-every-n-orders,false,Medium,216,234,Algorithms,65.5%,1357,false,Array;Hash Table;Design;,false,false,65.52247673113737,29778,45447\r\n1460,\"Number of Substrings Containing All Three Characters\",number-of-substrings-containing-all-three-characters,false,Medium,4454,82,Algorithms,73.6%,1358,false,Hash Table;String;Sliding Window;,true,false,73.64283931667708,451477,613063\r\n1461,\"Count All Valid Pickup and Delivery Options\",count-all-valid-pickup-and-delivery-options,false,Hard,3095,233,Algorithms,64.9%,1359,false,Math;Dynamic Programming;Combinatorics;,true,false,64.85871676361866,134575,207490\r\n1274,\"Number of Days Between Two Dates\",number-of-days-between-two-dates,false,Easy,437,1325,Algorithms,52.6%,1360,false,Math;String;,false,false,52.587464334758764,73908,140543\r\n1275,\"Validate Binary Tree Nodes\",validate-binary-tree-nodes,false,Medium,2255,525,Algorithms,44.1%,1361,false,Tree;Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;Binary Tree;,true,false,44.100585296773396,135776,307878\r\n1276,\"Closest Divisors\",closest-divisors,false,Medium,339,101,Algorithms,62.1%,1362,false,Math;,false,false,62.12225127523683,28985,46658\r\n1277,\"Largest Multiple of Three\",largest-multiple-of-three,false,Hard,629,91,Algorithms,33.2%,1363,false,Array;Math;Dynamic Programming;Greedy;Sorting;,false,false,33.20174997485668,26410,79544\r\n1495,\"Number of Trusted Contacts of a Customer\",number-of-trusted-contacts-of-a-customer,true,Medium,95,403,Database,74.7%,1364,true,Database;,true,false,74.68765840713242,25048,33537\r\n1482,\"How Many Numbers Are Smaller Than the Current Number\",how-many-numbers-are-smaller-than-the-current-number,false,Easy,6031,163,Algorithms,87.4%,1365,false,Array;Hash Table;Sorting;Counting Sort;,false,false,87.4349308742947,880468,1006999\r\n1483,\"Rank Teams by Votes\",rank-teams-by-votes,false,Medium,1568,198,Algorithms,60.1%,1366,false,Array;Hash Table;String;Sorting;Counting;,false,false,60.061543871988746,102471,170610\r\n1484,\"Linked List in Binary Tree\",linked-list-in-binary-tree,false,Medium,3027,90,Algorithms,52.0%,1367,false,Linked List;Tree;Depth-First Search;Binary Tree;,true,false,51.95410052352385,209494,403229\r\n1485,\"Minimum Cost to Make at Least One Valid Path in a Grid\",minimum-cost-to-make-at-least-one-valid-path-in-a-grid,false,Hard,2602,36,Algorithms,70.9%,1368,false,Array;Breadth-First Search;Graph Theory;Heap (Priority Queue);Matrix;Shortest Path;,true,false,70.92936138331474,166623,234914\r\n1504,\"Get the Second Most Recent Activity\",get-the-second-most-recent-activity,true,Hard,169,13,Database,67.3%,1369,true,Database;,false,false,67.3024940072423,26392,39214\r\n1472,\"Increasing Decreasing String\",increasing-decreasing-string,false,Easy,844,878,Algorithms,77.2%,1370,false,Hash Table;String;Counting;,false,false,77.22642052750777,99229,128491\r\n1473,\"Find the Longest Substring Containing Vowels in Even Counts\",find-the-longest-substring-containing-vowels-in-even-counts,false,Medium,2566,142,Algorithms,75.6%,1371,false,Hash Table;String;Bit Manipulation;Prefix Sum;,true,false,75.61369716425897,141322,186900\r\n1474,\"Longest ZigZag Path in a Binary Tree\",longest-zigzag-path-in-a-binary-tree,false,Medium,3754,86,Algorithms,67.1%,1372,false,Dynamic Programming;Tree;Depth-First Search;Binary Tree;,true,false,67.05720290508012,284287,423945\r\n1475,\"Maximum Sum BST in Binary Tree\",maximum-sum-bst-in-binary-tree,false,Hard,2995,200,Algorithms,47.0%,1373,false,Dynamic Programming;Tree;Depth-First Search;Binary Search Tree;Binary Tree;,false,false,47.044285002858885,127530,271083\r\n1490,\"Generate a String With Characters That Have Odd Counts\",generate-a-string-with-characters-that-have-odd-counts,false,Easy,529,1288,Algorithms,78.5%,1374,false,String;,false,false,78.4544562674515,114356,145761\r\n1491,\"Number of Times Binary String Is Prefix-Aligned\",number-of-times-binary-string-is-prefix-aligned,false,Medium,969,139,Algorithms,66.0%,1375,false,Array;,false,false,66.03312933139185,60314,91339\r\n1492,\"Time Needed to Inform All Employees\",time-needed-to-inform-all-employees,false,Medium,4255,325,Algorithms,60.5%,1376,false,Tree;Depth-First Search;Breadth-First Search;,true,false,60.46853661098856,259020,428355\r\n1493,\"Frog Position After T Seconds\",frog-position-after-t-seconds,false,Hard,845,151,Algorithms,38.4%,1377,false,Tree;Depth-First Search;Breadth-First Search;Graph Theory;,false,false,38.35649067090115,43479,113355\r\n1509,\"Replace Employee ID With The Unique Identifier\",replace-employee-id-with-the-unique-identifier,false,Easy,2061,163,Database,83.5%,1378,false,Database;,true,false,83.54198967022724,1317440,1576972\r\n1498,\"Find a Corresponding Node of a Binary Tree in a Clone of That Tree\",find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree,false,Easy,1811,2018,Algorithms,85.8%,1379,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,85.8230681641737,265309,309133\r\n1496,\"Lucky Numbers in a Matrix\",lucky-numbers-in-a-matrix,false,Easy,2355,123,Algorithms,80.0%,1380,false,Array;Matrix;,true,false,79.95287479936663,295887,370077\r\n1497,\"Design a Stack With Increment Operation\",design-a-stack-with-increment-operation,false,Medium,2372,112,Algorithms,79.9%,1381,false,Array;Stack;Design;,true,false,79.90372015309472,261588,327379\r\n1285,\"Balance a Binary Search Tree\",balance-a-binary-search-tree,false,Medium,4176,105,Algorithms,86.3%,1382,false,Divide and Conquer;Greedy;Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,86.28916115743095,403832,467999\r\n1499,\"Maximum Performance of a Team\",maximum-performance-of-a-team,false,Hard,3215,85,Algorithms,47.7%,1383,false,Array;Greedy;Sorting;Heap (Priority Queue);,true,false,47.73828861022675,110211,230863\r\n1518,\"Total Sales Amount by Year\",total-sales-amount-by-year,true,Hard,236,133,Database,61.3%,1384,true,Database;,false,false,61.29793691180529,19996,32621\r\n1486,\"Find the Distance Value Between Two Arrays\",find-the-distance-value-between-two-arrays,false,Easy,1036,3165,Algorithms,71.6%,1385,false,Array;Two Pointers;Binary Search;Sorting;,false,false,71.62719944190373,147850,206416\r\n1487,\"Cinema Seat Allocation\",cinema-seat-allocation,false,Medium,994,418,Algorithms,44.4%,1386,false,Array;Hash Table;Greedy;Bit Manipulation;,false,false,44.393612899278764,65307,147109\r\n1488,\"Sort Integers by The Power Value\",sort-integers-by-the-power-value,false,Medium,1513,121,Algorithms,71.7%,1387,false,Dynamic Programming;Memoization;Sorting;,false,false,71.67402094357423,122311,170649\r\n1489,\"Pizza With 3n Slices\",pizza-with-3n-slices,false,Hard,1140,24,Algorithms,53.8%,1388,false,Array;Dynamic Programming;Greedy;Heap (Priority Queue);,false,false,53.80160949231446,37907,70457\r\n1505,\"Create Target Array in the Given Order\",create-target-array-in-the-given-order,false,Easy,2305,1920,Algorithms,86.5%,1389,false,Array;Simulation;,false,false,86.4616379286728,315604,365022\r\n1284,\"Four Divisors\",four-divisors,false,Medium,892,223,Algorithms,56.6%,1390,false,Array;Math;,true,false,56.62218192737688,196103,346336\r\n1507,\"Check if There is a Valid Path in a Grid\",check-if-there-is-a-valid-path-in-a-grid,false,Medium,885,326,Algorithms,50.3%,1391,false,Array;Depth-First Search;Breadth-First Search;Union-Find;Matrix;,true,false,50.297469525899686,38044,75638\r\n1508,\"Longest Happy Prefix\",longest-happy-prefix,false,Hard,1590,48,Algorithms,52.9%,1392,false,String;Rolling Hash;String Matching;Hash Function;,false,false,52.856685205316865,100645,190412\r\n1523,\"Capital Gain/Loss\",capital-gainloss,false,Medium,930,51,Database,84.6%,1393,false,Database;,true,false,84.6482241296851,168141,198635\r\n1510,\"Find Lucky Integer in an Array\",find-lucky-integer-in-an-array,false,Easy,1632,45,Algorithms,75.5%,1394,false,Array;Hash Table;Counting;,true,false,75.50379814610314,338438,448236\r\n1511,\"Count Number of Teams\",count-number-of-teams,false,Medium,3457,237,Algorithms,70.2%,1395,false,Array;Dynamic Programming;Binary Indexed Tree;Segment Tree;,true,false,70.15731628474965,244165,348025\r\n1512,\"Design Underground System\",design-underground-system,false,Medium,3596,179,Algorithms,74.5%,1396,false,Hash Table;String;Design;,true,false,74.4721441433528,271305,364304\r\n1513,\"Find All Good Strings\",find-all-good-strings,false,Hard,535,130,Algorithms,45.2%,1397,false,String;Dynamic Programming;String Matching;,false,false,45.15072394967956,9511,21065\r\n1536,\"Customers Who Bought Products A and B but Not C\",customers-who-bought-products-a-and-b-but-not-c,true,Medium,327,18,Database,71.5%,1398,true,Database;,true,false,71.48529838676232,68949,96452\r\n1500,\"Count Largest Group\",count-largest-group,false,Easy,808,1190,Algorithms,74.7%,1399,false,Hash Table;Math;Counting;,true,false,74.67672978276725,185323,248167\r\n1502,\"Construct K Palindrome Strings\",construct-k-palindrome-strings,false,Medium,1794,160,Algorithms,68.5%,1400,false,Hash Table;String;Greedy;Counting;,true,false,68.54563090363446,210590,307226\r\n1928,\"Number of Orders in the Backlog\",number-of-orders-in-the-backlog,false,Medium,344,246,Algorithms,53.8%,1801,false,Array;Heap (Priority Queue);Simulation;,false,false,53.80702521498324,36917,68610\r\n1929,\"Maximum Value at a Given Index in a Bounded Array\",maximum-value-at-a-given-index-in-a-bounded-array,false,Medium,2728,478,Algorithms,38.9%,1802,false,Math;Binary Search;Greedy;,true,false,38.86279823372842,88626,228049\r\n1907,\"Count Pairs With XOR in a Range\",count-pairs-with-xor-in-a-range,false,Hard,555,24,Algorithms,46.0%,1803,false,Array;Bit Manipulation;Trie;,false,false,45.99744917098057,12262,26658\r\n1949,\"Implement Trie II (Prefix Tree)\",implement-trie-ii-prefix-tree,true,Medium,356,19,Algorithms,63.4%,1804,true,Hash Table;String;Design;Trie;,true,false,63.42203548085901,27170,42840\r\n1933,\"Number of Different Integers in a String\",number-of-different-integers-in-a-string,false,Easy,668,106,Algorithms,40.2%,1805,false,Hash Table;String;,false,false,40.23245781309592,64349,159943\r\n1935,\"Minimum Number of Operations to Reinitialize a Permutation\",minimum-number-of-operations-to-reinitialize-a-permutation,false,Medium,328,176,Algorithms,72.5%,1806,false,Array;Math;Simulation;,false,false,72.53242915357576,23317,32147\r\n1934,\"Evaluate the Bracket Pairs of a String\",evaluate-the-bracket-pairs-of-a-string,false,Medium,522,43,Algorithms,69.4%,1807,false,Array;Hash Table;String;,false,false,69.39687881487347,42067,60618\r\n1936,\"Maximize Number of Nice Divisors\",maximize-number-of-nice-divisors,false,Hard,234,173,Algorithms,35.9%,1808,false,Math;Recursion;Number Theory;,false,false,35.85545671662456,10359,28891\r\n1958,\"Ad-Free Sessions\",ad-free-sessions,true,Easy,99,61,Database,59.0%,1809,true,Database;,false,false,58.96781553981025,19641,33308\r\n1959,\"Minimum Path Cost in a Hidden Grid\",minimum-path-cost-in-a-hidden-grid,true,Medium,95,33,Algorithms,58.8%,1810,true,Array;Depth-First Search;Breadth-First Search;Graph Theory;Heap (Priority Queue);Matrix;Interactive;Shortest Path;,false,false,58.75304845721556,5541,9431\r\n1964,\"Find Interview Candidates\",find-interview-candidates,true,Medium,212,30,Database,60.8%,1811,true,Database;,false,false,60.78802157604315,19609,32258\r\n1920,\"Determine Color of a Chessboard Square\",determine-color-of-a-chessboard-square,false,Easy,902,24,Algorithms,79.8%,1812,false,Math;String;,false,false,79.83957650346643,118846,148856\r\n1923,\"Sentence Similarity III\",sentence-similarity-iii,false,Medium,1071,163,Algorithms,48.4%,1813,false,Array;Two Pointers;String;,true,false,48.42616691427967,132663,273949\r\n1925,\"Count Nice Pairs in an Array\",count-nice-pairs-in-an-array,false,Medium,2051,93,Algorithms,48.4%,1814,false,Array;Hash Table;Math;Counting;,true,false,48.44621998847328,135335,279351\r\n1924,\"Maximum Number of Groups Getting Fresh Donuts\",maximum-number-of-groups-getting-fresh-donuts,false,Hard,358,34,Algorithms,41.3%,1815,false,Array;Dynamic Programming;Bit Manipulation;Memoization;Bitmask;,false,false,41.27676063159934,8522,20646\r\n1944,\"Truncate Sentence\",truncate-sentence,false,Easy,1231,34,Algorithms,86.8%,1816,false,Array;String;,false,false,86.78828346921459,235256,271069\r\n1945,\"Finding the Users Active Minutes\",finding-the-users-active-minutes,false,Medium,864,320,Algorithms,80.8%,1817,false,Array;Hash Table;,false,false,80.78497747078063,70639,87441\r\n1946,\"Minimum Absolute Sum Difference\",minimum-absolute-sum-difference,false,Medium,1103,80,Algorithms,32.4%,1818,false,Array;Binary Search;Sorting;Ordered Set;,false,false,32.39227927376178,32792,101234\r\n1947,\"Number of Different Subsequences GCDs\",number-of-different-subsequences-gcds,false,Hard,436,48,Algorithms,45.2%,1819,false,Array;Math;Counting;Number Theory;,false,false,45.153639925757886,13137,29094\r\n1969,\"Maximum Number of Accepted Invitations\",maximum-number-of-accepted-invitations,true,Medium,236,68,Algorithms,52.5%,1820,true,Array;Depth-First Search;Graph Theory;Matrix;,false,false,52.50367839005173,11062,21069\r\n1974,\"Find Customers With Positive Revenue this Year\",find-customers-with-positive-revenue-this-year,true,Easy,66,26,Database,87.7%,1821,true,Database;,false,false,87.7092729462325,37144,42349\r\n1950,\"Sign of the Product of an Array\",sign-of-the-product-of-an-array,false,Easy,2298,232,Algorithms,64.8%,1822,false,Array;Math;,true,false,64.8097449124141,441491,681211\r\n1951,\"Find the Winner of the Circular Game\",find-the-winner-of-the-circular-game,false,Medium,4111,129,Algorithms,82.2%,1823,false,Array;Math;Recursion;Queue;Simulation;,true,false,82.24913698800627,376692,457989\r\n1952,\"Minimum Sideway Jumps\",minimum-sideway-jumps,false,Medium,1284,51,Algorithms,51.6%,1824,false,Array;Dynamic Programming;Greedy;,false,false,51.594411233630765,58862,114086\r\n1953,\"Finding MK Average\",finding-mk-average,false,Hard,529,142,Algorithms,38.7%,1825,false,Design;Queue;Heap (Priority Queue);Data Stream;Ordered Set;,false,false,38.69509217269971,28841,74533\r\n1980,\"Faulty Sensor\",faulty-sensor,true,Easy,72,85,Algorithms,50.5%,1826,true,Array;Two Pointers;,false,false,50.466016633209065,7039,13948\r\n1938,\"Minimum Operations to Make the Array Increasing\",minimum-operations-to-make-the-array-increasing,false,Easy,1320,68,Algorithms,82.0%,1827,false,Array;Greedy;,false,false,81.96160735286135,135903,165813\r\n1939,\"Queries on Number of Points Inside a Circle\",queries-on-number-of-points-inside-a-circle,false,Medium,1197,90,Algorithms,86.8%,1828,false,Array;Math;Geometry;,false,false,86.764066519329,95791,110404\r\n1940,\"Maximum XOR for Each Query\",maximum-xor-for-each-query,false,Medium,1267,194,Algorithms,84.7%,1829,false,Array;Bit Manipulation;Prefix Sum;,true,false,84.66325655726709,145156,171451\r\n1941,\"Minimum Number of Operations to Make String Sorted\",minimum-number-of-operations-to-make-string-sorted,false,Hard,189,132,Algorithms,50.1%,1830,false,Hash Table;Math;String;Combinatorics;Counting;,false,false,50.147756783379606,5600,11167\r\n1981,\"Maximum Transaction Each Day\",maximum-transaction-each-day,true,Medium,96,3,Database,82.4%,1831,true,Database;,false,false,82.44637205485876,28134,34124\r\n1960,\"Check if the Sentence Is Pangram\",check-if-the-sentence-is-pangram,false,Easy,3031,67,Algorithms,84.2%,1832,false,Hash Table;String;,true,false,84.1715660323033,543749,646001\r\n1961,\"Maximum Ice Cream Bars\",maximum-ice-cream-bars,false,Medium,2266,679,Algorithms,74.3%,1833,false,Array;Greedy;Sorting;Counting Sort;,true,false,74.28754564524901,191230,257419\r\n1962,\"Single-Threaded CPU\",single-threaded-cpu,false,Medium,3504,292,Algorithms,47.6%,1834,false,Array;Sorting;Heap (Priority Queue);,true,false,47.557256821323165,155176,326293\r\n1963,\"Find XOR Sum of All Pairs Bitwise AND\",find-xor-sum-of-all-pairs-bitwise-and,false,Hard,627,51,Algorithms,62.5%,1835,false,Array;Math;Bit Manipulation;,false,false,62.462681304214954,26571,42539\r\n1982,\"Remove Duplicates From an Unsorted Linked List\",remove-duplicates-from-an-unsorted-linked-list,true,Medium,408,12,Algorithms,75.7%,1836,true,Hash Table;Linked List;,true,false,75.6659671412096,40022,52893\r\n1965,\"Sum of Digits in Base K\",sum-of-digits-in-base-k,false,Easy,566,50,Algorithms,78.6%,1837,false,Math;,false,false,78.6291556064299,79681,101338\r\n1966,\"Frequency of the Most Frequent Element\",frequency-of-the-most-frequent-element,false,Medium,5756,313,Algorithms,44.8%,1838,false,Array;Binary Search;Greedy;Sliding Window;Sorting;Prefix Sum;,true,false,44.75313502358002,269980,603264\r\n1967,\"Longest Substring Of All Vowels in Order\",longest-substring-of-all-vowels-in-order,false,Medium,855,31,Algorithms,51.8%,1839,false,String;Sliding Window;,false,false,51.765994644477395,46783,90374\r\n1968,\"Maximum Building Height\",maximum-building-height,false,Hard,404,23,Algorithms,38.4%,1840,false,Array;Math;Sorting;,false,false,38.43987944162436,9693,25216\r\n1991,\"League Statistics\",league-statistics,true,Medium,114,98,Database,53.5%,1841,true,Database;,true,false,53.46615099613247,16451,30769\r\n1997,\"Next Palindrome Using Same Digits\",next-palindrome-using-same-digits,true,Hard,126,19,Algorithms,54.2%,1842,true,Two Pointers;String;,false,false,54.168279278581934,6998,12919\r\n1998,\"Suspicious Bank Accounts\",suspicious-bank-accounts,true,Medium,104,59,Database,44.2%,1843,true,Database;,true,false,44.165646674826604,15155,34314\r\n1954,\"Replace All Digits with Characters\",replace-all-digits-with-characters,false,Easy,899,117,Algorithms,82.7%,1844,false,String;,false,false,82.68586233376634,115212,139337\r\n1955,\"Seat Reservation Manager\",seat-reservation-manager,false,Medium,1481,92,Algorithms,67.1%,1845,false,Design;Heap (Priority Queue);,true,false,67.14605750890705,149263,222296\r\n1956,\"Maximum Element After Decreasing and Rearranging\",maximum-element-after-decreasing-and-rearranging,false,Medium,1136,278,Algorithms,65.7%,1846,false,Array;Greedy;Sorting;,true,false,65.73004231633456,115255,175346\r\n1957,\"Closest Room\",closest-room,false,Hard,538,21,Algorithms,41.1%,1847,false,Array;Binary Search;Sorting;Ordered Set;,false,false,41.11754008927095,12436,30245\r\n1975,\"Minimum Distance to the Target Element\",minimum-distance-to-the-target-element,false,Easy,628,86,Algorithms,64.6%,1848,false,Array;,true,false,64.61479604398434,170585,264001\r\n1976,\"Splitting a String Into Descending Consecutive Values\",splitting-a-string-into-descending-consecutive-values,false,Medium,555,128,Algorithms,37.6%,1849,false,String;Backtracking;Enumeration;,false,false,37.58180857601863,34856,92747\r\n1978,\"Minimum Adjacent Swaps to Reach the Kth Smallest Number\",minimum-adjacent-swaps-to-reach-the-kth-smallest-number,false,Medium,811,122,Algorithms,71.8%,1850,false,Two Pointers;String;Greedy;,false,false,71.78519519596094,28152,39217\r\n1977,\"Minimum Interval to Include Each Query\",minimum-interval-to-include-each-query,false,Hard,1154,49,Algorithms,54.2%,1851,false,Array;Binary Search;Sweep Line;Sorting;Heap (Priority Queue);,false,false,54.24042815973652,71145,131166\r\n2003,\"Distinct Numbers in Each Subarray\",distinct-numbers-in-each-subarray,true,Medium,157,10,Algorithms,77.3%,1852,true,Array;Hash Table;Sliding Window;,true,false,77.29169532718852,16855,21807\r\n2004,\"Convert Date Format\",convert-date-format,true,Easy,69,42,Database,85.0%,1853,true,Database;,false,false,84.95369145276528,16052,18895\r\n1983,\"Maximum Population Year\",maximum-population-year,false,Easy,1557,288,Algorithms,63.9%,1854,false,Array;Counting;Prefix Sum;,false,false,63.86950472705762,116604,182566\r\n1984,\"Maximum Distance Between a Pair of Values\",maximum-distance-between-a-pair-of-values,false,Medium,1460,36,Algorithms,58.8%,1855,false,Array;Two Pointers;Binary Search;,true,false,58.87539052550047,112275,190910\r\n1985,\"Maximum Subarray Min-Product\",maximum-subarray-min-product,false,Medium,1563,146,Algorithms,40.3%,1856,false,Array;Stack;Monotonic Stack;Prefix Sum;,false,false,40.28203556100552,40733,101121\r\n1986,\"Largest Color Value in a Directed Graph\",largest-color-value-in-a-directed-graph,false,Hard,2628,87,Algorithms,57.3%,1857,false,Hash Table;String;Dynamic Programming;Graph Theory;Topological Sort;Memoization;Counting;,true,false,57.28710048497866,149897,261660\r\n2009,\"Longest Word With All Prefixes\",longest-word-with-all-prefixes,true,Medium,204,7,Algorithms,72.1%,1858,true,Array;String;Depth-First Search;Trie;,true,false,72.06393328700487,14518,20146\r\n1970,\"Sorting the Sentence\",sorting-the-sentence,false,Easy,2398,83,Algorithms,84.1%,1859,false,String;Sorting;,false,false,84.07236722517456,235881,280569\r\n1971,\"Incremental Memory Leak\",incremental-memory-leak,false,Medium,236,93,Algorithms,72.8%,1860,false,Math;Simulation;,false,false,72.78657710700168,26332,36177\r\n1972,\"Rotating the Box\",rotating-the-box,false,Medium,1633,83,Algorithms,79.2%,1861,false,Array;Two Pointers;Matrix;,true,false,79.15000954051928,170072,214873\r\n1326,\"Sum of Floored Pairs\",sum-of-floored-pairs,false,Hard,466,39,Algorithms,30.8%,1862,false,Array;Math;Binary Search;Counting;Enumeration;Prefix Sum;,false,false,30.76672431511141,12275,39897\r\n1993,\"Sum of All Subset XOR Totals\",sum-of-all-subset-xor-totals,false,Easy,2704,356,Algorithms,90.1%,1863,false,Array;Math;Backtracking;Bit Manipulation;Combinatorics;Enumeration;,true,false,90.11372259325705,358639,397985\r\n1994,\"Minimum Number of Swaps to Make the Binary String Alternating\",minimum-number-of-swaps-to-make-the-binary-string-alternating,false,Medium,625,38,Algorithms,43.9%,1864,false,String;Greedy;,false,false,43.8608483368935,35933,81925\r\n1995,\"Finding Pairs With a Certain Sum\",finding-pairs-with-a-certain-sum,false,Medium,1042,145,Algorithms,61.6%,1865,false,Array;Hash Table;Design;,true,false,61.55227606585774,144979,235538\r\n1996,\"Number of Ways to Rearrange Sticks With K Sticks Visible\",number-of-ways-to-rearrange-sticks-with-k-sticks-visible,false,Hard,765,24,Algorithms,61.1%,1866,false,Math;Dynamic Programming;Combinatorics;,false,false,61.11924992675066,22945,37542\r\n2014,\"Orders With Maximum Quantity Above Average\",orders-with-maximum-quantity-above-average,true,Medium,79,282,Database,70.7%,1867,true,Database;,false,false,70.65835914427717,19619,27766\r\n2019,\"Product of Two Run-Length Encoded Arrays\",product-of-two-run-length-encoded-arrays,true,Medium,415,84,Algorithms,59.6%,1868,true,Array;Two Pointers;,false,false,59.5738915105359,63753,107015\r\n1999,\"Longer Contiguous Segments of Ones than Zeros\",longer-contiguous-segments-of-ones-than-zeros,false,Easy,579,14,Algorithms,62.4%,1869,false,String;,false,false,62.40858759611228,66394,106386\r\n2000,\"Minimum Speed to Arrive on Time\",minimum-speed-to-arrive-on-time,false,Medium,2458,293,Algorithms,47.8%,1870,false,Array;Binary Search;,true,false,47.78128915234587,127760,267385\r\n2001,\"Jump Game VII\",jump-game-vii,false,Medium,1816,121,Algorithms,26.5%,1871,false,String;Dynamic Programming;Sliding Window;Prefix Sum;,false,false,26.462836679942797,67173,253839\r\n2002,\"Stone Game VIII\",stone-game-viii,false,Hard,476,25,Algorithms,53.8%,1872,false,Array;Math;Dynamic Programming;Prefix Sum;Game Theory;,false,false,53.844887883151614,13087,24305\r\n2024,\"Calculate Special Bonus\",calculate-special-bonus,false,Easy,1190,83,Database,57.0%,1873,false,Database;,true,false,57.00539328596338,344254,603895\r\n2029,\"Minimize Product Sum of Two Arrays\",minimize-product-sum-of-two-arrays,true,Medium,257,28,Algorithms,89.9%,1874,true,Array;Greedy;Sorting;,true,false,89.8543569489015,25480,28357\r\n2030,\"Group Employees of the Same Salary\",group-employees-of-the-same-salary,true,Medium,78,6,Database,65.4%,1875,true,Database;,false,false,65.42341273205052,15436,23594\r\n1987,\"Substrings of Size Three with Distinct Characters\",substrings-of-size-three-with-distinct-characters,false,Easy,1704,58,Algorithms,76.7%,1876,false,Hash Table;String;Sliding Window;Counting;,false,false,76.68322866247033,215142,280560\r\n1988,\"Minimize Maximum Pair Sum in Array\",minimize-maximum-pair-sum-in-array,false,Medium,2377,547,Algorithms,83.3%,1877,false,Array;Two Pointers;Greedy;Sorting;,true,false,83.28492448219222,332620,399376\r\n1990,\"Get Biggest Three Rhombus Sums in a Grid\",get-biggest-three-rhombus-sums-in-a-grid,false,Medium,477,600,Algorithms,71.4%,1878,false,Array;Math;Sorting;Heap (Priority Queue);Matrix;Prefix Sum;,true,false,71.36279554431853,88345,123797\r\n1989,\"Minimum XOR Sum of Two Arrays\",minimum-xor-sum-of-two-arrays,false,Hard,722,13,Algorithms,51.0%,1879,false,Array;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,50.99761360001969,20729,40647\r\n2010,\"Check if Word Equals Summation of Two Words\",check-if-word-equals-summation-of-two-words,false,Easy,612,42,Algorithms,75.2%,1880,false,String;,false,false,75.22875226039784,83203,110600\r\n2011,\"Maximum Value after Insertion\",maximum-value-after-insertion,false,Medium,401,67,Algorithms,39.3%,1881,false,String;Greedy;,false,false,39.330040600094854,34001,86452\r\n2012,\"Process Tasks Using Servers\",process-tasks-using-servers,false,Medium,1036,290,Algorithms,41.9%,1882,false,Array;Heap (Priority Queue);,false,false,41.93361395498163,47021,112132\r\n2013,\"Minimum Skips to Arrive at Meeting On Time\",minimum-skips-to-arrive-at-meeting-on-time,false,Hard,355,54,Algorithms,38.6%,1883,false,Array;Dynamic Programming;,false,false,38.59081234480312,8703,22552\r\n2031,\"Egg Drop With 2 Eggs and N Floors\",egg-drop-with-2-eggs-and-n-floors,false,Medium,1544,164,Algorithms,74.6%,1884,false,Math;Dynamic Programming;,false,false,74.59776115074531,64307,86205\r\n2036,\"Count Pairs in Two Arrays\",count-pairs-in-two-arrays,true,Medium,245,23,Algorithms,60.3%,1885,true,Array;Two Pointers;Binary Search;Sorting;,true,false,60.31832606108687,12165,20168\r\n2015,\"Determine Whether Matrix Can Be Obtained By Rotation\",determine-whether-matrix-can-be-obtained-by-rotation,false,Easy,1855,173,Algorithms,68.2%,1886,false,Array;Matrix;,true,false,68.22166869693278,187613,275005\r\n2016,\"Reduction Operations to Make the Array Elements Equal\",reduction-operations-to-make-the-array-elements-equal,false,Medium,1280,52,Algorithms,72.5%,1887,false,Array;Sorting;,true,false,72.5022908714541,109977,151688\r\n2017,\"Minimum Number of Flips to Make the Binary String Alternating\",minimum-number-of-flips-to-make-the-binary-string-alternating,false,Medium,1813,122,Algorithms,53.5%,1888,false,String;Dynamic Programming;Sliding Window;,true,false,53.51447737114715,126048,235540\r\n2018,\"Minimum Space Wasted From Packaging\",minimum-space-wasted-from-packaging,false,Hard,424,39,Algorithms,33.5%,1889,false,Array;Binary Search;Sorting;Prefix Sum;,false,false,33.5132611131864,17943,53540\r\n2041,\"The Latest Login in 2020\",the-latest-login-in-2020,false,Easy,468,20,Database,77.0%,1890,false,Database;,true,false,76.99824499080079,145219,188601\r\n2045,\"Cutting Ribbons\",cutting-ribbons,true,Medium,630,70,Algorithms,53.0%,1891,true,Array;Binary Search;,true,false,53.025042342124365,87661,165320\r\n2046,\"Page Recommendations II\",page-recommendations-ii,true,Hard,93,24,Database,45.6%,1892,true,Database;,false,false,45.62694838933148,10538,23096\r\n2005,\"Check if All the Integers in a Range Are Covered\",check-if-all-the-integers-in-a-range-are-covered,false,Easy,677,127,Algorithms,51.0%,1893,false,Array;Hash Table;Prefix Sum;,false,false,50.95100778436851,68202,133858\r\n2006,\"Find the Student that Will Replace the Chalk\",find-the-student-that-will-replace-the-chalk,false,Medium,1212,134,Algorithms,53.2%,1894,false,Array;Binary Search;Simulation;Prefix Sum;,true,false,53.17468407365299,203449,382605\r\n1311,\"Largest Magic Square\",largest-magic-square,false,Medium,609,334,Algorithms,75.2%,1895,false,Array;Matrix;Prefix Sum;,true,false,75.23909474076206,88898,118154\r\n2008,\"Minimum Cost to Change the Final Value of Expression\",minimum-cost-to-change-the-final-value-of-expression,false,Hard,248,43,Algorithms,49.7%,1896,false,Math;String;Dynamic Programming;Stack;,false,false,49.7486033519553,5343,10740\r\n2025,\"Redistribute Characters to Make All Strings Equal\",redistribute-characters-to-make-all-strings-equal,false,Easy,1170,85,Algorithms,66.9%,1897,false,Hash Table;String;Counting;,true,false,66.85313335375655,159305,238291\r\n2027,\"Maximum Number of Removable Characters\",maximum-number-of-removable-characters,false,Medium,1055,137,Algorithms,47.0%,1898,false,Array;Two Pointers;String;Binary Search;,false,false,47.02570941366797,43021,91484\r\n2026,\"Merge Triplets to Form Target Triplet\",merge-triplets-to-form-target-triplet,false,Medium,940,80,Algorithms,68.9%,1899,false,Array;Greedy;,false,false,68.9481247054854,118517,171893\r\n2028,\"The Earliest and Latest Rounds Where Players Compete\",the-earliest-and-latest-rounds-where-players-compete,false,Hard,518,77,Algorithms,72.4%,1900,false,Dynamic Programming;Memoization;,true,false,72.376011235303,62357,86157\r\n1312,\"Count Artifacts That Can Be Extracted\",count-artifacts-that-can-be-extracted,false,Medium,225,204,Algorithms,57.1%,2201,false,Array;Hash Table;Simulation;,false,false,57.10264819619169,23331,40858\r\n1346,\"Maximize the Topmost Element After K Moves\",maximize-the-topmost-element-after-k-moves,false,Medium,652,336,Algorithms,24.1%,2202,false,Array;Greedy;,false,false,24.082163189041577,38537,160023\r\n2321,\"Minimum Weighted Subgraph With the Required Paths\",minimum-weighted-subgraph-with-the-required-paths,false,Hard,791,23,Algorithms,41.8%,2203,false,Graph Theory;Heap (Priority Queue);Shortest Path;,false,false,41.7510321814377,22146,53043\r\n1347,\"Distance to a Cycle in Undirected Graph\",distance-to-a-cycle-in-undirected-graph,true,Hard,154,11,Algorithms,73.7%,2204,true,Depth-First Search;Breadth-First Search;Graph Theory;Topological Sort;,true,false,73.74987321229334,7271,9859\r\n2336,\"The Number of Users That Are Eligible for Discount\",the-number-of-users-that-are-eligible-for-discount,true,Easy,32,77,Database,50.7%,2205,true,Database;,false,false,50.65158156616515,8551,16882\r\n2308,\"Divide Array Into Equal Pairs\",divide-array-into-equal-pairs,false,Easy,1200,50,Algorithms,79.2%,2206,false,Array;Hash Table;Bit Manipulation;Counting;,true,false,79.23577538606013,302065,381223\r\n2309,\"Maximize Number of Subsequences in a String\",maximize-number-of-subsequences-in-a-string,false,Medium,533,37,Algorithms,36.0%,2207,false,String;Greedy;Prefix Sum;,false,false,36.03291656404387,24871,69023\r\n2310,\"Minimum Operations to Halve Array Sum\",minimum-operations-to-halve-array-sum,false,Medium,677,32,Algorithms,50.1%,2208,false,Array;Greedy;Heap (Priority Queue);,false,false,50.08182545143474,53859,107543\r\n2311,\"Minimum White Tiles After Covering With Carpets\",minimum-white-tiles-after-covering-with-carpets,false,Hard,524,17,Algorithms,38.7%,2209,false,String;Dynamic Programming;Prefix Sum;,false,false,38.742138364779876,16324,42135\r\n2316,\"Count Hills and Valleys in an Array\",count-hills-and-valleys-in-an-array,false,Easy,1155,143,Algorithms,69.1%,2210,false,Array;,true,false,69.0521215435207,181846,263346\r\n2317,\"Count Collisions on a Road\",count-collisions-on-a-road,false,Medium,1115,277,Algorithms,58.1%,2211,false,String;Stack;Simulation;,true,false,58.09294398363822,127819,220025\r\n2318,\"Maximum Points in an Archery Competition\",maximum-points-in-an-archery-competition,false,Medium,515,56,Algorithms,51.4%,2212,false,Array;Backtracking;Bit Manipulation;Enumeration;,false,false,51.39963645806284,19794,38510\r\n2319,\"Longest Substring of One Repeating Character\",longest-substring-of-one-repeating-character,false,Hard,322,84,Algorithms,34.3%,2213,false,Array;String;Segment Tree;Ordered Set;,false,false,34.28192574459404,6722,19608\r\n2354,\"Minimum Health to Beat Game\",minimum-health-to-beat-game,true,Medium,327,240,Algorithms,58.8%,2214,true,Array;Greedy;,true,false,58.84106199811908,40668,69115\r\n1392,\"Find the Difference of Two Arrays\",find-the-difference-of-two-arrays,false,Easy,2622,129,Algorithms,81.4%,2215,false,Array;Hash Table;,true,false,81.38621731986846,642956,790006\r\n1355,\"Minimum Deletions to Make Array Beautiful\",minimum-deletions-to-make-array-beautiful,false,Medium,836,96,Algorithms,49.9%,2216,false,Array;Stack;Greedy;,false,false,49.892872974437275,40519,81212\r\n1375,\"Find Palindrome With Fixed Length\",find-palindrome-with-fixed-length,false,Medium,664,297,Algorithms,38.0%,2217,false,Array;Math;,false,false,38.01253430549297,27840,73239\r\n1393,\"Maximum Value of K Coins From Piles\",maximum-value-of-k-coins-from-piles,false,Hard,2454,38,Algorithms,60.4%,2218,false,Array;Dynamic Programming;Prefix Sum;,true,false,60.42488775232763,82228,136083\r\n2369,\"Maximum Sum Score of Array\",maximum-sum-score-of-array,true,Medium,72,19,Algorithms,62.6%,2219,true,Array;Prefix Sum;,false,false,62.59648370497427,5839,9328\r\n2323,\"Minimum Bit Flips to Convert Number\",minimum-bit-flips-to-convert-number,false,Easy,1616,39,Algorithms,87.8%,2220,false,Bit Manipulation;,true,false,87.84176177342586,373906,425659\r\n2324,\"Find Triangular Sum of an Array\",find-triangular-sum-of-an-array,false,Medium,1545,77,Algorithms,82.0%,2221,false,Array;Math;Simulation;Combinatorics;Number Theory;,true,false,81.96813220247435,239772,292518\r\n2325,\"Number of Ways to Select Buildings\",number-of-ways-to-select-buildings,false,Medium,1061,54,Algorithms,50.9%,2222,false,String;Dynamic Programming;Prefix Sum;,false,false,50.859338589866745,53473,105139\r\n2326,\"Sum of Scores of Built Strings\",sum-of-scores-of-built-strings,false,Hard,302,190,Algorithms,47.8%,2223,false,String;Binary Search;Rolling Hash;Suffix Array;String Matching;Hash Function;,false,false,47.812833888504805,15214,31821\r\n2345,\"Minimum Number of Operations to Convert Time\",minimum-number-of-operations-to-convert-time,false,Easy,502,39,Algorithms,66.4%,2224,false,String;Greedy;,false,false,66.35632721041974,55379,83457\r\n1354,\"Find Players With Zero or One Losses\",find-players-with-zero-or-one-losses,false,Medium,2276,160,Algorithms,72.5%,2225,false,Array;Hash Table;Sorting;Counting;,true,false,72.45427508951924,315250,435102\r\n1335,\"Maximum Candies Allocated to K Children\",maximum-candies-allocated-to-k-children,false,Medium,1839,86,Algorithms,49.9%,2226,false,Array;Binary Search;,true,false,49.88606341218891,206004,412942\r\n1433,\"Encrypt and Decrypt Strings\",encrypt-and-decrypt-strings,false,Hard,353,80,Algorithms,38.2%,2227,false,Array;Hash Table;String;Design;Trie;,false,false,38.214059807621,17520,45847\r\n2370,\"Users With Two Purchases Within Seven Days\",users-with-two-purchases-within-seven-days,true,Medium,68,11,Database,46.9%,2228,true,Database;,false,false,46.86897509061464,12155,25934\r\n1416,\"Check if an Array Is Consecutive\",check-if-an-array-is-consecutive,true,Easy,90,11,Algorithms,62.1%,2229,true,Array;Hash Table;Sorting;,false,false,62.13933849401829,7947,12789\r\n2371,\"The Users That Are Eligible for Discount\",the-users-that-are-eligible-for-discount,true,Easy,25,45,Database,50.9%,2230,true,Database;,false,false,50.882154882154886,7556,14850\r\n2327,\"Largest Number After Digit Swaps by Parity\",largest-number-after-digit-swaps-by-parity,false,Easy,694,311,Algorithms,65.3%,2231,false,Sorting;Heap (Priority Queue);,false,false,65.25455982668267,66866,102470\r\n2328,\"Minimize Result by Adding Parentheses to Expression\",minimize-result-by-adding-parentheses-to-expression,false,Medium,226,345,Algorithms,68.1%,2232,false,String;Enumeration;,false,false,68.08815759679976,27063,39747\r\n2329,\"Maximum Product After K Increments\",maximum-product-after-k-increments,false,Medium,791,45,Algorithms,43.3%,2233,false,Array;Greedy;Heap (Priority Queue);,false,false,43.32451310387766,44535,102794\r\n2330,\"Maximum Total Beauty of the Gardens\",maximum-total-beauty-of-the-gardens,false,Hard,452,41,Algorithms,30.2%,2234,false,Array;Two Pointers;Binary Search;Greedy;Sorting;Enumeration;Prefix Sum;,false,false,30.183232931726906,9620,31872\r\n2383,\"Add Two Integers\",add-two-integers,false,Easy,2142,3226,Algorithms,88.0%,2235,false,Math;,false,false,87.95011965441778,885347,1006647\r\n2384,\"Root Equals Sum of Children\",root-equals-sum-of-children,false,Easy,1587,1648,Algorithms,84.9%,2236,false,Tree;Binary Tree;,false,false,84.91669462419054,351824,414312\r\n2385,\"Count Positions on Street With Required Brightness\",count-positions-on-street-with-required-brightness,true,Medium,89,6,Algorithms,63.0%,2237,true,Array;Prefix Sum;,false,false,63.03439803439803,5131,8140\r\n2376,\"Number of Times a Driver Was a Passenger\",number-of-times-a-driver-was-a-passenger,true,Medium,73,6,Database,71.7%,2238,true,Database;,false,false,71.74930432582849,11345,15812\r\n2350,\"Find Closest Number to Zero\",find-closest-number-to-zero,false,Easy,807,57,Algorithms,47.9%,2239,false,Array;,false,false,47.85155715341588,209762,438361\r\n2351,\"Number of Ways to Buy Pens and Pencils\",number-of-ways-to-buy-pens-and-pencils,false,Medium,479,37,Algorithms,56.7%,2240,false,Math;Enumeration;,false,false,56.7285516605166,39356,69376\r\n2352,\"Design an ATM Machine\",design-an-atm-machine,false,Medium,313,387,Algorithms,45.0%,2241,false,Array;Greedy;Design;,false,false,44.9745369783881,35502,78938\r\n2353,\"Maximum Score of a Node Sequence\",maximum-score-of-a-node-sequence,false,Hard,581,21,Algorithms,40.0%,2242,false,Array;Graph Theory;Sorting;Enumeration;,false,false,39.969964503504144,17566,43948\r\n2361,\"Calculate Digit Sum of a String\",calculate-digit-sum-of-a-string,false,Easy,601,52,Algorithms,67.7%,2243,false,String;Simulation;,false,false,67.72935012819083,54684,80739\r\n2362,\"Minimum Rounds to Complete All Tasks\",minimum-rounds-to-complete-all-tasks,false,Medium,2851,85,Algorithms,63.3%,2244,false,Array;Hash Table;Greedy;Counting;,true,false,63.281175878150066,173412,274036\r\n2363,\"Maximum Trailing Zeros in a Cornered Path\",maximum-trailing-zeros-in-a-cornered-path,false,Medium,204,407,Algorithms,37.5%,2245,false,Array;Matrix;Prefix Sum;,false,false,37.461514778325125,9734,25984\r\n2364,\"Longest Path With Different Adjacent Characters\",longest-path-with-different-adjacent-characters,false,Hard,2551,61,Algorithms,54.0%,2246,false,Array;String;Tree;Depth-First Search;Graph Theory;Topological Sort;,true,false,53.96299461137366,92832,172027\r\n2007,\"Maximum Cost of Trip With K Highways\",maximum-cost-of-trip-with-k-highways,true,Hard,63,0,Algorithms,51.0%,2247,true,Dynamic Programming;Bit Manipulation;Graph Theory;Bitmask;,false,false,51.02863202545069,2406,4715\r\n2331,\"Intersection of Multiple Arrays\",intersection-of-multiple-arrays,false,Easy,808,44,Algorithms,68.7%,2248,false,Array;Hash Table;Sorting;Counting;,false,false,68.66126355890152,128687,187423\r\n2332,\"Count Lattice Points Inside a Circle\",count-lattice-points-inside-a-circle,false,Medium,256,223,Algorithms,56.6%,2249,false,Array;Hash Table;Math;Geometry;Enumeration;,false,false,56.6051736932024,32800,57946\r\n2333,\"Count Number of Rectangles Containing Each Point\",count-number-of-rectangles-containing-each-point,false,Medium,554,141,Algorithms,37.5%,2250,false,Array;Hash Table;Binary Search;Binary Indexed Tree;Sorting;,false,false,37.516688918558074,23323,62167\r\n2334,\"Number of Flowers in Full Bloom\",number-of-flowers-in-full-bloom,false,Hard,1820,46,Algorithms,57.8%,2251,false,Array;Hash Table;Binary Search;Sorting;Prefix Sum;Ordered Set;,true,false,57.772783303579025,108733,188208\r\n2381,\"Dynamic Pivoting of a Table\",dynamic-pivoting-of-a-table,true,Hard,34,10,Database,57.1%,2252,true,Database;,false,false,57.1021254536029,2203,3858\r\n2382,\"Dynamic Unpivoting of a Table\",dynamic-unpivoting-of-a-table,true,Hard,20,13,Database,69.4%,2253,true,Database;,false,false,69.35101847465656,1464,2111\r\n2396,\"Design Video Sharing Platform\",design-video-sharing-platform,true,Hard,88,15,Algorithms,64.1%,2254,true,Hash Table;Design;Heap (Priority Queue);,false,false,64.08643951520695,5605,8746\r\n2341,\"Count Prefixes of a Given String\",count-prefixes-of-a-given-string,false,Easy,608,24,Algorithms,74.3%,2255,false,Array;String;,false,false,74.2790322177926,89245,120149\r\n2342,\"Minimum Average Difference\",minimum-average-difference,false,Medium,1570,182,Algorithms,43.8%,2256,false,Array;Prefix Sum;,true,false,43.849634840270625,97868,223190\r\n2343,\"Count Unguarded Cells in the Grid\",count-unguarded-cells-in-the-grid,false,Medium,1298,93,Algorithms,69.0%,2257,false,Array;Matrix;Simulation;,true,false,68.97539956911669,206502,299385\r\n2344,\"Escape the Spreading Fire\",escape-the-spreading-fire,false,Hard,887,42,Algorithms,38.0%,2258,false,Array;Binary Search;Breadth-First Search;Matrix;,false,false,38.019965198278236,20757,54595\r\n2337,\"Remove Digit From Number to Maximize Result\",remove-digit-from-number-to-maximize-result,false,Easy,956,66,Algorithms,48.4%,2259,false,String;Greedy;Enumeration;,false,false,48.406272343069766,129313,267141\r\n2338,\"Minimum Consecutive Cards to Pick Up\",minimum-consecutive-cards-to-pick-up,false,Medium,1095,45,Algorithms,53.7%,2260,false,Array;Hash Table;Sliding Window;,false,false,53.68975167695793,120861,225110\r\n2339,\"K Divisible Elements Subarrays\",k-divisible-elements-subarrays,false,Medium,740,162,Algorithms,54.9%,2261,false,Array;Hash Table;Trie;Rolling Hash;Hash Function;Enumeration;,false,false,54.86146885569019,48988,89294\r\n2340,\"Total Appeal of A String\",total-appeal-of-a-string,false,Hard,1223,35,Algorithms,56.4%,2262,false,Hash Table;String;Dynamic Programming;,false,false,56.40513036671283,46836,83035\r\n1419,\"Make Array Non-decreasing or Non-increasing\",make-array-non-decreasing-or-non-increasing,true,Hard,94,13,Algorithms,65.5%,2263,true,Array;Dynamic Programming;Greedy;Heap (Priority Queue);,false,false,65.48805460750853,4797,7325\r\n2346,\"Largest 3-Same-Digit Number in String\",largest-3-same-digit-number-in-string,false,Easy,1391,55,Algorithms,72.7%,2264,false,String;,true,false,72.68786417184563,325968,448449\r\n2347,\"Count Nodes Equal to Average of Subtree\",count-nodes-equal-to-average-of-subtree,false,Medium,2362,59,Algorithms,86.8%,2265,false,Tree;Depth-First Search;Binary Tree;,true,false,86.75130165641517,198441,228747\r\n2348,\"Count Number of Texts\",count-number-of-texts,false,Medium,945,36,Algorithms,50.1%,2266,false,Hash Table;Math;String;Dynamic Programming;,false,false,50.10554045154427,29672,59219\r\n2349,\" Check if There Is a Valid Parentheses String Path\",check-if-there-is-a-valid-parentheses-string-path,false,Hard,541,9,Algorithms,40.1%,2267,false,Array;Dynamic Programming;Matrix;,false,false,40.13609502775623,20172,50259\r\n2405,\"Minimum Number of Keypresses\",minimum-number-of-keypresses,true,Medium,250,40,Algorithms,71.4%,2268,true,Hash Table;String;Greedy;Sorting;Counting;,false,false,71.44092052941967,37190,52057\r\n1430,\"Find the K-Beauty of a Number\",find-the-k-beauty-of-a-number,false,Easy,743,47,Algorithms,63.3%,2269,false,Math;String;Sliding Window;,false,false,63.263637749234455,91315,144341\r\n2358,\"Number of Ways to Split Array\",number-of-ways-to-split-array,false,Medium,1200,100,Algorithms,55.9%,2270,false,Array;Prefix Sum;,true,false,55.883781807890955,236964,424030\r\n2359,\"Maximum White Tiles Covered by a Carpet\",maximum-white-tiles-covered-by-a-carpet,false,Medium,841,58,Algorithms,35.8%,2271,false,Array;Binary Search;Greedy;Sliding Window;Sorting;Prefix Sum;,false,false,35.83139317171651,22008,61421\r\n2360,\"Substring With Largest Variance\",substring-with-largest-variance,false,Hard,1921,213,Algorithms,46.0%,2272,false,Hash Table;String;Dynamic Programming;Enumeration;,true,false,45.984240540393436,76040,165361\r\n1353,\"Find Resultant Array After Removing Anagrams\",find-resultant-array-after-removing-anagrams,false,Easy,1068,238,Algorithms,69.9%,2273,false,Array;Hash Table;String;Sorting;,true,false,69.9339351015442,208643,298343\r\n2355,\"Maximum Consecutive Floors Without Special Floors\",maximum-consecutive-floors-without-special-floors,false,Medium,431,41,Algorithms,52.6%,2274,false,Array;Sorting;,false,false,52.55675736932899,41739,79417\r\n2356,\"Largest Combination With Bitwise AND Greater Than Zero\",largest-combination-with-bitwise-and-greater-than-zero,false,Medium,1137,60,Algorithms,80.8%,2275,false,Array;Hash Table;Bit Manipulation;Counting;,true,false,80.7542443640412,156680,194021\r\n2357,\"Count Integers in Intervals\",count-integers-in-intervals,false,Hard,626,64,Algorithms,35.8%,2276,false,Design;Segment Tree;Ordered Set;,false,false,35.83444625506941,29247,81617\r\n2420,\"Closest Node to Path in Tree\",closest-node-to-path-in-tree,true,Hard,139,3,Algorithms,62.3%,2277,true,Array;Tree;Depth-First Search;Breadth-First Search;,false,false,62.31897686665413,6627,10634\r\n2365,\"Percentage of Letter in String\",percentage-of-letter-in-string,false,Easy,563,64,Algorithms,75.2%,2278,false,String;,false,false,75.18358547485197,100437,133589\r\n2366,\"Maximum Bags With Full Capacity of Rocks\",maximum-bags-with-full-capacity-of-rocks,false,Medium,1773,72,Algorithms,68.1%,2279,false,Array;Greedy;Sorting;,true,false,68.05350165314097,113207,166350\r\n2367,\"Minimum Lines to Represent a Line Chart\",minimum-lines-to-represent-a-line-chart,false,Medium,366,534,Algorithms,27.0%,2280,false,Array;Math;Geometry;Sorting;Number Theory;,false,false,26.9735744553068,32337,119884\r\n2368,\"Sum of Total Strength of Wizards\",sum-of-total-strength-of-wizards,false,Hard,1273,112,Algorithms,29.3%,2281,false,Array;Stack;Monotonic Stack;Prefix Sum;,true,false,29.254869722089015,25622,87582\r\n2425,\"Number of People That Can Be Seen in a Grid\",number-of-people-that-can-be-seen-in-a-grid,true,Medium,66,34,Algorithms,47.4%,2282,true,Array;Stack;Matrix;Monotonic Stack;,false,false,47.426536064113975,2663,5615\r\n2377,\"Check if Number Has Equal Digit Count and Digit Value\",check-if-number-has-equal-digit-count-and-digit-value,false,Easy,679,101,Algorithms,73.1%,2283,false,Hash Table;String;Counting;,false,false,73.12438365561891,85274,116615\r\n2378,\"Sender With Largest Word Count\",sender-with-largest-word-count,false,Medium,470,41,Algorithms,59.7%,2284,false,Array;Hash Table;String;Counting;,false,false,59.665329391891895,45211,75775\r\n2379,\"Maximum Total Importance of Roads\",maximum-total-importance-of-roads,false,Medium,1365,84,Algorithms,69.1%,2285,false,Greedy;Graph Theory;Sorting;Heap (Priority Queue);,true,false,69.10211680107011,162211,234741\r\n2380,\"Booking Concert Tickets in Groups\",booking-concert-tickets-in-groups,false,Hard,354,61,Algorithms,19.5%,2286,false,Binary Search;Design;Binary Indexed Tree;Segment Tree;,false,false,19.511662964138367,9837,50416\r\n2372,\"Rearrange Characters to Make Target String\",rearrange-characters-to-make-target-string,false,Easy,533,38,Algorithms,61.2%,2287,false,Hash Table;String;Counting;,false,false,61.1988031482405,56451,92242\r\n2373,\"Apply Discount to Prices\",apply-discount-to-prices,false,Medium,223,1130,Algorithms,34.1%,2288,false,String;,false,false,34.08593235112784,32066,94074\r\n2374,\"Steps to Make Array Non-decreasing\",steps-to-make-array-non-decreasing,false,Medium,1414,149,Algorithms,24.8%,2289,false,Array;Linked List;Dynamic Programming;Stack;Monotonic Stack;Simulation;,false,false,24.783336345278972,31542,127271\r\n2375,\"Minimum Obstacle Removal to Reach Corner\",minimum-obstacle-removal-to-reach-corner,false,Hard,1668,29,Algorithms,70.6%,2290,false,Array;Breadth-First Search;Graph Theory;Heap (Priority Queue);Matrix;Shortest Path;,true,false,70.61350185805387,123133,174376\r\n2426,\"Maximum Profit From Trading Stocks\",maximum-profit-from-trading-stocks,true,Medium,191,9,Algorithms,48.2%,2291,true,Array;Dynamic Programming;,false,false,48.1594756963408,17636,36620\r\n2431,\"Products With Three or More Orders in Two Consecutive Years\",products-with-three-or-more-orders-in-two-consecutive-years,true,Medium,65,29,Database,40.7%,2292,true,Database;,false,false,40.67073170731707,10672,26240\r\n2386,\"Min Max Game\",min-max-game,false,Easy,591,33,Algorithms,64.3%,2293,false,Array;Simulation;,false,false,64.28854998789639,66394,103274\r\n2387,\"Partition Array Such That Maximum Difference Is K\",partition-array-such-that-maximum-difference-is-k,false,Medium,1179,47,Algorithms,81.8%,2294,false,Array;Greedy;Sorting;,true,false,81.80799492141662,170105,207932\r\n2388,\"Replace Elements in an Array\",replace-elements-in-an-array,false,Medium,683,39,Algorithms,59.7%,2295,false,Array;Hash Table;Simulation;,false,false,59.72014366956001,47885,80183\r\n2389,\"Design a Text Editor\",design-a-text-editor,false,Hard,658,229,Algorithms,50.4%,2296,false,Linked List;String;Stack;Design;Simulation;Doubly-Linked List;,false,false,50.40397099938397,42547,84412\r\n2056,\"Jump Game VIII\",jump-game-viii,true,Medium,173,49,Algorithms,45.6%,2297,true,Array;Dynamic Programming;Stack;Graph Theory;Monotonic Stack;Shortest Path;,false,false,45.63739214902006,7987,17501\r\n2440,\"Tasks Count in the Weekend\",tasks-count-in-the-weekend,true,Medium,53,10,Database,81.8%,2298,true,Database;,false,false,81.8045378299638,9266,11327\r\n2391,\"Strong Password Checker II\",strong-password-checker-ii,false,Easy,386,41,Algorithms,55.4%,2299,false,String;,false,false,55.37899525957861,58061,104843\r\n2392,\"Successful Pairs of Spells and Potions\",successful-pairs-of-spells-and-potions,false,Medium,3216,106,Algorithms,49.5%,2300,false,Array;Two Pointers;Binary Search;Sorting;,true,false,49.54637376121177,384410,775859\r\n2853,\"Consecutive Transactions with Increasing Amounts\",consecutive-transactions-with-increasing-amounts,true,Hard,53,6,Database,34.9%,2701,true,Database;,true,false,34.86862442040186,5640,16175\r\n2729,\"Minimum Operations to Make Numbers Non-positive\",minimum-operations-to-make-numbers-non-positive,true,Hard,50,5,Algorithms,44.1%,2702,true,Array;Binary Search;,false,false,44.12918593246462,6299,14274\r\n2820,\"Return Length of Arguments Passed\",return-length-of-arguments-passed,false,Easy,426,177,JavaScript,94.5%,2703,false,,true,false,94.48830294353633,300296,317813\r\n2813,\"To Be Or Not To Be\",to-be-or-not-to-be,false,Easy,936,224,JavaScript,63.3%,2704,false,,true,false,63.315833093238574,356007,562274\r\n2804,\"Compact Object\",compact-object,false,Medium,230,25,JavaScript,68.0%,2705,false,,true,false,68.02474767634145,47718,70148\r\n2756,\"Buy Two Chocolates\",buy-two-chocolates,false,Easy,1071,72,Algorithms,68.4%,2706,false,Array;Greedy;Sorting;,true,false,68.352696804341,224094,327850\r\n2755,\"Extra Characters in a String\",extra-characters-in-a-string,false,Medium,2637,138,Algorithms,57.3%,2707,false,Array;Hash Table;String;Dynamic Programming;Trie;,true,false,57.33275342615689,199049,347182\r\n2754,\"Maximum Strength of a Group\",maximum-strength-of-a-group,false,Medium,387,68,Algorithms,25.7%,2708,false,Array;Dynamic Programming;Backtracking;Greedy;Bit Manipulation;Sorting;Enumeration;,false,false,25.674321670474132,38436,149706\r\n2827,\"Greatest Common Divisor Traversal\",greatest-common-divisor-traversal,false,Hard,864,144,Algorithms,41.8%,2709,false,Array;Math;Union-Find;Number Theory;,true,false,41.77503905760929,76742,183703\r\n2819,\"Remove Trailing Zeros From a String\",remove-trailing-zeros-from-a-string,false,Easy,342,13,Algorithms,79.5%,2710,false,String;,false,false,79.51029317426331,95437,120031\r\n2801,\"Difference of Number of Distinct Values on Diagonals\",difference-of-number-of-distinct-values-on-diagonals,false,Medium,143,211,Algorithms,68.3%,2711,false,Array;Hash Table;Matrix;,false,false,68.34151304764184,22837,33416\r\n2817,\"Minimum Cost to Make All Characters Equal\",minimum-cost-to-make-all-characters-equal,false,Medium,583,27,Algorithms,54.3%,2712,false,String;Dynamic Programming;Greedy;,false,false,54.32699150733027,22901,42154\r\n2818,\"Maximum Strictly Increasing Cells in a Matrix\",maximum-strictly-increasing-cells-in-a-matrix,false,Hard,630,22,Algorithms,31.4%,2713,false,Array;Hash Table;Binary Search;Dynamic Programming;Memoization;Sorting;Matrix;Ordered Set;,false,false,31.364481019378815,16541,52738\r\n2865,\"Find Shortest Path with K Hops\",find-shortest-path-with-k-hops,true,Hard,40,1,Algorithms,69.0%,2714,true,Graph Theory;Heap (Priority Queue);Shortest Path;,false,false,68.98843930635839,2387,3460\r\n2821,\"Timeout Cancellation\",timeout-cancellation,false,Easy,322,375,JavaScript,89.5%,2715,false,,true,false,89.5228397879288,101988,113924\r\n2825,\"Minimize String Length\",minimize-string-length,false,Easy,378,109,Algorithms,79.1%,2716,false,Hash Table;String;,false,false,79.10052125060581,79973,101103\r\n2785,\"Semi-Ordered Permutation\",semi-ordered-permutation,false,Easy,229,21,Algorithms,64.2%,2717,false,Array;Simulation;,false,false,64.2043261566344,38260,59591\r\n2838,\"Sum of Matrix After Queries\",sum-of-matrix-after-queries,false,Medium,733,28,Algorithms,32.1%,2718,false,Array;Hash Table;,false,false,32.0771141094242,25058,78118\r\n2757,\"Count of Integers\",count-of-integers,false,Hard,576,12,Algorithms,38.4%,2719,false,Math;String;Dynamic Programming;,false,false,38.44006882049321,20108,52310\r\n2874,\"Popularity Percentage\",popularity-percentage,true,Hard,14,9,Database,53.3%,2720,true,Database;,true,false,53.333333333333336,3984,7470\r\n2807,\"Execute Asynchronous Functions in Parallel\",execute-asynchronous-functions-in-parallel,false,Medium,260,49,JavaScript,78.5%,2721,false,,true,false,78.4625032066813,55054,70166\r\n2858,\"Join Two Arrays by ID\",join-two-arrays-by-id,false,Medium,243,65,JavaScript,57.4%,2722,false,,true,false,57.358848261881526,61117,106552\r\n2859,\"Add Two Promises\",add-two-promises,false,Easy,364,33,JavaScript,91.7%,2723,false,,true,false,91.66414050047426,187474,204523\r\n2860,\"Sort By\",sort-by,false,Easy,233,49,JavaScript,83.1%,2724,false,,true,false,83.0646562739586,81256,97823\r\n2862,\"Interval Cancellation\",interval-cancellation,false,Easy,217,99,JavaScript,84.8%,2725,false,,true,false,84.8233746145579,84451,99561\r\n2863,\"Calculator with Method Chaining\",calculator-with-method-chaining,false,Easy,153,22,JavaScript,77.5%,2726,false,,true,false,77.53352689064013,56079,72329\r\n2864,\"Is Object Empty\",is-object-empty,false,Easy,225,16,JavaScript,81.9%,2727,false,,true,false,81.90576115986265,120217,146775\r\n2875,\"Count Houses in a Circular Street\",count-houses-in-a-circular-street,true,Easy,60,12,Algorithms,86.2%,2728,true,Array;Interactive;,false,false,86.22395833333333,3311,3840\r\n2824,\"Check if The Number is Fascinating\",check-if-the-number-is-fascinating,false,Easy,263,14,Algorithms,53.0%,2729,false,Hash Table;Math;,false,false,53.00337725753077,62306,117550\r\n2786,\"Find the Longest Semi-Repetitive Substring\",find-the-longest-semi-repetitive-substring,false,Medium,318,89,Algorithms,38.8%,2730,false,String;Sliding Window;,false,false,38.83872776330698,33251,85613\r\n2787,\"Movement of Robots\",movement-of-robots,false,Medium,546,103,Algorithms,27.9%,2731,false,Array;Brainteaser;Sorting;Prefix Sum;,false,false,27.949965462353966,18613,66594\r\n2826,\"Find a Good Subset of the Matrix\",find-a-good-subset-of-the-matrix,false,Hard,213,30,Algorithms,46.7%,2732,false,Array;Hash Table;Bit Manipulation;Matrix;,false,false,46.74808133998095,8345,17851\r\n2836,\"Neither Minimum nor Maximum\",neither-minimum-nor-maximum,false,Easy,406,20,Algorithms,76.4%,2733,false,Array;Sorting;,false,false,76.37423049231748,136841,179172\r\n2828,\"Lexicographically Smallest String After Substring Operation\",lexicographically-smallest-string-after-substring-operation,false,Medium,281,195,Algorithms,34.8%,2734,false,String;Greedy;,false,false,34.83773847089135,36102,103629\r\n2810,\"Collecting Chocolates\",collecting-chocolates,false,Medium,314,556,Algorithms,34.9%,2735,false,Array;Enumeration;,false,false,34.89837862525691,15282,43790\r\n2839,\"Maximum Sum Queries\",maximum-sum-queries,false,Hard,354,17,Algorithms,30.2%,2736,false,Array;Binary Search;Stack;Binary Indexed Tree;Segment Tree;Sorting;Monotonic Stack;,false,false,30.19740675990676,8291,27456\r\n2880,\"Find the Closest Marked Node\",find-the-closest-marked-node,true,Medium,58,6,Algorithms,65.5%,2737,true,Array;Graph Theory;Heap (Priority Queue);Shortest Path;,true,false,65.4553492484527,7403,11310\r\n2885,\"Count Occurrences in Text\",count-occurrences-in-text,true,Medium,29,48,Database,54.5%,2738,true,Database;,true,false,54.505087881591116,11784,21620\r\n2857,\"Total Distance Traveled\",total-distance-traveled,false,Easy,329,107,Algorithms,41.4%,2739,false,Math;Simulation;,false,false,41.358206320249515,63252,152937\r\n2845,\"Find the Value of the Partition\",find-the-value-of-the-partition,false,Medium,325,26,Algorithms,64.8%,2740,false,Array;Sorting;,false,false,64.8446481157777,41177,63501\r\n2848,\"Special Permutations\",special-permutations,false,Medium,592,66,Algorithms,29.5%,2741,false,Array;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,29.479692282240055,17819,60445\r\n2808,\"Painting the Walls\",painting-the-walls,false,Hard,1502,95,Algorithms,49.0%,2742,false,Array;Dynamic Programming;,true,false,49.000403014056644,80246,163766\r\n2890,\"Count Substrings Without Repeating Character\",count-substrings-without-repeating-character,true,Medium,98,2,Algorithms,76.0%,2743,true,Hash Table;String;Sliding Window;,true,false,75.97254004576659,9296,12236\r\n2847,\"Find Maximum Number of String Pairs\",find-maximum-number-of-string-pairs,false,Easy,473,19,Algorithms,82.4%,2744,false,Array;Hash Table;String;Simulation;,false,false,82.40290314104521,116034,140813\r\n2850,\"Construct the Longest New String\",construct-the-longest-new-string,false,Medium,341,29,Algorithms,54.7%,2745,false,Math;Dynamic Programming;Greedy;Brainteaser;,false,false,54.731202509727225,26867,49089\r\n2854,\"Decremental String Concatenation\",decremental-string-concatenation,false,Medium,377,33,Algorithms,27.7%,2746,false,Array;String;Dynamic Programming;,false,false,27.650475837350143,11186,40455\r\n2833,\"Count Zero Request Servers\",count-zero-request-servers,false,Medium,406,58,Algorithms,35.8%,2747,false,Array;Hash Table;Sliding Window;Sorting;,false,false,35.762328709776455,12814,35831\r\n2831,\"Number of Beautiful Pairs\",number-of-beautiful-pairs,false,Easy,241,43,Algorithms,52.3%,2748,false,Array;Hash Table;Math;Counting;Number Theory;,false,false,52.280309015889735,47642,91128\r\n2837,\"Minimum Operations to Make the Integer Zero\",minimum-operations-to-make-the-integer-zero,false,Medium,769,376,Algorithms,58.2%,2749,false,Bit Manipulation;Brainteaser;Enumeration;,true,false,58.183682402249715,97036,166776\r\n2867,\"Ways to Split Array Into Good Subarrays\",ways-to-split-array-into-good-subarrays,false,Medium,474,14,Algorithms,35.0%,2750,false,Array;Math;Dynamic Programming;,false,false,34.97672450275074,28101,80342\r\n2846,\"Robot Collisions\",robot-collisions,false,Hard,1515,114,Algorithms,61.6%,2751,false,Array;Stack;Sorting;Simulation;,true,false,61.59071865936191,191116,310300\r\n2852,\"Customers with Maximum Number of Transactions on Consecutive Days\",customers-with-maximum-number-of-transactions-on-consecutive-days,true,Hard,16,35,Database,42.4%,2752,true,Database;,false,false,42.395336512983576,3200,7548\r\n2897,\"Count Houses in a Circular Street II\",count-houses-in-a-circular-street-ii,true,Hard,27,3,Algorithms,61.8%,2753,true,,true,false,61.799217731421116,948,1534\r\n2770,\"Bind Function to Context\",bind-function-to-context,true,Medium,17,0,JavaScript,87.2%,2754,true,,true,false,87.20565149136577,1111,1274\r\n2795,\"Deep Merge of Two Objects\",deep-merge-of-two-objects,true,Medium,15,4,JavaScript,64.8%,2755,true,,true,false,64.82130343377716,925,1427\r\n2806,\"Query Batching\",query-batching,true,Hard,15,5,JavaScript,68.0%,2756,true,,true,false,68.04511278195488,543,798\r\n2814,\"Generate Circular Array Values\",generate-circular-array-values,true,Medium,11,2,JavaScript,75.5%,2757,true,,true,false,75.50585729499467,709,939\r\n2822,\"Next Day\",next-day,true,Easy,13,1,JavaScript,85.9%,2758,true,,true,false,85.93500266382526,1613,1877\r\n2851,\"Convert JSON String to Object\",convert-json-string-to-object,true,Hard,17,3,JavaScript,61.7%,2759,true,,true,false,61.730013106159895,942,1526\r\n2866,\"Longest Even Odd Subarray With Threshold\",longest-even-odd-subarray-with-threshold,false,Easy,360,290,Algorithms,31.9%,2760,false,Array;Sliding Window;,false,false,31.943098872929244,53084,166183\r\n2873,\"Prime Pairs With Target Sum\",prime-pairs-with-target-sum,false,Medium,410,34,Algorithms,37.4%,2761,false,Array;Math;Enumeration;Number Theory;,false,false,37.35777438318752,40352,108015\r\n2868,\"Continuous Subarrays\",continuous-subarrays,false,Medium,1504,97,Algorithms,57.9%,2762,false,Array;Queue;Sliding Window;Heap (Priority Queue);Ordered Set;Monotonic Queue;,true,false,57.94723232166119,119216,205732\r\n2849,\"Sum of Imbalance Numbers of All Subarrays\",sum-of-imbalance-numbers-of-all-subarrays,false,Hard,325,9,Algorithms,43.2%,2763,false,Array;Hash Table;Enumeration;,false,false,43.20776255707763,9841,22776\r\n2918,\"Is Array a Preorder of Some ‌Binary Tree\",is-array-a-preorder-of-some-binary-tree,true,Medium,36,5,Algorithms,68.0%,2764,true,Stack;Tree;Depth-First Search;Binary Tree;,false,false,68.02486187845304,1970,2896\r\n2870,\"Longest Alternating Subarray\",longest-alternating-subarray,false,Easy,247,188,Algorithms,35.2%,2765,false,Array;Enumeration;,false,false,35.22615587294285,33691,95642\r\n2834,\"Relocate Marbles\",relocate-marbles,false,Medium,212,19,Algorithms,51.4%,2766,false,Array;Hash Table;Sorting;Simulation;,false,false,51.442453077434834,25517,49603\r\n2883,\"Partition String Into Minimum Beautiful Substrings\",partition-string-into-minimum-beautiful-substrings,false,Medium,383,19,Algorithms,54.0%,2767,false,Hash Table;String;Dynamic Programming;Backtracking;,false,false,53.999370749534116,22312,41319\r\n2889,\"Number of Black Blocks\",number-of-black-blocks,false,Medium,286,51,Algorithms,41.7%,2768,false,Array;Hash Table;Enumeration;,false,false,41.71494341070401,21746,52130\r\n2812,\"Find the Maximum Achievable Number\",find-the-maximum-achievable-number,false,Easy,525,777,Algorithms,91.3%,2769,false,Math;,false,false,91.25133094462828,206539,226341\r\n2855,\"Maximum Number of Jumps to Reach the Last Index\",maximum-number-of-jumps-to-reach-the-last-index,false,Medium,477,14,Algorithms,32.7%,2770,false,Array;Dynamic Programming;,false,false,32.68790164850517,35097,107370\r\n2869,\"Longest Non-decreasing Subarray From Two Arrays\",longest-non-decreasing-subarray-from-two-arrays,false,Medium,652,24,Algorithms,31.1%,2771,false,Array;Dynamic Programming;,false,false,31.106434462545156,36509,117368\r\n2878,\"Apply Operations to Make All Array Elements Equal to Zero\",apply-operations-to-make-all-array-elements-equal-to-zero,false,Medium,451,32,Algorithms,33.4%,2772,false,Array;Prefix Sum;,false,false,33.36906557168553,18366,55039\r\n2944,\"Height of Special Binary Tree\",height-of-special-binary-tree,true,Medium,18,43,Algorithms,74.6%,2773,true,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,false,false,74.56410256410257,1454,1950\r\n2768,\"Array Upper Bound\",array-upper-bound,true,Easy,23,2,JavaScript,82.4%,2774,true,,true,false,82.35711750088747,2320,2817\r\n2781,\"Undefined to Null\",undefined-to-null,true,Medium,15,1,JavaScript,72.3%,2775,true,,true,false,72.30113636363636,1018,1408\r\n2782,\"Convert Callback Based Function to Promise Based Function\",convert-callback-based-function-to-promise-based-function,true,Medium,19,12,JavaScript,90.8%,2776,true,,true,false,90.80622347949081,1284,1414\r\n2799,\"Date Range Generator\",date-range-generator,true,Medium,11,2,JavaScript,82.9%,2777,true,,true,false,82.87671232876713,726,876\r\n2844,\"Sum of Squares of Special Elements \",sum-of-squares-of-special-elements,false,Easy,321,140,Algorithms,82.1%,2778,false,Array;Enumeration;,false,false,82.0640684257242,101702,123930\r\n2891,\"Maximum Beauty of an Array After Applying Operation\",maximum-beauty-of-an-array-after-applying-operation,false,Medium,1274,48,Algorithms,58.4%,2779,false,Array;Binary Search;Sliding Window;Sorting;,true,false,58.37760153766802,132421,226835\r\n2888,\"Minimum Index of a Valid Split\",minimum-index-of-a-valid-split,false,Medium,820,47,Algorithms,75.5%,2780,false,Array;Hash Table;Sorting;,true,false,75.49517984445885,149106,197504\r\n2884,\"Length of the Longest Valid Substring\",length-of-the-longest-valid-substring,false,Hard,618,32,Algorithms,38.4%,2781,false,Array;Hash Table;String;Sliding Window;,false,false,38.423071991478196,38956,101387\r\n2995,\"Number of Unique Categories\",number-of-unique-categories,true,Medium,35,4,Algorithms,83.9%,2782,true,Union-Find;Interactive;Counting;,true,false,83.85565052231719,3532,4212\r\n3002,\"Flight Occupancy and Waitlist Analysis\",flight-occupancy-and-waitlist-analysis,true,Medium,21,8,Database,38.8%,2783,true,Database;,true,false,38.807240099009896,5017,12928\r\n2892,\"Check if Array is Good\",check-if-array-is-good,false,Easy,316,54,Algorithms,48.8%,2784,false,Array;Hash Table;Sorting;,false,false,48.80723698905517,65553,134310\r\n2887,\"Sort Vowels in a String\",sort-vowels-in-a-string,false,Medium,1431,73,Algorithms,83.4%,2785,false,String;Sorting;,true,false,83.42311683144895,310339,372006\r\n2893,\"Visit Array Positions to Maximize Score\",visit-array-positions-to-maximize-score,false,Medium,538,34,Algorithms,37.6%,2786,false,Array;Dynamic Programming;,false,false,37.56631943925513,25136,66911\r\n2882,\"Ways to Express an Integer as Sum of Powers\",ways-to-express-an-integer-as-sum-of-powers,false,Medium,845,41,Algorithms,49.8%,2787,false,Dynamic Programming;,true,false,49.828142683489126,118875,238570\r\n2881,\"Split Strings by Separator\",split-strings-by-separator,false,Easy,348,13,Algorithms,76.1%,2788,false,Array;String;,false,false,76.09839301628065,79414,104357\r\n2872,\"Largest Element in an Array after Merge Operations\",largest-element-in-an-array-after-merge-operations,false,Medium,501,33,Algorithms,47.8%,2789,false,Array;Greedy;,false,false,47.79873414503953,37608,78681\r\n2919,\"Maximum Number of Groups With Increasing Length\",maximum-number-of-groups-with-increasing-length,false,Hard,422,44,Algorithms,23.0%,2790,false,Array;Math;Binary Search;Greedy;Sorting;,false,false,23.036973748136237,13751,59691\r\n2905,\"Count Paths That Can Form a Palindrome in a Tree\",count-paths-that-can-form-a-palindrome-in-a-tree,false,Hard,456,19,Algorithms,51.6%,2791,false,Hash Table;Bit Manipulation;Tree;Depth-First Search;,false,false,51.60296846011132,13906,26948\r\n3016,\"Count Nodes That Are Great Enough\",count-nodes-that-are-great-enough,true,Hard,24,0,Algorithms,56.9%,2792,true,Divide and Conquer;Tree;Depth-First Search;Binary Tree;,false,false,56.858054226475275,1426,2508\r\n3003,\"Status of Flight Tickets\",status-of-flight-tickets,true,Hard,13,21,Database,79.0%,2793,true,,false,false,79.00626678603402,3530,4468\r\n2861,\"Create Object from Two Arrays\",create-object-from-two-arrays,true,Easy,11,3,JavaScript,64.5%,2794,true,,true,false,64.53130655085052,1783,2763\r\n2898,\"Parallel Execution of Promises for Individual Results Retrieval\",parallel-execution-of-promises-for-individual-results-retrieval,true,Medium,16,5,JavaScript,87.5%,2795,true,,true,false,87.49003984063745,1098,1255\r\n2899,\"Repeat String\",repeat-string,true,Easy,26,2,JavaScript,93.1%,2796,true,,true,false,93.07858687815428,3873,4161\r\n2900,\"Partial Function with Placeholders\",partial-function-with-placeholders,true,Easy,11,4,JavaScript,89.3%,2797,true,,false,false,89.33804951995957,1768,1979\r\n2876,\"Number of Employees Who Met the Target\",number-of-employees-who-met-the-target,false,Easy,612,77,Algorithms,87.8%,2798,false,Array;,false,false,87.83534247857372,244016,277811\r\n2856,\"Count Complete Subarrays in an Array\",count-complete-subarrays-in-an-array,false,Medium,1140,28,Algorithms,76.0%,2799,false,Array;Hash Table;Sliding Window;,true,false,75.9547784329274,171455,225733\r\n2877,\"Shortest String That Contains Three Strings\",shortest-string-that-contains-three-strings,false,Medium,373,296,Algorithms,31.6%,2800,false,String;Greedy;Enumeration;,false,false,31.634426415891113,19477,61569\r\n3374,\"Count Alternating Subarrays\",count-alternating-subarrays,false,Medium,242,10,Algorithms,57.4%,3101,false,Array;Math;,false,false,57.387377130061864,45363,79047\r\n3344,\"Minimize Manhattan Distances\",minimize-manhattan-distances,false,Hard,187,15,Algorithms,32.9%,3102,false,Array;Math;Geometry;Sorting;Ordered Set;,false,false,32.85329084446623,10722,32636\r\n3409,\"Find Trending Hashtags II \",find-trending-hashtags-ii,true,Hard,11,2,Database,66.6%,3103,true,Database;,false,false,66.63914120561519,1614,2422\r\n3410,\"Find Longest Self-Contained Substring\",find-longest-self-contained-substring,true,Hard,19,6,Algorithms,58.8%,3104,true,Hash Table;String;Sorting;,false,false,58.80864317695153,3021,5137\r\n3372,\"Longest Strictly Increasing or Strictly Decreasing Subarray\",longest-strictly-increasing-or-strictly-decreasing-subarray,false,Easy,665,34,Algorithms,64.9%,3105,false,Array;,true,false,64.9238599808535,218374,336354\r\n3346,\"Lexicographically Smallest String After Operations With Constraint\",lexicographically-smallest-string-after-operations-with-constraint,false,Medium,165,28,Algorithms,62.9%,3106,false,String;Greedy;,false,false,62.86686789544667,29367,46713\r\n3387,\"Minimum Operations to Make Median of Array Equal to K\",minimum-operations-to-make-median-of-array-equal-to-k,false,Medium,166,187,Algorithms,47.8%,3107,false,Array;Greedy;Sorting;,false,false,47.81569492204969,31008,64849\r\n3348,\"Minimum Cost Walk in Weighted Graph\",minimum-cost-walk-in-weighted-graph,false,Hard,789,43,Algorithms,68.2%,3108,false,Array;Bit Manipulation;Union-Find;Graph Theory;,true,false,68.23176119555892,106561,156175\r\n3417,\"Find the Index of Permutation\",find-the-index-of-permutation,true,Medium,16,5,Algorithms,36.5%,3109,true,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,false,false,36.46616541353384,873,2394\r\n3379,\"Score of a String\",score-of-a-string,false,Easy,858,52,Algorithms,91.3%,3110,false,String;,true,false,91.3378645682489,444670,486841\r\n3390,\"Minimum Rectangles to Cover Points\",minimum-rectangles-to-cover-points,false,Medium,111,8,Algorithms,63.7%,3111,false,Array;Greedy;Sorting;,false,false,63.689635832672565,32932,51707\r\n3389,\"Minimum Time to Visit Disappearing Nodes\",minimum-time-to-visit-disappearing-nodes,false,Medium,220,25,Algorithms,37.7%,3112,false,Array;Graph Theory;Heap (Priority Queue);Shortest Path;,false,false,37.653447602107505,27943,74211\r\n3382,\"Find the Number of Subarrays Where Boundary Elements Are Maximum\",find-the-number-of-subarrays-where-boundary-elements-are-maximum,false,Hard,263,6,Algorithms,33.1%,3113,false,Array;Binary Search;Stack;Monotonic Stack;,false,false,33.111141035999644,14753,44556\r\n3361,\"Latest Time You Can Obtain After Replacing Characters\",latest-time-you-can-obtain-after-replacing-characters,false,Easy,120,50,Algorithms,35.2%,3114,false,String;Enumeration;,false,false,35.20998536568764,41383,117532\r\n3373,\"Maximum Prime Difference\",maximum-prime-difference,false,Medium,128,16,Algorithms,58.8%,3115,false,Array;Math;Number Theory;,false,false,58.81872461834037,51127,86923\r\n3375,\"Kth Smallest Amount With Single Denomination Combination\",kth-smallest-amount-with-single-denomination-combination,false,Hard,254,19,Algorithms,20.1%,3116,false,Array;Math;Binary Search;Bit Manipulation;Combinatorics;Number Theory;,false,false,20.107622096587427,11808,58724\r\n3364,\"Minimum Sum of Values by Dividing Array\",minimum-sum-of-values-by-dividing-array,false,Hard,145,4,Algorithms,27.9%,3117,false,Array;Binary Search;Dynamic Programming;Bit Manipulation;Segment Tree;Queue;,false,false,27.93653299652668,7078,25336\r\n3424,\"Friday Purchase III \",friday-purchase-iii,true,Medium,6,7,Database,55.2%,3118,true,Database;,false,false,55.21472392638037,2430,4401\r\n3425,\"Maximum Number of Potholes That Can Be Fixed\",maximum-number-of-potholes-that-can-be-fixed,true,Medium,21,3,Algorithms,53.4%,3119,true,String;Greedy;Sorting;,false,false,53.41281278658456,4077,7633\r\n3408,\"Count the Number of Special Characters I\",count-the-number-of-special-characters-i,false,Easy,177,5,Algorithms,66.9%,3120,false,Hash Table;String;,false,false,66.92163949238162,65179,97396\r\n3405,\"Count the Number of Special Characters II\",count-the-number-of-special-characters-ii,false,Medium,183,16,Algorithms,43.5%,3121,false,Hash Table;String;,false,false,43.45409138880471,41586,95701\r\n3404,\"Minimum Number of Operations to Satisfy Conditions\",minimum-number-of-operations-to-satisfy-conditions,false,Medium,286,13,Algorithms,41.8%,3122,false,Array;Dynamic Programming;Matrix;,false,false,41.83255651870889,19207,45914\r\n3386,\"Find Edges in Shortest Paths\",find-edges-in-shortest-paths,false,Hard,318,5,Algorithms,46.5%,3123,false,Depth-First Search;Breadth-First Search;Graph Theory;Heap (Priority Queue);Shortest Path;,false,false,46.47018013923112,19425,41801\r\n3432,\"Find Longest Calls\",find-longest-calls,true,Medium,7,5,Database,63.8%,3124,true,Database;,false,false,63.77754459601259,3039,4765\r\n3433,\"Maximum Number That Makes Result of Bitwise AND Zero\",maximum-number-that-makes-result-of-bitwise-and-zero,true,Medium,12,2,Algorithms,70.0%,3125,true,String;Greedy;Sorting;,false,false,69.95305164319248,1341,1917\r\n3440,\"Server Utilization Time\",server-utilization-time,true,Medium,10,16,Database,60.6%,3126,true,Database;,false,false,60.61899679829242,2840,4685\r\n3398,\"Make a Square with the Same Color\",make-a-square-with-the-same-color,false,Easy,94,12,Algorithms,53.1%,3127,false,Array;Matrix;Enumeration;,false,false,53.07292071134581,34171,64385\r\n3388,\"Right Triangles\",right-triangles,false,Medium,136,24,Algorithms,48.6%,3128,false,Array;Hash Table;Math;Combinatorics;Counting;,false,false,48.583820325385354,23860,49111\r\n3406,\"Find All Possible Stable Binary Arrays I\",find-all-possible-stable-binary-arrays-i,false,Medium,497,187,Algorithms,53.7%,3129,false,Dynamic Programming;Prefix Sum;,true,false,53.70880690837514,84586,157490\r\n3407,\"Find All Possible Stable Binary Arrays II\",find-all-possible-stable-binary-arrays-ii,false,Hard,264,30,Algorithms,59.0%,3130,false,Dynamic Programming;Prefix Sum;,true,false,58.97686370796702,67016,113631\r\n3397,\"Find the Integer Added to Array I\",find-the-integer-added-to-array-i,false,Easy,173,12,Algorithms,82.9%,3131,false,Array;,false,false,82.88440849503925,83206,100388\r\n3399,\"Find the Integer Added to Array II\",find-the-integer-added-to-array-ii,false,Medium,179,44,Algorithms,32.9%,3132,false,Array;Two Pointers;Sorting;Enumeration;,false,false,32.90397832739678,26235,79732\r\n3394,\"Minimum Array End\",minimum-array-end,false,Medium,816,99,Algorithms,55.4%,3133,false,Bit Manipulation;,true,false,55.441585710123675,110372,199078\r\n3362,\"Find the Median of the Uniqueness Array\",find-the-median-of-the-uniqueness-array,false,Hard,178,13,Algorithms,30.1%,3134,false,Array;Hash Table;Binary Search;Sliding Window;,false,false,30.070917218431752,8947,29753\r\n3441,\"Equalize Strings by Adding or Removing Characters at Ends\",equalize-strings-by-adding-or-removing-characters-at-ends,true,Medium,16,2,Algorithms,56.1%,3135,true,String;Binary Search;Dynamic Programming;Sliding Window;Hash Function;,false,false,56.078734079505985,1453,2591\r\n3396,\"Valid Word\",valid-word,false,Easy,483,170,Algorithms,50.9%,3136,false,String;,true,false,50.87086734968073,208246,409362\r\n3384,\"Minimum Number of Operations to Make Word K-Periodic\",minimum-number-of-operations-to-make-word-k-periodic,false,Medium,123,13,Algorithms,60.7%,3137,false,Hash Table;String;Counting;,false,false,60.66064781139019,28354,46742\r\n3395,\"Minimum Length of Anagram Concatenation\",minimum-length-of-anagram-concatenation,false,Medium,204,104,Algorithms,39.8%,3138,false,Hash Table;String;Counting;,false,false,39.79331823329558,33732,84768\r\n3402,\"Minimum Cost to Equalize Array\",minimum-cost-to-equalize-array,false,Hard,149,24,Algorithms,18.8%,3139,false,Array;Greedy;Enumeration;,false,false,18.79826325144972,6451,34317\r\n3448,\"Consecutive Available Seats II\",consecutive-available-seats-ii,true,Medium,13,2,Database,55.5%,3140,true,Database;,false,false,55.50635348479014,2883,5194\r\n3449,\"Maximum Hamming Distances\",maximum-hamming-distances,true,Hard,15,2,Algorithms,49.4%,3141,true,Array;Bit Manipulation;Breadth-First Search;,false,false,49.35459377372817,650,1317\r\n3415,\"Check if Grid Satisfies Conditions\",check-if-grid-satisfies-conditions,false,Easy,113,6,Algorithms,45.2%,3142,false,Array;Matrix;,false,false,45.15688274141328,45608,100999\r\n3419,\"Maximum Points Inside the Square\",maximum-points-inside-the-square,false,Medium,175,24,Algorithms,39.3%,3143,false,Array;Hash Table;String;Binary Search;Sorting;,false,false,39.342783505154635,21371,54320\r\n3403,\"Minimum Substring Partition of Equal Character Frequency\",minimum-substring-partition-of-equal-character-frequency,false,Medium,177,36,Algorithms,40.2%,3144,false,Hash Table;String;Dynamic Programming;Counting;,false,false,40.18740810638812,18312,45567\r\n3411,\"Find Products of Elements of Big Array\",find-products-of-elements-of-big-array,false,Hard,62,18,Algorithms,24.6%,3145,false,Array;Binary Search;Bit Manipulation;,false,false,24.61186854756088,3123,12689\r\n3412,\"Permutation Difference between Two Strings\",permutation-difference-between-two-strings,false,Easy,193,17,Algorithms,87.8%,3146,false,Hash Table;String;,false,false,87.77168120633166,111176,126665\r\n3383,\"Taking Maximum Energy From the Mystic Dungeon\",taking-maximum-energy-from-the-mystic-dungeon,false,Medium,592,40,Algorithms,61.0%,3147,false,Array;Dynamic Programming;Prefix Sum;,true,false,61.01834003650056,142764,233969\r\n3391,\"Maximum Difference Score in a Grid\",maximum-difference-score-in-a-grid,false,Medium,287,23,Algorithms,47.9%,3148,false,Array;Dynamic Programming;Matrix;,false,false,47.866393178893176,23803,49728\r\n3431,\"Find the Minimum Cost Array Permutation\",find-the-minimum-cost-array-permutation,false,Hard,151,8,Algorithms,25.6%,3149,false,Array;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,25.561159255576076,7197,28156\r\n3457,\"Invalid Tweets II\",invalid-tweets-ii,true,Easy,18,3,Database,84.9%,3150,true,Database;,false,false,84.86634392759419,4032,4751\r\n3429,\"Special Array I\",special-array-i,false,Easy,582,33,Algorithms,81.6%,3151,false,Array;,true,false,81.61228215560803,261964,320986\r\n3427,\"Special Array II\",special-array-ii,false,Medium,916,67,Algorithms,45.8%,3152,false,Array;Binary Search;Prefix Sum;,true,false,45.77824270552639,138286,302077\r\n3416,\"Sum of Digit Differences of All Pairs\",sum-of-digit-differences-of-all-pairs,false,Medium,226,20,Algorithms,43.0%,3153,false,Array;Hash Table;Math;Counting;,false,false,43.02109679966081,29426,68399\r\n3414,\"Find Number of Ways to Reach the K-th Stair\",find-number-of-ways-to-reach-the-k-th-stair,false,Hard,199,13,Algorithms,37.6%,3154,false,Math;Dynamic Programming;Bit Manipulation;Memoization;Combinatorics;,false,false,37.6090107644417,15827,42083\r\n3458,\"Maximum Number of Upgradable Servers\",maximum-number-of-upgradable-servers,true,Medium,21,2,Algorithms,43.3%,3155,true,Array;Math;Binary Search;,false,false,43.315030008938834,3392,7831\r\n3465,\"Employee Task Duration and Concurrent Tasks\",employee-task-duration-and-concurrent-tasks,true,Hard,12,2,Database,40.2%,3156,true,Database;,false,false,40.154254037117376,1666,4149\r\n3467,\"Find the Level of Tree with Minimum Sum\",find-the-level-of-tree-with-minimum-sum,true,Medium,19,3,Algorithms,69.6%,3157,true,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,false,false,69.632949210414,3263,4686\r\n3428,\"Find the XOR of Numbers Which Appear Twice\",find-the-xor-of-numbers-which-appear-twice,false,Easy,167,14,Algorithms,78.8%,3158,false,Array;Hash Table;Bit Manipulation;,false,false,78.83911646342081,77774,98649\r\n3420,\"Find Occurrences of an Element in an Array\",find-occurrences-of-an-element-in-an-array,false,Medium,185,26,Algorithms,73.3%,3159,false,Array;Hash Table;,false,false,73.29477042241282,59047,80561\r\n3434,\"Find the Number of Distinct Colors Among the Balls\",find-the-number-of-distinct-colors-among-the-balls,false,Medium,768,94,Algorithms,54.1%,3160,false,Array;Hash Table;Simulation;,true,false,54.13858626805168,170948,315759\r\n3435,\"Block Placement Queries\",block-placement-queries,false,Hard,149,32,Algorithms,18.5%,3161,false,Array;Binary Search;Binary Indexed Tree;Segment Tree;,false,false,18.50822330321983,12784,69072\r\n3446,\"Find the Number of Good Pairs I\",find-the-number-of-good-pairs-i,false,Easy,170,16,Algorithms,86.4%,3162,false,Array;Hash Table;,false,false,86.37783051694295,96814,112082\r\n3451,\"String Compression III\",string-compression-iii,false,Medium,634,54,Algorithms,67.0%,3163,false,String;,true,false,67.02978087517687,202749,302476\r\n3444,\"Find the Number of Good Pairs II\",find-the-number-of-good-pairs-ii,false,Medium,257,40,Algorithms,26.7%,3164,false,Array;Hash Table;,false,false,26.657443673865394,29674,111316\r\n3423,\"Maximum Sum of Subsequence With Non-adjacent Elements\",maximum-sum-of-subsequence-with-non-adjacent-elements,false,Hard,158,32,Algorithms,15.9%,3165,false,Array;Divide and Conquer;Dynamic Programming;Segment Tree;,false,false,15.852649006622515,8809,55566\r\n3473,\"Calculate Parking Fees and Duration\",calculate-parking-fees-and-duration,true,Medium,14,4,Database,53.2%,3166,true,Database;,false,false,53.173818469448285,2689,5057\r\n3474,\"Better Compression of String\",better-compression-of-string,true,Medium,19,4,Algorithms,75.4%,3167,true,Hash Table;String;Sorting;Counting;,false,false,75.38204700141262,5870,7787\r\n3426,\"Minimum Number of Chairs in a Waiting Room\",minimum-number-of-chairs-in-a-waiting-room,false,Easy,158,16,Algorithms,79.3%,3168,false,String;Simulation;,false,false,79.27142124166238,71070,89654\r\n3430,\"Count Days Without Meetings\",count-days-without-meetings,false,Medium,786,19,Algorithms,48.1%,3169,false,Array;Sorting;,true,false,48.10943130601053,183168,380732\r\n3445,\"Lexicographically Minimum String After Removing Stars\",lexicographically-minimum-string-after-removing-stars,false,Medium,593,89,Algorithms,51.0%,3170,false,Hash Table;String;Stack;Greedy;Heap (Priority Queue);,true,false,50.95206045477393,119612,234754\r\n3436,\"Find Subarray With Bitwise OR Closest to K\",find-subarray-with-bitwise-or-closest-to-k,false,Hard,210,7,Algorithms,31.0%,3171,false,Array;Binary Search;Bit Manipulation;Segment Tree;,false,false,30.960058557043663,15650,50549\r\n3481,\"Second Day Verification\",second-day-verification,true,Easy,11,1,Database,66.7%,3172,true,Database;,false,false,66.71336018210471,3810,5711\r\n3472,\"Bitwise OR of Adjacent Elements\",bitwise-or-of-adjacent-elements,true,Easy,24,2,Algorithms,94.8%,3173,true,Array;Bit Manipulation;,false,false,94.79136690647482,6588,6950\r\n3447,\"Clear Digits\",clear-digits,false,Easy,704,27,Algorithms,82.7%,3174,false,String;Stack;Simulation;,true,false,82.69206948417731,280381,339066\r\n3413,\"Find The First Player to win K Games in a Row\",find-the-first-player-to-win-k-games-in-a-row,false,Medium,140,16,Algorithms,40.2%,3175,false,Array;Simulation;,false,false,40.162276265447026,36530,90956\r\n3456,\"Find the Maximum Length of a Good Subsequence I\",find-the-maximum-length-of-a-good-subsequence-i,false,Medium,168,98,Algorithms,32.7%,3176,false,Array;Hash Table;Dynamic Programming;,false,false,32.693001693362575,23554,72046\r\n3452,\"Find the Maximum Length of a Good Subsequence II\",find-the-maximum-length-of-a-good-subsequence-ii,false,Hard,142,10,Algorithms,25.2%,3177,false,Array;Hash Table;Dynamic Programming;,false,false,25.160652496292634,9671,38437\r\n3450,\"Find the Child Who Has the Ball After K Seconds\",find-the-child-who-has-the-ball-after-k-seconds,false,Easy,184,11,Algorithms,62.0%,3178,false,Math;Simulation;,false,false,62.01722093966432,59637,96162\r\n3422,\"Find the N-th Value After K Seconds\",find-the-n-th-value-after-k-seconds,false,Medium,124,21,Algorithms,53.8%,3179,false,Array;Math;Simulation;Combinatorics;Prefix Sum;,false,false,53.84168189260375,45381,84286\r\n3442,\"Maximum Total Reward Using Operations I\",maximum-total-reward-using-operations-i,false,Medium,217,18,Algorithms,30.8%,3180,false,Array;Dynamic Programming;,false,false,30.840070088805703,30977,100444\r\n3443,\"Maximum Total Reward Using Operations II\",maximum-total-reward-using-operations-ii,false,Hard,134,32,Algorithms,21.9%,3181,false,Array;Dynamic Programming;Bit Manipulation;,false,false,21.86314175860076,8700,39793\r\n3488,\"Find Top Scoring Students\",find-top-scoring-students,true,Medium,16,3,Database,49.8%,3182,true,Database;,false,false,49.76828864614366,3007,6042\r\n3489,\"The Number of Ways to Make the Sum\",the-number-of-ways-to-make-the-sum,true,Medium,21,1,Algorithms,51.0%,3183,true,Array;Dynamic Programming;,false,false,51.04219623792577,2008,3934\r\n3421,\"Count Pairs That Form a Complete Day I\",count-pairs-that-form-a-complete-day-i,false,Easy,166,12,Algorithms,78.1%,3184,false,Array;Hash Table;Counting;,false,false,78.12320858242569,76316,97687\r\n3418,\"Count Pairs That Form a Complete Day II\",count-pairs-that-form-a-complete-day-ii,false,Medium,197,12,Algorithms,43.7%,3185,false,Array;Hash Table;Counting;,false,false,43.704097062211986,48557,111104\r\n3437,\"Maximum Total Damage With Spell Casting\",maximum-total-damage-with-spell-casting,false,Medium,754,65,Algorithms,45.1%,3186,false,Array;Hash Table;Two Pointers;Binary Search;Dynamic Programming;Sorting;Counting;,true,false,45.07992322336023,114613,254244\r\n3438,\"Peaks in Array\",peaks-in-array,false,Hard,142,10,Algorithms,27.5%,3187,false,Array;Binary Indexed Tree;Segment Tree;,false,false,27.477953334558148,11965,43544\r\n3503,\"Find Top Scoring Students II\",find-top-scoring-students-ii,true,Hard,8,8,Database,40.0%,3188,true,Database;,false,false,40.02055850608189,2336,5837\r\n3504,\"Minimum Moves to Get a Peaceful Board\",minimum-moves-to-get-a-peaceful-board,true,Medium,61,13,Algorithms,75.8%,3189,true,Array;Greedy;Sorting;Counting Sort;,true,false,75.80543272267846,4800,6332\r\n3476,\"Find Minimum Operations to Make All Elements Divisible by Three\",find-minimum-operations-to-make-all-elements-divisible-by-three,false,Easy,523,34,Algorithms,90.8%,3190,false,Array;Math;,true,false,90.84242240231684,272272,299719\r\n3475,\"Minimum Operations to Make Binary Array Elements Equal to One I\",minimum-operations-to-make-binary-array-elements-equal-to-one-i,false,Medium,683,36,Algorithms,80.4%,3191,false,Array;Bit Manipulation;Queue;Sliding Window;Prefix Sum;,true,false,80.40392971562069,211316,262818\r\n3477,\"Minimum Operations to Make Binary Array Elements Equal to One II\",minimum-operations-to-make-binary-array-elements-equal-to-one-ii,false,Medium,158,9,Algorithms,65.1%,3192,false,Array;Dynamic Programming;Greedy;,false,false,65.1153083585516,43680,67081\r\n3460,\"Count the Number of Inversions\",count-the-number-of-inversions,false,Hard,186,37,Algorithms,30.1%,3193,false,Array;Dynamic Programming;,false,false,30.091194323080078,10262,34103\r\n3471,\"Minimum Average of Smallest and Largest Elements\",minimum-average-of-smallest-and-largest-elements,false,Easy,211,18,Algorithms,85.3%,3194,false,Array;Two Pointers;Sorting;,false,false,85.30415734598624,110206,129192\r\n3461,\"Find the Minimum Area to Cover All Ones I\",find-the-minimum-area-to-cover-all-ones-i,false,Medium,495,32,Algorithms,78.1%,3195,false,Array;Matrix;,true,false,78.14323657040252,167114,213856\r\n3464,\"Maximize Total Cost of Alternating Subarrays\",maximize-total-cost-of-alternating-subarrays,false,Medium,196,29,Algorithms,29.6%,3196,false,Array;Dynamic Programming;,false,false,29.63783671490894,25680,86646\r\n3459,\"Find the Minimum Area to Cover All Ones II\",find-the-minimum-area-to-cover-all-ones-ii,false,Hard,403,68,Algorithms,63.5%,3197,false,Array;Matrix;Enumeration;,true,false,63.48715346558807,65061,102479\r\n3505,\"Find Cities in Each State\",find-cities-in-each-state,true,Easy,9,2,Database,79.4%,3198,true,Database;,false,false,79.39009414654113,3879,4886\r\n3506,\"Count Triplets with Even XOR Set Bits I\",count-triplets-with-even-xor-set-bits-i,true,Easy,9,4,Algorithms,83.2%,3199,true,Array;Bit Manipulation;,false,false,83.19327731092437,1881,2261\r\n3469,\"Maximum Height of a Triangle\",maximum-height-of-a-triangle,false,Easy,166,31,Algorithms,44.3%,3200,false,Array;Enumeration;,false,false,44.31716037792381,44373,100126\r\n3942,\"Find Drivers with Improved Fuel Efficiency\",find-drivers-with-improved-fuel-efficiency,false,Medium,42,7,Database,46.4%,3601,false,Database;,false,false,46.36296158842086,9993,21555\r\n3912,\"Hexadecimal and Hexatrigesimal Conversion\",hexadecimal-and-hexatrigesimal-conversion,false,Easy,52,0,Algorithms,80.8%,3602,false,Math;String;,false,false,80.82911125184717,30631,37896\r\n3927,\"Minimum Cost Path with Alternating Directions II\",minimum-cost-path-with-alternating-directions-ii,false,Medium,74,12,Algorithms,44.8%,3603,false,Array;Dynamic Programming;Matrix;,false,false,44.77115767294861,19124,42715\r\n3916,\"Minimum Time to Reach Destination in Directed Graph\",minimum-time-to-reach-destination-in-directed-graph,false,Medium,103,4,Algorithms,45.6%,3604,false,Graph Theory;Heap (Priority Queue);Shortest Path;,false,false,45.588541666666664,17506,38400\r\n3920,\"Minimum Stability Factor of Array\",minimum-stability-factor-of-array,false,Hard,41,2,Algorithms,20.5%,3605,false,Array;Math;Binary Search;Greedy;Segment Tree;Number Theory;,false,false,20.50961153384061,4097,19976\r\n3934,\"Coupon Code Validator\",coupon-code-validator,false,Easy,336,107,Algorithms,64.9%,3606,false,Array;Hash Table;String;Sorting;,true,false,64.93830741657774,125365,193053\r\n3863,\"Power Grid Maintenance\",power-grid-maintenance,false,Medium,539,58,Algorithms,56.2%,3607,false,Array;Hash Table;Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;Heap (Priority Queue);Ordered Set;,true,false,56.18705339136611,93334,166113\r\n3908,\"Minimum Time for K Connected Components\",minimum-time-for-k-connected-components,false,Medium,127,6,Algorithms,45.4%,3608,false,Binary Search;Union-Find;Graph Theory;Sorting;,false,false,45.35935884177869,17545,38680\r\n3922,\"Minimum Moves to Reach Target in Grid\",minimum-moves-to-reach-target-in-grid,false,Hard,57,3,Algorithms,15.0%,3609,false,Math;,false,false,15.026412494258153,5234,34832\r\n3949,\"Minimum Number of Primes to Sum to Target\",minimum-number-of-primes-to-sum-to-target,true,Medium,16,1,Algorithms,59.9%,3610,true,Array;Math;Dynamic Programming;Number Theory;,false,false,59.85324947589099,3426,5724\r\n3943,\"Find Overbooked Employees\",find-overbooked-employees,false,Medium,46,10,Database,44.0%,3611,false,Database;,false,false,44.03396844555565,10215,23198\r\n3931,\"Process String with Special Operations I\",process-string-with-special-operations-i,false,Medium,58,11,Algorithms,65.0%,3612,false,String;Simulation;,false,false,65.01926665861092,48427,74481\r\n3881,\"Minimize Maximum Component Cost\",minimize-maximum-component-cost,false,Medium,122,9,Algorithms,43.5%,3613,false,Binary Search;Union-Find;Graph Theory;Sorting;,false,false,43.48877936052285,24088,55389\r\n3939,\"Process String with Special Operations II\",process-string-with-special-operations-ii,false,Hard,97,8,Algorithms,17.0%,3614,false,String;Simulation;,false,false,17.017654186542323,11095,65197\r\n3930,\"Longest Palindromic Path in Graph\",longest-palindromic-path-in-graph,false,Hard,58,5,Algorithms,22.1%,3615,false,String;Dynamic Programming;Bit Manipulation;Graph Theory;Bitmask;,false,false,22.138831117943152,7345,33177\r\n3960,\"Number of Student Replacements\",number-of-student-replacements,true,Medium,5,3,Algorithms,86.4%,3616,true,Array;Simulation;,false,false,86.40350877192982,985,1140\r\n3961,\"Find Students with Study Spiral Pattern\",find-students-with-study-spiral-pattern,false,Hard,36,12,Database,29.7%,3617,false,,false,false,29.67767608436132,3729,12565\r\n3936,\"Split Array by Prime Indices\",split-array-by-prime-indices,false,Medium,56,3,Algorithms,49.4%,3618,false,Array;Math;Number Theory;,false,false,49.39916716240333,37368,75645\r\n3823,\"Count Islands With Total Value Divisible by K\",count-islands-with-total-value-divisible-by-k,false,Medium,66,1,Algorithms,56.3%,3619,false,Array;Depth-First Search;Breadth-First Search;Union-Find;Matrix;,false,false,56.299961933764756,31059,55167\r\n3919,\"Network Recovery Pathways\",network-recovery-pathways,false,Hard,140,12,Algorithms,29.9%,3620,false,Array;Binary Search;Dynamic Programming;Graph Theory;Topological Sort;Heap (Priority Queue);Shortest Path;,false,false,29.91775325977934,14914,49850\r\n3937,\"Number of Integers With Popcount-Depth Equal to K I\",number-of-integers-with-popcount-depth-equal-to-k-i,false,Hard,53,5,Algorithms,22.5%,3621,false,Math;Dynamic Programming;Bit Manipulation;Combinatorics;,false,false,22.52726044581685,4669,20726\r\n3918,\"Check Divisibility by Digit Sum and Product\",check-divisibility-by-digit-sum-and-product,false,Easy,55,0,Algorithms,69.6%,3622,false,Math;,false,false,69.56587980993554,73056,105017\r\n3886,\"Count Number of Trapezoids I\",count-number-of-trapezoids-i,false,Medium,398,50,Algorithms,48.1%,3623,false,Array;Hash Table;Math;Geometry;,true,false,48.08088235294118,117701,244799\r\n3941,\"Number of Integers With Popcount-Depth Equal to K II\",number-of-integers-with-popcount-depth-equal-to-k-ii,false,Hard,36,9,Algorithms,59.5%,3624,false,Array;Divide and Conquer;Binary Indexed Tree;Segment Tree;,false,false,59.48558706351066,20306,34136\r\n3897,\"Count Number of Trapezoids II\",count-number-of-trapezoids-ii,false,Hard,263,98,Algorithms,40.0%,3625,false,Array;Hash Table;Math;Geometry;,true,false,39.99322019827461,57809,144547\r\n3971,\"Find Stores with Inventory Imbalance\",find-stores-with-inventory-imbalance,false,Medium,47,9,Database,48.0%,3626,false,,false,false,48.01959495788279,8038,16739\r\n3766,\"Maximum Median Sum of Subsequences of Size 3\",maximum-median-sum-of-subsequences-of-size-3,false,Medium,81,3,Algorithms,65.1%,3627,false,Array;Math;Greedy;Sorting;Game Theory;,false,false,65.06796136605969,62855,96599\r\n3948,\"Maximum Number of Subsequences After One Inserting\",maximum-number-of-subsequences-after-one-inserting,false,Medium,136,5,Algorithms,31.9%,3628,false,String;Dynamic Programming;Greedy;Prefix Sum;,false,false,31.857782208238582,30680,96303\r\n3933,\"Minimum Jumps to Reach End via Prime Teleportation\",minimum-jumps-to-reach-end-via-prime-teleportation,false,Medium,133,18,Algorithms,31.8%,3629,false,Array;Hash Table;Math;Breadth-First Search;Number Theory;,false,false,31.82418052764865,26767,84109\r\n3882,\"Partition Array for Maximum XOR and AND\",partition-array-for-maximum-xor-and-and,false,Hard,32,8,Algorithms,17.7%,3630,false,Array;Math;Greedy;Bit Manipulation;Enumeration;,false,false,17.694913636797406,7417,41916\r\n3969,\"Sort Threats by Severity and Exploitability\",sort-threats-by-severity-and-exploitability,true,Medium,5,1,Algorithms,63.9%,3631,true,Array;Sorting;,false,false,63.86740331491713,578,905\r\n3929,\"Subarrays with XOR at Least K\",subarrays-with-xor-at-least-k,true,Hard,4,2,Algorithms,43.0%,3632,true,Array;Bit Manipulation;Trie;Prefix Sum;,false,false,42.99363057324841,270,628\r\n3965,\"Earliest Finish Time for Land and Water Rides I\",earliest-finish-time-for-land-and-water-rides-i,false,Easy,71,18,Algorithms,62.0%,3633,false,Array;Two Pointers;Binary Search;Greedy;Sorting;,false,false,61.97708795269771,33541,54119\r\n3958,\"Minimum Removals to Balance Array\",minimum-removals-to-balance-array,false,Medium,608,28,Algorithms,47.8%,3634,false,Array;Binary Search;Sliding Window;Sorting;,true,false,47.84980134306102,143436,299763\r\n3967,\"Earliest Finish Time for Land and Water Rides II\",earliest-finish-time-for-land-and-water-rides-ii,false,Medium,73,3,Algorithms,35.2%,3635,false,Array;Two Pointers;Binary Search;Greedy;Sorting;,false,false,35.20512544416927,13078,37148\r\n3955,\"Threshold Majority Queries\",threshold-majority-queries,false,Hard,41,10,Algorithms,21.9%,3636,false,Array;Hash Table;Binary Search;Divide and Conquer;Counting;Prefix Sum;,false,false,21.874709112910733,4700,21486\r\n3952,\"Trionic Array I\",trionic-array-i,false,Easy,473,40,Algorithms,49.5%,3637,false,Array;,true,false,49.53415952022618,195174,394019\r\n3954,\"Maximum Balanced Shipments\",maximum-balanced-shipments,false,Medium,82,11,Algorithms,61.4%,3638,false,Array;Dynamic Programming;Stack;Greedy;Monotonic Stack;,false,false,61.39685282032126,52595,85664\r\n3944,\"Minimum Time to Activate String\",minimum-time-to-activate-string,false,Medium,121,6,Algorithms,49.2%,3639,false,Array;Binary Search;,false,false,49.21673217293655,35062,71240\r\n3956,\"Trionic Array II\",trionic-array-ii,false,Hard,383,38,Algorithms,47.3%,3640,false,Array;Dynamic Programming;,true,false,47.31655903904708,84849,179321\r\n3992,\"Longest Semi-Repeating Subarray\",longest-semi-repeating-subarray,true,Medium,6,1,Algorithms,64.4%,3641,true,Array;Hash Table;Sliding Window;,false,false,64.44296197464978,966,1499\r\n3996,\"Find Books with Polarized Opinions\",find-books-with-polarized-opinions,false,Medium,52,12,Database,42.2%,3642,false,,false,false,42.24716202270382,9825,23256\r\n3973,\"Flip Square Submatrix Vertically\",flip-square-submatrix-vertically,false,Easy,286,27,Algorithms,79.4%,3643,false,Array;Two Pointers;Matrix;,true,false,79.36370789810687,154314,194439\r\n3950,\"Maximum K to Sort a Permutation\",maximum-k-to-sort-a-permutation,false,Medium,100,36,Algorithms,37.4%,3644,false,Array;Bit Manipulation;,false,false,37.35597743128187,33038,88441\r\n3959,\"Maximum Total from Optimal Activation Order\",maximum-total-from-optimal-activation-order,false,Medium,80,52,Algorithms,33.2%,3645,false,Array;Two Pointers;Greedy;Sorting;Heap (Priority Queue);,false,false,33.19361538893359,17739,53441\r\n3951,\"Next Special Palindrome Number\",next-special-palindrome-number,false,Hard,65,5,Algorithms,28.0%,3646,false,Backtracking;Bit Manipulation;,false,false,28.013374461371825,11897,42469\r\n3987,\"Maximum Weight in Two Bags\",maximum-weight-in-two-bags,true,Medium,6,3,Algorithms,57.5%,3647,true,Array;Dynamic Programming;,false,false,57.52508361204013,688,1196\r\n3945,\"Minimum Sensors to Cover Grid\",minimum-sensors-to-cover-grid,false,Medium,52,9,Algorithms,68.7%,3648,false,Math;,false,false,68.72749380348876,29392,42766\r\n3963,\"Number of Perfect Pairs\",number-of-perfect-pairs,false,Medium,101,11,Algorithms,33.9%,3649,false,Array;Math;Two Pointers;Sorting;,false,false,33.872005391826484,22113,65284\r\n3887,\"Minimum Cost Path with Edge Reversals\",minimum-cost-path-with-edge-reversals,false,Medium,461,24,Algorithms,61.8%,3650,false,Graph Theory;Heap (Priority Queue);Shortest Path;,true,false,61.83082617000956,103578,167518\r\n3889,\"Minimum Cost Path with Teleportations\",minimum-cost-path-with-teleportations,false,Hard,421,34,Algorithms,45.6%,3651,false,Array;Dynamic Programming;Matrix;,true,false,45.59330140224165,65777,144269\r\n3980,\"Best Time to Buy and Sell Stock using Strategy\",best-time-to-buy-and-sell-stock-using-strategy,false,Medium,360,41,Algorithms,59.8%,3652,false,Array;Sliding Window;Prefix Sum;,true,false,59.78580138910981,112762,188610\r\n3974,\"XOR After Range Multiplication Queries I\",xor-after-range-multiplication-queries-i,false,Medium,238,119,Algorithms,73.3%,3653,false,Array;Divide and Conquer;Simulation;,true,false,73.33461285369599,133733,182360\r\n3966,\"Minimum Sum After Divisible Sum Deletions\",minimum-sum-after-divisible-sum-deletions,false,Medium,152,12,Algorithms,46.5%,3654,false,Array;Hash Table;Dynamic Programming;Prefix Sum;,false,false,46.47399939956073,29412,63287\r\n3975,\"XOR After Range Multiplication Queries II\",xor-after-range-multiplication-queries-ii,false,Hard,255,44,Algorithms,47.8%,3655,false,Array;Divide and Conquer;,true,false,47.76011208152398,68520,143466\r\n4006,\"Determine if a Simple Graph Exists\",determine-if-a-simple-graph-exists,true,Medium,8,7,Algorithms,47.8%,3656,true,Array;Binary Search;Graph Theory;Sorting;Prefix Sum;,false,false,47.82608695652174,396,828\r\n4025,\"Find Loyal Customers\",find-loyal-customers,false,Medium,44,1,Database,60.3%,3657,false,,false,false,60.33025024116212,10632,17623\r\n3995,\"GCD of Odd and Even Sums\",gcd-of-odd-and-even-sums,false,Easy,108,15,Algorithms,84.9%,3658,false,Math;Number Theory;,false,false,84.92796487153433,93611,110224\r\n3979,\"Partition Array Into K-Distinct Groups\",partition-array-into-k-distinct-groups,false,Medium,116,73,Algorithms,47.1%,3659,false,Array;Hash Table;Counting;,false,false,47.11005405405405,54471,115625\r\n3981,\"Jump Game IX\",jump-game-ix,false,Medium,185,14,Algorithms,24.0%,3660,false,Array;Dynamic Programming;,false,false,24.043208574201444,17094,71097\r\n3982,\"Maximum Walls Destroyed by Robots\",maximum-walls-destroyed-by-robots,false,Hard,333,31,Algorithms,47.9%,3661,false,Array;Binary Search;Dynamic Programming;Sorting;,true,false,47.93067338483253,63164,131782\r\n4017,\"Filter Characters by Frequency\",filter-characters-by-frequency,true,Easy,9,0,Algorithms,86.1%,3662,true,Hash Table;String;Counting;,false,false,86.10436893203884,1419,1648\r\n3994,\"Find The Least Frequent Digit\",find-the-least-frequent-digit,false,Easy,51,2,Algorithms,69.8%,3663,false,Array;Hash Table;Math;Counting;,false,false,69.75219824140687,43630,62550\r\n3877,\"Two-Letter Card Game\",two-letter-card-game,false,Medium,126,60,Algorithms,12.6%,3664,false,Array;Hash Table;String;Counting;Enumeration;,false,false,12.588590274366712,10764,85506\r\n3938,\"Twisted Mirror Path Count\",twisted-mirror-path-count,false,Medium,86,5,Algorithms,48.2%,3665,false,Array;Dynamic Programming;Matrix;,false,false,48.195667002306166,14838,30787\r\n3983,\"Minimum Operations to Equalize Binary String\",minimum-operations-to-equalize-binary-string,false,Hard,306,34,Algorithms,45.2%,3666,false,Math;String;Breadth-First Search;Union-Find;Ordered Set;,true,false,45.160477728714106,60954,134972\r\n4029,\"Sort Array By Absolute Value\",sort-array-by-absolute-value,true,Easy,7,0,Algorithms,86.1%,3667,true,Array;Math;Two Pointers;Sorting;,false,false,86.12040133779264,1545,1794\r\n4008,\"Restore Finishing Order\",restore-finishing-order,false,Easy,121,5,Algorithms,91.2%,3668,false,Array;Hash Table;,false,false,91.17527155449662,100642,110383\r\n3947,\"Balanced K-Factor Decomposition\",balanced-k-factor-decomposition,false,Medium,124,12,Algorithms,40.2%,3669,false,Math;Backtracking;Number Theory;,false,false,40.22339868520565,27656,68756\r\n3915,\"Maximum Product of Two Integers With No Common Bits\",maximum-product-of-two-integers-with-no-common-bits,false,Medium,104,19,Algorithms,15.2%,3670,false,Array;Dynamic Programming;Bit Manipulation;,false,false,15.160977145705964,11556,76222\r\n3989,\"Sum of Beautiful Subsequences\",sum-of-beautiful-subsequences,false,Hard,36,5,Algorithms,31.5%,3671,false,Array;Math;Binary Indexed Tree;Number Theory;,false,false,31.50471305794289,9091,28856\r\n4036,\"Sum of Weighted Modes in Subarrays\",sum-of-weighted-modes-in-subarrays,true,Medium,7,1,Algorithms,54.5%,3672,true,Array;Hash Table;Sliding Window;Counting;Ordered Set;,false,false,54.47427293064877,487,894\r\n4043,\"Find Zombie Sessions\",find-zombie-sessions,false,Hard,29,3,Database,48.5%,3673,false,,false,false,48.518284993694834,6156,12688\r\n3998,\"Minimum Operations to Equalize Array\",minimum-operations-to-equalize-array,false,Easy,60,12,Algorithms,60.3%,3674,false,Array;Bit Manipulation;Brainteaser;,false,false,60.309334973746076,54902,91034\r\n3999,\"Minimum Operations to Transform String\",minimum-operations-to-transform-string,false,Medium,74,7,Algorithms,61.9%,3675,false,String;Greedy;,false,false,61.91215347675293,51054,82462\r\n4000,\"Count Bowl Subarrays\",count-bowl-subarrays,false,Medium,188,5,Algorithms,48.2%,3676,false,Array;Stack;Monotonic Stack;,false,false,48.19973635309626,30348,62963\r\n4023,\"Count Binary Palindromic Numbers\",count-binary-palindromic-numbers,false,Hard,82,3,Algorithms,33.8%,3677,false,Math;Bit Manipulation;,false,false,33.788864481243664,15997,47344\r\n4011,\"Smallest Absent Positive Greater Than Average\",smallest-absent-positive-greater-than-average,false,Easy,65,5,Algorithms,34.3%,3678,false,Array;Hash Table;,false,false,34.25627817128139,37240,108710\r\n3953,\" Minimum Discards to Balance Inventory\",minimum-discards-to-balance-inventory,false,Medium,82,18,Algorithms,35.0%,3679,false,Array;Hash Table;Sliding Window;Simulation;Counting;,false,false,34.9710170384683,19909,56930\r\n3991,\"Generate Schedule\",generate-schedule,false,Medium,50,25,Algorithms,24.3%,3680,false,Array;Math;Greedy;,false,false,24.334246858679354,4706,19339\r\n3990,\"Maximum XOR of Subsequences\",maximum-xor-of-subsequences,false,Hard,63,10,Algorithms,51.2%,3681,false,Array;Math;Greedy;Bit Manipulation;,false,false,51.20405576679341,7676,14991\r\n4050,\"Minimum Index Sum of Common Elements\",minimum-index-sum-of-common-elements,true,Medium,6,1,Algorithms,77.5%,3682,true,Array;Hash Table;,false,false,77.49469214437367,730,942\r\n4012,\"Earliest Time to Finish One Task\",earliest-time-to-finish-one-task,false,Easy,48,3,Algorithms,84.5%,3683,false,Array;,false,false,84.53481353484904,71426,84493\r\n3997,\"Maximize Sum of At Most K Distinct Elements\",maximize-sum-of-at-most-k-distinct-elements,false,Easy,55,4,Algorithms,76.9%,3684,false,Array;Hash Table;Greedy;Sorting;,false,false,76.92177936286086,63841,82992\r\n3873,\"Subsequence Sum After Capping Elements\",subsequence-sum-after-capping-elements,false,Medium,164,15,Algorithms,25.3%,3685,false,Array;Two Pointers;Dynamic Programming;Sorting;,false,false,25.321251853975298,20316,80233\r\n4027,\"Number of Stable Subsequences\",number-of-stable-subsequences,false,Hard,87,3,Algorithms,60.2%,3686,false,Array;Dynamic Programming;,false,false,60.230116284775036,24551,40762\r\n4060,\"Library Late Fee Calculator\",library-late-fee-calculator,true,Easy,5,3,Algorithms,94.3%,3687,true,Array;Simulation;,false,false,94.25393883225209,2034,2158\r\n4009,\"Bitwise OR of Even Numbers in an Array\",bitwise-or-of-even-numbers-in-an-array,false,Easy,40,4,Algorithms,85.0%,3688,false,Array;Bit Manipulation;Simulation;,false,false,84.98915805917602,72901,85777\r\n4005,\"Maximum Total Subarray Value I\",maximum-total-subarray-value-i,false,Medium,54,21,Algorithms,64.4%,3689,false,Array;Greedy;,false,false,64.4146844427393,53727,83408\r\n3928,\"Split and Merge Array Transformation\",split-and-merge-array-transformation,false,Medium,99,11,Algorithms,58.7%,3690,false,Array;Hash Table;Breadth-First Search;,false,false,58.74117702052073,25133,42786\r\n4007,\"Maximum Total Subarray Value II\",maximum-total-subarray-value-ii,false,Hard,81,4,Algorithms,22.3%,3691,false,Array;Greedy;Segment Tree;Heap (Priority Queue);,false,false,22.326324986522412,12010,53793\r\n4053,\"Majority Frequency Characters\",majority-frequency-characters,false,Easy,55,15,Algorithms,67.1%,3692,false,Hash Table;String;Counting;,false,false,67.0677155637822,30436,45381\r\n4041,\"Climbing Stairs II\",climbing-stairs-ii,false,Medium,91,11,Algorithms,63.9%,3693,false,Array;Dynamic Programming;,false,false,63.93042286105993,29844,46682\r\n4021,\"Distinct Points Reachable After Substring Removal\",distinct-points-reachable-after-substring-removal,false,Medium,66,1,Algorithms,53.9%,3694,false,Hash Table;String;Sliding Window;Prefix Sum;,false,false,53.890253890253895,16450,30525\r\n4010,\"Maximize Alternating Sum Using Swaps\",maximize-alternating-sum-using-swaps,false,Hard,58,4,Algorithms,64.3%,3695,false,Array;Greedy;Union-Find;Sorting;,false,false,64.26466460847601,9159,14252\r\n4066,\"Maximum Distance Between Unequal Words in Array I\",maximum-distance-between-unequal-words-in-array-i,true,Easy,6,1,Algorithms,82.7%,3696,true,Array;String;,false,false,82.67405063291139,1045,1264\r\n4039,\"Compute Decimal Representation\",compute-decimal-representation,false,Easy,50,2,Algorithms,64.8%,3697,false,Array;Math;,false,false,64.7532058397556,61251,94592\r\n4015,\"Split Array With Minimum Difference\",split-array-with-minimum-difference,false,Medium,103,16,Algorithms,33.6%,3698,false,Array;Prefix Sum;,false,false,33.59981538562975,40768,121334\r\n3962,\"Number of ZigZag Arrays I\",number-of-zigzag-arrays-i,false,Hard,85,7,Algorithms,33.1%,3699,false,Dynamic Programming;Prefix Sum;,false,false,33.05333634552587,16094,48691\r\n3964,\"Number of ZigZag Arrays II\",number-of-zigzag-arrays-ii,false,Hard,28,4,Algorithms,57.6%,3700,false,Math;Dynamic Programming;,false,false,57.56621164391553,14802,25713\r\n"
  },
  {
    "path": "data.json",
    "content": "[{\"questionId\":\"1\",\"title\":\"Two Sum\",\"titleSlug\":\"two-sum\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":68699,\"dislikes\":2569,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.4%\",\"frontendQuestionId\":\"1\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":57.35849959850313,\"totalAccepted\":21447113,\"totalSubmission\":37391339},{\"questionId\":\"2\",\"title\":\"Add Two Numbers\",\"titleSlug\":\"add-two-numbers\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":36765,\"dislikes\":7254,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.3%\",\"frontendQuestionId\":\"2\",\"paidOnly\":false,\"topicTags\":\"Linked List;Math;Recursion;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":48.30425147111061,\"totalAccepted\":6954341,\"totalSubmission\":14396951},{\"questionId\":\"3\",\"title\":\"Longest Substring Without Repeating Characters\",\"titleSlug\":\"longest-substring-without-repeating-characters\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":44998,\"dislikes\":2214,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.9%\",\"frontendQuestionId\":\"3\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":38.87883960705547,\"totalAccepted\":9345737,\"totalSubmission\":24038142},{\"questionId\":\"4\",\"title\":\"Median of Two Sorted Arrays\",\"titleSlug\":\"median-of-two-sorted-arrays\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":32158,\"dislikes\":3583,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.3%\",\"frontendQuestionId\":\"4\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Divide and Conquer;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":46.34493519850407,\"totalAccepted\":4199732,\"totalSubmission\":9061899},{\"questionId\":\"5\",\"title\":\"Longest Palindromic Substring\",\"titleSlug\":\"longest-palindromic-substring\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":32650,\"dislikes\":2013,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.7%\",\"frontendQuestionId\":\"5\",\"paidOnly\":false,\"topicTags\":\"Two Pointers;String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":37.671255671811636,\"totalAccepted\":4686139,\"totalSubmission\":12439567},{\"questionId\":\"6\",\"title\":\"Zigzag Conversion\",\"titleSlug\":\"zigzag-conversion\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":9375,\"dislikes\":15937,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.9%\",\"frontendQuestionId\":\"6\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":53.934881004526204,\"totalAccepted\":2179451,\"totalSubmission\":4040893},{\"questionId\":\"7\",\"title\":\"Reverse Integer\",\"titleSlug\":\"reverse-integer\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":15539,\"dislikes\":14008,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.8%\",\"frontendQuestionId\":\"7\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":31.769460187150607,\"totalAccepted\":4945457,\"totalSubmission\":15566730},{\"questionId\":\"8\",\"title\":\"String to Integer (atoi)\",\"titleSlug\":\"string-to-integer-atoi\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6232,\"dislikes\":15626,\"categoryTitle\":\"Algorithms\",\"acRate\":\"20.9%\",\"frontendQuestionId\":\"8\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":20.862923595277895,\"totalAccepted\":2416993,\"totalSubmission\":11585147},{\"questionId\":\"9\",\"title\":\"Palindrome Number\",\"titleSlug\":\"palindrome-number\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":15971,\"dislikes\":2937,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.5%\",\"frontendQuestionId\":\"9\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":60.46960363329371,\"totalAccepted\":8030806,\"totalSubmission\":13280732},{\"questionId\":\"10\",\"title\":\"Regular Expression Matching\",\"titleSlug\":\"regular-expression-matching\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":13333,\"dislikes\":2404,\"categoryTitle\":\"Algorithms\",\"acRate\":\"30.8%\",\"frontendQuestionId\":\"10\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Recursion;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":30.76961918299262,\"totalAccepted\":1377185,\"totalSubmission\":4475794},{\"questionId\":\"11\",\"title\":\"Container With Most Water\",\"titleSlug\":\"container-with-most-water\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":34282,\"dislikes\":2211,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.9%\",\"frontendQuestionId\":\"11\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":59.867289276961344,\"totalAccepted\":5285810,\"totalSubmission\":8829234},{\"questionId\":\"12\",\"title\":\"Integer to Roman\",\"titleSlug\":\"integer-to-roman\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":8546,\"dislikes\":5722,\"categoryTitle\":\"Algorithms\",\"acRate\":\"70.8%\",\"frontendQuestionId\":\"12\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Math;String;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":70.79756343685051,\"totalAccepted\":2118786,\"totalSubmission\":2992739},{\"questionId\":\"13\",\"title\":\"Roman to Integer\",\"titleSlug\":\"roman-to-integer\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":17740,\"dislikes\":1243,\"categoryTitle\":\"Algorithms\",\"acRate\":\"66.5%\",\"frontendQuestionId\":\"13\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Math;String;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":66.51585561026612,\"totalAccepted\":5822333,\"totalSubmission\":8753307},{\"questionId\":\"14\",\"title\":\"Longest Common Prefix\",\"titleSlug\":\"longest-common-prefix\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":21393,\"dislikes\":4937,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.4%\",\"frontendQuestionId\":\"14\",\"paidOnly\":false,\"topicTags\":\"Array;String;Trie;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":47.41925094440872,\"totalAccepted\":5702274,\"totalSubmission\":12025238},{\"questionId\":\"15\",\"title\":\"3Sum\",\"titleSlug\":\"3sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":35608,\"dislikes\":3285,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.9%\",\"frontendQuestionId\":\"15\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":38.91890593253369,\"totalAccepted\":5880410,\"totalSubmission\":15109392},{\"questionId\":\"16\",\"title\":\"3Sum Closest\",\"titleSlug\":\"3sum-closest\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":11650,\"dislikes\":622,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.4%\",\"frontendQuestionId\":\"16\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":48.389814464470156,\"totalAccepted\":1817290,\"totalSubmission\":3755521},{\"questionId\":\"17\",\"title\":\"Letter Combinations of a Phone Number\",\"titleSlug\":\"letter-combinations-of-a-phone-number\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":20991,\"dislikes\":1135,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.9%\",\"frontendQuestionId\":\"17\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Backtracking;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":65.88631268955211,\"totalAccepted\":2997960,\"totalSubmission\":4550202},{\"questionId\":\"18\",\"title\":\"4Sum\",\"titleSlug\":\"4sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":12881,\"dislikes\":1540,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.4%\",\"frontendQuestionId\":\"18\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":40.43119992500787,\"totalAccepted\":1669168,\"totalSubmission\":4128424},{\"questionId\":\"19\",\"title\":\"Remove Nth Node From End of List\",\"titleSlug\":\"remove-nth-node-from-end-of-list\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":21267,\"dislikes\":908,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.4%\",\"frontendQuestionId\":\"19\",\"paidOnly\":false,\"topicTags\":\"Linked List;Two Pointers;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":51.383731553009284,\"totalAccepted\":4168348,\"totalSubmission\":8112201},{\"questionId\":\"20\",\"title\":\"Valid Parentheses\",\"titleSlug\":\"valid-parentheses\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":27957,\"dislikes\":2009,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.0%\",\"frontendQuestionId\":\"20\",\"paidOnly\":false,\"topicTags\":\"String;Stack;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":44.02938756470642,\"totalAccepted\":7475547,\"totalSubmission\":16978547},{\"questionId\":\"21\",\"title\":\"Merge Two Sorted Lists\",\"titleSlug\":\"merge-two-sorted-lists\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":25001,\"dislikes\":2447,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.2%\",\"frontendQuestionId\":\"21\",\"paidOnly\":false,\"topicTags\":\"Linked List;Recursion;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":68.1707958651683,\"totalAccepted\":6208099,\"totalSubmission\":9106678},{\"questionId\":\"22\",\"title\":\"Generate Parentheses\",\"titleSlug\":\"generate-parentheses\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":23293,\"dislikes\":1085,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.6%\",\"frontendQuestionId\":\"22\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Backtracking;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":78.55013669249351,\"totalAccepted\":2868346,\"totalSubmission\":3651602},{\"questionId\":\"23\",\"title\":\"Merge k Sorted Lists\",\"titleSlug\":\"merge-k-sorted-lists\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":21307,\"dislikes\":794,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.3%\",\"frontendQuestionId\":\"23\",\"paidOnly\":false,\"topicTags\":\"Linked List;Divide and Conquer;Heap (Priority Queue);Merge Sort;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":59.343334472828644,\"totalAccepted\":2964998,\"totalSubmission\":4996353},{\"questionId\":\"24\",\"title\":\"Swap Nodes in Pairs\",\"titleSlug\":\"swap-nodes-in-pairs\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":13176,\"dislikes\":515,\"categoryTitle\":\"Algorithms\",\"acRate\":\"69.3%\",\"frontendQuestionId\":\"24\",\"paidOnly\":false,\"topicTags\":\"Linked List;Recursion;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":69.33657257610587,\"totalAccepted\":1909342,\"totalSubmission\":2753730},{\"questionId\":\"25\",\"title\":\"Reverse Nodes in k-Group\",\"titleSlug\":\"reverse-nodes-in-k-group\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":15674,\"dislikes\":804,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.8%\",\"frontendQuestionId\":\"25\",\"paidOnly\":false,\"topicTags\":\"Linked List;Recursion;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":65.84817341739355,\"totalAccepted\":1524913,\"totalSubmission\":2315801},{\"questionId\":\"26\",\"title\":\"Remove Duplicates from Sorted Array\",\"titleSlug\":\"remove-duplicates-from-sorted-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":19158,\"dislikes\":20539,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.6%\",\"frontendQuestionId\":\"26\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":62.63324780213865,\"totalAccepted\":7765869,\"totalSubmission\":12398958},{\"questionId\":\"27\",\"title\":\"Remove Element\",\"titleSlug\":\"remove-element\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":5144,\"dislikes\":5363,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.7%\",\"frontendQuestionId\":\"27\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":61.664031809622045,\"totalAccepted\":5182244,\"totalSubmission\":8403998},{\"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\":7624,\"dislikes\":584,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.5%\",\"frontendQuestionId\":\"28\",\"paidOnly\":false,\"topicTags\":\"Two Pointers;String;String Matching;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":46.52594109499813,\"totalAccepted\":4030688,\"totalSubmission\":8663322},{\"questionId\":\"29\",\"title\":\"Divide Two Integers\",\"titleSlug\":\"divide-two-integers\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6129,\"dislikes\":15280,\"categoryTitle\":\"Algorithms\",\"acRate\":\"19.6%\",\"frontendQuestionId\":\"29\",\"paidOnly\":false,\"topicTags\":\"Math;Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":19.64619650020539,\"totalAccepted\":1155950,\"totalSubmission\":5883833},{\"questionId\":\"30\",\"title\":\"Substring with Concatenation of All Words\",\"titleSlug\":\"substring-with-concatenation-of-all-words\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2654,\"dislikes\":441,\"categoryTitle\":\"Algorithms\",\"acRate\":\"34.3%\",\"frontendQuestionId\":\"30\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":34.264131020793705,\"totalAccepted\":704819,\"totalSubmission\":2057015},{\"questionId\":\"31\",\"title\":\"Next Permutation\",\"titleSlug\":\"next-permutation\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":21395,\"dislikes\":5116,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.1%\",\"frontendQuestionId\":\"31\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":45.081667876940365,\"totalAccepted\":2245503,\"totalSubmission\":4980966},{\"questionId\":\"32\",\"title\":\"Longest Valid Parentheses\",\"titleSlug\":\"longest-valid-parentheses\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":13327,\"dislikes\":466,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.6%\",\"frontendQuestionId\":\"32\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Stack;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":38.58607442943393,\"totalAccepted\":1096443,\"totalSubmission\":2841557},{\"questionId\":\"33\",\"title\":\"Search in Rotated Sorted Array\",\"titleSlug\":\"search-in-rotated-sorted-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":30047,\"dislikes\":1829,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.4%\",\"frontendQuestionId\":\"33\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":44.39678194887695,\"totalAccepted\":4398740,\"totalSubmission\":9907806},{\"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\":23326,\"dislikes\":650,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.7%\",\"frontendQuestionId\":\"34\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":48.703744316856536,\"totalAccepted\":3284481,\"totalSubmission\":6743815},{\"questionId\":\"35\",\"title\":\"Search Insert Position\",\"titleSlug\":\"search-insert-position\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":18845,\"dislikes\":902,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.1%\",\"frontendQuestionId\":\"35\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":51.07941961700778,\"totalAccepted\":4696614,\"totalSubmission\":9194732},{\"questionId\":\"36\",\"title\":\"Valid Sudoku\",\"titleSlug\":\"valid-sudoku\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":12496,\"dislikes\":1265,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.4%\",\"frontendQuestionId\":\"36\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.39874661957549,\"totalAccepted\":2473218,\"totalSubmission\":3840481},{\"questionId\":\"37\",\"title\":\"Sudoku Solver\",\"titleSlug\":\"sudoku-solver\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":11119,\"dislikes\":346,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.4%\",\"frontendQuestionId\":\"37\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Backtracking;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":65.43889399770454,\"totalAccepted\":1026848,\"totalSubmission\":1569167},{\"questionId\":\"38\",\"title\":\"Count and Say\",\"titleSlug\":\"count-and-say\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":5119,\"dislikes\":9081,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.7%\",\"frontendQuestionId\":\"38\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":62.69199800911582,\"totalAccepted\":1406956,\"totalSubmission\":2244233},{\"questionId\":\"39\",\"title\":\"Combination Sum\",\"titleSlug\":\"combination-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":21004,\"dislikes\":542,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.4%\",\"frontendQuestionId\":\"39\",\"paidOnly\":false,\"topicTags\":\"Array;Backtracking;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":76.40358006659127,\"totalAccepted\":3113408,\"totalSubmission\":4074957},{\"questionId\":\"40\",\"title\":\"Combination Sum II\",\"titleSlug\":\"combination-sum-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":12277,\"dislikes\":389,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.3%\",\"frontendQuestionId\":\"40\",\"paidOnly\":false,\"topicTags\":\"Array;Backtracking;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.30248539846807,\"totalAccepted\":1691356,\"totalSubmission\":2852088},{\"questionId\":\"41\",\"title\":\"First Missing Positive\",\"titleSlug\":\"first-missing-positive\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":18415,\"dislikes\":1983,\"categoryTitle\":\"Algorithms\",\"acRate\":\"42.8%\",\"frontendQuestionId\":\"41\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":42.75575003085709,\"totalAccepted\":1742395,\"totalSubmission\":4075233},{\"questionId\":\"42\",\"title\":\"Trapping Rain Water\",\"titleSlug\":\"trapping-rain-water\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":36428,\"dislikes\":702,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.2%\",\"frontendQuestionId\":\"42\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Dynamic Programming;Stack;Monotonic Stack;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":67.18448817589812,\"totalAccepted\":3515076,\"totalSubmission\":5231976},{\"questionId\":\"43\",\"title\":\"Multiply Strings\",\"titleSlug\":\"multiply-strings\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":7748,\"dislikes\":3690,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.0%\",\"frontendQuestionId\":\"43\",\"paidOnly\":false,\"topicTags\":\"Math;String;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":43.9828644178692,\"totalAccepted\":1154217,\"totalSubmission\":2624239},{\"questionId\":\"44\",\"title\":\"Wildcard Matching\",\"titleSlug\":\"wildcard-matching\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":9130,\"dislikes\":419,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.8%\",\"frontendQuestionId\":\"44\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Greedy;Recursion;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":31.77478208655832,\"totalAccepted\":866790,\"totalSubmission\":2727920},{\"questionId\":\"45\",\"title\":\"Jump Game II\",\"titleSlug\":\"jump-game-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":16503,\"dislikes\":707,\"categoryTitle\":\"Algorithms\",\"acRate\":\"42.7%\",\"frontendQuestionId\":\"45\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":42.721016229403844,\"totalAccepted\":2119493,\"totalSubmission\":4961242},{\"questionId\":\"46\",\"title\":\"Permutations\",\"titleSlug\":\"permutations\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":20885,\"dislikes\":385,\"categoryTitle\":\"Algorithms\",\"acRate\":\"81.8%\",\"frontendQuestionId\":\"46\",\"paidOnly\":false,\"topicTags\":\"Array;Backtracking;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":81.83332586078429,\"totalAccepted\":3066325,\"totalSubmission\":3747039},{\"questionId\":\"47\",\"title\":\"Permutations II\",\"titleSlug\":\"permutations-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":9158,\"dislikes\":163,\"categoryTitle\":\"Algorithms\",\"acRate\":\"63.3%\",\"frontendQuestionId\":\"47\",\"paidOnly\":false,\"topicTags\":\"Array;Backtracking;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":63.2826512300384,\"totalAccepted\":1281117,\"totalSubmission\":2024441},{\"questionId\":\"48\",\"title\":\"Rotate Image\",\"titleSlug\":\"rotate-image\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":19898,\"dislikes\":966,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.6%\",\"frontendQuestionId\":\"48\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":79.59910423181967,\"totalAccepted\":2800549,\"totalSubmission\":3518318},{\"questionId\":\"49\",\"title\":\"Group Anagrams\",\"titleSlug\":\"group-anagrams\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":22083,\"dislikes\":758,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.5%\",\"frontendQuestionId\":\"49\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":72.45571477711128,\"totalAccepted\":4688837,\"totalSubmission\":6471317},{\"questionId\":\"50\",\"title\":\"Pow(x, n)\",\"titleSlug\":\"powx-n\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":11714,\"dislikes\":10553,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.5%\",\"frontendQuestionId\":\"50\",\"paidOnly\":false,\"topicTags\":\"Math;Recursion;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":38.53965131819274,\"totalAccepted\":2691370,\"totalSubmission\":6983380},{\"questionId\":\"51\",\"title\":\"N-Queens\",\"titleSlug\":\"n-queens\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":14352,\"dislikes\":351,\"categoryTitle\":\"Algorithms\",\"acRate\":\"75.3%\",\"frontendQuestionId\":\"51\",\"paidOnly\":false,\"topicTags\":\"Array;Backtracking;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":75.34238314311217,\"totalAccepted\":1261824,\"totalSubmission\":1674791},{\"questionId\":\"52\",\"title\":\"N-Queens II\",\"titleSlug\":\"n-queens-ii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":4289,\"dislikes\":283,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.5%\",\"frontendQuestionId\":\"52\",\"paidOnly\":false,\"topicTags\":\"Backtracking;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":78.503809045464,\"totalAccepted\":597061,\"totalSubmission\":760552},{\"questionId\":\"53\",\"title\":\"Maximum Subarray\",\"titleSlug\":\"maximum-subarray\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":37851,\"dislikes\":1611,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.2%\",\"frontendQuestionId\":\"53\",\"paidOnly\":false,\"topicTags\":\"Array;Divide and Conquer;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":53.199371952568185,\"totalAccepted\":6041887,\"totalSubmission\":11357074},{\"questionId\":\"54\",\"title\":\"Spiral Matrix\",\"titleSlug\":\"spiral-matrix\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":17486,\"dislikes\":1572,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.6%\",\"frontendQuestionId\":\"54\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":56.58186170804501,\"totalAccepted\":2370161,\"totalSubmission\":4188906},{\"questionId\":\"55\",\"title\":\"Jump Game\",\"titleSlug\":\"jump-game\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":21760,\"dislikes\":1491,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.7%\",\"frontendQuestionId\":\"55\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":40.739357219969676,\"totalAccepted\":3163825,\"totalSubmission\":7766016},{\"questionId\":\"56\",\"title\":\"Merge Intervals\",\"titleSlug\":\"merge-intervals\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":24659,\"dislikes\":908,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.6%\",\"frontendQuestionId\":\"56\",\"paidOnly\":false,\"topicTags\":\"Array;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":51.608841497174375,\"totalAccepted\":3956930,\"totalSubmission\":7667158},{\"questionId\":\"57\",\"title\":\"Insert Interval\",\"titleSlug\":\"insert-interval\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":11859,\"dislikes\":920,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.1%\",\"frontendQuestionId\":\"57\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":45.05625075509523,\"totalAccepted\":1760241,\"totalSubmission\":3906765},{\"questionId\":\"58\",\"title\":\"Length of Last Word\",\"titleSlug\":\"length-of-last-word\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":6446,\"dislikes\":365,\"categoryTitle\":\"Algorithms\",\"acRate\":\"58.7%\",\"frontendQuestionId\":\"58\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.659431254024064,\"totalAccepted\":3386433,\"totalSubmission\":5773056},{\"questionId\":\"59\",\"title\":\"Spiral Matrix II\",\"titleSlug\":\"spiral-matrix-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6916,\"dislikes\":289,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.9%\",\"frontendQuestionId\":\"59\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":74.90262500514963,\"totalAccepted\":799982,\"totalSubmission\":1068031},{\"questionId\":\"60\",\"title\":\"Permutation Sequence\",\"titleSlug\":\"permutation-sequence\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":7272,\"dislikes\":511,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.8%\",\"frontendQuestionId\":\"60\",\"paidOnly\":false,\"topicTags\":\"Math;Recursion;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":52.792933923708866,\"totalAccepted\":572900,\"totalSubmission\":1085184},{\"questionId\":\"61\",\"title\":\"Rotate List\",\"titleSlug\":\"rotate-list\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":11282,\"dislikes\":1554,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.6%\",\"frontendQuestionId\":\"61\",\"paidOnly\":false,\"topicTags\":\"Linked List;Two Pointers;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":41.574168741080626,\"totalAccepted\":1598452,\"totalSubmission\":3844826},{\"questionId\":\"62\",\"title\":\"Unique Paths\",\"titleSlug\":\"unique-paths\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":18393,\"dislikes\":495,\"categoryTitle\":\"Algorithms\",\"acRate\":\"66.7%\",\"frontendQuestionId\":\"62\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Combinatorics;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":66.74031169335495,\"totalAccepted\":2804813,\"totalSubmission\":4202576},{\"questionId\":\"63\",\"title\":\"Unique Paths II\",\"titleSlug\":\"unique-paths-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":9706,\"dislikes\":561,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.4%\",\"frontendQuestionId\":\"63\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":44.36997888446467,\"totalAccepted\":1472792,\"totalSubmission\":3319340},{\"questionId\":\"64\",\"title\":\"Minimum Path Sum\",\"titleSlug\":\"minimum-path-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":13713,\"dislikes\":203,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.1%\",\"frontendQuestionId\":\"64\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.0910039998294,\"totalAccepted\":1835959,\"totalSubmission\":2696335},{\"questionId\":\"65\",\"title\":\"Valid Number\",\"titleSlug\":\"valid-number\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1509,\"dislikes\":2214,\"categoryTitle\":\"Algorithms\",\"acRate\":\"22.9%\",\"frontendQuestionId\":\"65\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":22.85469203722415,\"totalAccepted\":516623,\"totalSubmission\":2260468},{\"questionId\":\"66\",\"title\":\"Plus One\",\"titleSlug\":\"plus-one\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":11870,\"dislikes\":5611,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.8%\",\"frontendQuestionId\":\"66\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.83310929232771,\"totalAccepted\":3704531,\"totalSubmission\":7433879},{\"questionId\":\"67\",\"title\":\"Add Binary\",\"titleSlug\":\"add-binary\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":10780,\"dislikes\":1116,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.9%\",\"frontendQuestionId\":\"67\",\"paidOnly\":false,\"topicTags\":\"Math;String;Bit Manipulation;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":57.92248518396489,\"totalAccepted\":2325810,\"totalSubmission\":4015383},{\"questionId\":\"68\",\"title\":\"Text Justification\",\"titleSlug\":\"text-justification\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":4569,\"dislikes\":5404,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.9%\",\"frontendQuestionId\":\"68\",\"paidOnly\":false,\"topicTags\":\"Array;String;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":50.86396086050895,\"totalAccepted\":646867,\"totalSubmission\":1271759},{\"questionId\":\"69\",\"title\":\"Sqrt(x)\",\"titleSlug\":\"sqrtx\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":9715,\"dislikes\":4641,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.7%\",\"frontendQuestionId\":\"69\",\"paidOnly\":false,\"topicTags\":\"Math;Binary Search;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":41.68522859835111,\"totalAccepted\":3159934,\"totalSubmission\":7580470},{\"questionId\":\"70\",\"title\":\"Climbing Stairs\",\"titleSlug\":\"climbing-stairs\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":24527,\"dislikes\":1048,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.0%\",\"frontendQuestionId\":\"70\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Memoization;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":54.01779638553948,\"totalAccepted\":5076413,\"totalSubmission\":9397674},{\"questionId\":\"71\",\"title\":\"Simplify Path\",\"titleSlug\":\"simplify-path\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6564,\"dislikes\":1416,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.4%\",\"frontendQuestionId\":\"71\",\"paidOnly\":false,\"topicTags\":\"String;Stack;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":50.40143248496351,\"totalAccepted\":1317305,\"totalSubmission\":2613633},{\"questionId\":\"72\",\"title\":\"Edit Distance\",\"titleSlug\":\"edit-distance\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":16451,\"dislikes\":325,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.4%\",\"frontendQuestionId\":\"72\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":60.42920099957352,\"totalAccepted\":1441003,\"totalSubmission\":2384615},{\"questionId\":\"73\",\"title\":\"Set Matrix Zeroes\",\"titleSlug\":\"set-matrix-zeroes\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":17137,\"dislikes\":867,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.7%\",\"frontendQuestionId\":\"73\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":62.74746748075001,\"totalAccepted\":2557317,\"totalSubmission\":4075568},{\"questionId\":\"74\",\"title\":\"Search a 2D Matrix\",\"titleSlug\":\"search-a-2d-matrix\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":17939,\"dislikes\":485,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.8%\",\"frontendQuestionId\":\"74\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":53.8076409455967,\"totalAccepted\":2863989,\"totalSubmission\":5322657},{\"questionId\":\"75\",\"title\":\"Sort Colors\",\"titleSlug\":\"sort-colors\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":21665,\"dislikes\":772,\"categoryTitle\":\"Algorithms\",\"acRate\":\"69.5%\",\"frontendQuestionId\":\"75\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":69.46769801147713,\"totalAccepted\":3697221,\"totalSubmission\":5322221},{\"questionId\":\"76\",\"title\":\"Minimum Window Substring\",\"titleSlug\":\"minimum-window-substring\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":20216,\"dislikes\":855,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.3%\",\"frontendQuestionId\":\"76\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.33563715475843,\"totalAccepted\":2140929,\"totalSubmission\":4522890},{\"questionId\":\"77\",\"title\":\"Combinations\",\"titleSlug\":\"combinations\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":8932,\"dislikes\":255,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.5%\",\"frontendQuestionId\":\"77\",\"paidOnly\":false,\"topicTags\":\"Backtracking;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":74.46689289796909,\"totalAccepted\":1326301,\"totalSubmission\":1781062},{\"questionId\":\"78\",\"title\":\"Subsets\",\"titleSlug\":\"subsets\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":19242,\"dislikes\":341,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.2%\",\"frontendQuestionId\":\"78\",\"paidOnly\":false,\"topicTags\":\"Array;Backtracking;Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":82.24396268906565,\"totalAccepted\":3019068,\"totalSubmission\":3670871},{\"questionId\":\"79\",\"title\":\"Word Search\",\"titleSlug\":\"word-search\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":17697,\"dislikes\":757,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.2%\",\"frontendQuestionId\":\"79\",\"paidOnly\":false,\"topicTags\":\"Array;String;Backtracking;Depth-First Search;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.19732693492873,\"totalAccepted\":2482792,\"totalSubmission\":5260463},{\"questionId\":\"80\",\"title\":\"Remove Duplicates from Sorted Array II\",\"titleSlug\":\"remove-duplicates-from-sorted-array-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":8280,\"dislikes\":1520,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.6%\",\"frontendQuestionId\":\"80\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.5591407256857,\"totalAccepted\":1918574,\"totalSubmission\":2971809},{\"questionId\":\"81\",\"title\":\"Search in Rotated Sorted Array II\",\"titleSlug\":\"search-in-rotated-sorted-array-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":9646,\"dislikes\":1125,\"categoryTitle\":\"Algorithms\",\"acRate\":\"39.9%\",\"frontendQuestionId\":\"81\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":39.93438043921437,\"totalAccepted\":1227235,\"totalSubmission\":3073139},{\"questionId\":\"82\",\"title\":\"Remove Duplicates from Sorted List II\",\"titleSlug\":\"remove-duplicates-from-sorted-list-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":9693,\"dislikes\":283,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.6%\",\"frontendQuestionId\":\"82\",\"paidOnly\":false,\"topicTags\":\"Linked List;Two Pointers;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":51.62977720811154,\"totalAccepted\":1092808,\"totalSubmission\":2116631},{\"questionId\":\"83\",\"title\":\"Remove Duplicates from Sorted List\",\"titleSlug\":\"remove-duplicates-from-sorted-list\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":9891,\"dislikes\":377,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.6%\",\"frontendQuestionId\":\"83\",\"paidOnly\":false,\"topicTags\":\"Linked List;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":56.582774853733056,\"totalAccepted\":2356182,\"totalSubmission\":4164133},{\"questionId\":\"84\",\"title\":\"Largest Rectangle in Histogram\",\"titleSlug\":\"largest-rectangle-in-histogram\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":19667,\"dislikes\":391,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.7%\",\"frontendQuestionId\":\"84\",\"paidOnly\":false,\"topicTags\":\"Array;Stack;Monotonic Stack;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":49.6968277052588,\"totalAccepted\":1544218,\"totalSubmission\":3107287},{\"questionId\":\"85\",\"title\":\"Maximal Rectangle\",\"titleSlug\":\"maximal-rectangle\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":12093,\"dislikes\":228,\"categoryTitle\":\"Algorithms\",\"acRate\":\"58.5%\",\"frontendQuestionId\":\"85\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Stack;Matrix;Monotonic Stack;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.53896598384423,\"totalAccepted\":799465,\"totalSubmission\":1365700},{\"questionId\":\"86\",\"title\":\"Partition List\",\"titleSlug\":\"partition-list\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":8058,\"dislikes\":984,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.0%\",\"frontendQuestionId\":\"86\",\"paidOnly\":false,\"topicTags\":\"Linked List;Two Pointers;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":60.9845554371909,\"totalAccepted\":903362,\"totalSubmission\":1481297},{\"questionId\":\"87\",\"title\":\"Scramble String\",\"titleSlug\":\"scramble-string\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":3639,\"dislikes\":1313,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.3%\",\"frontendQuestionId\":\"87\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":44.349097381133994,\"totalAccepted\":313965,\"totalSubmission\":707940},{\"questionId\":\"88\",\"title\":\"Merge Sorted Array\",\"titleSlug\":\"merge-sorted-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":19017,\"dislikes\":2656,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.7%\",\"frontendQuestionId\":\"88\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":54.69497399033146,\"totalAccepted\":5629175,\"totalSubmission\":10291941},{\"questionId\":\"89\",\"title\":\"Gray Code\",\"titleSlug\":\"gray-code\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2542,\"dislikes\":2837,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.7%\",\"frontendQuestionId\":\"89\",\"paidOnly\":false,\"topicTags\":\"Math;Backtracking;Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.66586665357183,\"totalAccepted\":421399,\"totalSubmission\":651656},{\"questionId\":\"90\",\"title\":\"Subsets II\",\"titleSlug\":\"subsets-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":10951,\"dislikes\":417,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.2%\",\"frontendQuestionId\":\"90\",\"paidOnly\":false,\"topicTags\":\"Array;Backtracking;Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.16009862165439,\"totalAccepted\":1483892,\"totalSubmission\":2426242},{\"questionId\":\"91\",\"title\":\"Decode Ways\",\"titleSlug\":\"decode-ways\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":12900,\"dislikes\":4614,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.9%\",\"frontendQuestionId\":\"91\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":37.85758824971738,\"totalAccepted\":1648958,\"totalSubmission\":4355695},{\"questionId\":\"92\",\"title\":\"Reverse Linked List II\",\"titleSlug\":\"reverse-linked-list-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":12964,\"dislikes\":787,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.4%\",\"frontendQuestionId\":\"92\",\"paidOnly\":false,\"topicTags\":\"Linked List;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":51.35918366383715,\"totalAccepted\":1305794,\"totalSubmission\":2542478},{\"questionId\":\"93\",\"title\":\"Restore IP Addresses\",\"titleSlug\":\"restore-ip-addresses\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":5664,\"dislikes\":821,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.8%\",\"frontendQuestionId\":\"93\",\"paidOnly\":false,\"topicTags\":\"String;Backtracking;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.784957865155974,\"totalAccepted\":623123,\"totalSubmission\":1117009},{\"questionId\":\"94\",\"title\":\"Binary Tree Inorder Traversal\",\"titleSlug\":\"binary-tree-inorder-traversal\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":14935,\"dislikes\":904,\"categoryTitle\":\"Algorithms\",\"acRate\":\"80.0%\",\"frontendQuestionId\":\"94\",\"paidOnly\":false,\"topicTags\":\"Stack;Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":79.95444790302155,\"totalAccepted\":3679295,\"totalSubmission\":4601744},{\"questionId\":\"95\",\"title\":\"Unique Binary Search Trees II\",\"titleSlug\":\"unique-binary-search-trees-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":7960,\"dislikes\":584,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.3%\",\"frontendQuestionId\":\"95\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;Backtracking;Tree;Binary Search Tree;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":62.28923129988628,\"totalAccepted\":577878,\"totalSubmission\":927734},{\"questionId\":\"96\",\"title\":\"Unique Binary Search Trees\",\"titleSlug\":\"unique-binary-search-trees\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":11025,\"dislikes\":448,\"categoryTitle\":\"Algorithms\",\"acRate\":\"63.6%\",\"frontendQuestionId\":\"96\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Tree;Binary Search Tree;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":63.574816559524436,\"totalAccepted\":861564,\"totalSubmission\":1355198},{\"questionId\":\"97\",\"title\":\"Interleaving String\",\"titleSlug\":\"interleaving-string\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":8854,\"dislikes\":556,\"categoryTitle\":\"Algorithms\",\"acRate\":\"43.8%\",\"frontendQuestionId\":\"97\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":43.841936831640076,\"totalAccepted\":779653,\"totalSubmission\":1778327},{\"questionId\":\"98\",\"title\":\"Validate Binary Search Tree\",\"titleSlug\":\"validate-binary-search-tree\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":18405,\"dislikes\":1461,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.6%\",\"frontendQuestionId\":\"98\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Binary Search Tree;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":35.62306232614128,\"totalAccepted\":3319179,\"totalSubmission\":9317513},{\"questionId\":\"99\",\"title\":\"Recover Binary Search Tree\",\"titleSlug\":\"recover-binary-search-tree\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":8614,\"dislikes\":292,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.4%\",\"frontendQuestionId\":\"99\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Binary Search Tree;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.376604261276945,\"totalAccepted\":661586,\"totalSubmission\":1114220},{\"questionId\":\"100\",\"title\":\"Same Tree\",\"titleSlug\":\"same-tree\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":12907,\"dislikes\":301,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.0%\",\"frontendQuestionId\":\"100\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Breadth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":66.96410686966449,\"totalAccepted\":3386529,\"totalSubmission\":5057239},{\"questionId\":\"401\",\"title\":\"Binary Watch\",\"titleSlug\":\"binary-watch\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1968,\"dislikes\":3078,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.4%\",\"frontendQuestionId\":\"401\",\"paidOnly\":false,\"topicTags\":\"Backtracking;Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":65.39265042526661,\"totalAccepted\":281089,\"totalSubmission\":429848},{\"questionId\":\"402\",\"title\":\"Remove K Digits\",\"titleSlug\":\"remove-k-digits\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":10622,\"dislikes\":549,\"categoryTitle\":\"Algorithms\",\"acRate\":\"36.7%\",\"frontendQuestionId\":\"402\",\"paidOnly\":false,\"topicTags\":\"String;Stack;Greedy;Monotonic Stack;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":36.68201680384898,\"totalAccepted\":729410,\"totalSubmission\":1988469},{\"questionId\":\"403\",\"title\":\"Frog Jump\",\"titleSlug\":\"frog-jump\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":5997,\"dislikes\":278,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.2%\",\"frontendQuestionId\":\"403\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.23564849111723,\"totalAccepted\":337938,\"totalSubmission\":715429},{\"questionId\":\"404\",\"title\":\"Sum of Left Leaves\",\"titleSlug\":\"sum-of-left-leaves\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":5801,\"dislikes\":327,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.6%\",\"frontendQuestionId\":\"404\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Breadth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":62.578082743427466,\"totalAccepted\":792510,\"totalSubmission\":1266436},{\"questionId\":\"405\",\"title\":\"Convert a Number to Hexadecimal\",\"titleSlug\":\"convert-a-number-to-hexadecimal\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1448,\"dislikes\":232,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.8%\",\"frontendQuestionId\":\"405\",\"paidOnly\":false,\"topicTags\":\"Math;String;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.84228179679712,\"totalAccepted\":219275,\"totalSubmission\":407255},{\"questionId\":\"406\",\"title\":\"Queue Reconstruction by Height\",\"titleSlug\":\"queue-reconstruction-by-height\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":7250,\"dislikes\":754,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.7%\",\"frontendQuestionId\":\"406\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Indexed Tree;Segment Tree;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":74.67201956176784,\"totalAccepted\":344466,\"totalSubmission\":461306},{\"questionId\":\"407\",\"title\":\"Trapping Rain Water II\",\"titleSlug\":\"trapping-rain-water-ii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":5010,\"dislikes\":174,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.1%\",\"frontendQuestionId\":\"407\",\"paidOnly\":false,\"topicTags\":\"Array;Breadth-First Search;Heap (Priority Queue);Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.06033916730603,\"totalAccepted\":266349,\"totalSubmission\":415778},{\"questionId\":\"408\",\"title\":\"Valid Word Abbreviation\",\"titleSlug\":\"valid-word-abbreviation\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":926,\"dislikes\":2406,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.0%\",\"frontendQuestionId\":\"408\",\"paidOnly\":true,\"topicTags\":\"Two Pointers;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":37.029378902533566,\"totalAccepted\":361573,\"totalSubmission\":976449},{\"questionId\":\"409\",\"title\":\"Longest Palindrome\",\"titleSlug\":\"longest-palindrome\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":6388,\"dislikes\":451,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.9%\",\"frontendQuestionId\":\"409\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.92547316680474,\"totalAccepted\":1050384,\"totalSubmission\":1878185},{\"questionId\":\"410\",\"title\":\"Split Array Largest Sum\",\"titleSlug\":\"split-array-largest-sum\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":11372,\"dislikes\":269,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.2%\",\"frontendQuestionId\":\"410\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Dynamic Programming;Greedy;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":60.23429451701335,\"totalAccepted\":627960,\"totalSubmission\":1042531},{\"questionId\":\"411\",\"title\":\"Minimum Unique Word Abbreviation\",\"titleSlug\":\"minimum-unique-word-abbreviation\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":184,\"dislikes\":146,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.5%\",\"frontendQuestionId\":\"411\",\"paidOnly\":true,\"topicTags\":\"Array;String;Backtracking;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.48555924182805,\"totalAccepted\":15742,\"totalSubmission\":38883},{\"questionId\":\"412\",\"title\":\"Fizz Buzz\",\"titleSlug\":\"fizz-buzz\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":3388,\"dislikes\":465,\"categoryTitle\":\"Algorithms\",\"acRate\":\"75.4%\",\"frontendQuestionId\":\"412\",\"paidOnly\":false,\"topicTags\":\"Math;String;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":75.43889930707157,\"totalAccepted\":1774459,\"totalSubmission\":2352183},{\"questionId\":\"413\",\"title\":\"Arithmetic Slices\",\"titleSlug\":\"arithmetic-slices\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":5639,\"dislikes\":306,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.8%\",\"frontendQuestionId\":\"413\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.82906864586255,\"totalAccepted\":367645,\"totalSubmission\":567099},{\"questionId\":\"414\",\"title\":\"Third Maximum Number\",\"titleSlug\":\"third-maximum-number\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":3547,\"dislikes\":3545,\"categoryTitle\":\"Algorithms\",\"acRate\":\"39.2%\",\"frontendQuestionId\":\"414\",\"paidOnly\":false,\"topicTags\":\"Array;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":39.24332392995469,\"totalAccepted\":835500,\"totalSubmission\":2129023},{\"questionId\":\"415\",\"title\":\"Add Strings\",\"titleSlug\":\"add-strings\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":5468,\"dislikes\":833,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.1%\",\"frontendQuestionId\":\"415\",\"paidOnly\":false,\"topicTags\":\"Math;String;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":52.131376193691246,\"totalAccepted\":938138,\"totalSubmission\":1799565},{\"questionId\":\"416\",\"title\":\"Partition Equal Subset Sum\",\"titleSlug\":\"partition-equal-subset-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":13880,\"dislikes\":300,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.4%\",\"frontendQuestionId\":\"416\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":49.383316605397084,\"totalAccepted\":1492293,\"totalSubmission\":3021860},{\"questionId\":\"417\",\"title\":\"Pacific Atlantic Water Flow\",\"titleSlug\":\"pacific-atlantic-water-flow\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":8729,\"dislikes\":1837,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.8%\",\"frontendQuestionId\":\"417\",\"paidOnly\":false,\"topicTags\":\"Array;Depth-First Search;Breadth-First Search;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":60.82233431753558,\"totalAccepted\":802555,\"totalSubmission\":1319508},{\"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.39787690109217,\"totalAccepted\":106977,\"totalSubmission\":293910},{\"questionId\":\"419\",\"title\":\"Battleships in a Board\",\"titleSlug\":\"battleships-in-a-board\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2524,\"dislikes\":1030,\"categoryTitle\":\"Algorithms\",\"acRate\":\"77.5%\",\"frontendQuestionId\":\"419\",\"paidOnly\":false,\"topicTags\":\"Array;Depth-First Search;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":77.47761536695492,\"totalAccepted\":283472,\"totalSubmission\":365875},{\"questionId\":\"420\",\"title\":\"Strong Password Checker\",\"titleSlug\":\"strong-password-checker\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":967,\"dislikes\":1754,\"categoryTitle\":\"Algorithms\",\"acRate\":\"15.7%\",\"frontendQuestionId\":\"420\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":15.657968263417565,\"totalAccepted\":55760,\"totalSubmission\":356118},{\"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\":5942,\"dislikes\":424,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.4%\",\"frontendQuestionId\":\"421\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Bit Manipulation;Trie;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":53.4030983595073,\"totalAccepted\":221067,\"totalSubmission\":413960},{\"questionId\":\"422\",\"title\":\"Valid Word Square\",\"titleSlug\":\"valid-word-square\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":451,\"dislikes\":274,\"categoryTitle\":\"Algorithms\",\"acRate\":\"42.9%\",\"frontendQuestionId\":\"422\",\"paidOnly\":true,\"topicTags\":\"Array;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":42.86876404765205,\"totalAccepted\":71142,\"totalSubmission\":165953},{\"questionId\":\"423\",\"title\":\"Reconstruct Original Digits from English\",\"titleSlug\":\"reconstruct-original-digits-from-english\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":895,\"dislikes\":2811,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.8%\",\"frontendQuestionId\":\"423\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Math;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":52.81535823170732,\"totalAccepted\":99783,\"totalSubmission\":188928},{\"questionId\":\"424\",\"title\":\"Longest Repeating Character Replacement\",\"titleSlug\":\"longest-repeating-character-replacement\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":13075,\"dislikes\":769,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.4%\",\"frontendQuestionId\":\"424\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.43754402173681,\"totalAccepted\":1534994,\"totalSubmission\":2582532},{\"questionId\":\"425\",\"title\":\"Word Squares\",\"titleSlug\":\"word-squares\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":1124,\"dislikes\":75,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.7%\",\"frontendQuestionId\":\"425\",\"paidOnly\":true,\"topicTags\":\"Array;String;Backtracking;Trie;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":54.682894236941735,\"totalAccepted\":83480,\"totalSubmission\":152662},{\"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\":2730,\"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.64106724896067,\"totalAccepted\":372154,\"totalSubmission\":566953},{\"questionId\":\"772\",\"title\":\"Construct Quad Tree\",\"titleSlug\":\"construct-quad-tree\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1762,\"dislikes\":1964,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.2%\",\"frontendQuestionId\":\"427\",\"paidOnly\":false,\"topicTags\":\"Array;Divide and Conquer;Tree;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":78.21371549485428,\"totalAccepted\":203295,\"totalSubmission\":259923},{\"questionId\":\"765\",\"title\":\"Serialize and Deserialize N-ary Tree\",\"titleSlug\":\"serialize-and-deserialize-n-ary-tree\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":1074,\"dislikes\":58,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.7%\",\"frontendQuestionId\":\"428\",\"paidOnly\":true,\"topicTags\":\"String;Tree;Depth-First Search;Breadth-First Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.73033468050095,\"totalAccepted\":99826,\"totalSubmission\":145243},{\"questionId\":\"764\",\"title\":\"N-ary Tree Level Order Traversal\",\"titleSlug\":\"n-ary-tree-level-order-traversal\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3757,\"dislikes\":146,\"categoryTitle\":\"Algorithms\",\"acRate\":\"71.5%\",\"frontendQuestionId\":\"429\",\"paidOnly\":false,\"topicTags\":\"Tree;Breadth-First Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":71.51316893793599,\"totalAccepted\":366389,\"totalSubmission\":512339},{\"questionId\":\"766\",\"title\":\"Flatten a Multilevel Doubly Linked List\",\"titleSlug\":\"flatten-a-multilevel-doubly-linked-list\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":5465,\"dislikes\":351,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.8%\",\"frontendQuestionId\":\"430\",\"paidOnly\":false,\"topicTags\":\"Linked List;Depth-First Search;Doubly-Linked List;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":62.75894430509078,\"totalAccepted\":437346,\"totalSubmission\":696867},{\"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.58102499758711,\"totalAccepted\":25047,\"totalSubmission\":31083},{\"questionId\":\"432\",\"title\":\"All O`one Data Structure\",\"titleSlug\":\"all-oone-data-structure\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2233,\"dislikes\":224,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.2%\",\"frontendQuestionId\":\"432\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Linked List;Design;Doubly-Linked List;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":44.21428448231256,\"totalAccepted\":205078,\"totalSubmission\":463829},{\"questionId\":\"433\",\"title\":\"Minimum Genetic Mutation\",\"titleSlug\":\"minimum-genetic-mutation\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3317,\"dislikes\":348,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.5%\",\"frontendQuestionId\":\"433\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Breadth-First Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":56.542663099737354,\"totalAccepted\":278571,\"totalSubmission\":492674},{\"questionId\":\"434\",\"title\":\"Number of Segments in a String\",\"titleSlug\":\"number-of-segments-in-a-string\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":918,\"dislikes\":1338,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.2%\",\"frontendQuestionId\":\"434\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":37.19508427909475,\"totalAccepted\":276935,\"totalSubmission\":744549},{\"questionId\":\"435\",\"title\":\"Non-overlapping Intervals\",\"titleSlug\":\"non-overlapping-intervals\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":9152,\"dislikes\":260,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.0%\",\"frontendQuestionId\":\"435\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":56.99165063348342,\"totalAccepted\":1003880,\"totalSubmission\":1761451},{\"questionId\":\"436\",\"title\":\"Find Right Interval\",\"titleSlug\":\"find-right-interval\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2363,\"dislikes\":398,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.7%\",\"frontendQuestionId\":\"436\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":55.689031725725535,\"totalAccepted\":160629,\"totalSubmission\":288440},{\"questionId\":\"437\",\"title\":\"Path Sum III\",\"titleSlug\":\"path-sum-iii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":11933,\"dislikes\":575,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.4%\",\"frontendQuestionId\":\"437\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":46.374322865020254,\"totalAccepted\":788014,\"totalSubmission\":1699247},{\"questionId\":\"438\",\"title\":\"Find All Anagrams in a String\",\"titleSlug\":\"find-all-anagrams-in-a-string\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":13231,\"dislikes\":378,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.6%\",\"frontendQuestionId\":\"438\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":53.598330002252624,\"totalAccepted\":1194438,\"totalSubmission\":2228502},{\"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.567519487660505,\"totalAccepted\":38688,\"totalSubmission\":61834},{\"questionId\":\"440\",\"title\":\"K-th Smallest in Lexicographical Order\",\"titleSlug\":\"k-th-smallest-in-lexicographical-order\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1650,\"dislikes\":147,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.3%\",\"frontendQuestionId\":\"440\",\"paidOnly\":false,\"topicTags\":\"Trie;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":46.27469526446862,\"totalAccepted\":169277,\"totalSubmission\":365809},{\"questionId\":\"441\",\"title\":\"Arranging Coins\",\"titleSlug\":\"arranging-coins\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":4359,\"dislikes\":1380,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.1%\",\"frontendQuestionId\":\"441\",\"paidOnly\":false,\"topicTags\":\"Math;Binary Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":48.119426946910146,\"totalAccepted\":619833,\"totalSubmission\":1288113},{\"questionId\":\"442\",\"title\":\"Find All Duplicates in an Array\",\"titleSlug\":\"find-all-duplicates-in-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":11158,\"dislikes\":449,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.9%\",\"frontendQuestionId\":\"442\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":76.89467599653031,\"totalAccepted\":1033623,\"totalSubmission\":1344208},{\"questionId\":\"443\",\"title\":\"String Compression\",\"titleSlug\":\"string-compression\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6226,\"dislikes\":8905,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.9%\",\"frontendQuestionId\":\"443\",\"paidOnly\":false,\"topicTags\":\"Two Pointers;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.85032289689786,\"totalAccepted\":1064673,\"totalSubmission\":1778891},{\"questionId\":\"444\",\"title\":\"Sequence Reconstruction\",\"titleSlug\":\"sequence-reconstruction\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":616,\"dislikes\":1549,\"categoryTitle\":\"Algorithms\",\"acRate\":\"30.7%\",\"frontendQuestionId\":\"444\",\"paidOnly\":true,\"topicTags\":\"Array;Graph Theory;Topological Sort;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":30.680694817116226,\"totalAccepted\":65175,\"totalSubmission\":212430},{\"questionId\":\"445\",\"title\":\"Add Two Numbers II\",\"titleSlug\":\"add-two-numbers-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6175,\"dislikes\":303,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.5%\",\"frontendQuestionId\":\"445\",\"paidOnly\":false,\"topicTags\":\"Linked List;Math;Stack;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":62.54705672724916,\"totalAccepted\":579190,\"totalSubmission\":926008},{\"questionId\":\"446\",\"title\":\"Arithmetic Slices II - Subsequence\",\"titleSlug\":\"arithmetic-slices-ii-subsequence\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":3517,\"dislikes\":165,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.0%\",\"frontendQuestionId\":\"446\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.01472574320256,\"totalAccepted\":169052,\"totalSubmission\":307285},{\"questionId\":\"447\",\"title\":\"Number of Boomerangs\",\"titleSlug\":\"number-of-boomerangs\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":901,\"dislikes\":1046,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.5%\",\"frontendQuestionId\":\"447\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":57.49863070800878,\"totalAccepted\":118626,\"totalSubmission\":206311},{\"questionId\":\"448\",\"title\":\"Find All Numbers Disappeared in an Array\",\"titleSlug\":\"find-all-numbers-disappeared-in-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":10416,\"dislikes\":557,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.0%\",\"frontendQuestionId\":\"448\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.01204339840668,\"totalAccepted\":1372149,\"totalSubmission\":2143580},{\"questionId\":\"449\",\"title\":\"Serialize and Deserialize BST\",\"titleSlug\":\"serialize-and-deserialize-bst\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3605,\"dislikes\":180,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.5%\",\"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.53599903306153,\"totalAccepted\":275841,\"totalSubmission\":463318},{\"questionId\":\"450\",\"title\":\"Delete Node in a BST\",\"titleSlug\":\"delete-node-in-a-bst\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":10462,\"dislikes\":388,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.5%\",\"frontendQuestionId\":\"450\",\"paidOnly\":false,\"topicTags\":\"Tree;Binary Search Tree;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":54.506529420412555,\"totalAccepted\":860151,\"totalSubmission\":1578077},{\"questionId\":\"451\",\"title\":\"Sort Characters By Frequency\",\"titleSlug\":\"sort-characters-by-frequency\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":9257,\"dislikes\":336,\"categoryTitle\":\"Algorithms\",\"acRate\":\"75.3%\",\"frontendQuestionId\":\"451\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Sorting;Heap (Priority Queue);Bucket Sort;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":75.25839433130226,\"totalAccepted\":1106903,\"totalSubmission\":1470806},{\"questionId\":\"452\",\"title\":\"Minimum Number of Arrows to Burst Balloons\",\"titleSlug\":\"minimum-number-of-arrows-to-burst-balloons\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":8102,\"dislikes\":274,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.3%\",\"frontendQuestionId\":\"452\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.345394317747484,\"totalAccepted\":780028,\"totalSubmission\":1271536},{\"questionId\":\"453\",\"title\":\"Minimum Moves to Equal Array Elements\",\"titleSlug\":\"minimum-moves-to-equal-array-elements\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2825,\"dislikes\":1914,\"categoryTitle\":\"Algorithms\",\"acRate\":\"58.7%\",\"frontendQuestionId\":\"453\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.660325009908846,\"totalAccepted\":219039,\"totalSubmission\":373403},{\"questionId\":\"454\",\"title\":\"4Sum II\",\"titleSlug\":\"4sum-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":5084,\"dislikes\":151,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.9%\",\"frontendQuestionId\":\"454\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":57.917356710829495,\"totalAccepted\":386091,\"totalSubmission\":666624},{\"questionId\":\"455\",\"title\":\"Assign Cookies\",\"titleSlug\":\"assign-cookies\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":5018,\"dislikes\":460,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.8%\",\"frontendQuestionId\":\"455\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":54.848683396263375,\"totalAccepted\":935054,\"totalSubmission\":1704791},{\"questionId\":\"456\",\"title\":\"132 Pattern\",\"titleSlug\":\"132-pattern\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":7635,\"dislikes\":472,\"categoryTitle\":\"Algorithms\",\"acRate\":\"34.7%\",\"frontendQuestionId\":\"456\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Stack;Monotonic Stack;Ordered Set;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":34.67847401262938,\"totalAccepted\":324835,\"totalSubmission\":936705},{\"questionId\":\"457\",\"title\":\"Circular Array Loop\",\"titleSlug\":\"circular-array-loop\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":831,\"dislikes\":905,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.2%\",\"frontendQuestionId\":\"457\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Two Pointers;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":37.21150741028301,\"totalAccepted\":108316,\"totalSubmission\":291082},{\"questionId\":\"458\",\"title\":\"Poor Pigs\",\"titleSlug\":\"poor-pigs\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1874,\"dislikes\":3369,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.1%\",\"frontendQuestionId\":\"458\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Combinatorics;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.109794653269546,\"totalAccepted\":133304,\"totalSubmission\":225516},{\"questionId\":\"459\",\"title\":\"Repeated Substring Pattern\",\"titleSlug\":\"repeated-substring-pattern\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":6873,\"dislikes\":570,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.1%\",\"frontendQuestionId\":\"459\",\"paidOnly\":false,\"topicTags\":\"String;String Matching;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":48.10847053799565,\"totalAccepted\":610598,\"totalSubmission\":1269211},{\"questionId\":\"460\",\"title\":\"LFU Cache\",\"titleSlug\":\"lfu-cache\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":6359,\"dislikes\":356,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.0%\",\"frontendQuestionId\":\"460\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Linked List;Design;Doubly-Linked List;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.01730830400343,\"totalAccepted\":379090,\"totalSubmission\":773383},{\"questionId\":\"461\",\"title\":\"Hamming Distance\",\"titleSlug\":\"hamming-distance\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":4037,\"dislikes\":231,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.7%\",\"frontendQuestionId\":\"461\",\"paidOnly\":false,\"topicTags\":\"Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":76.73416515689058,\"totalAccepted\":689524,\"totalSubmission\":898588},{\"questionId\":\"462\",\"title\":\"Minimum Moves to Equal Array Elements II\",\"titleSlug\":\"minimum-moves-to-equal-array-elements-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3521,\"dislikes\":132,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.7%\",\"frontendQuestionId\":\"462\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.684568637941204,\"totalAccepted\":224830,\"totalSubmission\":364484},{\"questionId\":\"463\",\"title\":\"Island Perimeter\",\"titleSlug\":\"island-perimeter\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":7314,\"dislikes\":431,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.4%\",\"frontendQuestionId\":\"463\",\"paidOnly\":false,\"topicTags\":\"Array;Depth-First Search;Breadth-First Search;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":74.36819261543403,\"totalAccepted\":824332,\"totalSubmission\":1108447},{\"questionId\":\"464\",\"title\":\"Can I Win\",\"titleSlug\":\"can-i-win\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2835,\"dislikes\":433,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.3%\",\"frontendQuestionId\":\"464\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Bit Manipulation;Memoization;Game Theory;Bitmask;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":31.2798402584354,\"totalAccepted\":122972,\"totalSubmission\":393135},{\"questionId\":\"465\",\"title\":\"Optimal Account Balancing\",\"titleSlug\":\"optimal-account-balancing\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":1532,\"dislikes\":164,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.4%\",\"frontendQuestionId\":\"465\",\"paidOnly\":true,\"topicTags\":\"Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":50.39537846505293,\"totalAccepted\":114715,\"totalSubmission\":227630},{\"questionId\":\"466\",\"title\":\"Count The Repetitions\",\"titleSlug\":\"count-the-repetitions\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":448,\"dislikes\":370,\"categoryTitle\":\"Algorithms\",\"acRate\":\"34.1%\",\"frontendQuestionId\":\"466\",\"paidOnly\":false,\"topicTags\":\"Two Pointers;String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":34.054525470706295,\"totalAccepted\":28502,\"totalSubmission\":83701},{\"questionId\":\"467\",\"title\":\"Unique Substrings in Wraparound String\",\"titleSlug\":\"unique-substrings-in-wraparound-string\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1531,\"dislikes\":191,\"categoryTitle\":\"Algorithms\",\"acRate\":\"42.9%\",\"frontendQuestionId\":\"467\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":42.940300425615554,\"totalAccepted\":56800,\"totalSubmission\":132278},{\"questionId\":\"468\",\"title\":\"Validate IP Address\",\"titleSlug\":\"validate-ip-address\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1124,\"dislikes\":2746,\"categoryTitle\":\"Algorithms\",\"acRate\":\"28.3%\",\"frontendQuestionId\":\"468\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":28.28031481484079,\"totalAccepted\":201617,\"totalSubmission\":712924},{\"questionId\":\"469\",\"title\":\"Convex Polygon\",\"titleSlug\":\"convex-polygon\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":103,\"dislikes\":242,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.2%\",\"frontendQuestionId\":\"469\",\"paidOnly\":true,\"topicTags\":\"Array;Math;Geometry;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.1980402980955,\"totalAccepted\":11651,\"totalSubmission\":28984},{\"questionId\":\"903\",\"title\":\"Implement Rand10() Using Rand7()\",\"titleSlug\":\"implement-rand10-using-rand7\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1176,\"dislikes\":388,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.3%\",\"frontendQuestionId\":\"470\",\"paidOnly\":false,\"topicTags\":\"Math;Rejection Sampling;Randomized;Probability and Statistics;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":46.313492431980684,\"totalAccepted\":109724,\"totalSubmission\":236917},{\"questionId\":\"471\",\"title\":\"Encode String with Shortest Length\",\"titleSlug\":\"encode-string-with-shortest-length\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":632,\"dislikes\":54,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.6%\",\"frontendQuestionId\":\"471\",\"paidOnly\":true,\"topicTags\":\"String;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":50.589643065199255,\"totalAccepted\":32131,\"totalSubmission\":63513},{\"questionId\":\"472\",\"title\":\"Concatenated Words\",\"titleSlug\":\"concatenated-words\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":4069,\"dislikes\":293,\"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.763770153940015,\"totalAccepted\":267536,\"totalSubmission\":537612},{\"questionId\":\"473\",\"title\":\"Matchsticks to Square\",\"titleSlug\":\"matchsticks-to-square\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4039,\"dislikes\":308,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.8%\",\"frontendQuestionId\":\"473\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":41.76906618652886,\"totalAccepted\":214352,\"totalSubmission\":513185},{\"questionId\":\"474\",\"title\":\"Ones and Zeroes\",\"titleSlug\":\"ones-and-zeroes\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6089,\"dislikes\":509,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.2%\",\"frontendQuestionId\":\"474\",\"paidOnly\":false,\"topicTags\":\"Array;String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":53.23987652965363,\"totalAccepted\":349093,\"totalSubmission\":655701},{\"questionId\":\"475\",\"title\":\"Heaters\",\"titleSlug\":\"heaters\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2365,\"dislikes\":1200,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.7%\",\"frontendQuestionId\":\"475\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Binary Search;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":41.733488505987516,\"totalAccepted\":169616,\"totalSubmission\":406428},{\"questionId\":\"476\",\"title\":\"Number Complement\",\"titleSlug\":\"number-complement\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":3236,\"dislikes\":145,\"categoryTitle\":\"Algorithms\",\"acRate\":\"70.4%\",\"frontendQuestionId\":\"476\",\"paidOnly\":false,\"topicTags\":\"Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":70.43155683537758,\"totalAccepted\":551546,\"totalSubmission\":783095},{\"questionId\":\"477\",\"title\":\"Total Hamming Distance\",\"titleSlug\":\"total-hamming-distance\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2309,\"dislikes\":97,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.8%\",\"frontendQuestionId\":\"477\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":54.77902642941835,\"totalAccepted\":135364,\"totalSubmission\":247110},{\"questionId\":\"915\",\"title\":\"Generate Random Point in a Circle\",\"titleSlug\":\"generate-random-point-in-a-circle\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":482,\"dislikes\":784,\"categoryTitle\":\"Algorithms\",\"acRate\":\"42.8%\",\"frontendQuestionId\":\"478\",\"paidOnly\":false,\"topicTags\":\"Math;Geometry;Rejection Sampling;Randomized;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":42.75008274362086,\"totalAccepted\":54249,\"totalSubmission\":126898},{\"questionId\":\"479\",\"title\":\"Largest Palindrome Product\",\"titleSlug\":\"largest-palindrome-product\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":194,\"dislikes\":1569,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.5%\",\"frontendQuestionId\":\"479\",\"paidOnly\":false,\"topicTags\":\"Math;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.518551842812634,\"totalAccepted\":34248,\"totalSubmission\":88913},{\"questionId\":\"480\",\"title\":\"Sliding Window Median\",\"titleSlug\":\"sliding-window-median\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":3586,\"dislikes\":241,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.9%\",\"frontendQuestionId\":\"480\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sliding Window;Heap (Priority Queue);\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":38.946711000237755,\"totalAccepted\":219501,\"totalSubmission\":563596},{\"questionId\":\"481\",\"title\":\"Magical String\",\"titleSlug\":\"magical-string\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":383,\"dislikes\":1425,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.0%\",\"frontendQuestionId\":\"481\",\"paidOnly\":false,\"topicTags\":\"Two Pointers;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":54.99729503762357,\"totalAccepted\":55912,\"totalSubmission\":101664},{\"questionId\":\"482\",\"title\":\"License Key Formatting\",\"titleSlug\":\"license-key-formatting\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1208,\"dislikes\":1472,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.9%\",\"frontendQuestionId\":\"482\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":45.88645446268493,\"totalAccepted\":359848,\"totalSubmission\":784214},{\"questionId\":\"483\",\"title\":\"Smallest Good Base\",\"titleSlug\":\"smallest-good-base\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":427,\"dislikes\":540,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.9%\",\"frontendQuestionId\":\"483\",\"paidOnly\":false,\"topicTags\":\"Math;Binary Search;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":45.877630564726076,\"totalAccepted\":31544,\"totalSubmission\":68758},{\"questionId\":\"484\",\"title\":\"Find Permutation\",\"titleSlug\":\"find-permutation\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":728,\"dislikes\":151,\"categoryTitle\":\"Algorithms\",\"acRate\":\"66.9%\",\"frontendQuestionId\":\"484\",\"paidOnly\":true,\"topicTags\":\"Array;String;Stack;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":66.86304750154225,\"totalAccepted\":43354,\"totalSubmission\":64840},{\"questionId\":\"485\",\"title\":\"Max Consecutive Ones\",\"titleSlug\":\"max-consecutive-ones\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":6895,\"dislikes\":500,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.0%\",\"frontendQuestionId\":\"485\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.96435629189752,\"totalAccepted\":2246248,\"totalSubmission\":3457665},{\"questionId\":\"486\",\"title\":\"Predict the Winner\",\"titleSlug\":\"predict-the-winner\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6171,\"dislikes\":296,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.2%\",\"frontendQuestionId\":\"486\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Dynamic Programming;Recursion;Game Theory;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":56.179710111303805,\"totalAccepted\":290578,\"totalSubmission\":517231},{\"questionId\":\"487\",\"title\":\"Max Consecutive Ones II\",\"titleSlug\":\"max-consecutive-ones-ii\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":1607,\"dislikes\":27,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.0%\",\"frontendQuestionId\":\"487\",\"paidOnly\":true,\"topicTags\":\"Array;Dynamic Programming;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":52.000475495024276,\"totalAccepted\":183726,\"totalSubmission\":353316},{\"questionId\":\"488\",\"title\":\"Zuma Game\",\"titleSlug\":\"zuma-game\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":496,\"dislikes\":516,\"categoryTitle\":\"Algorithms\",\"acRate\":\"29.8%\",\"frontendQuestionId\":\"488\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Stack;Breadth-First Search;Memoization;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":29.828019712360454,\"totalAccepted\":29658,\"totalSubmission\":99430},{\"questionId\":\"865\",\"title\":\"Robot Room Cleaner\",\"titleSlug\":\"robot-room-cleaner\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":2898,\"dislikes\":193,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.0%\",\"frontendQuestionId\":\"489\",\"paidOnly\":true,\"topicTags\":\"Backtracking;Interactive;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":77.96789394760015,\"totalAccepted\":211615,\"totalSubmission\":271413},{\"questionId\":\"490\",\"title\":\"The Maze\",\"titleSlug\":\"the-maze\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":1930,\"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.38508654358886,\"totalAccepted\":209497,\"totalSubmission\":346935},{\"questionId\":\"491\",\"title\":\"Non-decreasing Subsequences\",\"titleSlug\":\"non-decreasing-subsequences\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3827,\"dislikes\":239,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.6%\",\"frontendQuestionId\":\"491\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Backtracking;Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":62.60484560117433,\"totalAccepted\":210259,\"totalSubmission\":335851},{\"questionId\":\"492\",\"title\":\"Construct the Rectangle\",\"titleSlug\":\"construct-the-rectangle\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":800,\"dislikes\":394,\"categoryTitle\":\"Algorithms\",\"acRate\":\"63.6%\",\"frontendQuestionId\":\"492\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":63.55567738565772,\"totalAccepted\":171572,\"totalSubmission\":269956},{\"questionId\":\"493\",\"title\":\"Reverse Pairs\",\"titleSlug\":\"reverse-pairs\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":7025,\"dislikes\":300,\"categoryTitle\":\"Algorithms\",\"acRate\":\"34.0%\",\"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.04805644580636,\"totalAccepted\":358443,\"totalSubmission\":1052760},{\"questionId\":\"494\",\"title\":\"Target Sum\",\"titleSlug\":\"target-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":12407,\"dislikes\":416,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.1%\",\"frontendQuestionId\":\"494\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Backtracking;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":52.09162716762029,\"totalAccepted\":1079115,\"totalSubmission\":2071570},{\"questionId\":\"495\",\"title\":\"Teemo Attacking\",\"titleSlug\":\"teemo-attacking\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1369,\"dislikes\":158,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.6%\",\"frontendQuestionId\":\"495\",\"paidOnly\":false,\"topicTags\":\"Array;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":57.61289851900489,\"totalAccepted\":221115,\"totalSubmission\":383795},{\"questionId\":\"496\",\"title\":\"Next Greater Element I\",\"titleSlug\":\"next-greater-element-i\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":9903,\"dislikes\":1111,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.0%\",\"frontendQuestionId\":\"496\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Stack;Monotonic Stack;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":76.02372948857912,\"totalAccepted\":1408755,\"totalSubmission\":1853048},{\"questionId\":\"914\",\"title\":\"Random Point in Non-overlapping Rectangles\",\"titleSlug\":\"random-point-in-non-overlapping-rectangles\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":523,\"dislikes\":689,\"categoryTitle\":\"Algorithms\",\"acRate\":\"39.6%\",\"frontendQuestionId\":\"497\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Binary Search;Reservoir Sampling;Prefix Sum;Ordered Set;Randomized;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":39.64354276067616,\"totalAccepted\":53072,\"totalSubmission\":133870},{\"questionId\":\"498\",\"title\":\"Diagonal Traverse\",\"titleSlug\":\"diagonal-traverse\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4331,\"dislikes\":785,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.1%\",\"frontendQuestionId\":\"498\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":67.11188856526093,\"totalAccepted\":558987,\"totalSubmission\":832918},{\"questionId\":\"499\",\"title\":\"The Maze III\",\"titleSlug\":\"the-maze-iii\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":521,\"dislikes\":78,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.3%\",\"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.333510163416875,\"totalAccepted\":40447,\"totalSubmission\":77287},{\"questionId\":\"500\",\"title\":\"Keyboard Row\",\"titleSlug\":\"keyboard-row\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1830,\"dislikes\":1158,\"categoryTitle\":\"Algorithms\",\"acRate\":\"73.8%\",\"frontendQuestionId\":\"500\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":73.76990959481755,\"totalAccepted\":328191,\"totalSubmission\":444885},{\"questionId\":\"937\",\"title\":\"Online Stock Span\",\"titleSlug\":\"online-stock-span\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":7262,\"dislikes\":506,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.9%\",\"frontendQuestionId\":\"901\",\"paidOnly\":false,\"topicTags\":\"Stack;Design;Monotonic Stack;Data Stream;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.9394665075553,\"totalAccepted\":597346,\"totalSubmission\":866479},{\"questionId\":\"938\",\"title\":\"Numbers At Most N Given Digit Set\",\"titleSlug\":\"numbers-at-most-n-given-digit-set\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1472,\"dislikes\":98,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.9%\",\"frontendQuestionId\":\"902\",\"paidOnly\":false,\"topicTags\":\"Array;Math;String;Binary Search;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":44.866014809966046,\"totalAccepted\":54833,\"totalSubmission\":122215},{\"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.3%\",\"frontendQuestionId\":\"903\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":56.332194820213545,\"totalAccepted\":20946,\"totalSubmission\":37183},{\"questionId\":\"940\",\"title\":\"Fruit Into Baskets\",\"titleSlug\":\"fruit-into-baskets\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6220,\"dislikes\":595,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.9%\",\"frontendQuestionId\":\"904\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":50.90596207289231,\"totalAccepted\":821188,\"totalSubmission\":1613149},{\"questionId\":\"941\",\"title\":\"Sort Array By Parity\",\"titleSlug\":\"sort-array-by-parity\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":5701,\"dislikes\":157,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.5%\",\"frontendQuestionId\":\"905\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":76.50859765560905,\"totalAccepted\":1016507,\"totalSubmission\":1328618},{\"questionId\":\"942\",\"title\":\"Super Palindromes\",\"titleSlug\":\"super-palindromes\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":376,\"dislikes\":423,\"categoryTitle\":\"Algorithms\",\"acRate\":\"39.9%\",\"frontendQuestionId\":\"906\",\"paidOnly\":false,\"topicTags\":\"Math;String;Enumeration;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":39.92871364326191,\"totalAccepted\":28678,\"totalSubmission\":71823},{\"questionId\":\"943\",\"title\":\"Sum of Subarray Minimums\",\"titleSlug\":\"sum-of-subarray-minimums\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":9246,\"dislikes\":740,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.5%\",\"frontendQuestionId\":\"907\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Stack;Monotonic Stack;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":38.45230095593176,\"totalAccepted\":443480,\"totalSubmission\":1153325},{\"questionId\":\"944\",\"title\":\"Smallest Range I\",\"titleSlug\":\"smallest-range-i\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":794,\"dislikes\":2089,\"categoryTitle\":\"Algorithms\",\"acRate\":\"73.5%\",\"frontendQuestionId\":\"908\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":73.4504854254888,\"totalAccepted\":125059,\"totalSubmission\":170263},{\"questionId\":\"945\",\"title\":\"Snakes and Ladders\",\"titleSlug\":\"snakes-and-ladders\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3654,\"dislikes\":1354,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.0%\",\"frontendQuestionId\":\"909\",\"paidOnly\":false,\"topicTags\":\"Array;Breadth-First Search;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":48.041993486324856,\"totalAccepted\":363024,\"totalSubmission\":755638},{\"questionId\":\"946\",\"title\":\"Smallest Range II\",\"titleSlug\":\"smallest-range-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1715,\"dislikes\":468,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.8%\",\"frontendQuestionId\":\"910\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":37.83540964469038,\"totalAccepted\":66115,\"totalSubmission\":174747},{\"questionId\":\"947\",\"title\":\"Online Election\",\"titleSlug\":\"online-election\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1090,\"dislikes\":684,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.8%\",\"frontendQuestionId\":\"911\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Binary Search;Design;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":52.78981217372585,\"totalAccepted\":78471,\"totalSubmission\":148648},{\"questionId\":\"948\",\"title\":\"Sort an Array\",\"titleSlug\":\"sort-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":7242,\"dislikes\":844,\"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.89697876476365,\"totalAccepted\":1117421,\"totalSubmission\":1999072},{\"questionId\":\"949\",\"title\":\"Cat and Mouse\",\"titleSlug\":\"cat-and-mouse\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1016,\"dislikes\":181,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.1%\",\"frontendQuestionId\":\"913\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Graph Theory;Topological Sort;Memoization;Game Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":35.11149360324718,\"totalAccepted\":27334,\"totalSubmission\":77851},{\"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\":1908,\"dislikes\":580,\"categoryTitle\":\"Algorithms\",\"acRate\":\"30.2%\",\"frontendQuestionId\":\"914\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Counting;Number Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":30.223390527537074,\"totalAccepted\":157859,\"totalSubmission\":522310},{\"questionId\":\"951\",\"title\":\"Partition Array into Disjoint Intervals\",\"titleSlug\":\"partition-array-into-disjoint-intervals\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1772,\"dislikes\":83,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.4%\",\"frontendQuestionId\":\"915\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.42461557064834,\"totalAccepted\":98096,\"totalSubmission\":198476},{\"questionId\":\"952\",\"title\":\"Word Subsets\",\"titleSlug\":\"word-subsets\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3540,\"dislikes\":317,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.9%\",\"frontendQuestionId\":\"916\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.91531336663454,\"totalAccepted\":265742,\"totalSubmission\":475258},{\"questionId\":\"953\",\"title\":\"Reverse Only Letters\",\"titleSlug\":\"reverse-only-letters\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2455,\"dislikes\":87,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.4%\",\"frontendQuestionId\":\"917\",\"paidOnly\":false,\"topicTags\":\"Two Pointers;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.36653102917043,\"totalAccepted\":326616,\"totalSubmission\":477743},{\"questionId\":\"954\",\"title\":\"Maximum Sum Circular Subarray\",\"titleSlug\":\"maximum-sum-circular-subarray\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":7338,\"dislikes\":346,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.9%\",\"frontendQuestionId\":\"918\",\"paidOnly\":false,\"topicTags\":\"Array;Divide and Conquer;Dynamic Programming;Queue;Monotonic Queue;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.89901703517853,\"totalAccepted\":416059,\"totalSubmission\":833802},{\"questionId\":\"955\",\"title\":\"Complete Binary Tree Inserter\",\"titleSlug\":\"complete-binary-tree-inserter\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1155,\"dislikes\":120,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.0%\",\"frontendQuestionId\":\"919\",\"paidOnly\":false,\"topicTags\":\"Tree;Breadth-First Search;Design;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":65.01067698938151,\"totalAccepted\":66673,\"totalSubmission\":102557},{\"questionId\":\"956\",\"title\":\"Number of Music Playlists\",\"titleSlug\":\"number-of-music-playlists\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2469,\"dislikes\":206,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.0%\",\"frontendQuestionId\":\"920\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Combinatorics;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":60.02485187374036,\"totalAccepted\":79222,\"totalSubmission\":131982},{\"questionId\":\"957\",\"title\":\"Minimum Add to Make Parentheses Valid\",\"titleSlug\":\"minimum-add-to-make-parentheses-valid\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4956,\"dislikes\":249,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.4%\",\"frontendQuestionId\":\"921\",\"paidOnly\":false,\"topicTags\":\"String;Stack;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":74.40648959910312,\"totalAccepted\":700859,\"totalSubmission\":941933},{\"questionId\":\"958\",\"title\":\"Sort Array By Parity II\",\"titleSlug\":\"sort-array-by-parity-ii\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2829,\"dislikes\":104,\"categoryTitle\":\"Algorithms\",\"acRate\":\"71.2%\",\"frontendQuestionId\":\"922\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":71.24643118500119,\"totalAccepted\":345619,\"totalSubmission\":485102},{\"questionId\":\"959\",\"title\":\"3Sum With Multiplicity\",\"titleSlug\":\"3sum-with-multiplicity\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2683,\"dislikes\":332,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.3%\",\"frontendQuestionId\":\"923\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Two Pointers;Sorting;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":46.25936779767083,\"totalAccepted\":121231,\"totalSubmission\":262068},{\"questionId\":\"960\",\"title\":\"Minimize Malware Spread\",\"titleSlug\":\"minimize-malware-spread\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1123,\"dislikes\":654,\"categoryTitle\":\"Algorithms\",\"acRate\":\"43.1%\",\"frontendQuestionId\":\"924\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":43.06945637786499,\"totalAccepted\":74186,\"totalSubmission\":172250},{\"questionId\":\"961\",\"title\":\"Long Pressed Name\",\"titleSlug\":\"long-pressed-name\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2598,\"dislikes\":409,\"categoryTitle\":\"Algorithms\",\"acRate\":\"32.9%\",\"frontendQuestionId\":\"925\",\"paidOnly\":false,\"topicTags\":\"Two Pointers;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":32.85925845043028,\"totalAccepted\":192595,\"totalSubmission\":586122},{\"questionId\":\"962\",\"title\":\"Flip String to Monotone Increasing\",\"titleSlug\":\"flip-string-to-monotone-increasing\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4590,\"dislikes\":185,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.9%\",\"frontendQuestionId\":\"926\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.876049001364954,\"totalAccepted\":217140,\"totalSubmission\":350928},{\"questionId\":\"963\",\"title\":\"Three Equal Parts\",\"titleSlug\":\"three-equal-parts\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":856,\"dislikes\":126,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.3%\",\"frontendQuestionId\":\"927\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":41.29737729178656,\"totalAccepted\":35161,\"totalSubmission\":85141},{\"questionId\":\"964\",\"title\":\"Minimize Malware Spread II\",\"titleSlug\":\"minimize-malware-spread-ii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":708,\"dislikes\":92,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.5%\",\"frontendQuestionId\":\"928\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":45.52685981364413,\"totalAccepted\":30391,\"totalSubmission\":66754},{\"questionId\":\"965\",\"title\":\"Unique Email Addresses\",\"titleSlug\":\"unique-email-addresses\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2815,\"dislikes\":363,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.8%\",\"frontendQuestionId\":\"929\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":67.84953851348816,\"totalAccepted\":578686,\"totalSubmission\":852896},{\"questionId\":\"966\",\"title\":\"Binary Subarrays With Sum\",\"titleSlug\":\"binary-subarrays-with-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4882,\"dislikes\":169,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.6%\",\"frontendQuestionId\":\"930\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sliding Window;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.64384837751341,\"totalAccepted\":514332,\"totalSubmission\":749276},{\"questionId\":\"967\",\"title\":\"Minimum Falling Path Sum\",\"titleSlug\":\"minimum-falling-path-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":7005,\"dislikes\":175,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.8%\",\"frontendQuestionId\":\"931\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":60.81125098551615,\"totalAccepted\":657157,\"totalSubmission\":1080651},{\"questionId\":\"968\",\"title\":\"Beautiful Array\",\"titleSlug\":\"beautiful-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1160,\"dislikes\":1602,\"categoryTitle\":\"Algorithms\",\"acRate\":\"69.1%\",\"frontendQuestionId\":\"932\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Divide and Conquer;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":69.08810242673266,\"totalAccepted\":60866,\"totalSubmission\":88099},{\"questionId\":\"969\",\"title\":\"Number of Recent Calls\",\"titleSlug\":\"number-of-recent-calls\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":859,\"dislikes\":1209,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.4%\",\"frontendQuestionId\":\"933\",\"paidOnly\":false,\"topicTags\":\"Design;Queue;Data Stream;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":78.36056749702298,\"totalAccepted\":521168,\"totalSubmission\":665089},{\"questionId\":\"971\",\"title\":\"Shortest Bridge\",\"titleSlug\":\"shortest-bridge\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":5788,\"dislikes\":221,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.4%\",\"frontendQuestionId\":\"934\",\"paidOnly\":false,\"topicTags\":\"Array;Depth-First Search;Breadth-First Search;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.371824679238784,\"totalAccepted\":275794,\"totalSubmission\":464516},{\"questionId\":\"972\",\"title\":\"Knight Dialer\",\"titleSlug\":\"knight-dialer\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3204,\"dislikes\":452,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.8%\",\"frontendQuestionId\":\"935\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.836124898835884,\"totalAccepted\":200946,\"totalSubmission\":324964},{\"questionId\":\"973\",\"title\":\"Stamping The Sequence\",\"titleSlug\":\"stamping-the-sequence\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1580,\"dislikes\":222,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.3%\",\"frontendQuestionId\":\"936\",\"paidOnly\":false,\"topicTags\":\"String;Stack;Greedy;Queue;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":62.277305907051094,\"totalAccepted\":64670,\"totalSubmission\":103842},{\"questionId\":\"974\",\"title\":\"Reorder Data in Log Files\",\"titleSlug\":\"reorder-data-in-log-files\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2198,\"dislikes\":4424,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.8%\",\"frontendQuestionId\":\"937\",\"paidOnly\":false,\"topicTags\":\"Array;String;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":56.83035424428668,\"totalAccepted\":411383,\"totalSubmission\":723879},{\"questionId\":\"975\",\"title\":\"Range Sum of BST\",\"titleSlug\":\"range-sum-of-bst\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":7262,\"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.58661898581421,\"totalAccepted\":1345612,\"totalSubmission\":1536322},{\"questionId\":\"976\",\"title\":\"Minimum Area Rectangle\",\"titleSlug\":\"minimum-area-rectangle\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2108,\"dislikes\":298,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.4%\",\"frontendQuestionId\":\"939\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Geometry;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.38423924312714,\"totalAccepted\":178957,\"totalSubmission\":323119},{\"questionId\":\"977\",\"title\":\"Distinct Subsequences II\",\"titleSlug\":\"distinct-subsequences-ii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1833,\"dislikes\":40,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.1%\",\"frontendQuestionId\":\"940\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":44.09531357860558,\"totalAccepted\":51740,\"totalSubmission\":117337},{\"questionId\":\"978\",\"title\":\"Valid Mountain Array\",\"titleSlug\":\"valid-mountain-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":3158,\"dislikes\":211,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.2%\",\"frontendQuestionId\":\"941\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":35.16554955839673,\"totalAccepted\":561474,\"totalSubmission\":1596666},{\"questionId\":\"979\",\"title\":\"DI String Match\",\"titleSlug\":\"di-string-match\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2615,\"dislikes\":1081,\"categoryTitle\":\"Algorithms\",\"acRate\":\"81.0%\",\"frontendQuestionId\":\"942\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;String;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":81.00537832747608,\"totalAccepted\":208600,\"totalSubmission\":257514},{\"questionId\":\"980\",\"title\":\"Find the Shortest Superstring\",\"titleSlug\":\"find-the-shortest-superstring\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1523,\"dislikes\":152,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.3%\",\"frontendQuestionId\":\"943\",\"paidOnly\":false,\"topicTags\":\"Array;String;Dynamic Programming;Bit Manipulation;Bitmask;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":45.267447913360336,\"totalAccepted\":35654,\"totalSubmission\":78763},{\"questionId\":\"981\",\"title\":\"Delete Columns to Make Sorted\",\"titleSlug\":\"delete-columns-to-make-sorted\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2066,\"dislikes\":3018,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.1%\",\"frontendQuestionId\":\"944\",\"paidOnly\":false,\"topicTags\":\"Array;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":78.08614791710258,\"totalAccepted\":320945,\"totalSubmission\":411014},{\"questionId\":\"982\",\"title\":\"Minimum Increment to Make Array Unique\",\"titleSlug\":\"minimum-increment-to-make-array-unique\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2782,\"dislikes\":86,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.6%\",\"frontendQuestionId\":\"945\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":60.639326788218796,\"totalAccepted\":270224,\"totalSubmission\":445625},{\"questionId\":\"983\",\"title\":\"Validate Stack Sequences\",\"titleSlug\":\"validate-stack-sequences\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6117,\"dislikes\":132,\"categoryTitle\":\"Algorithms\",\"acRate\":\"70.3%\",\"frontendQuestionId\":\"946\",\"paidOnly\":false,\"topicTags\":\"Array;Stack;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":70.3330539320073,\"totalAccepted\":372553,\"totalSubmission\":529700},{\"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\":6454,\"dislikes\":709,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.9%\",\"frontendQuestionId\":\"947\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Depth-First Search;Union-Find;Graph Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":62.86467539095707,\"totalAccepted\":401547,\"totalSubmission\":638749},{\"questionId\":\"985\",\"title\":\"Bag of Tokens\",\"titleSlug\":\"bag-of-tokens\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3478,\"dislikes\":547,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.6%\",\"frontendQuestionId\":\"948\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.573141990380726,\"totalAccepted\":266675,\"totalSubmission\":447643},{\"questionId\":\"986\",\"title\":\"Largest Time for Given Digits\",\"titleSlug\":\"largest-time-for-given-digits\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":746,\"dislikes\":1072,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.9%\",\"frontendQuestionId\":\"949\",\"paidOnly\":false,\"topicTags\":\"Array;String;Backtracking;Enumeration;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":35.89314830875976,\"totalAccepted\":103462,\"totalSubmission\":288250},{\"questionId\":\"987\",\"title\":\"Reveal Cards In Increasing Order\",\"titleSlug\":\"reveal-cards-in-increasing-order\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3705,\"dislikes\":715,\"categoryTitle\":\"Algorithms\",\"acRate\":\"83.5%\",\"frontendQuestionId\":\"950\",\"paidOnly\":false,\"topicTags\":\"Array;Queue;Sorting;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":83.5221158747239,\"totalAccepted\":235960,\"totalSubmission\":282512},{\"questionId\":\"988\",\"title\":\"Flip Equivalent Binary Trees\",\"titleSlug\":\"flip-equivalent-binary-trees\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2890,\"dislikes\":124,\"categoryTitle\":\"Algorithms\",\"acRate\":\"69.5%\",\"frontendQuestionId\":\"951\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":69.51951370105428,\"totalAccepted\":269100,\"totalSubmission\":387086},{\"questionId\":\"989\",\"title\":\"Largest Component Size by Common Factor\",\"titleSlug\":\"largest-component-size-by-common-factor\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1727,\"dislikes\":95,\"categoryTitle\":\"Algorithms\",\"acRate\":\"42.8%\",\"frontendQuestionId\":\"952\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Union-Find;Number Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":42.83021151114876,\"totalAccepted\":67249,\"totalSubmission\":157012},{\"questionId\":\"990\",\"title\":\"Verifying an Alien Dictionary\",\"titleSlug\":\"verifying-an-alien-dictionary\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":5094,\"dislikes\":1683,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.9%\",\"frontendQuestionId\":\"953\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.925198437842006,\"totalAccepted\":582537,\"totalSubmission\":1041636},{\"questionId\":\"991\",\"title\":\"Array of Doubled Pairs\",\"titleSlug\":\"array-of-doubled-pairs\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1576,\"dislikes\":186,\"categoryTitle\":\"Algorithms\",\"acRate\":\"39.8%\",\"frontendQuestionId\":\"954\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":39.754349818583975,\"totalAccepted\":104965,\"totalSubmission\":264034},{\"questionId\":\"992\",\"title\":\"Delete Columns to Make Sorted II\",\"titleSlug\":\"delete-columns-to-make-sorted-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1045,\"dislikes\":136,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.7%\",\"frontendQuestionId\":\"955\",\"paidOnly\":false,\"topicTags\":\"Array;String;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.66963532181406,\"totalAccepted\":89457,\"totalSubmission\":180104},{\"questionId\":\"993\",\"title\":\"Tallest Billboard\",\"titleSlug\":\"tallest-billboard\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2487,\"dislikes\":63,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.8%\",\"frontendQuestionId\":\"956\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":51.82075692092045,\"totalAccepted\":70981,\"totalSubmission\":136974},{\"questionId\":\"994\",\"title\":\"Prison Cells After N Days\",\"titleSlug\":\"prison-cells-after-n-days\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1564,\"dislikes\":1781,\"categoryTitle\":\"Algorithms\",\"acRate\":\"39.2%\",\"frontendQuestionId\":\"957\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":39.161626981222874,\"totalAccepted\":176588,\"totalSubmission\":450921},{\"questionId\":\"998\",\"title\":\"Check Completeness of a Binary Tree\",\"titleSlug\":\"check-completeness-of-a-binary-tree\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4548,\"dislikes\":62,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.1%\",\"frontendQuestionId\":\"958\",\"paidOnly\":false,\"topicTags\":\"Tree;Breadth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.097396997970705,\"totalAccepted\":320052,\"totalSubmission\":541567},{\"questionId\":\"999\",\"title\":\"Regions Cut By Slashes\",\"titleSlug\":\"regions-cut-by-slashes\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3992,\"dislikes\":874,\"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.50922300664878,\"totalAccepted\":150850,\"totalSubmission\":194621},{\"questionId\":\"1000\",\"title\":\"Delete Columns to Make Sorted III\",\"titleSlug\":\"delete-columns-to-make-sorted-iii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":871,\"dislikes\":31,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.6%\",\"frontendQuestionId\":\"960\",\"paidOnly\":false,\"topicTags\":\"Array;String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.61401798288377,\"totalAccepted\":73732,\"totalSubmission\":101540},{\"questionId\":\"1001\",\"title\":\"N-Repeated Element in Size 2N Array\",\"titleSlug\":\"n-repeated-element-in-size-2n-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1852,\"dislikes\":348,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.9%\",\"frontendQuestionId\":\"961\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":79.87325371502124,\"totalAccepted\":470365,\"totalSubmission\":588890},{\"questionId\":\"1002\",\"title\":\"Maximum Width Ramp\",\"titleSlug\":\"maximum-width-ramp\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2860,\"dislikes\":98,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.9%\",\"frontendQuestionId\":\"962\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Stack;Monotonic Stack;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.87446749460422,\"totalAccepted\":207363,\"totalSubmission\":371123},{\"questionId\":\"1003\",\"title\":\"Minimum Area Rectangle II\",\"titleSlug\":\"minimum-area-rectangle-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":413,\"dislikes\":487,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.9%\",\"frontendQuestionId\":\"963\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Geometry;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.858777741741186,\"totalAccepted\":36168,\"totalSubmission\":64749},{\"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.5%\",\"frontendQuestionId\":\"964\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Memoization;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":48.490960989533775,\"totalAccepted\":12741,\"totalSubmission\":26275},{\"questionId\":\"1005\",\"title\":\"Univalued Binary Tree\",\"titleSlug\":\"univalued-binary-tree\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1984,\"dislikes\":68,\"categoryTitle\":\"Algorithms\",\"acRate\":\"73.0%\",\"frontendQuestionId\":\"965\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Breadth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.98350999306075,\"totalAccepted\":275558,\"totalSubmission\":377562},{\"questionId\":\"1006\",\"title\":\"Vowel Spellchecker\",\"titleSlug\":\"vowel-spellchecker\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":853,\"dislikes\":1003,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.4%\",\"frontendQuestionId\":\"966\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.404686355870155,\"totalAccepted\":140882,\"totalSubmission\":229432},{\"questionId\":\"1007\",\"title\":\"Numbers With Same Consecutive Differences\",\"titleSlug\":\"numbers-with-same-consecutive-differences\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2888,\"dislikes\":200,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.2%\",\"frontendQuestionId\":\"967\",\"paidOnly\":false,\"topicTags\":\"Backtracking;Breadth-First Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.16688386007456,\"totalAccepted\":156639,\"totalSubmission\":264741},{\"questionId\":\"1008\",\"title\":\"Binary Tree Cameras\",\"titleSlug\":\"binary-tree-cameras\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":5664,\"dislikes\":89,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.8%\",\"frontendQuestionId\":\"968\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.83104497455959,\"totalAccepted\":187072,\"totalSubmission\":391110},{\"questionId\":\"1009\",\"title\":\"Pancake Sorting\",\"titleSlug\":\"pancake-sorting\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1601,\"dislikes\":1561,\"categoryTitle\":\"Algorithms\",\"acRate\":\"71.7%\",\"frontendQuestionId\":\"969\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":71.7433347147396,\"totalAccepted\":114257,\"totalSubmission\":159258},{\"questionId\":\"1010\",\"title\":\"Powerful Integers\",\"titleSlug\":\"powerful-integers\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":422,\"dislikes\":86,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.6%\",\"frontendQuestionId\":\"970\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Math;Enumeration;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":44.56499090113493,\"totalAccepted\":64162,\"totalSubmission\":143974},{\"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\":\"51.9%\",\"frontendQuestionId\":\"971\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":51.857858884342924,\"totalAccepted\":49559,\"totalSubmission\":95567},{\"questionId\":\"1012\",\"title\":\"Equal Rational Numbers\",\"titleSlug\":\"equal-rational-numbers\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":107,\"dislikes\":218,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.1%\",\"frontendQuestionId\":\"972\",\"paidOnly\":false,\"topicTags\":\"Math;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":46.090080132633325,\"totalAccepted\":10008,\"totalSubmission\":21714},{\"questionId\":\"1014\",\"title\":\"K Closest Points to Origin\",\"titleSlug\":\"k-closest-points-to-origin\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":9090,\"dislikes\":339,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.9%\",\"frontendQuestionId\":\"973\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Divide and Conquer;Geometry;Sorting;Heap (Priority Queue);Quickselect;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":68.90525532399813,\"totalAccepted\":1720265,\"totalSubmission\":2496567},{\"questionId\":\"1016\",\"title\":\"Subarray Sums Divisible by K\",\"titleSlug\":\"subarray-sums-divisible-by-k\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":7906,\"dislikes\":345,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.2%\",\"frontendQuestionId\":\"974\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":56.21036426447286,\"totalAccepted\":486341,\"totalSubmission\":865213},{\"questionId\":\"1017\",\"title\":\"Odd Even Jump\",\"titleSlug\":\"odd-even-jump\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2116,\"dislikes\":532,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.2%\",\"frontendQuestionId\":\"975\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Stack;Sorting;Monotonic Stack;Ordered Set;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":41.16725173045643,\"totalAccepted\":104021,\"totalSubmission\":252679},{\"questionId\":\"1018\",\"title\":\"Largest Perimeter Triangle\",\"titleSlug\":\"largest-perimeter-triangle\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":3402,\"dislikes\":444,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.1%\",\"frontendQuestionId\":\"976\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":62.09891533576952,\"totalAccepted\":427556,\"totalSubmission\":688508},{\"questionId\":\"1019\",\"title\":\"Squares of a Sorted Array\",\"titleSlug\":\"squares-of-a-sorted-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":10265,\"dislikes\":279,\"categoryTitle\":\"Algorithms\",\"acRate\":\"73.7%\",\"frontendQuestionId\":\"977\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":73.69889231165178,\"totalAccepted\":2611581,\"totalSubmission\":3543585},{\"questionId\":\"1020\",\"title\":\"Longest Turbulent Subarray\",\"titleSlug\":\"longest-turbulent-subarray\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2122,\"dislikes\":262,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.1%\",\"frontendQuestionId\":\"978\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.05247350944354,\"totalAccepted\":139153,\"totalSubmission\":283684},{\"questionId\":\"1021\",\"title\":\"Distribute Coins in Binary Tree\",\"titleSlug\":\"distribute-coins-in-binary-tree\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":6087,\"dislikes\":249,\"categoryTitle\":\"Algorithms\",\"acRate\":\"77.3%\",\"frontendQuestionId\":\"979\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":77.28379379697259,\"totalAccepted\":226331,\"totalSubmission\":292857},{\"questionId\":\"1022\",\"title\":\"Unique Paths III\",\"titleSlug\":\"unique-paths-iii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":5492,\"dislikes\":200,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.8%\",\"frontendQuestionId\":\"980\",\"paidOnly\":false,\"topicTags\":\"Array;Backtracking;Bit Manipulation;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":82.82047673273027,\"totalAccepted\":258920,\"totalSubmission\":312628},{\"questionId\":\"1023\",\"title\":\"Time Based Key-Value Store\",\"titleSlug\":\"time-based-key-value-store\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":5286,\"dislikes\":731,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.9%\",\"frontendQuestionId\":\"981\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Binary Search;Design;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.85824618288187,\"totalAccepted\":730707,\"totalSubmission\":1465569},{\"questionId\":\"1024\",\"title\":\"Triples with Bitwise AND Equal To Zero\",\"titleSlug\":\"triples-with-bitwise-and-equal-to-zero\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":479,\"dislikes\":222,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.0%\",\"frontendQuestionId\":\"982\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":59.96172758762687,\"totalAccepted\":24754,\"totalSubmission\":41283},{\"questionId\":\"1025\",\"title\":\"Minimum Cost For Tickets\",\"titleSlug\":\"minimum-cost-for-tickets\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":8818,\"dislikes\":191,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.4%\",\"frontendQuestionId\":\"983\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":67.41700129274348,\"totalAccepted\":471439,\"totalSubmission\":699288},{\"questionId\":\"1026\",\"title\":\"String Without AAA or BBB\",\"titleSlug\":\"string-without-aaa-or-bbb\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":875,\"dislikes\":377,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.1%\",\"frontendQuestionId\":\"984\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":45.131381298051664,\"totalAccepted\":60991,\"totalSubmission\":135140},{\"questionId\":\"1027\",\"title\":\"Sum of Even Numbers After Queries\",\"titleSlug\":\"sum-of-even-numbers-after-queries\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2140,\"dislikes\":323,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.8%\",\"frontendQuestionId\":\"985\",\"paidOnly\":false,\"topicTags\":\"Array;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.8219495171707,\"totalAccepted\":155795,\"totalSubmission\":226374},{\"questionId\":\"1028\",\"title\":\"Interval List Intersections\",\"titleSlug\":\"interval-list-intersections\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":5926,\"dislikes\":131,\"categoryTitle\":\"Algorithms\",\"acRate\":\"73.0%\",\"frontendQuestionId\":\"986\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sweep Line;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.98794136575634,\"totalAccepted\":569319,\"totalSubmission\":780019},{\"questionId\":\"1029\",\"title\":\"Vertical Order Traversal of a Binary Tree\",\"titleSlug\":\"vertical-order-traversal-of-a-binary-tree\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":8673,\"dislikes\":4392,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.6%\",\"frontendQuestionId\":\"987\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Tree;Depth-First Search;Breadth-First Search;Sorting;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":53.57604417663134,\"totalAccepted\":712621,\"totalSubmission\":1330111},{\"questionId\":\"1030\",\"title\":\"Smallest String Starting From Leaf\",\"titleSlug\":\"smallest-string-starting-from-leaf\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2421,\"dislikes\":336,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.2%\",\"frontendQuestionId\":\"988\",\"paidOnly\":false,\"topicTags\":\"String;Backtracking;Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.1972432804962,\"totalAccepted\":221993,\"totalSubmission\":362749},{\"questionId\":\"1031\",\"title\":\"Add to Array-Form of Integer\",\"titleSlug\":\"add-to-array-form-of-integer\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":3695,\"dislikes\":317,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.5%\",\"frontendQuestionId\":\"989\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":45.47703298393947,\"totalAccepted\":339933,\"totalSubmission\":747480},{\"questionId\":\"1032\",\"title\":\"Satisfiability of Equality Equations\",\"titleSlug\":\"satisfiability-of-equality-equations\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4037,\"dislikes\":68,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.7%\",\"frontendQuestionId\":\"990\",\"paidOnly\":false,\"topicTags\":\"Array;String;Union-Find;Graph Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":51.74942539374027,\"totalAccepted\":167737,\"totalSubmission\":324134},{\"questionId\":\"1033\",\"title\":\"Broken Calculator\",\"titleSlug\":\"broken-calculator\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2842,\"dislikes\":218,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.0%\",\"frontendQuestionId\":\"991\",\"paidOnly\":false,\"topicTags\":\"Math;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":56.022867780246656,\"totalAccepted\":122787,\"totalSubmission\":219173},{\"questionId\":\"1034\",\"title\":\"Subarrays with K Different Integers\",\"titleSlug\":\"subarrays-with-k-different-integers\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":6971,\"dislikes\":121,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.0%\",\"frontendQuestionId\":\"992\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sliding Window;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":67.95021506171524,\"totalAccepted\":395103,\"totalSubmission\":581457},{\"questionId\":\"1035\",\"title\":\"Cousins in Binary Tree\",\"titleSlug\":\"cousins-in-binary-tree\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":4326,\"dislikes\":233,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.2%\",\"frontendQuestionId\":\"993\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Breadth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.23412711174453,\"totalAccepted\":349955,\"totalSubmission\":590801},{\"questionId\":\"1036\",\"title\":\"Rotting Oranges\",\"titleSlug\":\"rotting-oranges\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":15171,\"dislikes\":477,\"categoryTitle\":\"Algorithms\",\"acRate\":\"58.5%\",\"frontendQuestionId\":\"994\",\"paidOnly\":false,\"topicTags\":\"Array;Breadth-First Search;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.486655923488264,\"totalAccepted\":1628124,\"totalSubmission\":2783757},{\"questionId\":\"1037\",\"title\":\"Minimum Number of K Consecutive Bit Flips\",\"titleSlug\":\"minimum-number-of-k-consecutive-bit-flips\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2067,\"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.29562417042017,\"totalAccepted\":143146,\"totalSubmission\":229785},{\"questionId\":\"1038\",\"title\":\"Number of Squareful Arrays\",\"titleSlug\":\"number-of-squareful-arrays\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1040,\"dislikes\":49,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.4%\",\"frontendQuestionId\":\"996\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":51.3718747761301,\"totalAccepted\":50196,\"totalSubmission\":97712},{\"questionId\":\"1039\",\"title\":\"Find the Town Judge\",\"titleSlug\":\"find-the-town-judge\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":6972,\"dislikes\":634,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.7%\",\"frontendQuestionId\":\"997\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Graph Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":50.66967033175125,\"totalAccepted\":749218,\"totalSubmission\":1478633},{\"questionId\":\"1040\",\"title\":\"Maximum Binary Tree II\",\"titleSlug\":\"maximum-binary-tree-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":570,\"dislikes\":806,\"categoryTitle\":\"Algorithms\",\"acRate\":\"70.4%\",\"frontendQuestionId\":\"998\",\"paidOnly\":false,\"topicTags\":\"Tree;Binary Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":70.40360822353686,\"totalAccepted\":45580,\"totalSubmission\":64741},{\"questionId\":\"1041\",\"title\":\"Available Captures for Rook\",\"titleSlug\":\"available-captures-for-rook\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":810,\"dislikes\":648,\"categoryTitle\":\"Algorithms\",\"acRate\":\"71.7%\",\"frontendQuestionId\":\"999\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":71.65648769753314,\"totalAccepted\":89873,\"totalSubmission\":125422},{\"questionId\":\"1042\",\"title\":\"Minimum Cost to Merge Stones\",\"titleSlug\":\"minimum-cost-to-merge-stones\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2636,\"dislikes\":117,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.0%\",\"frontendQuestionId\":\"1000\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":45.97005977465484,\"totalAccepted\":52142,\"totalSubmission\":113426},{\"questionId\":\"1234\",\"title\":\"Number of Paths with Max Score\",\"titleSlug\":\"number-of-paths-with-max-score\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":551,\"dislikes\":28,\"categoryTitle\":\"Algorithms\",\"acRate\":\"42.4%\",\"frontendQuestionId\":\"1301\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":42.3525764520915,\"totalAccepted\":19126,\"totalSubmission\":45159},{\"questionId\":\"1254\",\"title\":\"Deepest Leaves Sum\",\"titleSlug\":\"deepest-leaves-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4843,\"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.52508285596072,\"totalAccepted\":405698,\"totalSubmission\":468880},{\"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.52826151364519,\"totalAccepted\":81588,\"totalSubmission\":91131},{\"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\":2492,\"dislikes\":620,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.4%\",\"frontendQuestionId\":\"1304\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":78.43804795397679,\"totalAccepted\":398128,\"totalSubmission\":507570},{\"questionId\":\"1427\",\"title\":\"All Elements in Two Binary Search Trees\",\"titleSlug\":\"all-elements-in-two-binary-search-trees\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3192,\"dislikes\":99,\"categoryTitle\":\"Algorithms\",\"acRate\":\"80.2%\",\"frontendQuestionId\":\"1305\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Binary Search Tree;Sorting;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":80.23670954174207,\"totalAccepted\":262495,\"totalSubmission\":327151},{\"questionId\":\"1428\",\"title\":\"Jump Game III\",\"titleSlug\":\"jump-game-iii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4342,\"dislikes\":118,\"categoryTitle\":\"Algorithms\",\"acRate\":\"66.8%\",\"frontendQuestionId\":\"1306\",\"paidOnly\":false,\"topicTags\":\"Array;Depth-First Search;Breadth-First Search;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":66.81716782959643,\"totalAccepted\":299824,\"totalSubmission\":448723},{\"questionId\":\"1429\",\"title\":\"Verbal Arithmetic Puzzle\",\"titleSlug\":\"verbal-arithmetic-puzzle\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":531,\"dislikes\":138,\"categoryTitle\":\"Algorithms\",\"acRate\":\"34.8%\",\"frontendQuestionId\":\"1307\",\"paidOnly\":false,\"topicTags\":\"Array;Math;String;Backtracking;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":34.80926832144331,\"totalAccepted\":17712,\"totalSubmission\":50883},{\"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.06806082959356,\"totalAccepted\":47371,\"totalSubmission\":55039},{\"questionId\":\"1434\",\"title\":\"Decrypt String from Alphabet to Integer Mapping\",\"titleSlug\":\"decrypt-string-from-alphabet-to-integer-mapping\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1610,\"dislikes\":120,\"categoryTitle\":\"Algorithms\",\"acRate\":\"80.6%\",\"frontendQuestionId\":\"1309\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":80.55381996811307,\"totalAccepted\":149553,\"totalSubmission\":185656},{\"questionId\":\"1435\",\"title\":\"XOR Queries of a Subarray\",\"titleSlug\":\"xor-queries-of-a-subarray\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2105,\"dislikes\":61,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.1%\",\"frontendQuestionId\":\"1310\",\"paidOnly\":false,\"topicTags\":\"Array;Bit Manipulation;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":78.06540632559806,\"totalAccepted\":217821,\"totalSubmission\":279022},{\"questionId\":\"1436\",\"title\":\"Get Watched Videos by Your Friends\",\"titleSlug\":\"get-watched-videos-by-your-friends\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":485,\"dislikes\":456,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.7%\",\"frontendQuestionId\":\"1311\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Breadth-First Search;Graph Theory;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":52.707745632566315,\"totalAccepted\":41665,\"totalSubmission\":79050},{\"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\":5601,\"dislikes\":76,\"categoryTitle\":\"Algorithms\",\"acRate\":\"73.8%\",\"frontendQuestionId\":\"1312\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":73.8283447598524,\"totalAccepted\":309702,\"totalSubmission\":419490},{\"questionId\":\"1241\",\"title\":\"Decompress Run-Length Encoded List\",\"titleSlug\":\"decompress-run-length-encoded-list\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1349,\"dislikes\":1325,\"categoryTitle\":\"Algorithms\",\"acRate\":\"86.2%\",\"frontendQuestionId\":\"1313\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":86.19259541941892,\"totalAccepted\":307168,\"totalSubmission\":356374},{\"questionId\":\"1242\",\"title\":\"Matrix Block Sum\",\"titleSlug\":\"matrix-block-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2512,\"dislikes\":401,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.5%\",\"frontendQuestionId\":\"1314\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":76.47564371411873,\"totalAccepted\":111230,\"totalSubmission\":145445},{\"questionId\":\"1243\",\"title\":\"Sum of Nodes with Even-Valued Grandparent\",\"titleSlug\":\"sum-of-nodes-with-even-valued-grandparent\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2831,\"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.9145026936168,\"totalAccepted\":184516,\"totalSubmission\":214767},{\"questionId\":\"1244\",\"title\":\"Distinct Echo Substrings\",\"titleSlug\":\"distinct-echo-substrings\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":338,\"dislikes\":208,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.2%\",\"frontendQuestionId\":\"1316\",\"paidOnly\":false,\"topicTags\":\"String;Trie;Rolling Hash;Hash Function;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.15330227718792,\"totalAccepted\":22478,\"totalSubmission\":42289},{\"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\":867,\"dislikes\":371,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.1%\",\"frontendQuestionId\":\"1317\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.1237915906906,\"totalAccepted\":208490,\"totalSubmission\":352633},{\"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\":2146,\"dislikes\":112,\"categoryTitle\":\"Algorithms\",\"acRate\":\"71.9%\",\"frontendQuestionId\":\"1318\",\"paidOnly\":false,\"topicTags\":\"Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":71.93918038396295,\"totalAccepted\":197626,\"totalSubmission\":274713},{\"questionId\":\"1442\",\"title\":\"Number of Operations to Make Network Connected\",\"titleSlug\":\"number-of-operations-to-make-network-connected\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":5609,\"dislikes\":85,\"categoryTitle\":\"Algorithms\",\"acRate\":\"66.4%\",\"frontendQuestionId\":\"1319\",\"paidOnly\":false,\"topicTags\":\"Depth-First Search;Breadth-First Search;Union-Find;Graph Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":66.39623038659956,\"totalAccepted\":359595,\"totalSubmission\":541591},{\"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\":1363,\"dislikes\":54,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.2%\",\"frontendQuestionId\":\"1320\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.24969457211007,\"totalAccepted\":99352,\"totalSubmission\":137512},{\"questionId\":\"1452\",\"title\":\"Restaurant Growth\",\"titleSlug\":\"restaurant-growth\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1172,\"dislikes\":388,\"categoryTitle\":\"Database\",\"acRate\":\"58.6%\",\"frontendQuestionId\":\"1321\",\"paidOnly\":false,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":58.58627525122317,\"totalAccepted\":255649,\"totalSubmission\":436364},{\"questionId\":\"1453\",\"title\":\"Ads Performance\",\"titleSlug\":\"ads-performance\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":273,\"dislikes\":68,\"categoryTitle\":\"Database\",\"acRate\":\"58.6%\",\"frontendQuestionId\":\"1322\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.59021579232615,\"totalAccepted\":52972,\"totalSubmission\":90411},{\"questionId\":\"1448\",\"title\":\"Maximum 69 Number\",\"titleSlug\":\"maximum-69-number\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":3319,\"dislikes\":240,\"categoryTitle\":\"Algorithms\",\"acRate\":\"84.5%\",\"frontendQuestionId\":\"1323\",\"paidOnly\":false,\"topicTags\":\"Math;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":84.54692920412137,\"totalAccepted\":488896,\"totalSubmission\":578254},{\"questionId\":\"1449\",\"title\":\"Print Words Vertically\",\"titleSlug\":\"print-words-vertically\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":826,\"dislikes\":121,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.5%\",\"frontendQuestionId\":\"1324\",\"paidOnly\":false,\"topicTags\":\"Array;String;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":67.4908342445488,\"totalAccepted\":52463,\"totalSubmission\":77734},{\"questionId\":\"1450\",\"title\":\"Delete Leaves With a Given Value\",\"titleSlug\":\"delete-leaves-with-a-given-value\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2908,\"dislikes\":59,\"categoryTitle\":\"Algorithms\",\"acRate\":\"77.2%\",\"frontendQuestionId\":\"1325\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":77.249341461579,\"totalAccepted\":256601,\"totalSubmission\":332173},{\"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\":3626,\"dislikes\":197,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.0%\",\"frontendQuestionId\":\"1326\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":50.994659694867,\"totalAccepted\":160136,\"totalSubmission\":314025},{\"questionId\":\"1462\",\"title\":\"List the Products Ordered in a Period\",\"titleSlug\":\"list-the-products-ordered-in-a-period\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":586,\"dislikes\":48,\"categoryTitle\":\"Database\",\"acRate\":\"71.7%\",\"frontendQuestionId\":\"1327\",\"paidOnly\":false,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":71.69966210853346,\"totalAccepted\":316172,\"totalSubmission\":440968},{\"questionId\":\"1252\",\"title\":\"Break a Palindrome\",\"titleSlug\":\"break-a-palindrome\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2447,\"dislikes\":755,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.6%\",\"frontendQuestionId\":\"1328\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":51.55900838902466,\"totalAccepted\":197041,\"totalSubmission\":382166},{\"questionId\":\"1253\",\"title\":\"Sort the Matrix Diagonally\",\"titleSlug\":\"sort-the-matrix-diagonally\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3587,\"dislikes\":239,\"categoryTitle\":\"Algorithms\",\"acRate\":\"83.2%\",\"frontendQuestionId\":\"1329\",\"paidOnly\":false,\"topicTags\":\"Array;Sorting;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":83.17664063783971,\"totalAccepted\":197379,\"totalSubmission\":237301},{\"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\":43.95856160972208,\"totalAccepted\":8826,\"totalSubmission\":20078},{\"questionId\":\"1256\",\"title\":\"Rank Transform of an Array\",\"titleSlug\":\"rank-transform-of-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2388,\"dislikes\":114,\"categoryTitle\":\"Algorithms\",\"acRate\":\"70.8%\",\"frontendQuestionId\":\"1331\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":70.83684837698596,\"totalAccepted\":321597,\"totalSubmission\":453998},{\"questionId\":\"1454\",\"title\":\"Remove Palindromic Subsequences\",\"titleSlug\":\"remove-palindromic-subsequences\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1751,\"dislikes\":1803,\"categoryTitle\":\"Algorithms\",\"acRate\":\"77.0%\",\"frontendQuestionId\":\"1332\",\"paidOnly\":false,\"topicTags\":\"Two Pointers;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":77.01898242182602,\"totalAccepted\":153572,\"totalSubmission\":199395},{\"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.1%\",\"frontendQuestionId\":\"1333\",\"paidOnly\":false,\"topicTags\":\"Array;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":64.14644529587058,\"totalAccepted\":37670,\"totalSubmission\":58725},{\"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\":3619,\"dislikes\":157,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.5%\",\"frontendQuestionId\":\"1334\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;Graph Theory;Shortest Path;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.52569259519328,\"totalAccepted\":323284,\"totalSubmission\":445751},{\"questionId\":\"1457\",\"title\":\"Minimum Difficulty of a Job Schedule\",\"titleSlug\":\"minimum-difficulty-of-a-job-schedule\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":3600,\"dislikes\":336,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.7%\",\"frontendQuestionId\":\"1335\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.74586052758599,\"totalAccepted\":227754,\"totalSubmission\":381205},{\"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.85748821467424,\"totalAccepted\":15837,\"totalSubmission\":33092},{\"questionId\":\"1463\",\"title\":\"The K Weakest Rows in a Matrix\",\"titleSlug\":\"the-k-weakest-rows-in-a-matrix\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":4348,\"dislikes\":242,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.3%\",\"frontendQuestionId\":\"1337\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Sorting;Heap (Priority Queue);Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":74.32792460727092,\"totalAccepted\":422665,\"totalSubmission\":568649},{\"questionId\":\"1464\",\"title\":\"Reduce Array Size to The Half\",\"titleSlug\":\"reduce-array-size-to-the-half\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3367,\"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.35934558280307,\"totalAccepted\":232831,\"totalSubmission\":335688},{\"questionId\":\"1465\",\"title\":\"Maximum Product of Splitted Binary Tree\",\"titleSlug\":\"maximum-product-of-splitted-binary-tree\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3582,\"dislikes\":122,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.7%\",\"frontendQuestionId\":\"1339\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.664988503069445,\"totalAccepted\":258063,\"totalSubmission\":463601},{\"questionId\":\"1466\",\"title\":\"Jump Game V\",\"titleSlug\":\"jump-game-v\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1195,\"dislikes\":46,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.9%\",\"frontendQuestionId\":\"1340\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":64.91948984872006,\"totalAccepted\":42656,\"totalSubmission\":65706},{\"questionId\":\"1480\",\"title\":\"Movie Rating\",\"titleSlug\":\"movie-rating\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1007,\"dislikes\":242,\"categoryTitle\":\"Database\",\"acRate\":\"43.2%\",\"frontendQuestionId\":\"1341\",\"paidOnly\":false,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":43.19080124045491,\"totalAccepted\":292194,\"totalSubmission\":676521},{\"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\":4285,\"dislikes\":181,\"categoryTitle\":\"Algorithms\",\"acRate\":\"85.8%\",\"frontendQuestionId\":\"1342\",\"paidOnly\":false,\"topicTags\":\"Math;Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":true,\"acRateRaw\":85.76692996353201,\"totalAccepted\":918158,\"totalSubmission\":1070527},{\"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\":1851,\"dislikes\":112,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.7%\",\"frontendQuestionId\":\"1343\",\"paidOnly\":false,\"topicTags\":\"Array;Sliding Window;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":72.67326138864003,\"totalAccepted\":193875,\"totalSubmission\":266777},{\"questionId\":\"1446\",\"title\":\"Angle Between Hands of a Clock\",\"titleSlug\":\"angle-between-hands-of-a-clock\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1376,\"dislikes\":248,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.4%\",\"frontendQuestionId\":\"1344\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.42485336585891,\"totalAccepted\":143670,\"totalSubmission\":223004},{\"questionId\":\"1447\",\"title\":\"Jump Game IV\",\"titleSlug\":\"jump-game-iv\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":3875,\"dislikes\":133,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.3%\",\"frontendQuestionId\":\"1345\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Breadth-First Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":46.28751617624621,\"totalAccepted\":163818,\"totalSubmission\":353914},{\"questionId\":\"1468\",\"title\":\"Check If N and Its Double Exist\",\"titleSlug\":\"check-if-n-and-its-double-exist\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2530,\"dislikes\":259,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.7%\",\"frontendQuestionId\":\"1346\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Two Pointers;Binary Search;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":41.7491324511042,\"totalAccepted\":629448,\"totalSubmission\":1507693},{\"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\":2825,\"dislikes\":122,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.5%\",\"frontendQuestionId\":\"1347\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":82.4865339521011,\"totalAccepted\":336290,\"totalSubmission\":407691},{\"questionId\":\"1470\",\"title\":\"Tweet Counts Per Frequency\",\"titleSlug\":\"tweet-counts-per-frequency\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":223,\"dislikes\":309,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.0%\",\"frontendQuestionId\":\"1348\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Binary Search;Design;Sorting;Ordered Set;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":46.01223433274135,\"totalAccepted\":39640,\"totalSubmission\":86151},{\"questionId\":\"1471\",\"title\":\"Maximum Students Taking Exam\",\"titleSlug\":\"maximum-students-taking-exam\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":901,\"dislikes\":19,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.7%\",\"frontendQuestionId\":\"1349\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Bit Manipulation;Matrix;Bitmask;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.71701546860782,\"totalAccepted\":23614,\"totalSubmission\":43960},{\"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.72657144011093,\"totalAccepted\":66648,\"totalSubmission\":74279},{\"questionId\":\"1476\",\"title\":\"Count Negative Numbers in a Sorted Matrix\",\"titleSlug\":\"count-negative-numbers-in-a-sorted-matrix\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":5494,\"dislikes\":147,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.6%\",\"frontendQuestionId\":\"1351\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":79.57201760726575,\"totalAccepted\":662705,\"totalSubmission\":832836},{\"questionId\":\"1477\",\"title\":\"Product of the Last K Numbers\",\"titleSlug\":\"product-of-the-last-k-numbers\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2168,\"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.908104624825064,\"totalAccepted\":261626,\"totalSubmission\":415886},{\"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\":4008,\"dislikes\":635,\"categoryTitle\":\"Algorithms\",\"acRate\":\"39.0%\",\"frontendQuestionId\":\"1353\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;Heap (Priority Queue);\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":38.95158867111375,\"totalAccepted\":226856,\"totalSubmission\":582405},{\"questionId\":\"1479\",\"title\":\"Construct Target Array With Multiple Sums\",\"titleSlug\":\"construct-target-array-with-multiple-sums\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2126,\"dislikes\":180,\"categoryTitle\":\"Algorithms\",\"acRate\":\"36.9%\",\"frontendQuestionId\":\"1354\",\"paidOnly\":false,\"topicTags\":\"Array;Heap (Priority Queue);\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":36.90759073013757,\"totalAccepted\":84184,\"totalSubmission\":228093},{\"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\":71.99886520223717,\"totalAccepted\":35530,\"totalSubmission\":49348},{\"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\":2868,\"dislikes\":138,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.3%\",\"frontendQuestionId\":\"1356\",\"paidOnly\":false,\"topicTags\":\"Array;Bit Manipulation;Sorting;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":82.30906691076966,\"totalAccepted\":394736,\"totalSubmission\":479578},{\"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.5%\",\"frontendQuestionId\":\"1357\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Design;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":65.52247673113737,\"totalAccepted\":29778,\"totalSubmission\":45447},{\"questionId\":\"1460\",\"title\":\"Number of Substrings Containing All Three Characters\",\"titleSlug\":\"number-of-substrings-containing-all-three-characters\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4454,\"dislikes\":82,\"categoryTitle\":\"Algorithms\",\"acRate\":\"73.6%\",\"frontendQuestionId\":\"1358\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":73.64283931667708,\"totalAccepted\":451477,\"totalSubmission\":613063},{\"questionId\":\"1461\",\"title\":\"Count All Valid Pickup and Delivery Options\",\"titleSlug\":\"count-all-valid-pickup-and-delivery-options\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":3095,\"dislikes\":233,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.9%\",\"frontendQuestionId\":\"1359\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Combinatorics;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.85871676361866,\"totalAccepted\":134575,\"totalSubmission\":207490},{\"questionId\":\"1274\",\"title\":\"Number of Days Between Two Dates\",\"titleSlug\":\"number-of-days-between-two-dates\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":437,\"dislikes\":1325,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.6%\",\"frontendQuestionId\":\"1360\",\"paidOnly\":false,\"topicTags\":\"Math;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":52.587464334758764,\"totalAccepted\":73908,\"totalSubmission\":140543},{\"questionId\":\"1275\",\"title\":\"Validate Binary Tree Nodes\",\"titleSlug\":\"validate-binary-tree-nodes\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2255,\"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.100585296773396,\"totalAccepted\":135776,\"totalSubmission\":307878},{\"questionId\":\"1276\",\"title\":\"Closest Divisors\",\"titleSlug\":\"closest-divisors\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":339,\"dislikes\":101,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.1%\",\"frontendQuestionId\":\"1362\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":62.12225127523683,\"totalAccepted\":28985,\"totalSubmission\":46658},{\"questionId\":\"1277\",\"title\":\"Largest Multiple of Three\",\"titleSlug\":\"largest-multiple-of-three\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":629,\"dislikes\":91,\"categoryTitle\":\"Algorithms\",\"acRate\":\"33.2%\",\"frontendQuestionId\":\"1363\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Dynamic Programming;Greedy;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":33.20174997485668,\"totalAccepted\":26410,\"totalSubmission\":79544},{\"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.7%\",\"frontendQuestionId\":\"1364\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":74.68765840713242,\"totalAccepted\":25048,\"totalSubmission\":33537},{\"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\":6031,\"dislikes\":163,\"categoryTitle\":\"Algorithms\",\"acRate\":\"87.4%\",\"frontendQuestionId\":\"1365\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sorting;Counting Sort;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":87.4349308742947,\"totalAccepted\":880468,\"totalSubmission\":1006999},{\"questionId\":\"1483\",\"title\":\"Rank Teams by Votes\",\"titleSlug\":\"rank-teams-by-votes\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1568,\"dislikes\":198,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.1%\",\"frontendQuestionId\":\"1366\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Sorting;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":60.061543871988746,\"totalAccepted\":102471,\"totalSubmission\":170610},{\"questionId\":\"1484\",\"title\":\"Linked List in Binary Tree\",\"titleSlug\":\"linked-list-in-binary-tree\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3027,\"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.95410052352385,\"totalAccepted\":209494,\"totalSubmission\":403229},{\"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\":2602,\"dislikes\":36,\"categoryTitle\":\"Algorithms\",\"acRate\":\"70.9%\",\"frontendQuestionId\":\"1368\",\"paidOnly\":false,\"topicTags\":\"Array;Breadth-First Search;Graph Theory;Heap (Priority Queue);Matrix;Shortest Path;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":70.92936138331474,\"totalAccepted\":166623,\"totalSubmission\":234914},{\"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.3%\",\"frontendQuestionId\":\"1369\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":67.3024940072423,\"totalAccepted\":26392,\"totalSubmission\":39214},{\"questionId\":\"1472\",\"title\":\"Increasing Decreasing String\",\"titleSlug\":\"increasing-decreasing-string\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":844,\"dislikes\":878,\"categoryTitle\":\"Algorithms\",\"acRate\":\"77.2%\",\"frontendQuestionId\":\"1370\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":77.22642052750777,\"totalAccepted\":99229,\"totalSubmission\":128491},{\"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\":2566,\"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.61369716425897,\"totalAccepted\":141322,\"totalSubmission\":186900},{\"questionId\":\"1474\",\"title\":\"Longest ZigZag Path in a Binary Tree\",\"titleSlug\":\"longest-zigzag-path-in-a-binary-tree\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3754,\"dislikes\":86,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.1%\",\"frontendQuestionId\":\"1372\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":67.05720290508012,\"totalAccepted\":284287,\"totalSubmission\":423945},{\"questionId\":\"1475\",\"title\":\"Maximum Sum BST in Binary Tree\",\"titleSlug\":\"maximum-sum-bst-in-binary-tree\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2995,\"dislikes\":200,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.0%\",\"frontendQuestionId\":\"1373\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;Tree;Depth-First Search;Binary Search Tree;Binary Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":47.044285002858885,\"totalAccepted\":127530,\"totalSubmission\":271083},{\"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\":529,\"dislikes\":1288,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.5%\",\"frontendQuestionId\":\"1374\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":78.4544562674515,\"totalAccepted\":114356,\"totalSubmission\":145761},{\"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\":969,\"dislikes\":139,\"categoryTitle\":\"Algorithms\",\"acRate\":\"66.0%\",\"frontendQuestionId\":\"1375\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":66.03312933139185,\"totalAccepted\":60314,\"totalSubmission\":91339},{\"questionId\":\"1492\",\"title\":\"Time Needed to Inform All Employees\",\"titleSlug\":\"time-needed-to-inform-all-employees\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4255,\"dislikes\":325,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.5%\",\"frontendQuestionId\":\"1376\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Breadth-First Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":60.46853661098856,\"totalAccepted\":259020,\"totalSubmission\":428355},{\"questionId\":\"1493\",\"title\":\"Frog Position After T Seconds\",\"titleSlug\":\"frog-position-after-t-seconds\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":845,\"dislikes\":151,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.4%\",\"frontendQuestionId\":\"1377\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Breadth-First Search;Graph Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.35649067090115,\"totalAccepted\":43479,\"totalSubmission\":113355},{\"questionId\":\"1509\",\"title\":\"Replace Employee ID With The Unique Identifier\",\"titleSlug\":\"replace-employee-id-with-the-unique-identifier\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2061,\"dislikes\":163,\"categoryTitle\":\"Database\",\"acRate\":\"83.5%\",\"frontendQuestionId\":\"1378\",\"paidOnly\":false,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":83.54198967022724,\"totalAccepted\":1317440,\"totalSubmission\":1576972},{\"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\":1811,\"dislikes\":2018,\"categoryTitle\":\"Algorithms\",\"acRate\":\"85.8%\",\"frontendQuestionId\":\"1379\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Breadth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":85.8230681641737,\"totalAccepted\":265309,\"totalSubmission\":309133},{\"questionId\":\"1496\",\"title\":\"Lucky Numbers in a Matrix\",\"titleSlug\":\"lucky-numbers-in-a-matrix\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2355,\"dislikes\":123,\"categoryTitle\":\"Algorithms\",\"acRate\":\"80.0%\",\"frontendQuestionId\":\"1380\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":79.95287479936663,\"totalAccepted\":295887,\"totalSubmission\":370077},{\"questionId\":\"1497\",\"title\":\"Design a Stack With Increment Operation\",\"titleSlug\":\"design-a-stack-with-increment-operation\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2372,\"dislikes\":112,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.9%\",\"frontendQuestionId\":\"1381\",\"paidOnly\":false,\"topicTags\":\"Array;Stack;Design;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":79.90372015309472,\"totalAccepted\":261588,\"totalSubmission\":327379},{\"questionId\":\"1285\",\"title\":\"Balance a Binary Search Tree\",\"titleSlug\":\"balance-a-binary-search-tree\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4176,\"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.28916115743095,\"totalAccepted\":403832,\"totalSubmission\":467999},{\"questionId\":\"1499\",\"title\":\"Maximum Performance of a Team\",\"titleSlug\":\"maximum-performance-of-a-team\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":3215,\"dislikes\":85,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.7%\",\"frontendQuestionId\":\"1383\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;Heap (Priority Queue);\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.73828861022675,\"totalAccepted\":110211,\"totalSubmission\":230863},{\"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.3%\",\"frontendQuestionId\":\"1384\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":61.29793691180529,\"totalAccepted\":19996,\"totalSubmission\":32621},{\"questionId\":\"1486\",\"title\":\"Find the Distance Value Between Two Arrays\",\"titleSlug\":\"find-the-distance-value-between-two-arrays\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1036,\"dislikes\":3165,\"categoryTitle\":\"Algorithms\",\"acRate\":\"71.6%\",\"frontendQuestionId\":\"1385\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Binary Search;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":71.62719944190373,\"totalAccepted\":147850,\"totalSubmission\":206416},{\"questionId\":\"1487\",\"title\":\"Cinema Seat Allocation\",\"titleSlug\":\"cinema-seat-allocation\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":994,\"dislikes\":418,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.4%\",\"frontendQuestionId\":\"1386\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Greedy;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":44.393612899278764,\"totalAccepted\":65307,\"totalSubmission\":147109},{\"questionId\":\"1488\",\"title\":\"Sort Integers by The Power Value\",\"titleSlug\":\"sort-integers-by-the-power-value\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1513,\"dislikes\":121,\"categoryTitle\":\"Algorithms\",\"acRate\":\"71.7%\",\"frontendQuestionId\":\"1387\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;Memoization;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":71.67402094357423,\"totalAccepted\":122311,\"totalSubmission\":170649},{\"questionId\":\"1489\",\"title\":\"Pizza With 3n Slices\",\"titleSlug\":\"pizza-with-3n-slices\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1140,\"dislikes\":24,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.8%\",\"frontendQuestionId\":\"1388\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Greedy;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.80160949231446,\"totalAccepted\":37907,\"totalSubmission\":70457},{\"questionId\":\"1505\",\"title\":\"Create Target Array in the Given Order\",\"titleSlug\":\"create-target-array-in-the-given-order\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2305,\"dislikes\":1920,\"categoryTitle\":\"Algorithms\",\"acRate\":\"86.5%\",\"frontendQuestionId\":\"1389\",\"paidOnly\":false,\"topicTags\":\"Array;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":86.4616379286728,\"totalAccepted\":315604,\"totalSubmission\":365022},{\"questionId\":\"1284\",\"title\":\"Four Divisors\",\"titleSlug\":\"four-divisors\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":892,\"dislikes\":223,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.6%\",\"frontendQuestionId\":\"1390\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":56.62218192737688,\"totalAccepted\":196103,\"totalSubmission\":346336},{\"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\":885,\"dislikes\":326,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.3%\",\"frontendQuestionId\":\"1391\",\"paidOnly\":false,\"topicTags\":\"Array;Depth-First Search;Breadth-First Search;Union-Find;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":50.297469525899686,\"totalAccepted\":38044,\"totalSubmission\":75638},{\"questionId\":\"1508\",\"title\":\"Longest Happy Prefix\",\"titleSlug\":\"longest-happy-prefix\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1590,\"dislikes\":48,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.9%\",\"frontendQuestionId\":\"1392\",\"paidOnly\":false,\"topicTags\":\"String;Rolling Hash;String Matching;Hash Function;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":52.856685205316865,\"totalAccepted\":100645,\"totalSubmission\":190412},{\"questionId\":\"1523\",\"title\":\"Capital Gain/Loss\",\"titleSlug\":\"capital-gainloss\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":930,\"dislikes\":51,\"categoryTitle\":\"Database\",\"acRate\":\"84.6%\",\"frontendQuestionId\":\"1393\",\"paidOnly\":false,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":84.6482241296851,\"totalAccepted\":168141,\"totalSubmission\":198635},{\"questionId\":\"1510\",\"title\":\"Find Lucky Integer in an Array\",\"titleSlug\":\"find-lucky-integer-in-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1632,\"dislikes\":45,\"categoryTitle\":\"Algorithms\",\"acRate\":\"75.5%\",\"frontendQuestionId\":\"1394\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":75.50379814610314,\"totalAccepted\":338438,\"totalSubmission\":448236},{\"questionId\":\"1511\",\"title\":\"Count Number of Teams\",\"titleSlug\":\"count-number-of-teams\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3457,\"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.15731628474965,\"totalAccepted\":244165,\"totalSubmission\":348025},{\"questionId\":\"1512\",\"title\":\"Design Underground System\",\"titleSlug\":\"design-underground-system\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3596,\"dislikes\":179,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.5%\",\"frontendQuestionId\":\"1396\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Design;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":74.4721441433528,\"totalAccepted\":271305,\"totalSubmission\":364304},{\"questionId\":\"1513\",\"title\":\"Find All Good Strings\",\"titleSlug\":\"find-all-good-strings\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":535,\"dislikes\":130,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.2%\",\"frontendQuestionId\":\"1397\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;String Matching;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":45.15072394967956,\"totalAccepted\":9511,\"totalSubmission\":21065},{\"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.48529838676232,\"totalAccepted\":68949,\"totalSubmission\":96452},{\"questionId\":\"1500\",\"title\":\"Count Largest Group\",\"titleSlug\":\"count-largest-group\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":808,\"dislikes\":1190,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.7%\",\"frontendQuestionId\":\"1399\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Math;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":74.67672978276725,\"totalAccepted\":185323,\"totalSubmission\":248167},{\"questionId\":\"1502\",\"title\":\"Construct K Palindrome Strings\",\"titleSlug\":\"construct-k-palindrome-strings\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1794,\"dislikes\":160,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.5%\",\"frontendQuestionId\":\"1400\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Greedy;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.54563090363446,\"totalAccepted\":210590,\"totalSubmission\":307226},{\"questionId\":\"1928\",\"title\":\"Number of Orders in the Backlog\",\"titleSlug\":\"number-of-orders-in-the-backlog\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":344,\"dislikes\":246,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.8%\",\"frontendQuestionId\":\"1801\",\"paidOnly\":false,\"topicTags\":\"Array;Heap (Priority Queue);Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.80702521498324,\"totalAccepted\":36917,\"totalSubmission\":68610},{\"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\":2728,\"dislikes\":478,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.9%\",\"frontendQuestionId\":\"1802\",\"paidOnly\":false,\"topicTags\":\"Math;Binary Search;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":38.86279823372842,\"totalAccepted\":88626,\"totalSubmission\":228049},{\"questionId\":\"1907\",\"title\":\"Count Pairs With XOR in a Range\",\"titleSlug\":\"count-pairs-with-xor-in-a-range\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":555,\"dislikes\":24,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.0%\",\"frontendQuestionId\":\"1803\",\"paidOnly\":false,\"topicTags\":\"Array;Bit Manipulation;Trie;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":45.99744917098057,\"totalAccepted\":12262,\"totalSubmission\":26658},{\"questionId\":\"1949\",\"title\":\"Implement Trie II (Prefix Tree)\",\"titleSlug\":\"implement-trie-ii-prefix-tree\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":356,\"dislikes\":19,\"categoryTitle\":\"Algorithms\",\"acRate\":\"63.4%\",\"frontendQuestionId\":\"1804\",\"paidOnly\":true,\"topicTags\":\"Hash Table;String;Design;Trie;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":63.42203548085901,\"totalAccepted\":27170,\"totalSubmission\":42840},{\"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.2%\",\"frontendQuestionId\":\"1805\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.23245781309592,\"totalAccepted\":64349,\"totalSubmission\":159943},{\"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\":176,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.5%\",\"frontendQuestionId\":\"1806\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":72.53242915357576,\"totalAccepted\":23317,\"totalSubmission\":32147},{\"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.4%\",\"frontendQuestionId\":\"1807\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":69.39687881487347,\"totalAccepted\":42067,\"totalSubmission\":60618},{\"questionId\":\"1936\",\"title\":\"Maximize Number of Nice Divisors\",\"titleSlug\":\"maximize-number-of-nice-divisors\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":234,\"dislikes\":173,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.9%\",\"frontendQuestionId\":\"1808\",\"paidOnly\":false,\"topicTags\":\"Math;Recursion;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":35.85545671662456,\"totalAccepted\":10359,\"totalSubmission\":28891},{\"questionId\":\"1958\",\"title\":\"Ad-Free Sessions\",\"titleSlug\":\"ad-free-sessions\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":99,\"dislikes\":61,\"categoryTitle\":\"Database\",\"acRate\":\"59.0%\",\"frontendQuestionId\":\"1809\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":58.96781553981025,\"totalAccepted\":19641,\"totalSubmission\":33308},{\"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.75304845721556,\"totalAccepted\":5541,\"totalSubmission\":9431},{\"questionId\":\"1964\",\"title\":\"Find Interview Candidates\",\"titleSlug\":\"find-interview-candidates\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":212,\"dislikes\":30,\"categoryTitle\":\"Database\",\"acRate\":\"60.8%\",\"frontendQuestionId\":\"1811\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":60.78802157604315,\"totalAccepted\":19609,\"totalSubmission\":32258},{\"questionId\":\"1920\",\"title\":\"Determine Color of a Chessboard Square\",\"titleSlug\":\"determine-color-of-a-chessboard-square\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":902,\"dislikes\":24,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.8%\",\"frontendQuestionId\":\"1812\",\"paidOnly\":false,\"topicTags\":\"Math;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":79.83957650346643,\"totalAccepted\":118846,\"totalSubmission\":148856},{\"questionId\":\"1923\",\"title\":\"Sentence Similarity III\",\"titleSlug\":\"sentence-similarity-iii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1071,\"dislikes\":163,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.4%\",\"frontendQuestionId\":\"1813\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":48.42616691427967,\"totalAccepted\":132663,\"totalSubmission\":273949},{\"questionId\":\"1925\",\"title\":\"Count Nice Pairs in an Array\",\"titleSlug\":\"count-nice-pairs-in-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2051,\"dislikes\":93,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.4%\",\"frontendQuestionId\":\"1814\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":48.44621998847328,\"totalAccepted\":135335,\"totalSubmission\":279351},{\"questionId\":\"1924\",\"title\":\"Maximum Number of Groups Getting Fresh Donuts\",\"titleSlug\":\"maximum-number-of-groups-getting-fresh-donuts\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":358,\"dislikes\":34,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.3%\",\"frontendQuestionId\":\"1815\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Bit Manipulation;Memoization;Bitmask;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":41.27676063159934,\"totalAccepted\":8522,\"totalSubmission\":20646},{\"questionId\":\"1944\",\"title\":\"Truncate Sentence\",\"titleSlug\":\"truncate-sentence\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1231,\"dislikes\":34,\"categoryTitle\":\"Algorithms\",\"acRate\":\"86.8%\",\"frontendQuestionId\":\"1816\",\"paidOnly\":false,\"topicTags\":\"Array;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":86.78828346921459,\"totalAccepted\":235256,\"totalSubmission\":271069},{\"questionId\":\"1945\",\"title\":\"Finding the Users Active Minutes\",\"titleSlug\":\"finding-the-users-active-minutes\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":864,\"dislikes\":320,\"categoryTitle\":\"Algorithms\",\"acRate\":\"80.8%\",\"frontendQuestionId\":\"1817\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":80.78497747078063,\"totalAccepted\":70639,\"totalSubmission\":87441},{\"questionId\":\"1946\",\"title\":\"Minimum Absolute Sum Difference\",\"titleSlug\":\"minimum-absolute-sum-difference\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1103,\"dislikes\":80,\"categoryTitle\":\"Algorithms\",\"acRate\":\"32.4%\",\"frontendQuestionId\":\"1818\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Sorting;Ordered Set;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":32.39227927376178,\"totalAccepted\":32792,\"totalSubmission\":101234},{\"questionId\":\"1947\",\"title\":\"Number of Different Subsequences GCDs\",\"titleSlug\":\"number-of-different-subsequences-gcds\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":436,\"dislikes\":48,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.2%\",\"frontendQuestionId\":\"1819\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Counting;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":45.153639925757886,\"totalAccepted\":13137,\"totalSubmission\":29094},{\"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.5%\",\"frontendQuestionId\":\"1820\",\"paidOnly\":true,\"topicTags\":\"Array;Depth-First Search;Graph Theory;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":52.50367839005173,\"totalAccepted\":11062,\"totalSubmission\":21069},{\"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.7092729462325,\"totalAccepted\":37144,\"totalSubmission\":42349},{\"questionId\":\"1950\",\"title\":\"Sign of the Product of an Array\",\"titleSlug\":\"sign-of-the-product-of-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2298,\"dislikes\":232,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.8%\",\"frontendQuestionId\":\"1822\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.8097449124141,\"totalAccepted\":441491,\"totalSubmission\":681211},{\"questionId\":\"1951\",\"title\":\"Find the Winner of the Circular Game\",\"titleSlug\":\"find-the-winner-of-the-circular-game\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":4111,\"dislikes\":129,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.2%\",\"frontendQuestionId\":\"1823\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Recursion;Queue;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":82.24913698800627,\"totalAccepted\":376692,\"totalSubmission\":457989},{\"questionId\":\"1952\",\"title\":\"Minimum Sideway Jumps\",\"titleSlug\":\"minimum-sideway-jumps\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1284,\"dislikes\":51,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.6%\",\"frontendQuestionId\":\"1824\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":51.594411233630765,\"totalAccepted\":58862,\"totalSubmission\":114086},{\"questionId\":\"1953\",\"title\":\"Finding MK Average\",\"titleSlug\":\"finding-mk-average\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":529,\"dislikes\":142,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.7%\",\"frontendQuestionId\":\"1825\",\"paidOnly\":false,\"topicTags\":\"Design;Queue;Heap (Priority Queue);Data Stream;Ordered Set;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.69509217269971,\"totalAccepted\":28841,\"totalSubmission\":74533},{\"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.466016633209065,\"totalAccepted\":7039,\"totalSubmission\":13948},{\"questionId\":\"1938\",\"title\":\"Minimum Operations to Make the Array Increasing\",\"titleSlug\":\"minimum-operations-to-make-the-array-increasing\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1320,\"dislikes\":68,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.0%\",\"frontendQuestionId\":\"1827\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":81.96160735286135,\"totalAccepted\":135903,\"totalSubmission\":165813},{\"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\":1197,\"dislikes\":90,\"categoryTitle\":\"Algorithms\",\"acRate\":\"86.8%\",\"frontendQuestionId\":\"1828\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Geometry;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":86.764066519329,\"totalAccepted\":95791,\"totalSubmission\":110404},{\"questionId\":\"1940\",\"title\":\"Maximum XOR for Each Query\",\"titleSlug\":\"maximum-xor-for-each-query\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1267,\"dislikes\":194,\"categoryTitle\":\"Algorithms\",\"acRate\":\"84.7%\",\"frontendQuestionId\":\"1829\",\"paidOnly\":false,\"topicTags\":\"Array;Bit Manipulation;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":84.66325655726709,\"totalAccepted\":145156,\"totalSubmission\":171451},{\"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\":189,\"dislikes\":132,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.1%\",\"frontendQuestionId\":\"1830\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Math;String;Combinatorics;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":50.147756783379606,\"totalAccepted\":5600,\"totalSubmission\":11167},{\"questionId\":\"1981\",\"title\":\"Maximum Transaction Each Day\",\"titleSlug\":\"maximum-transaction-each-day\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":96,\"dislikes\":3,\"categoryTitle\":\"Database\",\"acRate\":\"82.4%\",\"frontendQuestionId\":\"1831\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":82.44637205485876,\"totalAccepted\":28134,\"totalSubmission\":34124},{\"questionId\":\"1960\",\"title\":\"Check if the Sentence Is Pangram\",\"titleSlug\":\"check-if-the-sentence-is-pangram\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":3031,\"dislikes\":67,\"categoryTitle\":\"Algorithms\",\"acRate\":\"84.2%\",\"frontendQuestionId\":\"1832\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":84.1715660323033,\"totalAccepted\":543749,\"totalSubmission\":646001},{\"questionId\":\"1961\",\"title\":\"Maximum Ice Cream Bars\",\"titleSlug\":\"maximum-ice-cream-bars\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2266,\"dislikes\":679,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.3%\",\"frontendQuestionId\":\"1833\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;Counting Sort;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":74.28754564524901,\"totalAccepted\":191230,\"totalSubmission\":257419},{\"questionId\":\"1962\",\"title\":\"Single-Threaded CPU\",\"titleSlug\":\"single-threaded-cpu\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3504,\"dislikes\":292,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.6%\",\"frontendQuestionId\":\"1834\",\"paidOnly\":false,\"topicTags\":\"Array;Sorting;Heap (Priority Queue);\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.557256821323165,\"totalAccepted\":155176,\"totalSubmission\":326293},{\"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\":627,\"dislikes\":51,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.5%\",\"frontendQuestionId\":\"1835\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":62.462681304214954,\"totalAccepted\":26571,\"totalSubmission\":42539},{\"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.6659671412096,\"totalAccepted\":40022,\"totalSubmission\":52893},{\"questionId\":\"1965\",\"title\":\"Sum of Digits in Base K\",\"titleSlug\":\"sum-of-digits-in-base-k\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":566,\"dislikes\":50,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.6%\",\"frontendQuestionId\":\"1837\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":78.6291556064299,\"totalAccepted\":79681,\"totalSubmission\":101338},{\"questionId\":\"1966\",\"title\":\"Frequency of the Most Frequent Element\",\"titleSlug\":\"frequency-of-the-most-frequent-element\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":5756,\"dislikes\":313,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.8%\",\"frontendQuestionId\":\"1838\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Greedy;Sliding Window;Sorting;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":44.75313502358002,\"totalAccepted\":269980,\"totalSubmission\":603264},{\"questionId\":\"1967\",\"title\":\"Longest Substring Of All Vowels in Order\",\"titleSlug\":\"longest-substring-of-all-vowels-in-order\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":855,\"dislikes\":31,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.8%\",\"frontendQuestionId\":\"1839\",\"paidOnly\":false,\"topicTags\":\"String;Sliding Window;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":51.765994644477395,\"totalAccepted\":46783,\"totalSubmission\":90374},{\"questionId\":\"1968\",\"title\":\"Maximum Building Height\",\"titleSlug\":\"maximum-building-height\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":404,\"dislikes\":23,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.4%\",\"frontendQuestionId\":\"1840\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.43987944162436,\"totalAccepted\":9693,\"totalSubmission\":25216},{\"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.46615099613247,\"totalAccepted\":16451,\"totalSubmission\":30769},{\"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.2%\",\"frontendQuestionId\":\"1842\",\"paidOnly\":true,\"topicTags\":\"Two Pointers;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":54.168279278581934,\"totalAccepted\":6998,\"totalSubmission\":12919},{\"questionId\":\"1998\",\"title\":\"Suspicious Bank Accounts\",\"titleSlug\":\"suspicious-bank-accounts\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":104,\"dislikes\":59,\"categoryTitle\":\"Database\",\"acRate\":\"44.2%\",\"frontendQuestionId\":\"1843\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":44.165646674826604,\"totalAccepted\":15155,\"totalSubmission\":34314},{\"questionId\":\"1954\",\"title\":\"Replace All Digits with Characters\",\"titleSlug\":\"replace-all-digits-with-characters\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":899,\"dislikes\":117,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.7%\",\"frontendQuestionId\":\"1844\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":82.68586233376634,\"totalAccepted\":115212,\"totalSubmission\":139337},{\"questionId\":\"1955\",\"title\":\"Seat Reservation Manager\",\"titleSlug\":\"seat-reservation-manager\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1481,\"dislikes\":92,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.1%\",\"frontendQuestionId\":\"1845\",\"paidOnly\":false,\"topicTags\":\"Design;Heap (Priority Queue);\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":67.14605750890705,\"totalAccepted\":149263,\"totalSubmission\":222296},{\"questionId\":\"1956\",\"title\":\"Maximum Element After Decreasing and Rearranging\",\"titleSlug\":\"maximum-element-after-decreasing-and-rearranging\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1136,\"dislikes\":278,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.7%\",\"frontendQuestionId\":\"1846\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":65.73004231633456,\"totalAccepted\":115255,\"totalSubmission\":175346},{\"questionId\":\"1957\",\"title\":\"Closest Room\",\"titleSlug\":\"closest-room\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":538,\"dislikes\":21,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.1%\",\"frontendQuestionId\":\"1847\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Sorting;Ordered Set;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":41.11754008927095,\"totalAccepted\":12436,\"totalSubmission\":30245},{\"questionId\":\"1975\",\"title\":\"Minimum Distance to the Target Element\",\"titleSlug\":\"minimum-distance-to-the-target-element\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":628,\"dislikes\":86,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.6%\",\"frontendQuestionId\":\"1848\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.61479604398434,\"totalAccepted\":170585,\"totalSubmission\":264001},{\"questionId\":\"1976\",\"title\":\"Splitting a String Into Descending Consecutive Values\",\"titleSlug\":\"splitting-a-string-into-descending-consecutive-values\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":555,\"dislikes\":128,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.6%\",\"frontendQuestionId\":\"1849\",\"paidOnly\":false,\"topicTags\":\"String;Backtracking;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":37.58180857601863,\"totalAccepted\":34856,\"totalSubmission\":92747},{\"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\":811,\"dislikes\":122,\"categoryTitle\":\"Algorithms\",\"acRate\":\"71.8%\",\"frontendQuestionId\":\"1850\",\"paidOnly\":false,\"topicTags\":\"Two Pointers;String;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":71.78519519596094,\"totalAccepted\":28152,\"totalSubmission\":39217},{\"questionId\":\"1977\",\"title\":\"Minimum Interval to Include Each Query\",\"titleSlug\":\"minimum-interval-to-include-each-query\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1154,\"dislikes\":49,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.2%\",\"frontendQuestionId\":\"1851\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Sweep Line;Sorting;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":54.24042815973652,\"totalAccepted\":71145,\"totalSubmission\":131166},{\"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.29169532718852,\"totalAccepted\":16855,\"totalSubmission\":21807},{\"questionId\":\"2004\",\"title\":\"Convert Date Format\",\"titleSlug\":\"convert-date-format\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":69,\"dislikes\":42,\"categoryTitle\":\"Database\",\"acRate\":\"85.0%\",\"frontendQuestionId\":\"1853\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":84.95369145276528,\"totalAccepted\":16052,\"totalSubmission\":18895},{\"questionId\":\"1983\",\"title\":\"Maximum Population Year\",\"titleSlug\":\"maximum-population-year\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1557,\"dislikes\":288,\"categoryTitle\":\"Algorithms\",\"acRate\":\"63.9%\",\"frontendQuestionId\":\"1854\",\"paidOnly\":false,\"topicTags\":\"Array;Counting;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":63.86950472705762,\"totalAccepted\":116604,\"totalSubmission\":182566},{\"questionId\":\"1984\",\"title\":\"Maximum Distance Between a Pair of Values\",\"titleSlug\":\"maximum-distance-between-a-pair-of-values\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1460,\"dislikes\":36,\"categoryTitle\":\"Algorithms\",\"acRate\":\"58.8%\",\"frontendQuestionId\":\"1855\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Binary Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.87539052550047,\"totalAccepted\":112275,\"totalSubmission\":190910},{\"questionId\":\"1985\",\"title\":\"Maximum Subarray Min-Product\",\"titleSlug\":\"maximum-subarray-min-product\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1563,\"dislikes\":146,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.3%\",\"frontendQuestionId\":\"1856\",\"paidOnly\":false,\"topicTags\":\"Array;Stack;Monotonic Stack;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.28203556100552,\"totalAccepted\":40733,\"totalSubmission\":101121},{\"questionId\":\"1986\",\"title\":\"Largest Color Value in a Directed Graph\",\"titleSlug\":\"largest-color-value-in-a-directed-graph\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2628,\"dislikes\":87,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.3%\",\"frontendQuestionId\":\"1857\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Dynamic Programming;Graph Theory;Topological Sort;Memoization;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":57.28710048497866,\"totalAccepted\":149897,\"totalSubmission\":261660},{\"questionId\":\"2009\",\"title\":\"Longest Word With All Prefixes\",\"titleSlug\":\"longest-word-with-all-prefixes\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":204,\"dislikes\":7,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.1%\",\"frontendQuestionId\":\"1858\",\"paidOnly\":true,\"topicTags\":\"Array;String;Depth-First Search;Trie;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.06393328700487,\"totalAccepted\":14518,\"totalSubmission\":20146},{\"questionId\":\"1970\",\"title\":\"Sorting the Sentence\",\"titleSlug\":\"sorting-the-sentence\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2398,\"dislikes\":83,\"categoryTitle\":\"Algorithms\",\"acRate\":\"84.1%\",\"frontendQuestionId\":\"1859\",\"paidOnly\":false,\"topicTags\":\"String;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":84.07236722517456,\"totalAccepted\":235881,\"totalSubmission\":280569},{\"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.78657710700168,\"totalAccepted\":26332,\"totalSubmission\":36177},{\"questionId\":\"1972\",\"title\":\"Rotating the Box\",\"titleSlug\":\"rotating-the-box\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1633,\"dislikes\":83,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.2%\",\"frontendQuestionId\":\"1861\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":79.15000954051928,\"totalAccepted\":170072,\"totalSubmission\":214873},{\"questionId\":\"1326\",\"title\":\"Sum of Floored Pairs\",\"titleSlug\":\"sum-of-floored-pairs\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":466,\"dislikes\":39,\"categoryTitle\":\"Algorithms\",\"acRate\":\"30.8%\",\"frontendQuestionId\":\"1862\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Binary Search;Counting;Enumeration;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":30.76672431511141,\"totalAccepted\":12275,\"totalSubmission\":39897},{\"questionId\":\"1993\",\"title\":\"Sum of All Subset XOR Totals\",\"titleSlug\":\"sum-of-all-subset-xor-totals\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2704,\"dislikes\":356,\"categoryTitle\":\"Algorithms\",\"acRate\":\"90.1%\",\"frontendQuestionId\":\"1863\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Backtracking;Bit Manipulation;Combinatorics;Enumeration;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":90.11372259325705,\"totalAccepted\":358639,\"totalSubmission\":397985},{\"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\":625,\"dislikes\":38,\"categoryTitle\":\"Algorithms\",\"acRate\":\"43.9%\",\"frontendQuestionId\":\"1864\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":43.8608483368935,\"totalAccepted\":35933,\"totalSubmission\":81925},{\"questionId\":\"1995\",\"title\":\"Finding Pairs With a Certain Sum\",\"titleSlug\":\"finding-pairs-with-a-certain-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1042,\"dislikes\":145,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.6%\",\"frontendQuestionId\":\"1865\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Design;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.55227606585774,\"totalAccepted\":144979,\"totalSubmission\":235538},{\"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\":765,\"dislikes\":24,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.1%\",\"frontendQuestionId\":\"1866\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Combinatorics;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":61.11924992675066,\"totalAccepted\":22945,\"totalSubmission\":37542},{\"questionId\":\"2014\",\"title\":\"Orders With Maximum Quantity Above Average\",\"titleSlug\":\"orders-with-maximum-quantity-above-average\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":79,\"dislikes\":282,\"categoryTitle\":\"Database\",\"acRate\":\"70.7%\",\"frontendQuestionId\":\"1867\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":70.65835914427717,\"totalAccepted\":19619,\"totalSubmission\":27766},{\"questionId\":\"2019\",\"title\":\"Product of Two Run-Length Encoded Arrays\",\"titleSlug\":\"product-of-two-run-length-encoded-arrays\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":415,\"dislikes\":84,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.6%\",\"frontendQuestionId\":\"1868\",\"paidOnly\":true,\"topicTags\":\"Array;Two Pointers;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":59.5738915105359,\"totalAccepted\":63753,\"totalSubmission\":107015},{\"questionId\":\"1999\",\"title\":\"Longer Contiguous Segments of Ones than Zeros\",\"titleSlug\":\"longer-contiguous-segments-of-ones-than-zeros\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":579,\"dislikes\":14,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.4%\",\"frontendQuestionId\":\"1869\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":62.40858759611228,\"totalAccepted\":66394,\"totalSubmission\":106386},{\"questionId\":\"2000\",\"title\":\"Minimum Speed to Arrive on Time\",\"titleSlug\":\"minimum-speed-to-arrive-on-time\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2458,\"dislikes\":293,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.8%\",\"frontendQuestionId\":\"1870\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.78128915234587,\"totalAccepted\":127760,\"totalSubmission\":267385},{\"questionId\":\"2001\",\"title\":\"Jump Game VII\",\"titleSlug\":\"jump-game-vii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1816,\"dislikes\":121,\"categoryTitle\":\"Algorithms\",\"acRate\":\"26.5%\",\"frontendQuestionId\":\"1871\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Sliding Window;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":26.462836679942797,\"totalAccepted\":67173,\"totalSubmission\":253839},{\"questionId\":\"2002\",\"title\":\"Stone Game VIII\",\"titleSlug\":\"stone-game-viii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":476,\"dislikes\":25,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.8%\",\"frontendQuestionId\":\"1872\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Dynamic Programming;Prefix Sum;Game Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.844887883151614,\"totalAccepted\":13087,\"totalSubmission\":24305},{\"questionId\":\"2024\",\"title\":\"Calculate Special Bonus\",\"titleSlug\":\"calculate-special-bonus\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1190,\"dislikes\":83,\"categoryTitle\":\"Database\",\"acRate\":\"57.0%\",\"frontendQuestionId\":\"1873\",\"paidOnly\":false,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":57.00539328596338,\"totalAccepted\":344254,\"totalSubmission\":603895},{\"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.8543569489015,\"totalAccepted\":25480,\"totalSubmission\":28357},{\"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.4%\",\"frontendQuestionId\":\"1875\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":65.42341273205052,\"totalAccepted\":15436,\"totalSubmission\":23594},{\"questionId\":\"1987\",\"title\":\"Substrings of Size Three with Distinct Characters\",\"titleSlug\":\"substrings-of-size-three-with-distinct-characters\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1704,\"dislikes\":58,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.7%\",\"frontendQuestionId\":\"1876\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Sliding Window;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":76.68322866247033,\"totalAccepted\":215142,\"totalSubmission\":280560},{\"questionId\":\"1988\",\"title\":\"Minimize Maximum Pair Sum in Array\",\"titleSlug\":\"minimize-maximum-pair-sum-in-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2377,\"dislikes\":547,\"categoryTitle\":\"Algorithms\",\"acRate\":\"83.3%\",\"frontendQuestionId\":\"1877\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":83.28492448219222,\"totalAccepted\":332620,\"totalSubmission\":399376},{\"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\":477,\"dislikes\":600,\"categoryTitle\":\"Algorithms\",\"acRate\":\"71.4%\",\"frontendQuestionId\":\"1878\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Sorting;Heap (Priority Queue);Matrix;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":71.36279554431853,\"totalAccepted\":88345,\"totalSubmission\":123797},{\"questionId\":\"1989\",\"title\":\"Minimum XOR Sum of Two Arrays\",\"titleSlug\":\"minimum-xor-sum-of-two-arrays\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":722,\"dislikes\":13,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.0%\",\"frontendQuestionId\":\"1879\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Bit Manipulation;Bitmask;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":50.99761360001969,\"totalAccepted\":20729,\"totalSubmission\":40647},{\"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.2%\",\"frontendQuestionId\":\"1880\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":75.22875226039784,\"totalAccepted\":83203,\"totalSubmission\":110600},{\"questionId\":\"2011\",\"title\":\"Maximum Value after Insertion\",\"titleSlug\":\"maximum-value-after-insertion\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":401,\"dislikes\":67,\"categoryTitle\":\"Algorithms\",\"acRate\":\"39.3%\",\"frontendQuestionId\":\"1881\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":39.330040600094854,\"totalAccepted\":34001,\"totalSubmission\":86452},{\"questionId\":\"2012\",\"title\":\"Process Tasks Using Servers\",\"titleSlug\":\"process-tasks-using-servers\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1036,\"dislikes\":290,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.9%\",\"frontendQuestionId\":\"1882\",\"paidOnly\":false,\"topicTags\":\"Array;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":41.93361395498163,\"totalAccepted\":47021,\"totalSubmission\":112132},{\"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.6%\",\"frontendQuestionId\":\"1883\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.59081234480312,\"totalAccepted\":8703,\"totalSubmission\":22552},{\"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\":1544,\"dislikes\":164,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.6%\",\"frontendQuestionId\":\"1884\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":74.59776115074531,\"totalAccepted\":64307,\"totalSubmission\":86205},{\"questionId\":\"2036\",\"title\":\"Count Pairs in Two Arrays\",\"titleSlug\":\"count-pairs-in-two-arrays\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":245,\"dislikes\":23,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.3%\",\"frontendQuestionId\":\"1885\",\"paidOnly\":true,\"topicTags\":\"Array;Two Pointers;Binary Search;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":60.31832606108687,\"totalAccepted\":12165,\"totalSubmission\":20168},{\"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\":1855,\"dislikes\":173,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.2%\",\"frontendQuestionId\":\"1886\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.22166869693278,\"totalAccepted\":187613,\"totalSubmission\":275005},{\"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\":1280,\"dislikes\":52,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.5%\",\"frontendQuestionId\":\"1887\",\"paidOnly\":false,\"topicTags\":\"Array;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.5022908714541,\"totalAccepted\":109977,\"totalSubmission\":151688},{\"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\":1813,\"dislikes\":122,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.5%\",\"frontendQuestionId\":\"1888\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":53.51447737114715,\"totalAccepted\":126048,\"totalSubmission\":235540},{\"questionId\":\"2018\",\"title\":\"Minimum Space Wasted From Packaging\",\"titleSlug\":\"minimum-space-wasted-from-packaging\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":424,\"dislikes\":39,\"categoryTitle\":\"Algorithms\",\"acRate\":\"33.5%\",\"frontendQuestionId\":\"1889\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Sorting;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":33.5132611131864,\"totalAccepted\":17943,\"totalSubmission\":53540},{\"questionId\":\"2041\",\"title\":\"The Latest Login in 2020\",\"titleSlug\":\"the-latest-login-in-2020\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":468,\"dislikes\":20,\"categoryTitle\":\"Database\",\"acRate\":\"77.0%\",\"frontendQuestionId\":\"1890\",\"paidOnly\":false,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":76.99824499080079,\"totalAccepted\":145219,\"totalSubmission\":188601},{\"questionId\":\"2045\",\"title\":\"Cutting Ribbons\",\"titleSlug\":\"cutting-ribbons\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":630,\"dislikes\":70,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.0%\",\"frontendQuestionId\":\"1891\",\"paidOnly\":true,\"topicTags\":\"Array;Binary Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":53.025042342124365,\"totalAccepted\":87661,\"totalSubmission\":165320},{\"questionId\":\"2046\",\"title\":\"Page Recommendations II\",\"titleSlug\":\"page-recommendations-ii\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":93,\"dislikes\":24,\"categoryTitle\":\"Database\",\"acRate\":\"45.6%\",\"frontendQuestionId\":\"1892\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":45.62694838933148,\"totalAccepted\":10538,\"totalSubmission\":23096},{\"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\":677,\"dislikes\":127,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.0%\",\"frontendQuestionId\":\"1893\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":50.95100778436851,\"totalAccepted\":68202,\"totalSubmission\":133858},{\"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\":1212,\"dislikes\":134,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.2%\",\"frontendQuestionId\":\"1894\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Simulation;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":53.17468407365299,\"totalAccepted\":203449,\"totalSubmission\":382605},{\"questionId\":\"1311\",\"title\":\"Largest Magic Square\",\"titleSlug\":\"largest-magic-square\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":609,\"dislikes\":334,\"categoryTitle\":\"Algorithms\",\"acRate\":\"75.2%\",\"frontendQuestionId\":\"1895\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":75.23909474076206,\"totalAccepted\":88898,\"totalSubmission\":118154},{\"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\":248,\"dislikes\":43,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.7%\",\"frontendQuestionId\":\"1896\",\"paidOnly\":false,\"topicTags\":\"Math;String;Dynamic Programming;Stack;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":49.7486033519553,\"totalAccepted\":5343,\"totalSubmission\":10740},{\"questionId\":\"2025\",\"title\":\"Redistribute Characters to Make All Strings Equal\",\"titleSlug\":\"redistribute-characters-to-make-all-strings-equal\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1170,\"dislikes\":85,\"categoryTitle\":\"Algorithms\",\"acRate\":\"66.9%\",\"frontendQuestionId\":\"1897\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":66.85313335375655,\"totalAccepted\":159305,\"totalSubmission\":238291},{\"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.0%\",\"frontendQuestionId\":\"1898\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;String;Binary Search;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":47.02570941366797,\"totalAccepted\":43021,\"totalSubmission\":91484},{\"questionId\":\"2026\",\"title\":\"Merge Triplets to Form Target Triplet\",\"titleSlug\":\"merge-triplets-to-form-target-triplet\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":940,\"dislikes\":80,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.9%\",\"frontendQuestionId\":\"1899\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":68.9481247054854,\"totalAccepted\":118517,\"totalSubmission\":171893},{\"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\":518,\"dislikes\":77,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.4%\",\"frontendQuestionId\":\"1900\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;Memoization;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.376011235303,\"totalAccepted\":62357,\"totalSubmission\":86157},{\"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.1%\",\"frontendQuestionId\":\"2201\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":57.10264819619169,\"totalAccepted\":23331,\"totalSubmission\":40858},{\"questionId\":\"1346\",\"title\":\"Maximize the Topmost Element After K Moves\",\"titleSlug\":\"maximize-the-topmost-element-after-k-moves\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":652,\"dislikes\":336,\"categoryTitle\":\"Algorithms\",\"acRate\":\"24.1%\",\"frontendQuestionId\":\"2202\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":24.082163189041577,\"totalAccepted\":38537,\"totalSubmission\":160023},{\"questionId\":\"2321\",\"title\":\"Minimum Weighted Subgraph With the Required Paths\",\"titleSlug\":\"minimum-weighted-subgraph-with-the-required-paths\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":791,\"dislikes\":23,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.8%\",\"frontendQuestionId\":\"2203\",\"paidOnly\":false,\"topicTags\":\"Graph Theory;Heap (Priority Queue);Shortest Path;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":41.7510321814377,\"totalAccepted\":22146,\"totalSubmission\":53043},{\"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.74987321229334,\"totalAccepted\":7271,\"totalSubmission\":9859},{\"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.7%\",\"frontendQuestionId\":\"2205\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":50.65158156616515,\"totalAccepted\":8551,\"totalSubmission\":16882},{\"questionId\":\"2308\",\"title\":\"Divide Array Into Equal Pairs\",\"titleSlug\":\"divide-array-into-equal-pairs\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1200,\"dislikes\":50,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.2%\",\"frontendQuestionId\":\"2206\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Bit Manipulation;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":79.23577538606013,\"totalAccepted\":302065,\"totalSubmission\":381223},{\"questionId\":\"2309\",\"title\":\"Maximize Number of Subsequences in a String\",\"titleSlug\":\"maximize-number-of-subsequences-in-a-string\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":533,\"dislikes\":37,\"categoryTitle\":\"Algorithms\",\"acRate\":\"36.0%\",\"frontendQuestionId\":\"2207\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":36.03291656404387,\"totalAccepted\":24871,\"totalSubmission\":69023},{\"questionId\":\"2310\",\"title\":\"Minimum Operations to Halve Array Sum\",\"titleSlug\":\"minimum-operations-to-halve-array-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":677,\"dislikes\":32,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.1%\",\"frontendQuestionId\":\"2208\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":50.08182545143474,\"totalAccepted\":53859,\"totalSubmission\":107543},{\"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.7%\",\"frontendQuestionId\":\"2209\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.742138364779876,\"totalAccepted\":16324,\"totalSubmission\":42135},{\"questionId\":\"2316\",\"title\":\"Count Hills and Valleys in an Array\",\"titleSlug\":\"count-hills-and-valleys-in-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1155,\"dislikes\":143,\"categoryTitle\":\"Algorithms\",\"acRate\":\"69.1%\",\"frontendQuestionId\":\"2210\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":69.0521215435207,\"totalAccepted\":181846,\"totalSubmission\":263346},{\"questionId\":\"2317\",\"title\":\"Count Collisions on a Road\",\"titleSlug\":\"count-collisions-on-a-road\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1115,\"dislikes\":277,\"categoryTitle\":\"Algorithms\",\"acRate\":\"58.1%\",\"frontendQuestionId\":\"2211\",\"paidOnly\":false,\"topicTags\":\"String;Stack;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.09294398363822,\"totalAccepted\":127819,\"totalSubmission\":220025},{\"questionId\":\"2318\",\"title\":\"Maximum Points in an Archery Competition\",\"titleSlug\":\"maximum-points-in-an-archery-competition\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":515,\"dislikes\":56,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.4%\",\"frontendQuestionId\":\"2212\",\"paidOnly\":false,\"topicTags\":\"Array;Backtracking;Bit Manipulation;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":51.39963645806284,\"totalAccepted\":19794,\"totalSubmission\":38510},{\"questionId\":\"2319\",\"title\":\"Longest Substring of One Repeating Character\",\"titleSlug\":\"longest-substring-of-one-repeating-character\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":322,\"dislikes\":84,\"categoryTitle\":\"Algorithms\",\"acRate\":\"34.3%\",\"frontendQuestionId\":\"2213\",\"paidOnly\":false,\"topicTags\":\"Array;String;Segment Tree;Ordered Set;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":34.28192574459404,\"totalAccepted\":6722,\"totalSubmission\":19608},{\"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.8%\",\"frontendQuestionId\":\"2214\",\"paidOnly\":true,\"topicTags\":\"Array;Greedy;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.84106199811908,\"totalAccepted\":40668,\"totalSubmission\":69115},{\"questionId\":\"1392\",\"title\":\"Find the Difference of Two Arrays\",\"titleSlug\":\"find-the-difference-of-two-arrays\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2622,\"dislikes\":129,\"categoryTitle\":\"Algorithms\",\"acRate\":\"81.4%\",\"frontendQuestionId\":\"2215\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":81.38621731986846,\"totalAccepted\":642956,\"totalSubmission\":790006},{\"questionId\":\"1355\",\"title\":\"Minimum Deletions to Make Array Beautiful\",\"titleSlug\":\"minimum-deletions-to-make-array-beautiful\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":836,\"dislikes\":96,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.9%\",\"frontendQuestionId\":\"2216\",\"paidOnly\":false,\"topicTags\":\"Array;Stack;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":49.892872974437275,\"totalAccepted\":40519,\"totalSubmission\":81212},{\"questionId\":\"1375\",\"title\":\"Find Palindrome With Fixed Length\",\"titleSlug\":\"find-palindrome-with-fixed-length\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":664,\"dislikes\":297,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.0%\",\"frontendQuestionId\":\"2217\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.01253430549297,\"totalAccepted\":27840,\"totalSubmission\":73239},{\"questionId\":\"1393\",\"title\":\"Maximum Value of K Coins From Piles\",\"titleSlug\":\"maximum-value-of-k-coins-from-piles\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2454,\"dislikes\":38,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.4%\",\"frontendQuestionId\":\"2218\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":60.42488775232763,\"totalAccepted\":82228,\"totalSubmission\":136083},{\"questionId\":\"2369\",\"title\":\"Maximum Sum Score of Array\",\"titleSlug\":\"maximum-sum-score-of-array\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":72,\"dislikes\":19,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.6%\",\"frontendQuestionId\":\"2219\",\"paidOnly\":true,\"topicTags\":\"Array;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":62.59648370497427,\"totalAccepted\":5839,\"totalSubmission\":9328},{\"questionId\":\"2323\",\"title\":\"Minimum Bit Flips to Convert Number\",\"titleSlug\":\"minimum-bit-flips-to-convert-number\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1616,\"dislikes\":39,\"categoryTitle\":\"Algorithms\",\"acRate\":\"87.8%\",\"frontendQuestionId\":\"2220\",\"paidOnly\":false,\"topicTags\":\"Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":87.84176177342586,\"totalAccepted\":373906,\"totalSubmission\":425659},{\"questionId\":\"2324\",\"title\":\"Find Triangular Sum of an Array\",\"titleSlug\":\"find-triangular-sum-of-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1545,\"dislikes\":77,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.0%\",\"frontendQuestionId\":\"2221\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Simulation;Combinatorics;Number Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":81.96813220247435,\"totalAccepted\":239772,\"totalSubmission\":292518},{\"questionId\":\"2325\",\"title\":\"Number of Ways to Select Buildings\",\"titleSlug\":\"number-of-ways-to-select-buildings\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1061,\"dislikes\":54,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.9%\",\"frontendQuestionId\":\"2222\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":50.859338589866745,\"totalAccepted\":53473,\"totalSubmission\":105139},{\"questionId\":\"2326\",\"title\":\"Sum of Scores of Built Strings\",\"titleSlug\":\"sum-of-scores-of-built-strings\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":302,\"dislikes\":190,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.8%\",\"frontendQuestionId\":\"2223\",\"paidOnly\":false,\"topicTags\":\"String;Binary Search;Rolling Hash;Suffix Array;String Matching;Hash Function;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":47.812833888504805,\"totalAccepted\":15214,\"totalSubmission\":31821},{\"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.4%\",\"frontendQuestionId\":\"2224\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":66.35632721041974,\"totalAccepted\":55379,\"totalSubmission\":83457},{\"questionId\":\"1354\",\"title\":\"Find Players With Zero or One Losses\",\"titleSlug\":\"find-players-with-zero-or-one-losses\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2276,\"dislikes\":160,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.5%\",\"frontendQuestionId\":\"2225\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sorting;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.45427508951924,\"totalAccepted\":315250,\"totalSubmission\":435102},{\"questionId\":\"1335\",\"title\":\"Maximum Candies Allocated to K Children\",\"titleSlug\":\"maximum-candies-allocated-to-k-children\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1839,\"dislikes\":86,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.9%\",\"frontendQuestionId\":\"2226\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.88606341218891,\"totalAccepted\":206004,\"totalSubmission\":412942},{\"questionId\":\"1433\",\"title\":\"Encrypt and Decrypt Strings\",\"titleSlug\":\"encrypt-and-decrypt-strings\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":353,\"dislikes\":80,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.2%\",\"frontendQuestionId\":\"2227\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Design;Trie;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.214059807621,\"totalAccepted\":17520,\"totalSubmission\":45847},{\"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\":\"46.9%\",\"frontendQuestionId\":\"2228\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":46.86897509061464,\"totalAccepted\":12155,\"totalSubmission\":25934},{\"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.1%\",\"frontendQuestionId\":\"2229\",\"paidOnly\":true,\"topicTags\":\"Array;Hash Table;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":62.13933849401829,\"totalAccepted\":7947,\"totalSubmission\":12789},{\"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.882154882154886,\"totalAccepted\":7556,\"totalSubmission\":14850},{\"questionId\":\"2327\",\"title\":\"Largest Number After Digit Swaps by Parity\",\"titleSlug\":\"largest-number-after-digit-swaps-by-parity\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":694,\"dislikes\":311,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.3%\",\"frontendQuestionId\":\"2231\",\"paidOnly\":false,\"topicTags\":\"Sorting;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":65.25455982668267,\"totalAccepted\":66866,\"totalSubmission\":102470},{\"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.1%\",\"frontendQuestionId\":\"2232\",\"paidOnly\":false,\"topicTags\":\"String;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":68.08815759679976,\"totalAccepted\":27063,\"totalSubmission\":39747},{\"questionId\":\"2329\",\"title\":\"Maximum Product After K Increments\",\"titleSlug\":\"maximum-product-after-k-increments\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":791,\"dislikes\":45,\"categoryTitle\":\"Algorithms\",\"acRate\":\"43.3%\",\"frontendQuestionId\":\"2233\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":43.32451310387766,\"totalAccepted\":44535,\"totalSubmission\":102794},{\"questionId\":\"2330\",\"title\":\"Maximum Total Beauty of the Gardens\",\"titleSlug\":\"maximum-total-beauty-of-the-gardens\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":452,\"dislikes\":41,\"categoryTitle\":\"Algorithms\",\"acRate\":\"30.2%\",\"frontendQuestionId\":\"2234\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Binary Search;Greedy;Sorting;Enumeration;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":30.183232931726906,\"totalAccepted\":9620,\"totalSubmission\":31872},{\"questionId\":\"2383\",\"title\":\"Add Two Integers\",\"titleSlug\":\"add-two-integers\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":2142,\"dislikes\":3226,\"categoryTitle\":\"Algorithms\",\"acRate\":\"88.0%\",\"frontendQuestionId\":\"2235\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":87.95011965441778,\"totalAccepted\":885347,\"totalSubmission\":1006647},{\"questionId\":\"2384\",\"title\":\"Root Equals Sum of Children\",\"titleSlug\":\"root-equals-sum-of-children\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1587,\"dislikes\":1648,\"categoryTitle\":\"Algorithms\",\"acRate\":\"84.9%\",\"frontendQuestionId\":\"2236\",\"paidOnly\":false,\"topicTags\":\"Tree;Binary Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":84.91669462419054,\"totalAccepted\":351824,\"totalSubmission\":414312},{\"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.03439803439803,\"totalAccepted\":5131,\"totalSubmission\":8140},{\"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.7%\",\"frontendQuestionId\":\"2238\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":71.74930432582849,\"totalAccepted\":11345,\"totalSubmission\":15812},{\"questionId\":\"2350\",\"title\":\"Find Closest Number to Zero\",\"titleSlug\":\"find-closest-number-to-zero\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":807,\"dislikes\":57,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.9%\",\"frontendQuestionId\":\"2239\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":47.85155715341588,\"totalAccepted\":209762,\"totalSubmission\":438361},{\"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\":479,\"dislikes\":37,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.7%\",\"frontendQuestionId\":\"2240\",\"paidOnly\":false,\"topicTags\":\"Math;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":56.7285516605166,\"totalAccepted\":39356,\"totalSubmission\":69376},{\"questionId\":\"2352\",\"title\":\"Design an ATM Machine\",\"titleSlug\":\"design-an-atm-machine\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":313,\"dislikes\":387,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.0%\",\"frontendQuestionId\":\"2241\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Design;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":44.9745369783881,\"totalAccepted\":35502,\"totalSubmission\":78938},{\"questionId\":\"2353\",\"title\":\"Maximum Score of a Node Sequence\",\"titleSlug\":\"maximum-score-of-a-node-sequence\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":581,\"dislikes\":21,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.0%\",\"frontendQuestionId\":\"2242\",\"paidOnly\":false,\"topicTags\":\"Array;Graph Theory;Sorting;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":39.969964503504144,\"totalAccepted\":17566,\"totalSubmission\":43948},{\"questionId\":\"2361\",\"title\":\"Calculate Digit Sum of a String\",\"titleSlug\":\"calculate-digit-sum-of-a-string\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":601,\"dislikes\":52,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.7%\",\"frontendQuestionId\":\"2243\",\"paidOnly\":false,\"topicTags\":\"String;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":67.72935012819083,\"totalAccepted\":54684,\"totalSubmission\":80739},{\"questionId\":\"2362\",\"title\":\"Minimum Rounds to Complete All Tasks\",\"titleSlug\":\"minimum-rounds-to-complete-all-tasks\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2851,\"dislikes\":85,\"categoryTitle\":\"Algorithms\",\"acRate\":\"63.3%\",\"frontendQuestionId\":\"2244\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Greedy;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":63.281175878150066,\"totalAccepted\":173412,\"totalSubmission\":274036},{\"questionId\":\"2363\",\"title\":\"Maximum Trailing Zeros in a Cornered Path\",\"titleSlug\":\"maximum-trailing-zeros-in-a-cornered-path\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":204,\"dislikes\":407,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.5%\",\"frontendQuestionId\":\"2245\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":37.461514778325125,\"totalAccepted\":9734,\"totalSubmission\":25984},{\"questionId\":\"2364\",\"title\":\"Longest Path With Different Adjacent Characters\",\"titleSlug\":\"longest-path-with-different-adjacent-characters\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":2551,\"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.96299461137366,\"totalAccepted\":92832,\"totalSubmission\":172027},{\"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\":\"51.0%\",\"frontendQuestionId\":\"2247\",\"paidOnly\":true,\"topicTags\":\"Dynamic Programming;Bit Manipulation;Graph Theory;Bitmask;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":51.02863202545069,\"totalAccepted\":2406,\"totalSubmission\":4715},{\"questionId\":\"2331\",\"title\":\"Intersection of Multiple Arrays\",\"titleSlug\":\"intersection-of-multiple-arrays\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":808,\"dislikes\":44,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.7%\",\"frontendQuestionId\":\"2248\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sorting;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":68.66126355890152,\"totalAccepted\":128687,\"totalSubmission\":187423},{\"questionId\":\"2332\",\"title\":\"Count Lattice Points Inside a Circle\",\"titleSlug\":\"count-lattice-points-inside-a-circle\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":256,\"dislikes\":223,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.6%\",\"frontendQuestionId\":\"2249\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Geometry;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":56.6051736932024,\"totalAccepted\":32800,\"totalSubmission\":57946},{\"questionId\":\"2333\",\"title\":\"Count Number of Rectangles Containing Each Point\",\"titleSlug\":\"count-number-of-rectangles-containing-each-point\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":554,\"dislikes\":141,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.5%\",\"frontendQuestionId\":\"2250\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Binary Search;Binary Indexed Tree;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":37.516688918558074,\"totalAccepted\":23323,\"totalSubmission\":62167},{\"questionId\":\"2334\",\"title\":\"Number of Flowers in Full Bloom\",\"titleSlug\":\"number-of-flowers-in-full-bloom\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1820,\"dislikes\":46,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.8%\",\"frontendQuestionId\":\"2251\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Binary Search;Sorting;Prefix Sum;Ordered Set;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":57.772783303579025,\"totalAccepted\":108733,\"totalSubmission\":188208},{\"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.1%\",\"frontendQuestionId\":\"2252\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":57.1021254536029,\"totalAccepted\":2203,\"totalSubmission\":3858},{\"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.4%\",\"frontendQuestionId\":\"2253\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":69.35101847465656,\"totalAccepted\":1464,\"totalSubmission\":2111},{\"questionId\":\"2396\",\"title\":\"Design Video Sharing Platform\",\"titleSlug\":\"design-video-sharing-platform\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":88,\"dislikes\":15,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.1%\",\"frontendQuestionId\":\"2254\",\"paidOnly\":true,\"topicTags\":\"Hash Table;Design;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":64.08643951520695,\"totalAccepted\":5605,\"totalSubmission\":8746},{\"questionId\":\"2341\",\"title\":\"Count Prefixes of a Given String\",\"titleSlug\":\"count-prefixes-of-a-given-string\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":608,\"dislikes\":24,\"categoryTitle\":\"Algorithms\",\"acRate\":\"74.3%\",\"frontendQuestionId\":\"2255\",\"paidOnly\":false,\"topicTags\":\"Array;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":74.2790322177926,\"totalAccepted\":89245,\"totalSubmission\":120149},{\"questionId\":\"2342\",\"title\":\"Minimum Average Difference\",\"titleSlug\":\"minimum-average-difference\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1570,\"dislikes\":182,\"categoryTitle\":\"Algorithms\",\"acRate\":\"43.8%\",\"frontendQuestionId\":\"2256\",\"paidOnly\":false,\"topicTags\":\"Array;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":43.849634840270625,\"totalAccepted\":97868,\"totalSubmission\":223190},{\"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.97539956911669,\"totalAccepted\":206502,\"totalSubmission\":299385},{\"questionId\":\"2344\",\"title\":\"Escape the Spreading Fire\",\"titleSlug\":\"escape-the-spreading-fire\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":887,\"dislikes\":42,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.0%\",\"frontendQuestionId\":\"2258\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Breadth-First Search;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.019965198278236,\"totalAccepted\":20757,\"totalSubmission\":54595},{\"questionId\":\"2337\",\"title\":\"Remove Digit From Number to Maximize Result\",\"titleSlug\":\"remove-digit-from-number-to-maximize-result\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":956,\"dislikes\":66,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.4%\",\"frontendQuestionId\":\"2259\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":48.406272343069766,\"totalAccepted\":129313,\"totalSubmission\":267141},{\"questionId\":\"2338\",\"title\":\"Minimum Consecutive Cards to Pick Up\",\"titleSlug\":\"minimum-consecutive-cards-to-pick-up\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1095,\"dislikes\":45,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.7%\",\"frontendQuestionId\":\"2260\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sliding Window;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.68975167695793,\"totalAccepted\":120861,\"totalSubmission\":225110},{\"questionId\":\"2339\",\"title\":\"K Divisible Elements Subarrays\",\"titleSlug\":\"k-divisible-elements-subarrays\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":740,\"dislikes\":162,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.9%\",\"frontendQuestionId\":\"2261\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Trie;Rolling Hash;Hash Function;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":54.86146885569019,\"totalAccepted\":48988,\"totalSubmission\":89294},{\"questionId\":\"2340\",\"title\":\"Total Appeal of A String\",\"titleSlug\":\"total-appeal-of-a-string\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1223,\"dislikes\":35,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.4%\",\"frontendQuestionId\":\"2262\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":56.40513036671283,\"totalAccepted\":46836,\"totalSubmission\":83035},{\"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.5%\",\"frontendQuestionId\":\"2263\",\"paidOnly\":true,\"topicTags\":\"Array;Dynamic Programming;Greedy;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":65.48805460750853,\"totalAccepted\":4797,\"totalSubmission\":7325},{\"questionId\":\"2346\",\"title\":\"Largest 3-Same-Digit Number in String\",\"titleSlug\":\"largest-3-same-digit-number-in-string\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1391,\"dislikes\":55,\"categoryTitle\":\"Algorithms\",\"acRate\":\"72.7%\",\"frontendQuestionId\":\"2264\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.68786417184563,\"totalAccepted\":325968,\"totalSubmission\":448449},{\"questionId\":\"2347\",\"title\":\"Count Nodes Equal to Average of Subtree\",\"titleSlug\":\"count-nodes-equal-to-average-of-subtree\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2362,\"dislikes\":59,\"categoryTitle\":\"Algorithms\",\"acRate\":\"86.8%\",\"frontendQuestionId\":\"2265\",\"paidOnly\":false,\"topicTags\":\"Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":86.75130165641517,\"totalAccepted\":198441,\"totalSubmission\":228747},{\"questionId\":\"2348\",\"title\":\"Count Number of Texts\",\"titleSlug\":\"count-number-of-texts\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":945,\"dislikes\":36,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.1%\",\"frontendQuestionId\":\"2266\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Math;String;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":50.10554045154427,\"totalAccepted\":29672,\"totalSubmission\":59219},{\"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\":541,\"dislikes\":9,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.1%\",\"frontendQuestionId\":\"2267\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.13609502775623,\"totalAccepted\":20172,\"totalSubmission\":50259},{\"questionId\":\"2405\",\"title\":\"Minimum Number of Keypresses\",\"titleSlug\":\"minimum-number-of-keypresses\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":250,\"dislikes\":40,\"categoryTitle\":\"Algorithms\",\"acRate\":\"71.4%\",\"frontendQuestionId\":\"2268\",\"paidOnly\":true,\"topicTags\":\"Hash Table;String;Greedy;Sorting;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":71.44092052941967,\"totalAccepted\":37190,\"totalSubmission\":52057},{\"questionId\":\"1430\",\"title\":\"Find the K-Beauty of a Number\",\"titleSlug\":\"find-the-k-beauty-of-a-number\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":743,\"dislikes\":47,\"categoryTitle\":\"Algorithms\",\"acRate\":\"63.3%\",\"frontendQuestionId\":\"2269\",\"paidOnly\":false,\"topicTags\":\"Math;String;Sliding Window;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":63.263637749234455,\"totalAccepted\":91315,\"totalSubmission\":144341},{\"questionId\":\"2358\",\"title\":\"Number of Ways to Split Array\",\"titleSlug\":\"number-of-ways-to-split-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1200,\"dislikes\":100,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.9%\",\"frontendQuestionId\":\"2270\",\"paidOnly\":false,\"topicTags\":\"Array;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.883781807890955,\"totalAccepted\":236964,\"totalSubmission\":424030},{\"questionId\":\"2359\",\"title\":\"Maximum White Tiles Covered by a Carpet\",\"titleSlug\":\"maximum-white-tiles-covered-by-a-carpet\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":841,\"dislikes\":58,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.8%\",\"frontendQuestionId\":\"2271\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Greedy;Sliding Window;Sorting;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":35.83139317171651,\"totalAccepted\":22008,\"totalSubmission\":61421},{\"questionId\":\"2360\",\"title\":\"Substring With Largest Variance\",\"titleSlug\":\"substring-with-largest-variance\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1921,\"dislikes\":213,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.0%\",\"frontendQuestionId\":\"2272\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Dynamic Programming;Enumeration;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":45.984240540393436,\"totalAccepted\":76040,\"totalSubmission\":165361},{\"questionId\":\"1353\",\"title\":\"Find Resultant Array After Removing Anagrams\",\"titleSlug\":\"find-resultant-array-after-removing-anagrams\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1068,\"dislikes\":238,\"categoryTitle\":\"Algorithms\",\"acRate\":\"69.9%\",\"frontendQuestionId\":\"2273\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":69.9339351015442,\"totalAccepted\":208643,\"totalSubmission\":298343},{\"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.6%\",\"frontendQuestionId\":\"2274\",\"paidOnly\":false,\"topicTags\":\"Array;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":52.55675736932899,\"totalAccepted\":41739,\"totalSubmission\":79417},{\"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\":1137,\"dislikes\":60,\"categoryTitle\":\"Algorithms\",\"acRate\":\"80.8%\",\"frontendQuestionId\":\"2275\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Bit Manipulation;Counting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":80.7542443640412,\"totalAccepted\":156680,\"totalSubmission\":194021},{\"questionId\":\"2357\",\"title\":\"Count Integers in Intervals\",\"titleSlug\":\"count-integers-in-intervals\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":626,\"dislikes\":64,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.8%\",\"frontendQuestionId\":\"2276\",\"paidOnly\":false,\"topicTags\":\"Design;Segment Tree;Ordered Set;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":35.83444625506941,\"totalAccepted\":29247,\"totalSubmission\":81617},{\"questionId\":\"2420\",\"title\":\"Closest Node to Path in Tree\",\"titleSlug\":\"closest-node-to-path-in-tree\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":139,\"dislikes\":3,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.3%\",\"frontendQuestionId\":\"2277\",\"paidOnly\":true,\"topicTags\":\"Array;Tree;Depth-First Search;Breadth-First Search;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":62.31897686665413,\"totalAccepted\":6627,\"totalSubmission\":10634},{\"questionId\":\"2365\",\"title\":\"Percentage of Letter in String\",\"titleSlug\":\"percentage-of-letter-in-string\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":563,\"dislikes\":64,\"categoryTitle\":\"Algorithms\",\"acRate\":\"75.2%\",\"frontendQuestionId\":\"2278\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":75.18358547485197,\"totalAccepted\":100437,\"totalSubmission\":133589},{\"questionId\":\"2366\",\"title\":\"Maximum Bags With Full Capacity of Rocks\",\"titleSlug\":\"maximum-bags-with-full-capacity-of-rocks\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1773,\"dislikes\":72,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.1%\",\"frontendQuestionId\":\"2279\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.05350165314097,\"totalAccepted\":113207,\"totalSubmission\":166350},{\"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.0%\",\"frontendQuestionId\":\"2280\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Geometry;Sorting;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":26.9735744553068,\"totalAccepted\":32337,\"totalSubmission\":119884},{\"questionId\":\"2368\",\"title\":\"Sum of Total Strength of Wizards\",\"titleSlug\":\"sum-of-total-strength-of-wizards\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1273,\"dislikes\":112,\"categoryTitle\":\"Algorithms\",\"acRate\":\"29.3%\",\"frontendQuestionId\":\"2281\",\"paidOnly\":false,\"topicTags\":\"Array;Stack;Monotonic Stack;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":29.254869722089015,\"totalAccepted\":25622,\"totalSubmission\":87582},{\"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\":66,\"dislikes\":34,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.4%\",\"frontendQuestionId\":\"2282\",\"paidOnly\":true,\"topicTags\":\"Array;Stack;Matrix;Monotonic Stack;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":47.426536064113975,\"totalAccepted\":2663,\"totalSubmission\":5615},{\"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\":679,\"dislikes\":101,\"categoryTitle\":\"Algorithms\",\"acRate\":\"73.1%\",\"frontendQuestionId\":\"2283\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":73.12438365561891,\"totalAccepted\":85274,\"totalSubmission\":116615},{\"questionId\":\"2378\",\"title\":\"Sender With Largest Word Count\",\"titleSlug\":\"sender-with-largest-word-count\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":470,\"dislikes\":41,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.7%\",\"frontendQuestionId\":\"2284\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":59.665329391891895,\"totalAccepted\":45211,\"totalSubmission\":75775},{\"questionId\":\"2379\",\"title\":\"Maximum Total Importance of Roads\",\"titleSlug\":\"maximum-total-importance-of-roads\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1365,\"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.10211680107011,\"totalAccepted\":162211,\"totalSubmission\":234741},{\"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.5%\",\"frontendQuestionId\":\"2286\",\"paidOnly\":false,\"topicTags\":\"Binary Search;Design;Binary Indexed Tree;Segment Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":19.511662964138367,\"totalAccepted\":9837,\"totalSubmission\":50416},{\"questionId\":\"2372\",\"title\":\"Rearrange Characters to Make Target String\",\"titleSlug\":\"rearrange-characters-to-make-target-string\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":533,\"dislikes\":38,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.2%\",\"frontendQuestionId\":\"2287\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":61.1988031482405,\"totalAccepted\":56451,\"totalSubmission\":92242},{\"questionId\":\"2373\",\"title\":\"Apply Discount to Prices\",\"titleSlug\":\"apply-discount-to-prices\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":223,\"dislikes\":1130,\"categoryTitle\":\"Algorithms\",\"acRate\":\"34.1%\",\"frontendQuestionId\":\"2288\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":34.08593235112784,\"totalAccepted\":32066,\"totalSubmission\":94074},{\"questionId\":\"2374\",\"title\":\"Steps to Make Array Non-decreasing\",\"titleSlug\":\"steps-to-make-array-non-decreasing\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1414,\"dislikes\":149,\"categoryTitle\":\"Algorithms\",\"acRate\":\"24.8%\",\"frontendQuestionId\":\"2289\",\"paidOnly\":false,\"topicTags\":\"Array;Linked List;Dynamic Programming;Stack;Monotonic Stack;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":24.783336345278972,\"totalAccepted\":31542,\"totalSubmission\":127271},{\"questionId\":\"2375\",\"title\":\"Minimum Obstacle Removal to Reach Corner\",\"titleSlug\":\"minimum-obstacle-removal-to-reach-corner\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1668,\"dislikes\":29,\"categoryTitle\":\"Algorithms\",\"acRate\":\"70.6%\",\"frontendQuestionId\":\"2290\",\"paidOnly\":false,\"topicTags\":\"Array;Breadth-First Search;Graph Theory;Heap (Priority Queue);Matrix;Shortest Path;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":70.61350185805387,\"totalAccepted\":123133,\"totalSubmission\":174376},{\"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.2%\",\"frontendQuestionId\":\"2291\",\"paidOnly\":true,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":48.1594756963408,\"totalAccepted\":17636,\"totalSubmission\":36620},{\"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.7%\",\"frontendQuestionId\":\"2292\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.67073170731707,\"totalAccepted\":10672,\"totalSubmission\":26240},{\"questionId\":\"2386\",\"title\":\"Min Max Game\",\"titleSlug\":\"min-max-game\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":591,\"dislikes\":33,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.3%\",\"frontendQuestionId\":\"2293\",\"paidOnly\":false,\"topicTags\":\"Array;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":64.28854998789639,\"totalAccepted\":66394,\"totalSubmission\":103274},{\"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\":1179,\"dislikes\":47,\"categoryTitle\":\"Algorithms\",\"acRate\":\"81.8%\",\"frontendQuestionId\":\"2294\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":81.80799492141662,\"totalAccepted\":170105,\"totalSubmission\":207932},{\"questionId\":\"2388\",\"title\":\"Replace Elements in an Array\",\"titleSlug\":\"replace-elements-in-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":683,\"dislikes\":39,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.7%\",\"frontendQuestionId\":\"2295\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":59.72014366956001,\"totalAccepted\":47885,\"totalSubmission\":80183},{\"questionId\":\"2389\",\"title\":\"Design a Text Editor\",\"titleSlug\":\"design-a-text-editor\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":658,\"dislikes\":229,\"categoryTitle\":\"Algorithms\",\"acRate\":\"50.4%\",\"frontendQuestionId\":\"2296\",\"paidOnly\":false,\"topicTags\":\"Linked List;String;Stack;Design;Simulation;Doubly-Linked List;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":50.40397099938397,\"totalAccepted\":42547,\"totalSubmission\":84412},{\"questionId\":\"2056\",\"title\":\"Jump Game VIII\",\"titleSlug\":\"jump-game-viii\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":173,\"dislikes\":49,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.6%\",\"frontendQuestionId\":\"2297\",\"paidOnly\":true,\"topicTags\":\"Array;Dynamic Programming;Stack;Graph Theory;Monotonic Stack;Shortest Path;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":45.63739214902006,\"totalAccepted\":7987,\"totalSubmission\":17501},{\"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.8045378299638,\"totalAccepted\":9266,\"totalSubmission\":11327},{\"questionId\":\"2391\",\"title\":\"Strong Password Checker II\",\"titleSlug\":\"strong-password-checker-ii\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":386,\"dislikes\":41,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.4%\",\"frontendQuestionId\":\"2299\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":55.37899525957861,\"totalAccepted\":58061,\"totalSubmission\":104843},{\"questionId\":\"2392\",\"title\":\"Successful Pairs of Spells and Potions\",\"titleSlug\":\"successful-pairs-of-spells-and-potions\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":3216,\"dislikes\":106,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.5%\",\"frontendQuestionId\":\"2300\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Binary Search;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.54637376121177,\"totalAccepted\":384410,\"totalSubmission\":775859},{\"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\":\"34.9%\",\"frontendQuestionId\":\"2701\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":34.86862442040186,\"totalAccepted\":5640,\"totalSubmission\":16175},{\"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.12918593246462,\"totalAccepted\":6299,\"totalSubmission\":14274},{\"questionId\":\"2820\",\"title\":\"Return Length of Arguments Passed\",\"titleSlug\":\"return-length-of-arguments-passed\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":426,\"dislikes\":177,\"categoryTitle\":\"JavaScript\",\"acRate\":\"94.5%\",\"frontendQuestionId\":\"2703\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":94.48830294353633,\"totalAccepted\":300296,\"totalSubmission\":317813},{\"questionId\":\"2813\",\"title\":\"To Be Or Not To Be\",\"titleSlug\":\"to-be-or-not-to-be\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":936,\"dislikes\":224,\"categoryTitle\":\"JavaScript\",\"acRate\":\"63.3%\",\"frontendQuestionId\":\"2704\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":63.315833093238574,\"totalAccepted\":356007,\"totalSubmission\":562274},{\"questionId\":\"2804\",\"title\":\"Compact Object\",\"titleSlug\":\"compact-object\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":230,\"dislikes\":25,\"categoryTitle\":\"JavaScript\",\"acRate\":\"68.0%\",\"frontendQuestionId\":\"2705\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.02474767634145,\"totalAccepted\":47718,\"totalSubmission\":70148},{\"questionId\":\"2756\",\"title\":\"Buy Two Chocolates\",\"titleSlug\":\"buy-two-chocolates\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":1071,\"dislikes\":72,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.4%\",\"frontendQuestionId\":\"2706\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.352696804341,\"totalAccepted\":224094,\"totalSubmission\":327850},{\"questionId\":\"2755\",\"title\":\"Extra Characters in a String\",\"titleSlug\":\"extra-characters-in-a-string\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":2637,\"dislikes\":138,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.3%\",\"frontendQuestionId\":\"2707\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Dynamic Programming;Trie;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":57.33275342615689,\"totalAccepted\":199049,\"totalSubmission\":347182},{\"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.7%\",\"frontendQuestionId\":\"2708\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Backtracking;Greedy;Bit Manipulation;Sorting;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":25.674321670474132,\"totalAccepted\":38436,\"totalSubmission\":149706},{\"questionId\":\"2827\",\"title\":\"Greatest Common Divisor Traversal\",\"titleSlug\":\"greatest-common-divisor-traversal\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":864,\"dislikes\":144,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.8%\",\"frontendQuestionId\":\"2709\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Union-Find;Number Theory;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":41.77503905760929,\"totalAccepted\":76742,\"totalSubmission\":183703},{\"questionId\":\"2819\",\"title\":\"Remove Trailing Zeros From a String\",\"titleSlug\":\"remove-trailing-zeros-from-a-string\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":342,\"dislikes\":13,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.5%\",\"frontendQuestionId\":\"2710\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":79.51029317426331,\"totalAccepted\":95437,\"totalSubmission\":120031},{\"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.3%\",\"frontendQuestionId\":\"2711\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":68.34151304764184,\"totalAccepted\":22837,\"totalSubmission\":33416},{\"questionId\":\"2817\",\"title\":\"Minimum Cost to Make All Characters Equal\",\"titleSlug\":\"minimum-cost-to-make-all-characters-equal\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":583,\"dislikes\":27,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.3%\",\"frontendQuestionId\":\"2712\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":54.32699150733027,\"totalAccepted\":22901,\"totalSubmission\":42154},{\"questionId\":\"2818\",\"title\":\"Maximum Strictly Increasing Cells in a Matrix\",\"titleSlug\":\"maximum-strictly-increasing-cells-in-a-matrix\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":630,\"dislikes\":22,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.4%\",\"frontendQuestionId\":\"2713\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Binary Search;Dynamic Programming;Memoization;Sorting;Matrix;Ordered Set;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":31.364481019378815,\"totalAccepted\":16541,\"totalSubmission\":52738},{\"questionId\":\"2865\",\"title\":\"Find Shortest Path with K Hops\",\"titleSlug\":\"find-shortest-path-with-k-hops\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":40,\"dislikes\":1,\"categoryTitle\":\"Algorithms\",\"acRate\":\"69.0%\",\"frontendQuestionId\":\"2714\",\"paidOnly\":true,\"topicTags\":\"Graph Theory;Heap (Priority Queue);Shortest Path;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":68.98843930635839,\"totalAccepted\":2387,\"totalSubmission\":3460},{\"questionId\":\"2821\",\"title\":\"Timeout Cancellation\",\"titleSlug\":\"timeout-cancellation\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":322,\"dislikes\":375,\"categoryTitle\":\"JavaScript\",\"acRate\":\"89.5%\",\"frontendQuestionId\":\"2715\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":89.5228397879288,\"totalAccepted\":101988,\"totalSubmission\":113924},{\"questionId\":\"2825\",\"title\":\"Minimize String Length\",\"titleSlug\":\"minimize-string-length\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":378,\"dislikes\":109,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.1%\",\"frontendQuestionId\":\"2716\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":79.10052125060581,\"totalAccepted\":79973,\"totalSubmission\":101103},{\"questionId\":\"2785\",\"title\":\"Semi-Ordered Permutation\",\"titleSlug\":\"semi-ordered-permutation\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":229,\"dislikes\":21,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.2%\",\"frontendQuestionId\":\"2717\",\"paidOnly\":false,\"topicTags\":\"Array;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":64.2043261566344,\"totalAccepted\":38260,\"totalSubmission\":59591},{\"questionId\":\"2838\",\"title\":\"Sum of Matrix After Queries\",\"titleSlug\":\"sum-of-matrix-after-queries\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":733,\"dislikes\":28,\"categoryTitle\":\"Algorithms\",\"acRate\":\"32.1%\",\"frontendQuestionId\":\"2718\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":32.0771141094242,\"totalAccepted\":25058,\"totalSubmission\":78118},{\"questionId\":\"2757\",\"title\":\"Count of Integers\",\"titleSlug\":\"count-of-integers\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":576,\"dislikes\":12,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.4%\",\"frontendQuestionId\":\"2719\",\"paidOnly\":false,\"topicTags\":\"Math;String;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.44006882049321,\"totalAccepted\":20108,\"totalSubmission\":52310},{\"questionId\":\"2874\",\"title\":\"Popularity Percentage\",\"titleSlug\":\"popularity-percentage\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":14,\"dislikes\":9,\"categoryTitle\":\"Database\",\"acRate\":\"53.3%\",\"frontendQuestionId\":\"2720\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":53.333333333333336,\"totalAccepted\":3984,\"totalSubmission\":7470},{\"questionId\":\"2807\",\"title\":\"Execute Asynchronous Functions in Parallel\",\"titleSlug\":\"execute-asynchronous-functions-in-parallel\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":260,\"dislikes\":49,\"categoryTitle\":\"JavaScript\",\"acRate\":\"78.5%\",\"frontendQuestionId\":\"2721\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":78.4625032066813,\"totalAccepted\":55054,\"totalSubmission\":70166},{\"questionId\":\"2858\",\"title\":\"Join Two Arrays by ID\",\"titleSlug\":\"join-two-arrays-by-id\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":243,\"dislikes\":65,\"categoryTitle\":\"JavaScript\",\"acRate\":\"57.4%\",\"frontendQuestionId\":\"2722\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":57.358848261881526,\"totalAccepted\":61117,\"totalSubmission\":106552},{\"questionId\":\"2859\",\"title\":\"Add Two Promises\",\"titleSlug\":\"add-two-promises\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":364,\"dislikes\":33,\"categoryTitle\":\"JavaScript\",\"acRate\":\"91.7%\",\"frontendQuestionId\":\"2723\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":91.66414050047426,\"totalAccepted\":187474,\"totalSubmission\":204523},{\"questionId\":\"2860\",\"title\":\"Sort By\",\"titleSlug\":\"sort-by\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":233,\"dislikes\":49,\"categoryTitle\":\"JavaScript\",\"acRate\":\"83.1%\",\"frontendQuestionId\":\"2724\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":83.0646562739586,\"totalAccepted\":81256,\"totalSubmission\":97823},{\"questionId\":\"2862\",\"title\":\"Interval Cancellation\",\"titleSlug\":\"interval-cancellation\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":217,\"dislikes\":99,\"categoryTitle\":\"JavaScript\",\"acRate\":\"84.8%\",\"frontendQuestionId\":\"2725\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":84.8233746145579,\"totalAccepted\":84451,\"totalSubmission\":99561},{\"questionId\":\"2863\",\"title\":\"Calculator with Method Chaining\",\"titleSlug\":\"calculator-with-method-chaining\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":153,\"dislikes\":22,\"categoryTitle\":\"JavaScript\",\"acRate\":\"77.5%\",\"frontendQuestionId\":\"2726\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":77.53352689064013,\"totalAccepted\":56079,\"totalSubmission\":72329},{\"questionId\":\"2864\",\"title\":\"Is Object Empty\",\"titleSlug\":\"is-object-empty\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":225,\"dislikes\":16,\"categoryTitle\":\"JavaScript\",\"acRate\":\"81.9%\",\"frontendQuestionId\":\"2727\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":81.90576115986265,\"totalAccepted\":120217,\"totalSubmission\":146775},{\"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.2%\",\"frontendQuestionId\":\"2728\",\"paidOnly\":true,\"topicTags\":\"Array;Interactive;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":86.22395833333333,\"totalAccepted\":3311,\"totalSubmission\":3840},{\"questionId\":\"2824\",\"title\":\"Check if The Number is Fascinating\",\"titleSlug\":\"check-if-the-number-is-fascinating\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":263,\"dislikes\":14,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.0%\",\"frontendQuestionId\":\"2729\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.00337725753077,\"totalAccepted\":62306,\"totalSubmission\":117550},{\"questionId\":\"2786\",\"title\":\"Find the Longest Semi-Repetitive Substring\",\"titleSlug\":\"find-the-longest-semi-repetitive-substring\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":318,\"dislikes\":89,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.8%\",\"frontendQuestionId\":\"2730\",\"paidOnly\":false,\"topicTags\":\"String;Sliding Window;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.83872776330698,\"totalAccepted\":33251,\"totalSubmission\":85613},{\"questionId\":\"2787\",\"title\":\"Movement of Robots\",\"titleSlug\":\"movement-of-robots\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":546,\"dislikes\":103,\"categoryTitle\":\"Algorithms\",\"acRate\":\"27.9%\",\"frontendQuestionId\":\"2731\",\"paidOnly\":false,\"topicTags\":\"Array;Brainteaser;Sorting;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":27.949965462353966,\"totalAccepted\":18613,\"totalSubmission\":66594},{\"questionId\":\"2826\",\"title\":\"Find a Good Subset of the Matrix\",\"titleSlug\":\"find-a-good-subset-of-the-matrix\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":213,\"dislikes\":30,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.7%\",\"frontendQuestionId\":\"2732\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Bit Manipulation;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":46.74808133998095,\"totalAccepted\":8345,\"totalSubmission\":17851},{\"questionId\":\"2836\",\"title\":\"Neither Minimum nor Maximum\",\"titleSlug\":\"neither-minimum-nor-maximum\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":406,\"dislikes\":20,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.4%\",\"frontendQuestionId\":\"2733\",\"paidOnly\":false,\"topicTags\":\"Array;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":76.37423049231748,\"totalAccepted\":136841,\"totalSubmission\":179172},{\"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\":\"34.8%\",\"frontendQuestionId\":\"2734\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":34.83773847089135,\"totalAccepted\":36102,\"totalSubmission\":103629},{\"questionId\":\"2810\",\"title\":\"Collecting Chocolates\",\"titleSlug\":\"collecting-chocolates\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":314,\"dislikes\":556,\"categoryTitle\":\"Algorithms\",\"acRate\":\"34.9%\",\"frontendQuestionId\":\"2735\",\"paidOnly\":false,\"topicTags\":\"Array;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":34.89837862525691,\"totalAccepted\":15282,\"totalSubmission\":43790},{\"questionId\":\"2839\",\"title\":\"Maximum Sum Queries\",\"titleSlug\":\"maximum-sum-queries\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":354,\"dislikes\":17,\"categoryTitle\":\"Algorithms\",\"acRate\":\"30.2%\",\"frontendQuestionId\":\"2736\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Stack;Binary Indexed Tree;Segment Tree;Sorting;Monotonic Stack;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":30.19740675990676,\"totalAccepted\":8291,\"totalSubmission\":27456},{\"questionId\":\"2880\",\"title\":\"Find the Closest Marked Node\",\"titleSlug\":\"find-the-closest-marked-node\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":58,\"dislikes\":6,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.5%\",\"frontendQuestionId\":\"2737\",\"paidOnly\":true,\"topicTags\":\"Array;Graph Theory;Heap (Priority Queue);Shortest Path;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":65.4553492484527,\"totalAccepted\":7403,\"totalSubmission\":11310},{\"questionId\":\"2885\",\"title\":\"Count Occurrences in Text\",\"titleSlug\":\"count-occurrences-in-text\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":29,\"dislikes\":48,\"categoryTitle\":\"Database\",\"acRate\":\"54.5%\",\"frontendQuestionId\":\"2738\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":54.505087881591116,\"totalAccepted\":11784,\"totalSubmission\":21620},{\"questionId\":\"2857\",\"title\":\"Total Distance Traveled\",\"titleSlug\":\"total-distance-traveled\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":329,\"dislikes\":107,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.4%\",\"frontendQuestionId\":\"2739\",\"paidOnly\":false,\"topicTags\":\"Math;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":41.358206320249515,\"totalAccepted\":63252,\"totalSubmission\":152937},{\"questionId\":\"2845\",\"title\":\"Find the Value of the Partition\",\"titleSlug\":\"find-the-value-of-the-partition\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":325,\"dislikes\":26,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.8%\",\"frontendQuestionId\":\"2740\",\"paidOnly\":false,\"topicTags\":\"Array;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":64.8446481157777,\"totalAccepted\":41177,\"totalSubmission\":63501},{\"questionId\":\"2848\",\"title\":\"Special Permutations\",\"titleSlug\":\"special-permutations\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":592,\"dislikes\":66,\"categoryTitle\":\"Algorithms\",\"acRate\":\"29.5%\",\"frontendQuestionId\":\"2741\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Bit Manipulation;Bitmask;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":29.479692282240055,\"totalAccepted\":17819,\"totalSubmission\":60445},{\"questionId\":\"2808\",\"title\":\"Painting the Walls\",\"titleSlug\":\"painting-the-walls\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1502,\"dislikes\":95,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.0%\",\"frontendQuestionId\":\"2742\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.000403014056644,\"totalAccepted\":80246,\"totalSubmission\":163766},{\"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\":\"76.0%\",\"frontendQuestionId\":\"2743\",\"paidOnly\":true,\"topicTags\":\"Hash Table;String;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":75.97254004576659,\"totalAccepted\":9296,\"totalSubmission\":12236},{\"questionId\":\"2847\",\"title\":\"Find Maximum Number of String Pairs\",\"titleSlug\":\"find-maximum-number-of-string-pairs\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":473,\"dislikes\":19,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.4%\",\"frontendQuestionId\":\"2744\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":82.40290314104521,\"totalAccepted\":116034,\"totalSubmission\":140813},{\"questionId\":\"2850\",\"title\":\"Construct the Longest New String\",\"titleSlug\":\"construct-the-longest-new-string\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":341,\"dislikes\":29,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.7%\",\"frontendQuestionId\":\"2745\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Greedy;Brainteaser;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":54.731202509727225,\"totalAccepted\":26867,\"totalSubmission\":49089},{\"questionId\":\"2854\",\"title\":\"Decremental String Concatenation\",\"titleSlug\":\"decremental-string-concatenation\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":377,\"dislikes\":33,\"categoryTitle\":\"Algorithms\",\"acRate\":\"27.7%\",\"frontendQuestionId\":\"2746\",\"paidOnly\":false,\"topicTags\":\"Array;String;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":27.650475837350143,\"totalAccepted\":11186,\"totalSubmission\":40455},{\"questionId\":\"2833\",\"title\":\"Count Zero Request Servers\",\"titleSlug\":\"count-zero-request-servers\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":406,\"dislikes\":58,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.8%\",\"frontendQuestionId\":\"2747\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sliding Window;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":35.762328709776455,\"totalAccepted\":12814,\"totalSubmission\":35831},{\"questionId\":\"2831\",\"title\":\"Number of Beautiful Pairs\",\"titleSlug\":\"number-of-beautiful-pairs\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":241,\"dislikes\":43,\"categoryTitle\":\"Algorithms\",\"acRate\":\"52.3%\",\"frontendQuestionId\":\"2748\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Counting;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":52.280309015889735,\"totalAccepted\":47642,\"totalSubmission\":91128},{\"questionId\":\"2837\",\"title\":\"Minimum Operations to Make the Integer Zero\",\"titleSlug\":\"minimum-operations-to-make-the-integer-zero\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":769,\"dislikes\":376,\"categoryTitle\":\"Algorithms\",\"acRate\":\"58.2%\",\"frontendQuestionId\":\"2749\",\"paidOnly\":false,\"topicTags\":\"Bit Manipulation;Brainteaser;Enumeration;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.183682402249715,\"totalAccepted\":97036,\"totalSubmission\":166776},{\"questionId\":\"2867\",\"title\":\"Ways to Split Array Into Good Subarrays\",\"titleSlug\":\"ways-to-split-array-into-good-subarrays\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":474,\"dislikes\":14,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.0%\",\"frontendQuestionId\":\"2750\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":34.97672450275074,\"totalAccepted\":28101,\"totalSubmission\":80342},{\"questionId\":\"2846\",\"title\":\"Robot Collisions\",\"titleSlug\":\"robot-collisions\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":1515,\"dislikes\":114,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.6%\",\"frontendQuestionId\":\"2751\",\"paidOnly\":false,\"topicTags\":\"Array;Stack;Sorting;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.59071865936191,\"totalAccepted\":191116,\"totalSubmission\":310300},{\"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.395336512983576,\"totalAccepted\":3200,\"totalSubmission\":7548},{\"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\":\"61.8%\",\"frontendQuestionId\":\"2753\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.799217731421116,\"totalAccepted\":948,\"totalSubmission\":1534},{\"questionId\":\"2770\",\"title\":\"Bind Function to Context\",\"titleSlug\":\"bind-function-to-context\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":17,\"dislikes\":0,\"categoryTitle\":\"JavaScript\",\"acRate\":\"87.2%\",\"frontendQuestionId\":\"2754\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":87.20565149136577,\"totalAccepted\":1111,\"totalSubmission\":1274},{\"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\":\"64.8%\",\"frontendQuestionId\":\"2755\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.82130343377716,\"totalAccepted\":925,\"totalSubmission\":1427},{\"questionId\":\"2806\",\"title\":\"Query Batching\",\"titleSlug\":\"query-batching\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":15,\"dislikes\":5,\"categoryTitle\":\"JavaScript\",\"acRate\":\"68.0%\",\"frontendQuestionId\":\"2756\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":68.04511278195488,\"totalAccepted\":543,\"totalSubmission\":798},{\"questionId\":\"2814\",\"title\":\"Generate Circular Array Values\",\"titleSlug\":\"generate-circular-array-values\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":11,\"dislikes\":2,\"categoryTitle\":\"JavaScript\",\"acRate\":\"75.5%\",\"frontendQuestionId\":\"2757\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":75.50585729499467,\"totalAccepted\":709,\"totalSubmission\":939},{\"questionId\":\"2822\",\"title\":\"Next Day\",\"titleSlug\":\"next-day\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":13,\"dislikes\":1,\"categoryTitle\":\"JavaScript\",\"acRate\":\"85.9%\",\"frontendQuestionId\":\"2758\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":85.93500266382526,\"totalAccepted\":1613,\"totalSubmission\":1877},{\"questionId\":\"2851\",\"title\":\"Convert JSON String to Object\",\"titleSlug\":\"convert-json-string-to-object\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":17,\"dislikes\":3,\"categoryTitle\":\"JavaScript\",\"acRate\":\"61.7%\",\"frontendQuestionId\":\"2759\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.730013106159895,\"totalAccepted\":942,\"totalSubmission\":1526},{\"questionId\":\"2866\",\"title\":\"Longest Even Odd Subarray With Threshold\",\"titleSlug\":\"longest-even-odd-subarray-with-threshold\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":360,\"dislikes\":290,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.9%\",\"frontendQuestionId\":\"2760\",\"paidOnly\":false,\"topicTags\":\"Array;Sliding Window;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":31.943098872929244,\"totalAccepted\":53084,\"totalSubmission\":166183},{\"questionId\":\"2873\",\"title\":\"Prime Pairs With Target Sum\",\"titleSlug\":\"prime-pairs-with-target-sum\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":410,\"dislikes\":34,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.4%\",\"frontendQuestionId\":\"2761\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Enumeration;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":37.35777438318752,\"totalAccepted\":40352,\"totalSubmission\":108015},{\"questionId\":\"2868\",\"title\":\"Continuous Subarrays\",\"titleSlug\":\"continuous-subarrays\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1504,\"dislikes\":97,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.9%\",\"frontendQuestionId\":\"2762\",\"paidOnly\":false,\"topicTags\":\"Array;Queue;Sliding Window;Heap (Priority Queue);Ordered Set;Monotonic Queue;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":57.94723232166119,\"totalAccepted\":119216,\"totalSubmission\":205732},{\"questionId\":\"2849\",\"title\":\"Sum of Imbalance Numbers of All Subarrays\",\"titleSlug\":\"sum-of-imbalance-numbers-of-all-subarrays\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":325,\"dislikes\":9,\"categoryTitle\":\"Algorithms\",\"acRate\":\"43.2%\",\"frontendQuestionId\":\"2763\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":43.20776255707763,\"totalAccepted\":9841,\"totalSubmission\":22776},{\"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\":\"68.0%\",\"frontendQuestionId\":\"2764\",\"paidOnly\":true,\"topicTags\":\"Stack;Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":68.02486187845304,\"totalAccepted\":1970,\"totalSubmission\":2896},{\"questionId\":\"2870\",\"title\":\"Longest Alternating Subarray\",\"titleSlug\":\"longest-alternating-subarray\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":247,\"dislikes\":188,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.2%\",\"frontendQuestionId\":\"2765\",\"paidOnly\":false,\"topicTags\":\"Array;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":35.22615587294285,\"totalAccepted\":33691,\"totalSubmission\":95642},{\"questionId\":\"2834\",\"title\":\"Relocate Marbles\",\"titleSlug\":\"relocate-marbles\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":212,\"dislikes\":19,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.4%\",\"frontendQuestionId\":\"2766\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sorting;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":51.442453077434834,\"totalAccepted\":25517,\"totalSubmission\":49603},{\"questionId\":\"2883\",\"title\":\"Partition String Into Minimum Beautiful Substrings\",\"titleSlug\":\"partition-string-into-minimum-beautiful-substrings\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":383,\"dislikes\":19,\"categoryTitle\":\"Algorithms\",\"acRate\":\"54.0%\",\"frontendQuestionId\":\"2767\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Dynamic Programming;Backtracking;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.999370749534116,\"totalAccepted\":22312,\"totalSubmission\":41319},{\"questionId\":\"2889\",\"title\":\"Number of Black Blocks\",\"titleSlug\":\"number-of-black-blocks\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":286,\"dislikes\":51,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.7%\",\"frontendQuestionId\":\"2768\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":41.71494341070401,\"totalAccepted\":21746,\"totalSubmission\":52130},{\"questionId\":\"2812\",\"title\":\"Find the Maximum Achievable Number\",\"titleSlug\":\"find-the-maximum-achievable-number\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":525,\"dislikes\":777,\"categoryTitle\":\"Algorithms\",\"acRate\":\"91.3%\",\"frontendQuestionId\":\"2769\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":91.25133094462828,\"totalAccepted\":206539,\"totalSubmission\":226341},{\"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\":477,\"dislikes\":14,\"categoryTitle\":\"Algorithms\",\"acRate\":\"32.7%\",\"frontendQuestionId\":\"2770\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":32.68790164850517,\"totalAccepted\":35097,\"totalSubmission\":107370},{\"questionId\":\"2869\",\"title\":\"Longest Non-decreasing Subarray From Two Arrays\",\"titleSlug\":\"longest-non-decreasing-subarray-from-two-arrays\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":652,\"dislikes\":24,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.1%\",\"frontendQuestionId\":\"2771\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":31.106434462545156,\"totalAccepted\":36509,\"totalSubmission\":117368},{\"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.4%\",\"frontendQuestionId\":\"2772\",\"paidOnly\":false,\"topicTags\":\"Array;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":33.36906557168553,\"totalAccepted\":18366,\"totalSubmission\":55039},{\"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.6%\",\"frontendQuestionId\":\"2773\",\"paidOnly\":true,\"topicTags\":\"Tree;Depth-First Search;Breadth-First Search;Binary Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":74.56410256410257,\"totalAccepted\":1454,\"totalSubmission\":1950},{\"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.35711750088747,\"totalAccepted\":2320,\"totalSubmission\":2817},{\"questionId\":\"2781\",\"title\":\"Undefined to Null\",\"titleSlug\":\"undefined-to-null\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":15,\"dislikes\":1,\"categoryTitle\":\"JavaScript\",\"acRate\":\"72.3%\",\"frontendQuestionId\":\"2775\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":72.30113636363636,\"totalAccepted\":1018,\"totalSubmission\":1408},{\"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.8%\",\"frontendQuestionId\":\"2776\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":90.80622347949081,\"totalAccepted\":1284,\"totalSubmission\":1414},{\"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.87671232876713,\"totalAccepted\":726,\"totalSubmission\":876},{\"questionId\":\"2844\",\"title\":\"Sum of Squares of Special Elements \",\"titleSlug\":\"sum-of-squares-of-special-elements\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":321,\"dislikes\":140,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.1%\",\"frontendQuestionId\":\"2778\",\"paidOnly\":false,\"topicTags\":\"Array;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":82.0640684257242,\"totalAccepted\":101702,\"totalSubmission\":123930},{\"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\":1274,\"dislikes\":48,\"categoryTitle\":\"Algorithms\",\"acRate\":\"58.4%\",\"frontendQuestionId\":\"2779\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Sliding Window;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.37760153766802,\"totalAccepted\":132421,\"totalSubmission\":226835},{\"questionId\":\"2888\",\"title\":\"Minimum Index of a Valid Split\",\"titleSlug\":\"minimum-index-of-a-valid-split\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":820,\"dislikes\":47,\"categoryTitle\":\"Algorithms\",\"acRate\":\"75.5%\",\"frontendQuestionId\":\"2780\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":75.49517984445885,\"totalAccepted\":149106,\"totalSubmission\":197504},{\"questionId\":\"2884\",\"title\":\"Length of the Longest Valid Substring\",\"titleSlug\":\"length-of-the-longest-valid-substring\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":618,\"dislikes\":32,\"categoryTitle\":\"Algorithms\",\"acRate\":\"38.4%\",\"frontendQuestionId\":\"2781\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Sliding Window;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":38.423071991478196,\"totalAccepted\":38956,\"totalSubmission\":101387},{\"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.85565052231719,\"totalAccepted\":3532,\"totalSubmission\":4212},{\"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.8%\",\"frontendQuestionId\":\"2783\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":38.807240099009896,\"totalAccepted\":5017,\"totalSubmission\":12928},{\"questionId\":\"2892\",\"title\":\"Check if Array is Good\",\"titleSlug\":\"check-if-array-is-good\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":316,\"dislikes\":54,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.8%\",\"frontendQuestionId\":\"2784\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":48.80723698905517,\"totalAccepted\":65553,\"totalSubmission\":134310},{\"questionId\":\"2887\",\"title\":\"Sort Vowels in a String\",\"titleSlug\":\"sort-vowels-in-a-string\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1431,\"dislikes\":73,\"categoryTitle\":\"Algorithms\",\"acRate\":\"83.4%\",\"frontendQuestionId\":\"2785\",\"paidOnly\":false,\"topicTags\":\"String;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":83.42311683144895,\"totalAccepted\":310339,\"totalSubmission\":372006},{\"questionId\":\"2893\",\"title\":\"Visit Array Positions to Maximize Score\",\"titleSlug\":\"visit-array-positions-to-maximize-score\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":538,\"dislikes\":34,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.6%\",\"frontendQuestionId\":\"2786\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":37.56631943925513,\"totalAccepted\":25136,\"totalSubmission\":66911},{\"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\":845,\"dislikes\":41,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.8%\",\"frontendQuestionId\":\"2787\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.828142683489126,\"totalAccepted\":118875,\"totalSubmission\":238570},{\"questionId\":\"2881\",\"title\":\"Split Strings by Separator\",\"titleSlug\":\"split-strings-by-separator\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":348,\"dislikes\":13,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.1%\",\"frontendQuestionId\":\"2788\",\"paidOnly\":false,\"topicTags\":\"Array;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":76.09839301628065,\"totalAccepted\":79414,\"totalSubmission\":104357},{\"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\":501,\"dislikes\":33,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.8%\",\"frontendQuestionId\":\"2789\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":47.79873414503953,\"totalAccepted\":37608,\"totalSubmission\":78681},{\"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.0%\",\"frontendQuestionId\":\"2790\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Binary Search;Greedy;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":23.036973748136237,\"totalAccepted\":13751,\"totalSubmission\":59691},{\"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\":456,\"dislikes\":19,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.6%\",\"frontendQuestionId\":\"2791\",\"paidOnly\":false,\"topicTags\":\"Hash Table;Bit Manipulation;Tree;Depth-First Search;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":51.60296846011132,\"totalAccepted\":13906,\"totalSubmission\":26948},{\"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.9%\",\"frontendQuestionId\":\"2792\",\"paidOnly\":true,\"topicTags\":\"Divide and Conquer;Tree;Depth-First Search;Binary Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":56.858054226475275,\"totalAccepted\":1426,\"totalSubmission\":2508},{\"questionId\":\"3003\",\"title\":\"Status of Flight Tickets\",\"titleSlug\":\"status-of-flight-tickets\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":13,\"dislikes\":21,\"categoryTitle\":\"Database\",\"acRate\":\"79.0%\",\"frontendQuestionId\":\"2793\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":79.00626678603402,\"totalAccepted\":3530,\"totalSubmission\":4468},{\"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\":\"64.5%\",\"frontendQuestionId\":\"2794\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.53130655085052,\"totalAccepted\":1783,\"totalSubmission\":2763},{\"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.49003984063745,\"totalAccepted\":1098,\"totalSubmission\":1255},{\"questionId\":\"2899\",\"title\":\"Repeat String\",\"titleSlug\":\"repeat-string\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":26,\"dislikes\":2,\"categoryTitle\":\"JavaScript\",\"acRate\":\"93.1%\",\"frontendQuestionId\":\"2796\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":93.07858687815428,\"totalAccepted\":3873,\"totalSubmission\":4161},{\"questionId\":\"2900\",\"title\":\"Partial Function with Placeholders\",\"titleSlug\":\"partial-function-with-placeholders\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":11,\"dislikes\":4,\"categoryTitle\":\"JavaScript\",\"acRate\":\"89.3%\",\"frontendQuestionId\":\"2797\",\"paidOnly\":true,\"topicTags\":\"\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":89.33804951995957,\"totalAccepted\":1768,\"totalSubmission\":1979},{\"questionId\":\"2876\",\"title\":\"Number of Employees Who Met the Target\",\"titleSlug\":\"number-of-employees-who-met-the-target\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":612,\"dislikes\":77,\"categoryTitle\":\"Algorithms\",\"acRate\":\"87.8%\",\"frontendQuestionId\":\"2798\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":87.83534247857372,\"totalAccepted\":244016,\"totalSubmission\":277811},{\"questionId\":\"2856\",\"title\":\"Count Complete Subarrays in an Array\",\"titleSlug\":\"count-complete-subarrays-in-an-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":1140,\"dislikes\":28,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.0%\",\"frontendQuestionId\":\"2799\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sliding Window;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":75.9547784329274,\"totalAccepted\":171455,\"totalSubmission\":225733},{\"questionId\":\"2877\",\"title\":\"Shortest String That Contains Three Strings\",\"titleSlug\":\"shortest-string-that-contains-three-strings\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":373,\"dislikes\":296,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.6%\",\"frontendQuestionId\":\"2800\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":31.634426415891113,\"totalAccepted\":19477,\"totalSubmission\":61569},{\"questionId\":\"3374\",\"title\":\"Count Alternating Subarrays\",\"titleSlug\":\"count-alternating-subarrays\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":242,\"dislikes\":10,\"categoryTitle\":\"Algorithms\",\"acRate\":\"57.4%\",\"frontendQuestionId\":\"3101\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":57.387377130061864,\"totalAccepted\":45363,\"totalSubmission\":79047},{\"questionId\":\"3344\",\"title\":\"Minimize Manhattan Distances\",\"titleSlug\":\"minimize-manhattan-distances\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":187,\"dislikes\":15,\"categoryTitle\":\"Algorithms\",\"acRate\":\"32.9%\",\"frontendQuestionId\":\"3102\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Geometry;Sorting;Ordered Set;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":32.85329084446623,\"totalAccepted\":10722,\"totalSubmission\":32636},{\"questionId\":\"3409\",\"title\":\"Find Trending Hashtags II \",\"titleSlug\":\"find-trending-hashtags-ii\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":11,\"dislikes\":2,\"categoryTitle\":\"Database\",\"acRate\":\"66.6%\",\"frontendQuestionId\":\"3103\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":66.63914120561519,\"totalAccepted\":1614,\"totalSubmission\":2422},{\"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.8%\",\"frontendQuestionId\":\"3104\",\"paidOnly\":true,\"topicTags\":\"Hash Table;String;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":58.80864317695153,\"totalAccepted\":3021,\"totalSubmission\":5137},{\"questionId\":\"3372\",\"title\":\"Longest Strictly Increasing or Strictly Decreasing Subarray\",\"titleSlug\":\"longest-strictly-increasing-or-strictly-decreasing-subarray\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":665,\"dislikes\":34,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.9%\",\"frontendQuestionId\":\"3105\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.9238599808535,\"totalAccepted\":218374,\"totalSubmission\":336354},{\"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.86686789544667,\"totalAccepted\":29367,\"totalSubmission\":46713},{\"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\":166,\"dislikes\":187,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.8%\",\"frontendQuestionId\":\"3107\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":47.81569492204969,\"totalAccepted\":31008,\"totalSubmission\":64849},{\"questionId\":\"3348\",\"title\":\"Minimum Cost Walk in Weighted Graph\",\"titleSlug\":\"minimum-cost-walk-in-weighted-graph\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":789,\"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.23176119555892,\"totalAccepted\":106561,\"totalSubmission\":156175},{\"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\":\"36.5%\",\"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\":36.46616541353384,\"totalAccepted\":873,\"totalSubmission\":2394},{\"questionId\":\"3379\",\"title\":\"Score of a String\",\"titleSlug\":\"score-of-a-string\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":858,\"dislikes\":52,\"categoryTitle\":\"Algorithms\",\"acRate\":\"91.3%\",\"frontendQuestionId\":\"3110\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":91.3378645682489,\"totalAccepted\":444670,\"totalSubmission\":486841},{\"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.7%\",\"frontendQuestionId\":\"3111\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":63.689635832672565,\"totalAccepted\":32932,\"totalSubmission\":51707},{\"questionId\":\"3389\",\"title\":\"Minimum Time to Visit Disappearing Nodes\",\"titleSlug\":\"minimum-time-to-visit-disappearing-nodes\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":220,\"dislikes\":25,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.7%\",\"frontendQuestionId\":\"3112\",\"paidOnly\":false,\"topicTags\":\"Array;Graph Theory;Heap (Priority Queue);Shortest Path;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":37.653447602107505,\"totalAccepted\":27943,\"totalSubmission\":74211},{\"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\":263,\"dislikes\":6,\"categoryTitle\":\"Algorithms\",\"acRate\":\"33.1%\",\"frontendQuestionId\":\"3113\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Stack;Monotonic Stack;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":33.111141035999644,\"totalAccepted\":14753,\"totalSubmission\":44556},{\"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\":50,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.2%\",\"frontendQuestionId\":\"3114\",\"paidOnly\":false,\"topicTags\":\"String;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":35.20998536568764,\"totalAccepted\":41383,\"totalSubmission\":117532},{\"questionId\":\"3373\",\"title\":\"Maximum Prime Difference\",\"titleSlug\":\"maximum-prime-difference\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":128,\"dislikes\":16,\"categoryTitle\":\"Algorithms\",\"acRate\":\"58.8%\",\"frontendQuestionId\":\"3115\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":58.81872461834037,\"totalAccepted\":51127,\"totalSubmission\":86923},{\"questionId\":\"3375\",\"title\":\"Kth Smallest Amount With Single Denomination Combination\",\"titleSlug\":\"kth-smallest-amount-with-single-denomination-combination\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":254,\"dislikes\":19,\"categoryTitle\":\"Algorithms\",\"acRate\":\"20.1%\",\"frontendQuestionId\":\"3116\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Binary Search;Bit Manipulation;Combinatorics;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":20.107622096587427,\"totalAccepted\":11808,\"totalSubmission\":58724},{\"questionId\":\"3364\",\"title\":\"Minimum Sum of Values by Dividing Array\",\"titleSlug\":\"minimum-sum-of-values-by-dividing-array\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":145,\"dislikes\":4,\"categoryTitle\":\"Algorithms\",\"acRate\":\"27.9%\",\"frontendQuestionId\":\"3117\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Dynamic Programming;Bit Manipulation;Segment Tree;Queue;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":27.93653299652668,\"totalAccepted\":7078,\"totalSubmission\":25336},{\"questionId\":\"3424\",\"title\":\"Friday Purchase III \",\"titleSlug\":\"friday-purchase-iii\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":6,\"dislikes\":7,\"categoryTitle\":\"Database\",\"acRate\":\"55.2%\",\"frontendQuestionId\":\"3118\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":55.21472392638037,\"totalAccepted\":2430,\"totalSubmission\":4401},{\"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.4%\",\"frontendQuestionId\":\"3119\",\"paidOnly\":true,\"topicTags\":\"String;Greedy;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.41281278658456,\"totalAccepted\":4077,\"totalSubmission\":7633},{\"questionId\":\"3408\",\"title\":\"Count the Number of Special Characters I\",\"titleSlug\":\"count-the-number-of-special-characters-i\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":177,\"dislikes\":5,\"categoryTitle\":\"Algorithms\",\"acRate\":\"66.9%\",\"frontendQuestionId\":\"3120\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":66.92163949238162,\"totalAccepted\":65179,\"totalSubmission\":97396},{\"questionId\":\"3405\",\"title\":\"Count the Number of Special Characters II\",\"titleSlug\":\"count-the-number-of-special-characters-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":183,\"dislikes\":16,\"categoryTitle\":\"Algorithms\",\"acRate\":\"43.5%\",\"frontendQuestionId\":\"3121\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":43.45409138880471,\"totalAccepted\":41586,\"totalSubmission\":95701},{\"questionId\":\"3404\",\"title\":\"Minimum Number of Operations to Satisfy Conditions\",\"titleSlug\":\"minimum-number-of-operations-to-satisfy-conditions\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":286,\"dislikes\":13,\"categoryTitle\":\"Algorithms\",\"acRate\":\"41.8%\",\"frontendQuestionId\":\"3122\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":41.83255651870889,\"totalAccepted\":19207,\"totalSubmission\":45914},{\"questionId\":\"3386\",\"title\":\"Find Edges in Shortest Paths\",\"titleSlug\":\"find-edges-in-shortest-paths\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":318,\"dislikes\":5,\"categoryTitle\":\"Algorithms\",\"acRate\":\"46.5%\",\"frontendQuestionId\":\"3123\",\"paidOnly\":false,\"topicTags\":\"Depth-First Search;Breadth-First Search;Graph Theory;Heap (Priority Queue);Shortest Path;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":46.47018013923112,\"totalAccepted\":19425,\"totalSubmission\":41801},{\"questionId\":\"3432\",\"title\":\"Find Longest Calls\",\"titleSlug\":\"find-longest-calls\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":7,\"dislikes\":5,\"categoryTitle\":\"Database\",\"acRate\":\"63.8%\",\"frontendQuestionId\":\"3124\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":63.77754459601259,\"totalAccepted\":3039,\"totalSubmission\":4765},{\"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.95305164319248,\"totalAccepted\":1341,\"totalSubmission\":1917},{\"questionId\":\"3440\",\"title\":\"Server Utilization Time\",\"titleSlug\":\"server-utilization-time\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":10,\"dislikes\":16,\"categoryTitle\":\"Database\",\"acRate\":\"60.6%\",\"frontendQuestionId\":\"3126\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":60.61899679829242,\"totalAccepted\":2840,\"totalSubmission\":4685},{\"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.1%\",\"frontendQuestionId\":\"3127\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.07292071134581,\"totalAccepted\":34171,\"totalSubmission\":64385},{\"questionId\":\"3388\",\"title\":\"Right Triangles\",\"titleSlug\":\"right-triangles\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":136,\"dislikes\":24,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.6%\",\"frontendQuestionId\":\"3128\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Combinatorics;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":48.583820325385354,\"totalAccepted\":23860,\"totalSubmission\":49111},{\"questionId\":\"3406\",\"title\":\"Find All Possible Stable Binary Arrays I\",\"titleSlug\":\"find-all-possible-stable-binary-arrays-i\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":497,\"dislikes\":187,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.7%\",\"frontendQuestionId\":\"3129\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":53.70880690837514,\"totalAccepted\":84586,\"totalSubmission\":157490},{\"questionId\":\"3407\",\"title\":\"Find All Possible Stable Binary Arrays II\",\"titleSlug\":\"find-all-possible-stable-binary-arrays-ii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":264,\"dislikes\":30,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.0%\",\"frontendQuestionId\":\"3130\",\"paidOnly\":false,\"topicTags\":\"Dynamic Programming;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":58.97686370796702,\"totalAccepted\":67016,\"totalSubmission\":113631},{\"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\":\"82.9%\",\"frontendQuestionId\":\"3131\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":82.88440849503925,\"totalAccepted\":83206,\"totalSubmission\":100388},{\"questionId\":\"3399\",\"title\":\"Find the Integer Added to Array II\",\"titleSlug\":\"find-the-integer-added-to-array-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":179,\"dislikes\":44,\"categoryTitle\":\"Algorithms\",\"acRate\":\"32.9%\",\"frontendQuestionId\":\"3132\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sorting;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":32.90397832739678,\"totalAccepted\":26235,\"totalSubmission\":79732},{\"questionId\":\"3394\",\"title\":\"Minimum Array End\",\"titleSlug\":\"minimum-array-end\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":816,\"dislikes\":99,\"categoryTitle\":\"Algorithms\",\"acRate\":\"55.4%\",\"frontendQuestionId\":\"3133\",\"paidOnly\":false,\"topicTags\":\"Bit Manipulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":55.441585710123675,\"totalAccepted\":110372,\"totalSubmission\":199078},{\"questionId\":\"3362\",\"title\":\"Find the Median of the Uniqueness Array\",\"titleSlug\":\"find-the-median-of-the-uniqueness-array\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":178,\"dislikes\":13,\"categoryTitle\":\"Algorithms\",\"acRate\":\"30.1%\",\"frontendQuestionId\":\"3134\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Binary Search;Sliding Window;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":30.070917218431752,\"totalAccepted\":8947,\"totalSubmission\":29753},{\"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.1%\",\"frontendQuestionId\":\"3135\",\"paidOnly\":true,\"topicTags\":\"String;Binary Search;Dynamic Programming;Sliding Window;Hash Function;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":56.078734079505985,\"totalAccepted\":1453,\"totalSubmission\":2591},{\"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.87086734968073,\"totalAccepted\":208246,\"totalSubmission\":409362},{\"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.7%\",\"frontendQuestionId\":\"3137\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":60.66064781139019,\"totalAccepted\":28354,\"totalSubmission\":46742},{\"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.8%\",\"frontendQuestionId\":\"3138\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":39.79331823329558,\"totalAccepted\":33732,\"totalSubmission\":84768},{\"questionId\":\"3402\",\"title\":\"Minimum Cost to Equalize Array\",\"titleSlug\":\"minimum-cost-to-equalize-array\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":149,\"dislikes\":24,\"categoryTitle\":\"Algorithms\",\"acRate\":\"18.8%\",\"frontendQuestionId\":\"3139\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":18.79826325144972,\"totalAccepted\":6451,\"totalSubmission\":34317},{\"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.50635348479014,\"totalAccepted\":2883,\"totalSubmission\":5194},{\"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.35459377372817,\"totalAccepted\":650,\"totalSubmission\":1317},{\"questionId\":\"3415\",\"title\":\"Check if Grid Satisfies Conditions\",\"titleSlug\":\"check-if-grid-satisfies-conditions\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":113,\"dislikes\":6,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.2%\",\"frontendQuestionId\":\"3142\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":45.15688274141328,\"totalAccepted\":45608,\"totalSubmission\":100999},{\"questionId\":\"3419\",\"title\":\"Maximum Points Inside the Square\",\"titleSlug\":\"maximum-points-inside-the-square\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":175,\"dislikes\":24,\"categoryTitle\":\"Algorithms\",\"acRate\":\"39.3%\",\"frontendQuestionId\":\"3143\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Binary Search;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":39.342783505154635,\"totalAccepted\":21371,\"totalSubmission\":54320},{\"questionId\":\"3403\",\"title\":\"Minimum Substring Partition of Equal Character Frequency\",\"titleSlug\":\"minimum-substring-partition-of-equal-character-frequency\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":177,\"dislikes\":36,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.2%\",\"frontendQuestionId\":\"3144\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Dynamic Programming;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.18740810638812,\"totalAccepted\":18312,\"totalSubmission\":45567},{\"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.6%\",\"frontendQuestionId\":\"3145\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":24.61186854756088,\"totalAccepted\":3123,\"totalSubmission\":12689},{\"questionId\":\"3412\",\"title\":\"Permutation Difference between Two Strings\",\"titleSlug\":\"permutation-difference-between-two-strings\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":193,\"dislikes\":17,\"categoryTitle\":\"Algorithms\",\"acRate\":\"87.8%\",\"frontendQuestionId\":\"3146\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":87.77168120633166,\"totalAccepted\":111176,\"totalSubmission\":126665},{\"questionId\":\"3383\",\"title\":\"Taking Maximum Energy From the Mystic Dungeon\",\"titleSlug\":\"taking-maximum-energy-from-the-mystic-dungeon\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":592,\"dislikes\":40,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.0%\",\"frontendQuestionId\":\"3147\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.01834003650056,\"totalAccepted\":142764,\"totalSubmission\":233969},{\"questionId\":\"3391\",\"title\":\"Maximum Difference Score in a Grid\",\"titleSlug\":\"maximum-difference-score-in-a-grid\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":287,\"dislikes\":23,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.9%\",\"frontendQuestionId\":\"3148\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":47.866393178893176,\"totalAccepted\":23803,\"totalSubmission\":49728},{\"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.6%\",\"frontendQuestionId\":\"3149\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Bit Manipulation;Bitmask;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":25.561159255576076,\"totalAccepted\":7197,\"totalSubmission\":28156},{\"questionId\":\"3457\",\"title\":\"Invalid Tweets II\",\"titleSlug\":\"invalid-tweets-ii\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":18,\"dislikes\":3,\"categoryTitle\":\"Database\",\"acRate\":\"84.9%\",\"frontendQuestionId\":\"3150\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":84.86634392759419,\"totalAccepted\":4032,\"totalSubmission\":4751},{\"questionId\":\"3429\",\"title\":\"Special Array I\",\"titleSlug\":\"special-array-i\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":582,\"dislikes\":33,\"categoryTitle\":\"Algorithms\",\"acRate\":\"81.6%\",\"frontendQuestionId\":\"3151\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":81.61228215560803,\"totalAccepted\":261964,\"totalSubmission\":320986},{\"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.77824270552639,\"totalAccepted\":138286,\"totalSubmission\":302077},{\"questionId\":\"3416\",\"title\":\"Sum of Digit Differences of All Pairs\",\"titleSlug\":\"sum-of-digit-differences-of-all-pairs\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":226,\"dislikes\":20,\"categoryTitle\":\"Algorithms\",\"acRate\":\"43.0%\",\"frontendQuestionId\":\"3153\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":43.02109679966081,\"totalAccepted\":29426,\"totalSubmission\":68399},{\"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\":199,\"dislikes\":13,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.6%\",\"frontendQuestionId\":\"3154\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Bit Manipulation;Memoization;Combinatorics;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":37.6090107644417,\"totalAccepted\":15827,\"totalSubmission\":42083},{\"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.3%\",\"frontendQuestionId\":\"3155\",\"paidOnly\":true,\"topicTags\":\"Array;Math;Binary Search;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":43.315030008938834,\"totalAccepted\":3392,\"totalSubmission\":7831},{\"questionId\":\"3465\",\"title\":\"Employee Task Duration and Concurrent Tasks\",\"titleSlug\":\"employee-task-duration-and-concurrent-tasks\",\"isPaidOnly\":true,\"difficulty\":\"Hard\",\"likes\":12,\"dislikes\":2,\"categoryTitle\":\"Database\",\"acRate\":\"40.2%\",\"frontendQuestionId\":\"3156\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.154254037117376,\"totalAccepted\":1666,\"totalSubmission\":4149},{\"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.6%\",\"frontendQuestionId\":\"3157\",\"paidOnly\":true,\"topicTags\":\"Tree;Depth-First Search;Breadth-First Search;Binary Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":69.632949210414,\"totalAccepted\":3263,\"totalSubmission\":4686},{\"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\":167,\"dislikes\":14,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.8%\",\"frontendQuestionId\":\"3158\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":78.83911646342081,\"totalAccepted\":77774,\"totalSubmission\":98649},{\"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\":185,\"dislikes\":26,\"categoryTitle\":\"Algorithms\",\"acRate\":\"73.3%\",\"frontendQuestionId\":\"3159\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":73.29477042241282,\"totalAccepted\":59047,\"totalSubmission\":80561},{\"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.1%\",\"frontendQuestionId\":\"3160\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":54.13858626805168,\"totalAccepted\":170948,\"totalSubmission\":315759},{\"questionId\":\"3435\",\"title\":\"Block Placement Queries\",\"titleSlug\":\"block-placement-queries\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":149,\"dislikes\":32,\"categoryTitle\":\"Algorithms\",\"acRate\":\"18.5%\",\"frontendQuestionId\":\"3161\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Binary Indexed Tree;Segment Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":18.50822330321983,\"totalAccepted\":12784,\"totalSubmission\":69072},{\"questionId\":\"3446\",\"title\":\"Find the Number of Good Pairs I\",\"titleSlug\":\"find-the-number-of-good-pairs-i\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":170,\"dislikes\":16,\"categoryTitle\":\"Algorithms\",\"acRate\":\"86.4%\",\"frontendQuestionId\":\"3162\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":86.37783051694295,\"totalAccepted\":96814,\"totalSubmission\":112082},{\"questionId\":\"3451\",\"title\":\"String Compression III\",\"titleSlug\":\"string-compression-iii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":634,\"dislikes\":54,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.0%\",\"frontendQuestionId\":\"3163\",\"paidOnly\":false,\"topicTags\":\"String;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":67.02978087517687,\"totalAccepted\":202749,\"totalSubmission\":302476},{\"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.657443673865394,\"totalAccepted\":29674,\"totalSubmission\":111316},{\"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\":158,\"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.852649006622515,\"totalAccepted\":8809,\"totalSubmission\":55566},{\"questionId\":\"3473\",\"title\":\"Calculate Parking Fees and Duration\",\"titleSlug\":\"calculate-parking-fees-and-duration\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":14,\"dislikes\":4,\"categoryTitle\":\"Database\",\"acRate\":\"53.2%\",\"frontendQuestionId\":\"3166\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.173818469448285,\"totalAccepted\":2689,\"totalSubmission\":5057},{\"questionId\":\"3474\",\"title\":\"Better Compression of String\",\"titleSlug\":\"better-compression-of-string\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":19,\"dislikes\":4,\"categoryTitle\":\"Algorithms\",\"acRate\":\"75.4%\",\"frontendQuestionId\":\"3167\",\"paidOnly\":true,\"topicTags\":\"Hash Table;String;Sorting;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":75.38204700141262,\"totalAccepted\":5870,\"totalSubmission\":7787},{\"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\":158,\"dislikes\":16,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.3%\",\"frontendQuestionId\":\"3168\",\"paidOnly\":false,\"topicTags\":\"String;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":79.27142124166238,\"totalAccepted\":71070,\"totalSubmission\":89654},{\"questionId\":\"3430\",\"title\":\"Count Days Without Meetings\",\"titleSlug\":\"count-days-without-meetings\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":786,\"dislikes\":19,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.1%\",\"frontendQuestionId\":\"3169\",\"paidOnly\":false,\"topicTags\":\"Array;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":48.10943130601053,\"totalAccepted\":183168,\"totalSubmission\":380732},{\"questionId\":\"3445\",\"title\":\"Lexicographically Minimum String After Removing Stars\",\"titleSlug\":\"lexicographically-minimum-string-after-removing-stars\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":593,\"dislikes\":89,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.0%\",\"frontendQuestionId\":\"3170\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Stack;Greedy;Heap (Priority Queue);\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":50.95206045477393,\"totalAccepted\":119612,\"totalSubmission\":234754},{\"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\":210,\"dislikes\":7,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.0%\",\"frontendQuestionId\":\"3171\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Bit Manipulation;Segment Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":30.960058557043663,\"totalAccepted\":15650,\"totalSubmission\":50549},{\"questionId\":\"3481\",\"title\":\"Second Day Verification\",\"titleSlug\":\"second-day-verification\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":11,\"dislikes\":1,\"categoryTitle\":\"Database\",\"acRate\":\"66.7%\",\"frontendQuestionId\":\"3172\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":66.71336018210471,\"totalAccepted\":3810,\"totalSubmission\":5711},{\"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.79136690647482,\"totalAccepted\":6588,\"totalSubmission\":6950},{\"questionId\":\"3447\",\"title\":\"Clear Digits\",\"titleSlug\":\"clear-digits\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":704,\"dislikes\":27,\"categoryTitle\":\"Algorithms\",\"acRate\":\"82.7%\",\"frontendQuestionId\":\"3174\",\"paidOnly\":false,\"topicTags\":\"String;Stack;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":82.69206948417731,\"totalAccepted\":280381,\"totalSubmission\":339066},{\"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\":140,\"dislikes\":16,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.2%\",\"frontendQuestionId\":\"3175\",\"paidOnly\":false,\"topicTags\":\"Array;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.162276265447026,\"totalAccepted\":36530,\"totalSubmission\":90956},{\"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\":168,\"dislikes\":98,\"categoryTitle\":\"Algorithms\",\"acRate\":\"32.7%\",\"frontendQuestionId\":\"3176\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":32.693001693362575,\"totalAccepted\":23554,\"totalSubmission\":72046},{\"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\":142,\"dislikes\":10,\"categoryTitle\":\"Algorithms\",\"acRate\":\"25.2%\",\"frontendQuestionId\":\"3177\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":25.160652496292634,\"totalAccepted\":9671,\"totalSubmission\":38437},{\"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\":184,\"dislikes\":11,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.0%\",\"frontendQuestionId\":\"3178\",\"paidOnly\":false,\"topicTags\":\"Math;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":62.01722093966432,\"totalAccepted\":59637,\"totalSubmission\":96162},{\"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\":124,\"dislikes\":21,\"categoryTitle\":\"Algorithms\",\"acRate\":\"53.8%\",\"frontendQuestionId\":\"3179\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Simulation;Combinatorics;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.84168189260375,\"totalAccepted\":45381,\"totalSubmission\":84286},{\"questionId\":\"3442\",\"title\":\"Maximum Total Reward Using Operations I\",\"titleSlug\":\"maximum-total-reward-using-operations-i\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":217,\"dislikes\":18,\"categoryTitle\":\"Algorithms\",\"acRate\":\"30.8%\",\"frontendQuestionId\":\"3180\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":30.840070088805703,\"totalAccepted\":30977,\"totalSubmission\":100444},{\"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\":\"21.9%\",\"frontendQuestionId\":\"3181\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":21.86314175860076,\"totalAccepted\":8700,\"totalSubmission\":39793},{\"questionId\":\"3488\",\"title\":\"Find Top Scoring Students\",\"titleSlug\":\"find-top-scoring-students\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":16,\"dislikes\":3,\"categoryTitle\":\"Database\",\"acRate\":\"49.8%\",\"frontendQuestionId\":\"3182\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":49.76828864614366,\"totalAccepted\":3007,\"totalSubmission\":6042},{\"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\":\"51.0%\",\"frontendQuestionId\":\"3183\",\"paidOnly\":true,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":51.04219623792577,\"totalAccepted\":2008,\"totalSubmission\":3934},{\"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\":166,\"dislikes\":12,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.1%\",\"frontendQuestionId\":\"3184\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":78.12320858242569,\"totalAccepted\":76316,\"totalSubmission\":97687},{\"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\":197,\"dislikes\":12,\"categoryTitle\":\"Algorithms\",\"acRate\":\"43.7%\",\"frontendQuestionId\":\"3185\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":43.704097062211986,\"totalAccepted\":48557,\"totalSubmission\":111104},{\"questionId\":\"3437\",\"title\":\"Maximum Total Damage With Spell Casting\",\"titleSlug\":\"maximum-total-damage-with-spell-casting\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":754,\"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.07992322336023,\"totalAccepted\":114613,\"totalSubmission\":254244},{\"questionId\":\"3438\",\"title\":\"Peaks in Array\",\"titleSlug\":\"peaks-in-array\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":142,\"dislikes\":10,\"categoryTitle\":\"Algorithms\",\"acRate\":\"27.5%\",\"frontendQuestionId\":\"3187\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Indexed Tree;Segment Tree;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":27.477953334558148,\"totalAccepted\":11965,\"totalSubmission\":43544},{\"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\":\"40.0%\",\"frontendQuestionId\":\"3188\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.02055850608189,\"totalAccepted\":2336,\"totalSubmission\":5837},{\"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.80543272267846,\"totalAccepted\":4800,\"totalSubmission\":6332},{\"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\":523,\"dislikes\":34,\"categoryTitle\":\"Algorithms\",\"acRate\":\"90.8%\",\"frontendQuestionId\":\"3190\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":90.84242240231684,\"totalAccepted\":272272,\"totalSubmission\":299719},{\"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.40392971562069,\"totalAccepted\":211316,\"totalSubmission\":262818},{\"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.1%\",\"frontendQuestionId\":\"3192\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":65.1153083585516,\"totalAccepted\":43680,\"totalSubmission\":67081},{\"questionId\":\"3460\",\"title\":\"Count the Number of Inversions\",\"titleSlug\":\"count-the-number-of-inversions\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":186,\"dislikes\":37,\"categoryTitle\":\"Algorithms\",\"acRate\":\"30.1%\",\"frontendQuestionId\":\"3193\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":30.091194323080078,\"totalAccepted\":10262,\"totalSubmission\":34103},{\"questionId\":\"3471\",\"title\":\"Minimum Average of Smallest and Largest Elements\",\"titleSlug\":\"minimum-average-of-smallest-and-largest-elements\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":211,\"dislikes\":18,\"categoryTitle\":\"Algorithms\",\"acRate\":\"85.3%\",\"frontendQuestionId\":\"3194\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":85.30415734598624,\"totalAccepted\":110206,\"totalSubmission\":129192},{\"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\":495,\"dislikes\":32,\"categoryTitle\":\"Algorithms\",\"acRate\":\"78.1%\",\"frontendQuestionId\":\"3195\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":78.14323657040252,\"totalAccepted\":167114,\"totalSubmission\":213856},{\"questionId\":\"3464\",\"title\":\"Maximize Total Cost of Alternating Subarrays\",\"titleSlug\":\"maximize-total-cost-of-alternating-subarrays\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":196,\"dislikes\":29,\"categoryTitle\":\"Algorithms\",\"acRate\":\"29.6%\",\"frontendQuestionId\":\"3196\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":29.63783671490894,\"totalAccepted\":25680,\"totalSubmission\":86646},{\"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\":68,\"categoryTitle\":\"Algorithms\",\"acRate\":\"63.5%\",\"frontendQuestionId\":\"3197\",\"paidOnly\":false,\"topicTags\":\"Array;Matrix;Enumeration;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":63.48715346558807,\"totalAccepted\":65061,\"totalSubmission\":102479},{\"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.4%\",\"frontendQuestionId\":\"3198\",\"paidOnly\":true,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":79.39009414654113,\"totalAccepted\":3879,\"totalSubmission\":4886},{\"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.2%\",\"frontendQuestionId\":\"3199\",\"paidOnly\":true,\"topicTags\":\"Array;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":83.19327731092437,\"totalAccepted\":1881,\"totalSubmission\":2261},{\"questionId\":\"3469\",\"title\":\"Maximum Height of a Triangle\",\"titleSlug\":\"maximum-height-of-a-triangle\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":166,\"dislikes\":31,\"categoryTitle\":\"Algorithms\",\"acRate\":\"44.3%\",\"frontendQuestionId\":\"3200\",\"paidOnly\":false,\"topicTags\":\"Array;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":44.31716037792381,\"totalAccepted\":44373,\"totalSubmission\":100126},{\"questionId\":\"3942\",\"title\":\"Find Drivers with Improved Fuel Efficiency\",\"titleSlug\":\"find-drivers-with-improved-fuel-efficiency\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":42,\"dislikes\":7,\"categoryTitle\":\"Database\",\"acRate\":\"46.4%\",\"frontendQuestionId\":\"3601\",\"paidOnly\":false,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":46.36296158842086,\"totalAccepted\":9993,\"totalSubmission\":21555},{\"questionId\":\"3912\",\"title\":\"Hexadecimal and Hexatrigesimal Conversion\",\"titleSlug\":\"hexadecimal-and-hexatrigesimal-conversion\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":52,\"dislikes\":0,\"categoryTitle\":\"Algorithms\",\"acRate\":\"80.8%\",\"frontendQuestionId\":\"3602\",\"paidOnly\":false,\"topicTags\":\"Math;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":80.82911125184717,\"totalAccepted\":30631,\"totalSubmission\":37896},{\"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.8%\",\"frontendQuestionId\":\"3603\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":44.77115767294861,\"totalAccepted\":19124,\"totalSubmission\":42715},{\"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\":103,\"dislikes\":4,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.6%\",\"frontendQuestionId\":\"3604\",\"paidOnly\":false,\"topicTags\":\"Graph Theory;Heap (Priority Queue);Shortest Path;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":45.588541666666664,\"totalAccepted\":17506,\"totalSubmission\":38400},{\"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.5%\",\"frontendQuestionId\":\"3605\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Binary Search;Greedy;Segment Tree;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":20.50961153384061,\"totalAccepted\":4097,\"totalSubmission\":19976},{\"questionId\":\"3934\",\"title\":\"Coupon Code Validator\",\"titleSlug\":\"coupon-code-validator\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":336,\"dislikes\":107,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.9%\",\"frontendQuestionId\":\"3606\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":64.93830741657774,\"totalAccepted\":125365,\"totalSubmission\":193053},{\"questionId\":\"3863\",\"title\":\"Power Grid Maintenance\",\"titleSlug\":\"power-grid-maintenance\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":539,\"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.18705339136611,\"totalAccepted\":93334,\"totalSubmission\":166113},{\"questionId\":\"3908\",\"title\":\"Minimum Time for K Connected Components\",\"titleSlug\":\"minimum-time-for-k-connected-components\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":127,\"dislikes\":6,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.4%\",\"frontendQuestionId\":\"3608\",\"paidOnly\":false,\"topicTags\":\"Binary Search;Union-Find;Graph Theory;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":45.35935884177869,\"totalAccepted\":17545,\"totalSubmission\":38680},{\"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.0%\",\"frontendQuestionId\":\"3609\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":15.026412494258153,\"totalAccepted\":5234,\"totalSubmission\":34832},{\"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.9%\",\"frontendQuestionId\":\"3610\",\"paidOnly\":true,\"topicTags\":\"Array;Math;Dynamic Programming;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":59.85324947589099,\"totalAccepted\":3426,\"totalSubmission\":5724},{\"questionId\":\"3943\",\"title\":\"Find Overbooked Employees\",\"titleSlug\":\"find-overbooked-employees\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":46,\"dislikes\":10,\"categoryTitle\":\"Database\",\"acRate\":\"44.0%\",\"frontendQuestionId\":\"3611\",\"paidOnly\":false,\"topicTags\":\"Database;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":44.03396844555565,\"totalAccepted\":10215,\"totalSubmission\":23198},{\"questionId\":\"3931\",\"title\":\"Process String with Special Operations I\",\"titleSlug\":\"process-string-with-special-operations-i\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":58,\"dislikes\":11,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.0%\",\"frontendQuestionId\":\"3612\",\"paidOnly\":false,\"topicTags\":\"String;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":65.01926665861092,\"totalAccepted\":48427,\"totalSubmission\":74481},{\"questionId\":\"3881\",\"title\":\"Minimize Maximum Component Cost\",\"titleSlug\":\"minimize-maximum-component-cost\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":122,\"dislikes\":9,\"categoryTitle\":\"Algorithms\",\"acRate\":\"43.5%\",\"frontendQuestionId\":\"3613\",\"paidOnly\":false,\"topicTags\":\"Binary Search;Union-Find;Graph Theory;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":43.48877936052285,\"totalAccepted\":24088,\"totalSubmission\":55389},{\"questionId\":\"3939\",\"title\":\"Process String with Special Operations II\",\"titleSlug\":\"process-string-with-special-operations-ii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":97,\"dislikes\":8,\"categoryTitle\":\"Algorithms\",\"acRate\":\"17.0%\",\"frontendQuestionId\":\"3614\",\"paidOnly\":false,\"topicTags\":\"String;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":17.017654186542323,\"totalAccepted\":11095,\"totalSubmission\":65197},{\"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.1%\",\"frontendQuestionId\":\"3615\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Bit Manipulation;Graph Theory;Bitmask;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":22.138831117943152,\"totalAccepted\":7345,\"totalSubmission\":33177},{\"questionId\":\"3960\",\"title\":\"Number of Student Replacements\",\"titleSlug\":\"number-of-student-replacements\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":5,\"dislikes\":3,\"categoryTitle\":\"Algorithms\",\"acRate\":\"86.4%\",\"frontendQuestionId\":\"3616\",\"paidOnly\":true,\"topicTags\":\"Array;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":86.40350877192982,\"totalAccepted\":985,\"totalSubmission\":1140},{\"questionId\":\"3961\",\"title\":\"Find Students with Study Spiral Pattern\",\"titleSlug\":\"find-students-with-study-spiral-pattern\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":36,\"dislikes\":12,\"categoryTitle\":\"Database\",\"acRate\":\"29.7%\",\"frontendQuestionId\":\"3617\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":29.67767608436132,\"totalAccepted\":3729,\"totalSubmission\":12565},{\"questionId\":\"3936\",\"title\":\"Split Array by Prime Indices\",\"titleSlug\":\"split-array-by-prime-indices\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":56,\"dislikes\":3,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.4%\",\"frontendQuestionId\":\"3618\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":49.39916716240333,\"totalAccepted\":37368,\"totalSubmission\":75645},{\"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\":66,\"dislikes\":1,\"categoryTitle\":\"Algorithms\",\"acRate\":\"56.3%\",\"frontendQuestionId\":\"3619\",\"paidOnly\":false,\"topicTags\":\"Array;Depth-First Search;Breadth-First Search;Union-Find;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":56.299961933764756,\"totalAccepted\":31059,\"totalSubmission\":55167},{\"questionId\":\"3919\",\"title\":\"Network Recovery Pathways\",\"titleSlug\":\"network-recovery-pathways\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":140,\"dislikes\":12,\"categoryTitle\":\"Algorithms\",\"acRate\":\"29.9%\",\"frontendQuestionId\":\"3620\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Dynamic Programming;Graph Theory;Topological Sort;Heap (Priority Queue);Shortest Path;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":29.91775325977934,\"totalAccepted\":14914,\"totalSubmission\":49850},{\"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.5%\",\"frontendQuestionId\":\"3621\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;Bit Manipulation;Combinatorics;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":22.52726044581685,\"totalAccepted\":4669,\"totalSubmission\":20726},{\"questionId\":\"3918\",\"title\":\"Check Divisibility by Digit Sum and Product\",\"titleSlug\":\"check-divisibility-by-digit-sum-and-product\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":55,\"dislikes\":0,\"categoryTitle\":\"Algorithms\",\"acRate\":\"69.6%\",\"frontendQuestionId\":\"3622\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":69.56587980993554,\"totalAccepted\":73056,\"totalSubmission\":105017},{\"questionId\":\"3886\",\"title\":\"Count Number of Trapezoids I\",\"titleSlug\":\"count-number-of-trapezoids-i\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":398,\"dislikes\":50,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.1%\",\"frontendQuestionId\":\"3623\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Geometry;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":48.08088235294118,\"totalAccepted\":117701,\"totalSubmission\":244799},{\"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.48558706351066,\"totalAccepted\":20306,\"totalSubmission\":34136},{\"questionId\":\"3897\",\"title\":\"Count Number of Trapezoids II\",\"titleSlug\":\"count-number-of-trapezoids-ii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":263,\"dislikes\":98,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.0%\",\"frontendQuestionId\":\"3625\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Geometry;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":39.99322019827461,\"totalAccepted\":57809,\"totalSubmission\":144547},{\"questionId\":\"3971\",\"title\":\"Find Stores with Inventory Imbalance\",\"titleSlug\":\"find-stores-with-inventory-imbalance\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":47,\"dislikes\":9,\"categoryTitle\":\"Database\",\"acRate\":\"48.0%\",\"frontendQuestionId\":\"3626\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":48.01959495788279,\"totalAccepted\":8038,\"totalSubmission\":16739},{\"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\":81,\"dislikes\":3,\"categoryTitle\":\"Algorithms\",\"acRate\":\"65.1%\",\"frontendQuestionId\":\"3627\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Greedy;Sorting;Game Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":65.06796136605969,\"totalAccepted\":62855,\"totalSubmission\":96599},{\"questionId\":\"3948\",\"title\":\"Maximum Number of Subsequences After One Inserting\",\"titleSlug\":\"maximum-number-of-subsequences-after-one-inserting\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":136,\"dislikes\":5,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.9%\",\"frontendQuestionId\":\"3628\",\"paidOnly\":false,\"topicTags\":\"String;Dynamic Programming;Greedy;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":31.857782208238582,\"totalAccepted\":30680,\"totalSubmission\":96303},{\"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\":133,\"dislikes\":18,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.8%\",\"frontendQuestionId\":\"3629\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Breadth-First Search;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":31.82418052764865,\"totalAccepted\":26767,\"totalSubmission\":84109},{\"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.7%\",\"frontendQuestionId\":\"3630\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Greedy;Bit Manipulation;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":17.694913636797406,\"totalAccepted\":7417,\"totalSubmission\":41916},{\"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\":\"63.9%\",\"frontendQuestionId\":\"3631\",\"paidOnly\":true,\"topicTags\":\"Array;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":63.86740331491713,\"totalAccepted\":578,\"totalSubmission\":905},{\"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\":\"43.0%\",\"frontendQuestionId\":\"3632\",\"paidOnly\":true,\"topicTags\":\"Array;Bit Manipulation;Trie;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":42.99363057324841,\"totalAccepted\":270,\"totalSubmission\":628},{\"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\":71,\"dislikes\":18,\"categoryTitle\":\"Algorithms\",\"acRate\":\"62.0%\",\"frontendQuestionId\":\"3633\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Binary Search;Greedy;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":61.97708795269771,\"totalAccepted\":33541,\"totalSubmission\":54119},{\"questionId\":\"3958\",\"title\":\"Minimum Removals to Balance Array\",\"titleSlug\":\"minimum-removals-to-balance-array\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":608,\"dislikes\":28,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.8%\",\"frontendQuestionId\":\"3634\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Sliding Window;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.84980134306102,\"totalAccepted\":143436,\"totalSubmission\":299763},{\"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\":73,\"dislikes\":3,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.2%\",\"frontendQuestionId\":\"3635\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Binary Search;Greedy;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":35.20512544416927,\"totalAccepted\":13078,\"totalSubmission\":37148},{\"questionId\":\"3955\",\"title\":\"Threshold Majority Queries\",\"titleSlug\":\"threshold-majority-queries\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":41,\"dislikes\":10,\"categoryTitle\":\"Algorithms\",\"acRate\":\"21.9%\",\"frontendQuestionId\":\"3636\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Binary Search;Divide and Conquer;Counting;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":21.874709112910733,\"totalAccepted\":4700,\"totalSubmission\":21486},{\"questionId\":\"3952\",\"title\":\"Trionic Array I\",\"titleSlug\":\"trionic-array-i\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":473,\"dislikes\":40,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.5%\",\"frontendQuestionId\":\"3637\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":49.53415952022618,\"totalAccepted\":195174,\"totalSubmission\":394019},{\"questionId\":\"3954\",\"title\":\"Maximum Balanced Shipments\",\"titleSlug\":\"maximum-balanced-shipments\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":82,\"dislikes\":11,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.4%\",\"frontendQuestionId\":\"3638\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Stack;Greedy;Monotonic Stack;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":61.39685282032126,\"totalAccepted\":52595,\"totalSubmission\":85664},{\"questionId\":\"3944\",\"title\":\"Minimum Time to Activate String\",\"titleSlug\":\"minimum-time-to-activate-string\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":121,\"dislikes\":6,\"categoryTitle\":\"Algorithms\",\"acRate\":\"49.2%\",\"frontendQuestionId\":\"3639\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":49.21673217293655,\"totalAccepted\":35062,\"totalSubmission\":71240},{\"questionId\":\"3956\",\"title\":\"Trionic Array II\",\"titleSlug\":\"trionic-array-ii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":383,\"dislikes\":38,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.3%\",\"frontendQuestionId\":\"3640\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.31655903904708,\"totalAccepted\":84849,\"totalSubmission\":179321},{\"questionId\":\"3992\",\"title\":\"Longest Semi-Repeating Subarray\",\"titleSlug\":\"longest-semi-repeating-subarray\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":6,\"dislikes\":1,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.4%\",\"frontendQuestionId\":\"3641\",\"paidOnly\":true,\"topicTags\":\"Array;Hash Table;Sliding Window;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":64.44296197464978,\"totalAccepted\":966,\"totalSubmission\":1499},{\"questionId\":\"3996\",\"title\":\"Find Books with Polarized Opinions\",\"titleSlug\":\"find-books-with-polarized-opinions\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":52,\"dislikes\":12,\"categoryTitle\":\"Database\",\"acRate\":\"42.2%\",\"frontendQuestionId\":\"3642\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":42.24716202270382,\"totalAccepted\":9825,\"totalSubmission\":23256},{\"questionId\":\"3973\",\"title\":\"Flip Square Submatrix Vertically\",\"titleSlug\":\"flip-square-submatrix-vertically\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":286,\"dislikes\":27,\"categoryTitle\":\"Algorithms\",\"acRate\":\"79.4%\",\"frontendQuestionId\":\"3643\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":79.36370789810687,\"totalAccepted\":154314,\"totalSubmission\":194439},{\"questionId\":\"3950\",\"title\":\"Maximum K to Sort a Permutation\",\"titleSlug\":\"maximum-k-to-sort-a-permutation\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":100,\"dislikes\":36,\"categoryTitle\":\"Algorithms\",\"acRate\":\"37.4%\",\"frontendQuestionId\":\"3644\",\"paidOnly\":false,\"topicTags\":\"Array;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":37.35597743128187,\"totalAccepted\":33038,\"totalSubmission\":88441},{\"questionId\":\"3959\",\"title\":\"Maximum Total from Optimal Activation Order\",\"titleSlug\":\"maximum-total-from-optimal-activation-order\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":80,\"dislikes\":52,\"categoryTitle\":\"Algorithms\",\"acRate\":\"33.2%\",\"frontendQuestionId\":\"3645\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Greedy;Sorting;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":33.19361538893359,\"totalAccepted\":17739,\"totalSubmission\":53441},{\"questionId\":\"3951\",\"title\":\"Next Special Palindrome Number\",\"titleSlug\":\"next-special-palindrome-number\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":65,\"dislikes\":5,\"categoryTitle\":\"Algorithms\",\"acRate\":\"28.0%\",\"frontendQuestionId\":\"3646\",\"paidOnly\":false,\"topicTags\":\"Backtracking;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":28.013374461371825,\"totalAccepted\":11897,\"totalSubmission\":42469},{\"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\":\"57.5%\",\"frontendQuestionId\":\"3647\",\"paidOnly\":true,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":57.52508361204013,\"totalAccepted\":688,\"totalSubmission\":1196},{\"questionId\":\"3945\",\"title\":\"Minimum Sensors to Cover Grid\",\"titleSlug\":\"minimum-sensors-to-cover-grid\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":52,\"dislikes\":9,\"categoryTitle\":\"Algorithms\",\"acRate\":\"68.7%\",\"frontendQuestionId\":\"3648\",\"paidOnly\":false,\"topicTags\":\"Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":68.72749380348876,\"totalAccepted\":29392,\"totalSubmission\":42766},{\"questionId\":\"3963\",\"title\":\"Number of Perfect Pairs\",\"titleSlug\":\"number-of-perfect-pairs\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":101,\"dislikes\":11,\"categoryTitle\":\"Algorithms\",\"acRate\":\"33.9%\",\"frontendQuestionId\":\"3649\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Two Pointers;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":33.872005391826484,\"totalAccepted\":22113,\"totalSubmission\":65284},{\"questionId\":\"3887\",\"title\":\"Minimum Cost Path with Edge Reversals\",\"titleSlug\":\"minimum-cost-path-with-edge-reversals\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":461,\"dislikes\":24,\"categoryTitle\":\"Algorithms\",\"acRate\":\"61.8%\",\"frontendQuestionId\":\"3650\",\"paidOnly\":false,\"topicTags\":\"Graph Theory;Heap (Priority Queue);Shortest Path;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":61.83082617000956,\"totalAccepted\":103578,\"totalSubmission\":167518},{\"questionId\":\"3889\",\"title\":\"Minimum Cost Path with Teleportations\",\"titleSlug\":\"minimum-cost-path-with-teleportations\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":421,\"dislikes\":34,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.6%\",\"frontendQuestionId\":\"3651\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Matrix;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":45.59330140224165,\"totalAccepted\":65777,\"totalSubmission\":144269},{\"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\":360,\"dislikes\":41,\"categoryTitle\":\"Algorithms\",\"acRate\":\"59.8%\",\"frontendQuestionId\":\"3652\",\"paidOnly\":false,\"topicTags\":\"Array;Sliding Window;Prefix Sum;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":59.78580138910981,\"totalAccepted\":112762,\"totalSubmission\":188610},{\"questionId\":\"3974\",\"title\":\"XOR After Range Multiplication Queries I\",\"titleSlug\":\"xor-after-range-multiplication-queries-i\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":238,\"dislikes\":119,\"categoryTitle\":\"Algorithms\",\"acRate\":\"73.3%\",\"frontendQuestionId\":\"3653\",\"paidOnly\":false,\"topicTags\":\"Array;Divide and Conquer;Simulation;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":73.33461285369599,\"totalAccepted\":133733,\"totalSubmission\":182360},{\"questionId\":\"3966\",\"title\":\"Minimum Sum After Divisible Sum Deletions\",\"titleSlug\":\"minimum-sum-after-divisible-sum-deletions\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":152,\"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.47399939956073,\"totalAccepted\":29412,\"totalSubmission\":63287},{\"questionId\":\"3975\",\"title\":\"XOR After Range Multiplication Queries II\",\"titleSlug\":\"xor-after-range-multiplication-queries-ii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":255,\"dislikes\":44,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.8%\",\"frontendQuestionId\":\"3655\",\"paidOnly\":false,\"topicTags\":\"Array;Divide and Conquer;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.76011208152398,\"totalAccepted\":68520,\"totalSubmission\":143466},{\"questionId\":\"4006\",\"title\":\"Determine if a Simple Graph Exists\",\"titleSlug\":\"determine-if-a-simple-graph-exists\",\"isPaidOnly\":true,\"difficulty\":\"Medium\",\"likes\":8,\"dislikes\":7,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.8%\",\"frontendQuestionId\":\"3656\",\"paidOnly\":true,\"topicTags\":\"Array;Binary Search;Graph Theory;Sorting;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":47.82608695652174,\"totalAccepted\":396,\"totalSubmission\":828},{\"questionId\":\"4025\",\"title\":\"Find Loyal Customers\",\"titleSlug\":\"find-loyal-customers\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":44,\"dislikes\":1,\"categoryTitle\":\"Database\",\"acRate\":\"60.3%\",\"frontendQuestionId\":\"3657\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":60.33025024116212,\"totalAccepted\":10632,\"totalSubmission\":17623},{\"questionId\":\"3995\",\"title\":\"GCD of Odd and Even Sums\",\"titleSlug\":\"gcd-of-odd-and-even-sums\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":108,\"dislikes\":15,\"categoryTitle\":\"Algorithms\",\"acRate\":\"84.9%\",\"frontendQuestionId\":\"3658\",\"paidOnly\":false,\"topicTags\":\"Math;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":84.92796487153433,\"totalAccepted\":93611,\"totalSubmission\":110224},{\"questionId\":\"3979\",\"title\":\"Partition Array Into K-Distinct Groups\",\"titleSlug\":\"partition-array-into-k-distinct-groups\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":116,\"dislikes\":73,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.1%\",\"frontendQuestionId\":\"3659\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":47.11005405405405,\"totalAccepted\":54471,\"totalSubmission\":115625},{\"questionId\":\"3981\",\"title\":\"Jump Game IX\",\"titleSlug\":\"jump-game-ix\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":185,\"dislikes\":14,\"categoryTitle\":\"Algorithms\",\"acRate\":\"24.0%\",\"frontendQuestionId\":\"3660\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":24.043208574201444,\"totalAccepted\":17094,\"totalSubmission\":71097},{\"questionId\":\"3982\",\"title\":\"Maximum Walls Destroyed by Robots\",\"titleSlug\":\"maximum-walls-destroyed-by-robots\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":333,\"dislikes\":31,\"categoryTitle\":\"Algorithms\",\"acRate\":\"47.9%\",\"frontendQuestionId\":\"3661\",\"paidOnly\":false,\"topicTags\":\"Array;Binary Search;Dynamic Programming;Sorting;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":47.93067338483253,\"totalAccepted\":63164,\"totalSubmission\":131782},{\"questionId\":\"4017\",\"title\":\"Filter Characters by Frequency\",\"titleSlug\":\"filter-characters-by-frequency\",\"isPaidOnly\":true,\"difficulty\":\"Easy\",\"likes\":9,\"dislikes\":0,\"categoryTitle\":\"Algorithms\",\"acRate\":\"86.1%\",\"frontendQuestionId\":\"3662\",\"paidOnly\":true,\"topicTags\":\"Hash Table;String;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":86.10436893203884,\"totalAccepted\":1419,\"totalSubmission\":1648},{\"questionId\":\"3994\",\"title\":\"Find The Least Frequent Digit\",\"titleSlug\":\"find-the-least-frequent-digit\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":51,\"dislikes\":2,\"categoryTitle\":\"Algorithms\",\"acRate\":\"69.8%\",\"frontendQuestionId\":\"3663\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Math;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":69.75219824140687,\"totalAccepted\":43630,\"totalSubmission\":62550},{\"questionId\":\"3877\",\"title\":\"Two-Letter Card Game\",\"titleSlug\":\"two-letter-card-game\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":126,\"dislikes\":60,\"categoryTitle\":\"Algorithms\",\"acRate\":\"12.6%\",\"frontendQuestionId\":\"3664\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;String;Counting;Enumeration;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":12.588590274366712,\"totalAccepted\":10764,\"totalSubmission\":85506},{\"questionId\":\"3938\",\"title\":\"Twisted Mirror Path Count\",\"titleSlug\":\"twisted-mirror-path-count\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":86,\"dislikes\":5,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.2%\",\"frontendQuestionId\":\"3665\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Matrix;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":48.195667002306166,\"totalAccepted\":14838,\"totalSubmission\":30787},{\"questionId\":\"3983\",\"title\":\"Minimum Operations to Equalize Binary String\",\"titleSlug\":\"minimum-operations-to-equalize-binary-string\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":306,\"dislikes\":34,\"categoryTitle\":\"Algorithms\",\"acRate\":\"45.2%\",\"frontendQuestionId\":\"3666\",\"paidOnly\":false,\"topicTags\":\"Math;String;Breadth-First Search;Union-Find;Ordered Set;\",\"hasSolution\":true,\"hasVideoSolution\":false,\"acRateRaw\":45.160477728714106,\"totalAccepted\":60954,\"totalSubmission\":134972},{\"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.1%\",\"frontendQuestionId\":\"3667\",\"paidOnly\":true,\"topicTags\":\"Array;Math;Two Pointers;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":86.12040133779264,\"totalAccepted\":1545,\"totalSubmission\":1794},{\"questionId\":\"4008\",\"title\":\"Restore Finishing Order\",\"titleSlug\":\"restore-finishing-order\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":121,\"dislikes\":5,\"categoryTitle\":\"Algorithms\",\"acRate\":\"91.2%\",\"frontendQuestionId\":\"3668\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":91.17527155449662,\"totalAccepted\":100642,\"totalSubmission\":110383},{\"questionId\":\"3947\",\"title\":\"Balanced K-Factor Decomposition\",\"titleSlug\":\"balanced-k-factor-decomposition\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":124,\"dislikes\":12,\"categoryTitle\":\"Algorithms\",\"acRate\":\"40.2%\",\"frontendQuestionId\":\"3669\",\"paidOnly\":false,\"topicTags\":\"Math;Backtracking;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":40.22339868520565,\"totalAccepted\":27656,\"totalSubmission\":68756},{\"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\":104,\"dislikes\":19,\"categoryTitle\":\"Algorithms\",\"acRate\":\"15.2%\",\"frontendQuestionId\":\"3670\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":15.160977145705964,\"totalAccepted\":11556,\"totalSubmission\":76222},{\"questionId\":\"3989\",\"title\":\"Sum of Beautiful Subsequences\",\"titleSlug\":\"sum-of-beautiful-subsequences\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":36,\"dislikes\":5,\"categoryTitle\":\"Algorithms\",\"acRate\":\"31.5%\",\"frontendQuestionId\":\"3671\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Binary Indexed Tree;Number Theory;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":31.50471305794289,\"totalAccepted\":9091,\"totalSubmission\":28856},{\"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\":\"54.5%\",\"frontendQuestionId\":\"3672\",\"paidOnly\":true,\"topicTags\":\"Array;Hash Table;Sliding Window;Counting;Ordered Set;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":54.47427293064877,\"totalAccepted\":487,\"totalSubmission\":894},{\"questionId\":\"4043\",\"title\":\"Find Zombie Sessions\",\"titleSlug\":\"find-zombie-sessions\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":29,\"dislikes\":3,\"categoryTitle\":\"Database\",\"acRate\":\"48.5%\",\"frontendQuestionId\":\"3673\",\"paidOnly\":false,\"topicTags\":\"\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":48.518284993694834,\"totalAccepted\":6156,\"totalSubmission\":12688},{\"questionId\":\"3998\",\"title\":\"Minimum Operations to Equalize Array\",\"titleSlug\":\"minimum-operations-to-equalize-array\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":60,\"dislikes\":12,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.3%\",\"frontendQuestionId\":\"3674\",\"paidOnly\":false,\"topicTags\":\"Array;Bit Manipulation;Brainteaser;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":60.309334973746076,\"totalAccepted\":54902,\"totalSubmission\":91034},{\"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\":\"61.9%\",\"frontendQuestionId\":\"3675\",\"paidOnly\":false,\"topicTags\":\"String;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":61.91215347675293,\"totalAccepted\":51054,\"totalSubmission\":82462},{\"questionId\":\"4000\",\"title\":\"Count Bowl Subarrays\",\"titleSlug\":\"count-bowl-subarrays\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":188,\"dislikes\":5,\"categoryTitle\":\"Algorithms\",\"acRate\":\"48.2%\",\"frontendQuestionId\":\"3676\",\"paidOnly\":false,\"topicTags\":\"Array;Stack;Monotonic Stack;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":48.19973635309626,\"totalAccepted\":30348,\"totalSubmission\":62963},{\"questionId\":\"4023\",\"title\":\"Count Binary Palindromic Numbers\",\"titleSlug\":\"count-binary-palindromic-numbers\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":82,\"dislikes\":3,\"categoryTitle\":\"Algorithms\",\"acRate\":\"33.8%\",\"frontendQuestionId\":\"3677\",\"paidOnly\":false,\"topicTags\":\"Math;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":33.788864481243664,\"totalAccepted\":15997,\"totalSubmission\":47344},{\"questionId\":\"4011\",\"title\":\"Smallest Absent Positive Greater Than Average\",\"titleSlug\":\"smallest-absent-positive-greater-than-average\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":65,\"dislikes\":5,\"categoryTitle\":\"Algorithms\",\"acRate\":\"34.3%\",\"frontendQuestionId\":\"3678\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":34.25627817128139,\"totalAccepted\":37240,\"totalSubmission\":108710},{\"questionId\":\"3953\",\"title\":\" Minimum Discards to Balance Inventory\",\"titleSlug\":\"minimum-discards-to-balance-inventory\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":82,\"dislikes\":18,\"categoryTitle\":\"Algorithms\",\"acRate\":\"35.0%\",\"frontendQuestionId\":\"3679\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Sliding Window;Simulation;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":34.9710170384683,\"totalAccepted\":19909,\"totalSubmission\":56930},{\"questionId\":\"3991\",\"title\":\"Generate Schedule\",\"titleSlug\":\"generate-schedule\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":50,\"dislikes\":25,\"categoryTitle\":\"Algorithms\",\"acRate\":\"24.3%\",\"frontendQuestionId\":\"3680\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":24.334246858679354,\"totalAccepted\":4706,\"totalSubmission\":19339},{\"questionId\":\"3990\",\"title\":\"Maximum XOR of Subsequences\",\"titleSlug\":\"maximum-xor-of-subsequences\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":63,\"dislikes\":10,\"categoryTitle\":\"Algorithms\",\"acRate\":\"51.2%\",\"frontendQuestionId\":\"3681\",\"paidOnly\":false,\"topicTags\":\"Array;Math;Greedy;Bit Manipulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":51.20405576679341,\"totalAccepted\":7676,\"totalSubmission\":14991},{\"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.5%\",\"frontendQuestionId\":\"3682\",\"paidOnly\":true,\"topicTags\":\"Array;Hash Table;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":77.49469214437367,\"totalAccepted\":730,\"totalSubmission\":942},{\"questionId\":\"4012\",\"title\":\"Earliest Time to Finish One Task\",\"titleSlug\":\"earliest-time-to-finish-one-task\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":48,\"dislikes\":3,\"categoryTitle\":\"Algorithms\",\"acRate\":\"84.5%\",\"frontendQuestionId\":\"3683\",\"paidOnly\":false,\"topicTags\":\"Array;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":84.53481353484904,\"totalAccepted\":71426,\"totalSubmission\":84493},{\"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\":55,\"dislikes\":4,\"categoryTitle\":\"Algorithms\",\"acRate\":\"76.9%\",\"frontendQuestionId\":\"3684\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Greedy;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":76.92177936286086,\"totalAccepted\":63841,\"totalSubmission\":82992},{\"questionId\":\"3873\",\"title\":\"Subsequence Sum After Capping Elements\",\"titleSlug\":\"subsequence-sum-after-capping-elements\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":164,\"dislikes\":15,\"categoryTitle\":\"Algorithms\",\"acRate\":\"25.3%\",\"frontendQuestionId\":\"3685\",\"paidOnly\":false,\"topicTags\":\"Array;Two Pointers;Dynamic Programming;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":25.321251853975298,\"totalAccepted\":20316,\"totalSubmission\":80233},{\"questionId\":\"4027\",\"title\":\"Number of Stable Subsequences\",\"titleSlug\":\"number-of-stable-subsequences\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":87,\"dislikes\":3,\"categoryTitle\":\"Algorithms\",\"acRate\":\"60.2%\",\"frontendQuestionId\":\"3686\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":60.230116284775036,\"totalAccepted\":24551,\"totalSubmission\":40762},{\"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.25393883225209,\"totalAccepted\":2034,\"totalSubmission\":2158},{\"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\":40,\"dislikes\":4,\"categoryTitle\":\"Algorithms\",\"acRate\":\"85.0%\",\"frontendQuestionId\":\"3688\",\"paidOnly\":false,\"topicTags\":\"Array;Bit Manipulation;Simulation;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":84.98915805917602,\"totalAccepted\":72901,\"totalSubmission\":85777},{\"questionId\":\"4005\",\"title\":\"Maximum Total Subarray Value I\",\"titleSlug\":\"maximum-total-subarray-value-i\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":54,\"dislikes\":21,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.4%\",\"frontendQuestionId\":\"3689\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":64.4146844427393,\"totalAccepted\":53727,\"totalSubmission\":83408},{\"questionId\":\"3928\",\"title\":\"Split and Merge Array Transformation\",\"titleSlug\":\"split-and-merge-array-transformation\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":99,\"dislikes\":11,\"categoryTitle\":\"Algorithms\",\"acRate\":\"58.7%\",\"frontendQuestionId\":\"3690\",\"paidOnly\":false,\"topicTags\":\"Array;Hash Table;Breadth-First Search;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":58.74117702052073,\"totalAccepted\":25133,\"totalSubmission\":42786},{\"questionId\":\"4007\",\"title\":\"Maximum Total Subarray Value II\",\"titleSlug\":\"maximum-total-subarray-value-ii\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":81,\"dislikes\":4,\"categoryTitle\":\"Algorithms\",\"acRate\":\"22.3%\",\"frontendQuestionId\":\"3691\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Segment Tree;Heap (Priority Queue);\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":22.326324986522412,\"totalAccepted\":12010,\"totalSubmission\":53793},{\"questionId\":\"4053\",\"title\":\"Majority Frequency Characters\",\"titleSlug\":\"majority-frequency-characters\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":55,\"dislikes\":15,\"categoryTitle\":\"Algorithms\",\"acRate\":\"67.1%\",\"frontendQuestionId\":\"3692\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Counting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":67.0677155637822,\"totalAccepted\":30436,\"totalSubmission\":45381},{\"questionId\":\"4041\",\"title\":\"Climbing Stairs II\",\"titleSlug\":\"climbing-stairs-ii\",\"isPaidOnly\":false,\"difficulty\":\"Medium\",\"likes\":91,\"dislikes\":11,\"categoryTitle\":\"Algorithms\",\"acRate\":\"63.9%\",\"frontendQuestionId\":\"3693\",\"paidOnly\":false,\"topicTags\":\"Array;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":63.93042286105993,\"totalAccepted\":29844,\"totalSubmission\":46682},{\"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\":\"53.9%\",\"frontendQuestionId\":\"3694\",\"paidOnly\":false,\"topicTags\":\"Hash Table;String;Sliding Window;Prefix Sum;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":53.890253890253895,\"totalAccepted\":16450,\"totalSubmission\":30525},{\"questionId\":\"4010\",\"title\":\"Maximize Alternating Sum Using Swaps\",\"titleSlug\":\"maximize-alternating-sum-using-swaps\",\"isPaidOnly\":false,\"difficulty\":\"Hard\",\"likes\":58,\"dislikes\":4,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.3%\",\"frontendQuestionId\":\"3695\",\"paidOnly\":false,\"topicTags\":\"Array;Greedy;Union-Find;Sorting;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":64.26466460847601,\"totalAccepted\":9159,\"totalSubmission\":14252},{\"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.7%\",\"frontendQuestionId\":\"3696\",\"paidOnly\":true,\"topicTags\":\"Array;String;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":82.67405063291139,\"totalAccepted\":1045,\"totalSubmission\":1264},{\"questionId\":\"4039\",\"title\":\"Compute Decimal Representation\",\"titleSlug\":\"compute-decimal-representation\",\"isPaidOnly\":false,\"difficulty\":\"Easy\",\"likes\":50,\"dislikes\":2,\"categoryTitle\":\"Algorithms\",\"acRate\":\"64.8%\",\"frontendQuestionId\":\"3697\",\"paidOnly\":false,\"topicTags\":\"Array;Math;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":64.7532058397556,\"totalAccepted\":61251,\"totalSubmission\":94592},{\"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.59981538562975,\"totalAccepted\":40768,\"totalSubmission\":121334},{\"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.05333634552587,\"totalAccepted\":16094,\"totalSubmission\":48691},{\"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.6%\",\"frontendQuestionId\":\"3700\",\"paidOnly\":false,\"topicTags\":\"Math;Dynamic Programming;\",\"hasSolution\":false,\"hasVideoSolution\":false,\"acRateRaw\":57.56621164391553,\"totalAccepted\":14802,\"totalSubmission\":25713}]"
  },
  {
    "path": "index.html",
    "content": "<title>Leetcode Sorted</title>\n<img height=\"0\" width=\"0\" src=\"https://hitwebcounter.com/counter/counter.php?page=7958690&style=0025&nbdigits=6&type=page&initCount=0\" title=\"Free Counter\" Alt=\"web counter\"   border=\"0\" /> \n<iframe src=\"https://docs.google.com/spreadsheets/d/1-tziPYyuh2UmI9P4yrW3I4qhLjxqHduMsPPAE8n-F1A\" style=\"border: 0; width: 100%; height: 100%\">Your browser doesn't support iFrames.</iframe>\n"
  }
]