Full Code of adixmr/leetcode for AI

Repository: adixmr/leetcode
Branch: main
Commit: f98a24fba52c
Files: 5
Total size: 549.6 KB

Directory structure:
gitextract_7rm8drbz/

├── .gitignore
├── README.md
├── data.csv
├── data.json
└── index.html

================================================
FILE CONTENTS
================================================

================================================
FILE: .gitignore
================================================
node_modules
pacakage*.json
run*.js
leet.png


================================================
FILE: README.md
================================================

# Leetcode sorted

A 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.

Feel free to suggest any changes by opening an issue.
## Live URL

https://adityarajput.com/leetcode
  
## Screenshot

![App Screenshot](https://adityarajput.com/leetcode/leet.png)

    
## Acknowledgements
 
 - [Awesome README](https://github.com/matiassingers/awesome-readme)
 - [Leetcode](https://leetcode.com)

## Technologies used

- Nodejs
- Google Sheets
- Cron Jobs

  
## License

[MIT](https://choosealicense.com/licenses/mit/)

  
## 🔗 Links
[![linkedin](https://img.shields.io/badge/linkedin-0A66C2?style=for-the-badge&logo=linkedin&logoColor=white)](https://www.linkedin.com/in/aditya-kumar-rajput/)

  


================================================
FILE: data.csv
================================================
questionId,title,titleSlug,isPaidOnly,difficulty,likes,dislikes,categoryTitle,acRate,frontendQuestionId,paidOnly,topicTags,hasSolution,hasVideoSolution,acRateRaw,totalAccepted,totalSubmission
1,"Two Sum",two-sum,false,Easy,68699,2569,Algorithms,57.4%,1,false,Array;Hash Table;,true,true,57.35849959850313,21447113,37391339
2,"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
3,"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
4,"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
5,"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
6,"Zigzag Conversion",zigzag-conversion,false,Medium,9375,15937,Algorithms,53.9%,6,false,String;,true,true,53.934881004526204,2179451,4040893
7,"Reverse Integer",reverse-integer,false,Medium,15539,14008,Algorithms,31.8%,7,false,Math;,true,true,31.769460187150607,4945457,15566730
8,"String to Integer (atoi)",string-to-integer-atoi,false,Medium,6232,15626,Algorithms,20.9%,8,false,String;,true,false,20.862923595277895,2416993,11585147
9,"Palindrome Number",palindrome-number,false,Easy,15971,2937,Algorithms,60.5%,9,false,Math;,true,true,60.46960363329371,8030806,13280732
10,"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
11,"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
12,"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
13,"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
14,"Longest Common Prefix",longest-common-prefix,false,Easy,21393,4937,Algorithms,47.4%,14,false,Array;String;Trie;,true,true,47.41925094440872,5702274,12025238
15,"3Sum",3sum,false,Medium,35608,3285,Algorithms,38.9%,15,false,Array;Two Pointers;Sorting;,true,true,38.91890593253369,5880410,15109392
16,"3Sum Closest",3sum-closest,false,Medium,11650,622,Algorithms,48.4%,16,false,Array;Two Pointers;Sorting;,true,true,48.389814464470156,1817290,3755521
17,"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
18,"4Sum",4sum,false,Medium,12881,1540,Algorithms,40.4%,18,false,Array;Two Pointers;Sorting;,true,false,40.43119992500787,1669168,4128424
19,"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
20,"Valid Parentheses",valid-parentheses,false,Easy,27957,2009,Algorithms,44.0%,20,false,String;Stack;,true,true,44.02938756470642,7475547,16978547
21,"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
22,"Generate Parentheses",generate-parentheses,false,Medium,23293,1085,Algorithms,78.6%,22,false,String;Dynamic Programming;Backtracking;,true,true,78.55013669249351,2868346,3651602
23,"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
24,"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
25,"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
26,"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
27,"Remove Element",remove-element,false,Easy,5144,5363,Algorithms,61.7%,27,false,Array;Two Pointers;,true,true,61.664031809622045,5182244,8403998
28,"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
29,"Divide Two Integers",divide-two-integers,false,Medium,6129,15280,Algorithms,19.6%,29,false,Math;Bit Manipulation;,true,false,19.64619650020539,1155950,5883833
30,"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
31,"Next Permutation",next-permutation,false,Medium,21395,5116,Algorithms,45.1%,31,false,Array;Two Pointers;,true,true,45.081667876940365,2245503,4980966
32,"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
33,"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
34,"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
35,"Search Insert Position",search-insert-position,false,Easy,18845,902,Algorithms,51.1%,35,false,Array;Binary Search;,true,true,51.07941961700778,4696614,9194732
36,"Valid Sudoku",valid-sudoku,false,Medium,12496,1265,Algorithms,64.4%,36,false,Array;Hash Table;Matrix;,true,false,64.39874661957549,2473218,3840481
37,"Sudoku Solver",sudoku-solver,false,Hard,11119,346,Algorithms,65.4%,37,false,Array;Hash Table;Backtracking;Matrix;,true,false,65.43889399770454,1026848,1569167
38,"Count and Say",count-and-say,false,Medium,5119,9081,Algorithms,62.7%,38,false,String;,true,false,62.69199800911582,1406956,2244233
39,"Combination Sum",combination-sum,false,Medium,21004,542,Algorithms,76.4%,39,false,Array;Backtracking;,true,true,76.40358006659127,3113408,4074957
40,"Combination Sum II",combination-sum-ii,false,Medium,12277,389,Algorithms,59.3%,40,false,Array;Backtracking;,true,false,59.30248539846807,1691356,2852088
41,"First Missing Positive",first-missing-positive,false,Hard,18415,1983,Algorithms,42.8%,41,false,Array;Hash Table;,true,false,42.75575003085709,1742395,4075233
42,"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
43,"Multiply Strings",multiply-strings,false,Medium,7748,3690,Algorithms,44.0%,43,false,Math;String;Simulation;,true,false,43.9828644178692,1154217,2624239
44,"Wildcard Matching",wildcard-matching,false,Hard,9130,419,Algorithms,31.8%,44,false,String;Dynamic Programming;Greedy;Recursion;,true,false,31.77478208655832,866790,2727920
45,"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
46,"Permutations",permutations,false,Medium,20885,385,Algorithms,81.8%,46,false,Array;Backtracking;,true,false,81.83332586078429,3066325,3747039
47,"Permutations II",permutations-ii,false,Medium,9158,163,Algorithms,63.3%,47,false,Array;Backtracking;Sorting;,true,false,63.2826512300384,1281117,2024441
48,"Rotate Image",rotate-image,false,Medium,19898,966,Algorithms,79.6%,48,false,Array;Math;Matrix;,true,false,79.59910423181967,2800549,3518318
49,"Group Anagrams",group-anagrams,false,Medium,22083,758,Algorithms,72.5%,49,false,Array;Hash Table;String;Sorting;,true,true,72.45571477711128,4688837,6471317
50,"Pow(x, n)",powx-n,false,Medium,11714,10553,Algorithms,38.5%,50,false,Math;Recursion;,true,false,38.53965131819274,2691370,6983380
51,"N-Queens",n-queens,false,Hard,14352,351,Algorithms,75.3%,51,false,Array;Backtracking;,true,false,75.34238314311217,1261824,1674791
52,"N-Queens II",n-queens-ii,false,Hard,4289,283,Algorithms,78.5%,52,false,Backtracking;,true,false,78.503809045464,597061,760552
53,"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
54,"Spiral Matrix",spiral-matrix,false,Medium,17486,1572,Algorithms,56.6%,54,false,Array;Matrix;Simulation;,true,false,56.58186170804501,2370161,4188906
55,"Jump Game",jump-game,false,Medium,21760,1491,Algorithms,40.7%,55,false,Array;Dynamic Programming;Greedy;,true,false,40.739357219969676,3163825,7766016
56,"Merge Intervals",merge-intervals,false,Medium,24659,908,Algorithms,51.6%,56,false,Array;Sorting;,true,true,51.608841497174375,3956930,7667158
57,"Insert Interval",insert-interval,false,Medium,11859,920,Algorithms,45.1%,57,false,Array;,true,false,45.05625075509523,1760241,3906765
58,"Length of Last Word",length-of-last-word,false,Easy,6446,365,Algorithms,58.7%,58,false,String;,true,false,58.659431254024064,3386433,5773056
59,"Spiral Matrix II",spiral-matrix-ii,false,Medium,6916,289,Algorithms,74.9%,59,false,Array;Matrix;Simulation;,true,false,74.90262500514963,799982,1068031
60,"Permutation Sequence",permutation-sequence,false,Hard,7272,511,Algorithms,52.8%,60,false,Math;Recursion;,true,false,52.792933923708866,572900,1085184
61,"Rotate List",rotate-list,false,Medium,11282,1554,Algorithms,41.6%,61,false,Linked List;Two Pointers;,true,false,41.574168741080626,1598452,3844826
62,"Unique Paths",unique-paths,false,Medium,18393,495,Algorithms,66.7%,62,false,Math;Dynamic Programming;Combinatorics;,true,false,66.74031169335495,2804813,4202576
63,"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
64,"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
65,"Valid Number",valid-number,false,Hard,1509,2214,Algorithms,22.9%,65,false,String;,true,false,22.85469203722415,516623,2260468
66,"Plus One",plus-one,false,Easy,11870,5611,Algorithms,49.8%,66,false,Array;Math;,true,false,49.83310929232771,3704531,7433879
67,"Add Binary",add-binary,false,Easy,10780,1116,Algorithms,57.9%,67,false,Math;String;Bit Manipulation;Simulation;,true,false,57.92248518396489,2325810,4015383
68,"Text Justification",text-justification,false,Hard,4569,5404,Algorithms,50.9%,68,false,Array;String;Simulation;,true,false,50.86396086050895,646867,1271759
69,"Sqrt(x)",sqrtx,false,Easy,9715,4641,Algorithms,41.7%,69,false,Math;Binary Search;,true,true,41.68522859835111,3159934,7580470
70,"Climbing Stairs",climbing-stairs,false,Easy,24527,1048,Algorithms,54.0%,70,false,Math;Dynamic Programming;Memoization;,true,false,54.01779638553948,5076413,9397674
71,"Simplify Path",simplify-path,false,Medium,6564,1416,Algorithms,50.4%,71,false,String;Stack;,true,true,50.40143248496351,1317305,2613633
72,"Edit Distance",edit-distance,false,Medium,16451,325,Algorithms,60.4%,72,false,String;Dynamic Programming;,true,false,60.42920099957352,1441003,2384615
73,"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
74,"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
75,"Sort Colors",sort-colors,false,Medium,21665,772,Algorithms,69.5%,75,false,Array;Two Pointers;Sorting;,true,false,69.46769801147713,3697221,5322221
76,"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
77,"Combinations",combinations,false,Medium,8932,255,Algorithms,74.5%,77,false,Backtracking;,true,false,74.46689289796909,1326301,1781062
78,"Subsets",subsets,false,Medium,19242,341,Algorithms,82.2%,78,false,Array;Backtracking;Bit Manipulation;,true,true,82.24396268906565,3019068,3670871
79,"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
80,"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
81,"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
82,"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
83,"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
84,"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
85,"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
86,"Partition List",partition-list,false,Medium,8058,984,Algorithms,61.0%,86,false,Linked List;Two Pointers;,true,false,60.9845554371909,903362,1481297
87,"Scramble String",scramble-string,false,Hard,3639,1313,Algorithms,44.3%,87,false,String;Dynamic Programming;,true,false,44.349097381133994,313965,707940
88,"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
89,"Gray Code",gray-code,false,Medium,2542,2837,Algorithms,64.7%,89,false,Math;Backtracking;Bit Manipulation;,true,false,64.66586665357183,421399,651656
90,"Subsets II",subsets-ii,false,Medium,10951,417,Algorithms,61.2%,90,false,Array;Backtracking;Bit Manipulation;,true,false,61.16009862165439,1483892,2426242
91,"Decode Ways",decode-ways,false,Medium,12900,4614,Algorithms,37.9%,91,false,String;Dynamic Programming;,true,true,37.85758824971738,1648958,4355695
92,"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
93,"Restore IP Addresses",restore-ip-addresses,false,Medium,5664,821,Algorithms,55.8%,93,false,String;Backtracking;,true,false,55.784957865155974,623123,1117009
94,"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
95,"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
96,"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
97,"Interleaving String",interleaving-string,false,Medium,8854,556,Algorithms,43.8%,97,false,String;Dynamic Programming;,true,false,43.841936831640076,779653,1778327
98,"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
99,"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
100,"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
401,"Binary Watch",binary-watch,false,Easy,1968,3078,Algorithms,65.4%,401,false,Backtracking;Bit Manipulation;,true,false,65.39265042526661,281089,429848
402,"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
403,"Frog Jump",frog-jump,false,Hard,5997,278,Algorithms,47.2%,403,false,Array;Dynamic Programming;,true,false,47.23564849111723,337938,715429
404,"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
405,"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
406,"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
407,"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
408,"Valid Word Abbreviation",valid-word-abbreviation,true,Easy,926,2406,Algorithms,37.0%,408,true,Two Pointers;String;,false,false,37.029378902533566,361573,976449
409,"Longest Palindrome",longest-palindrome,false,Easy,6388,451,Algorithms,55.9%,409,false,Hash Table;String;Greedy;,true,false,55.92547316680474,1050384,1878185
410,"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
411,"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
412,"Fizz Buzz",fizz-buzz,false,Easy,3388,465,Algorithms,75.4%,412,false,Math;String;Simulation;,true,true,75.43889930707157,1774459,2352183
413,"Arithmetic Slices",arithmetic-slices,false,Medium,5639,306,Algorithms,64.8%,413,false,Array;Dynamic Programming;Sliding Window;,true,false,64.82906864586255,367645,567099
414,"Third Maximum Number",third-maximum-number,false,Easy,3547,3545,Algorithms,39.2%,414,false,Array;Sorting;,true,false,39.24332392995469,835500,2129023
415,"Add Strings",add-strings,false,Easy,5468,833,Algorithms,52.1%,415,false,Math;String;Simulation;,true,false,52.131376193691246,938138,1799565
416,"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
417,"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
418,"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
419,"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
420,"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
421,"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
422,"Valid Word Square",valid-word-square,true,Easy,451,274,Algorithms,42.9%,422,true,Array;Matrix;,true,false,42.86876404765205,71142,165953
423,"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
424,"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
425,"Word Squares",word-squares,true,Hard,1124,75,Algorithms,54.7%,425,true,Array;String;Backtracking;Trie;,true,false,54.682894236941735,83480,152662
758,"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
772,"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
765,"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
764,"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
766,"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
771,"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
432,"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
433,"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
434,"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
435,"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
436,"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
437,"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
438,"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
439,"Ternary Expression Parser",ternary-expression-parser,true,Medium,514,74,Algorithms,62.6%,439,true,String;Stack;Recursion;,true,false,62.567519487660505,38688,61834
440,"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
441,"Arranging Coins",arranging-coins,false,Easy,4359,1380,Algorithms,48.1%,441,false,Math;Binary Search;,true,false,48.119426946910146,619833,1288113
442,"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
443,"String Compression",string-compression,false,Medium,6226,8905,Algorithms,59.9%,443,false,Two Pointers;String;,true,false,59.85032289689786,1064673,1778891
444,"Sequence Reconstruction",sequence-reconstruction,true,Medium,616,1549,Algorithms,30.7%,444,true,Array;Graph Theory;Topological Sort;,false,false,30.680694817116226,65175,212430
445,"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
446,"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
447,"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
448,"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
449,"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
450,"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
451,"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
452,"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
453,"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
454,"4Sum II",4sum-ii,false,Medium,5084,151,Algorithms,57.9%,454,false,Array;Hash Table;,true,false,57.917356710829495,386091,666624
455,"Assign Cookies",assign-cookies,false,Easy,5018,460,Algorithms,54.8%,455,false,Array;Two Pointers;Greedy;Sorting;,true,false,54.848683396263375,935054,1704791
456,"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
457,"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
458,"Poor Pigs",poor-pigs,false,Hard,1874,3369,Algorithms,59.1%,458,false,Math;Dynamic Programming;Combinatorics;,true,false,59.109794653269546,133304,225516
459,"Repeated Substring Pattern",repeated-substring-pattern,false,Easy,6873,570,Algorithms,48.1%,459,false,String;String Matching;,true,false,48.10847053799565,610598,1269211
460,"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
461,"Hamming Distance",hamming-distance,false,Easy,4037,231,Algorithms,76.7%,461,false,Bit Manipulation;,true,false,76.73416515689058,689524,898588
462,"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
463,"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
464,"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
465,"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
466,"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
467,"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
468,"Validate IP Address",validate-ip-address,false,Medium,1124,2746,Algorithms,28.3%,468,false,String;,true,false,28.28031481484079,201617,712924
469,"Convex Polygon",convex-polygon,true,Medium,103,242,Algorithms,40.2%,469,true,Array;Math;Geometry;,false,false,40.1980402980955,11651,28984
903,"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
471,"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
472,"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
473,"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
474,"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
475,"Heaters",heaters,false,Medium,2365,1200,Algorithms,41.7%,475,false,Array;Two Pointers;Binary Search;Sorting;,false,false,41.733488505987516,169616,406428
476,"Number Complement",number-complement,false,Easy,3236,145,Algorithms,70.4%,476,false,Bit Manipulation;,true,false,70.43155683537758,551546,783095
477,"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
915,"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
479,"Largest Palindrome Product",largest-palindrome-product,false,Hard,194,1569,Algorithms,38.5%,479,false,Math;Enumeration;,false,false,38.518551842812634,34248,88913
480,"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
481,"Magical String",magical-string,false,Medium,383,1425,Algorithms,55.0%,481,false,Two Pointers;String;,false,false,54.99729503762357,55912,101664
482,"License Key Formatting",license-key-formatting,false,Easy,1208,1472,Algorithms,45.9%,482,false,String;,true,false,45.88645446268493,359848,784214
483,"Smallest Good Base",smallest-good-base,false,Hard,427,540,Algorithms,45.9%,483,false,Math;Binary Search;,false,false,45.877630564726076,31544,68758
484,"Find Permutation",find-permutation,true,Medium,728,151,Algorithms,66.9%,484,true,Array;String;Stack;Greedy;,true,false,66.86304750154225,43354,64840
485,"Max Consecutive Ones",max-consecutive-ones,false,Easy,6895,500,Algorithms,65.0%,485,false,Array;,true,false,64.96435629189752,2246248,3457665
486,"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
487,"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
488,"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
865,"Robot Room Cleaner",robot-room-cleaner,true,Hard,2898,193,Algorithms,78.0%,489,true,Backtracking;Interactive;,true,false,77.96789394760015,211615,271413
490,"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
491,"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
492,"Construct the Rectangle",construct-the-rectangle,false,Easy,800,394,Algorithms,63.6%,492,false,Math;,false,false,63.55567738565772,171572,269956
493,"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
494,"Target Sum",target-sum,false,Medium,12407,416,Algorithms,52.1%,494,false,Array;Dynamic Programming;Backtracking;,true,false,52.09162716762029,1079115,2071570
495,"Teemo Attacking",teemo-attacking,false,Easy,1369,158,Algorithms,57.6%,495,false,Array;Simulation;,true,false,57.61289851900489,221115,383795
496,"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
914,"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
498,"Diagonal Traverse",diagonal-traverse,false,Medium,4331,785,Algorithms,67.1%,498,false,Array;Matrix;Simulation;,true,false,67.11188856526093,558987,832918
499,"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
500,"Keyboard Row",keyboard-row,false,Easy,1830,1158,Algorithms,73.8%,500,false,Array;Hash Table;String;,false,false,73.76990959481755,328191,444885
937,"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
938,"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
939,"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
940,"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
941,"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
942,"Super Palindromes",super-palindromes,false,Hard,376,423,Algorithms,39.9%,906,false,Math;String;Enumeration;,true,false,39.92871364326191,28678,71823
943,"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
944,"Smallest Range I",smallest-range-i,false,Easy,794,2089,Algorithms,73.5%,908,false,Array;Math;,true,false,73.4504854254888,125059,170263
945,"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
946,"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
947,"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
948,"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
949,"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
950,"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
951,"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
952,"Word Subsets",word-subsets,false,Medium,3540,317,Algorithms,55.9%,916,false,Array;Hash Table;String;,true,false,55.91531336663454,265742,475258
953,"Reverse Only Letters",reverse-only-letters,false,Easy,2455,87,Algorithms,68.4%,917,false,Two Pointers;String;,true,false,68.36653102917043,326616,477743
954,"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
955,"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
956,"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
957,"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
958,"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
959,"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
960,"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
961,"Long Pressed Name",long-pressed-name,false,Easy,2598,409,Algorithms,32.9%,925,false,Two Pointers;String;,true,false,32.85925845043028,192595,586122
962,"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
963,"Three Equal Parts",three-equal-parts,false,Hard,856,126,Algorithms,41.3%,927,false,Array;Math;,true,false,41.29737729178656,35161,85141
964,"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
965,"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
966,"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
967,"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
968,"Beautiful Array",beautiful-array,false,Medium,1160,1602,Algorithms,69.1%,932,false,Array;Math;Divide and Conquer;,true,false,69.08810242673266,60866,88099
969,"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
971,"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
972,"Knight Dialer",knight-dialer,false,Medium,3204,452,Algorithms,61.8%,935,false,Dynamic Programming;,true,false,61.836124898835884,200946,324964
973,"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
974,"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
975,"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
976,"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
977,"Distinct Subsequences II",distinct-subsequences-ii,false,Hard,1833,40,Algorithms,44.1%,940,false,String;Dynamic Programming;,true,true,44.09531357860558,51740,117337
978,"Valid Mountain Array",valid-mountain-array,false,Easy,3158,211,Algorithms,35.2%,941,false,Array;,true,false,35.16554955839673,561474,1596666
979,"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
980,"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
981,"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
982,"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
983,"Validate Stack Sequences",validate-stack-sequences,false,Medium,6117,132,Algorithms,70.3%,946,false,Array;Stack;Simulation;,true,false,70.3330539320073,372553,529700
984,"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
985,"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
986,"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
987,"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
988,"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
989,"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
990,"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
991,"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
992,"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
993,"Tallest Billboard",tallest-billboard,false,Hard,2487,63,Algorithms,51.8%,956,false,Array;Dynamic Programming;,true,false,51.82075692092045,70981,136974
994,"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
998,"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
999,"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
1000,"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
1001,"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
1002,"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
1003,"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
1004,"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
1005,"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
1006,"Vowel Spellchecker",vowel-spellchecker,false,Medium,853,1003,Algorithms,61.4%,966,false,Array;Hash Table;String;,true,false,61.404686355870155,140882,229432
1007,"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
1008,"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
1009,"Pancake Sorting",pancake-sorting,false,Medium,1601,1561,Algorithms,71.7%,969,false,Array;Two Pointers;Greedy;Sorting;,true,false,71.7433347147396,114257,159258
1010,"Powerful Integers",powerful-integers,false,Medium,422,86,Algorithms,44.6%,970,false,Hash Table;Math;Enumeration;,true,false,44.56499090113493,64162,143974
1011,"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
1012,"Equal Rational Numbers",equal-rational-numbers,false,Hard,107,218,Algorithms,46.1%,972,false,Math;String;,true,false,46.090080132633325,10008,21714
1014,"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
1016,"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
1017,"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
1018,"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
1019,"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
1020,"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
1021,"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
1022,"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
1023,"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
1024,"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
1025,"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
1026,"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
1027,"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
1028,"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
1029,"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
1030,"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
1031,"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
1032,"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
1033,"Broken Calculator",broken-calculator,false,Medium,2842,218,Algorithms,56.0%,991,false,Math;Greedy;,true,false,56.022867780246656,122787,219173
1034,"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
1035,"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
1036,"Rotting Oranges",rotting-oranges,false,Medium,15171,477,Algorithms,58.5%,994,false,Array;Breadth-First Search;Matrix;,true,false,58.486655923488264,1628124,2783757
1037,"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
1038,"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
1039,"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
1040,"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
1041,"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
1042,"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
1234,"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
1254,"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
1438,"Find the Team Size",find-the-team-size,true,Easy,344,16,Database,89.5%,1303,true,Database;,false,false,89.52826151364519,81588,91131
1426,"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
1427,"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
1428,"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
1429,"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
1439,"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
1434,"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
1435,"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
1436,"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
1437,"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
1241,"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
1242,"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
1243,"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
1244,"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
1440,"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
1441,"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
1442,"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
1443,"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
1452,"Restaurant Growth",restaurant-growth,false,Medium,1172,388,Database,58.6%,1321,false,Database;,false,false,58.58627525122317,255649,436364
1453,"Ads Performance",ads-performance,true,Easy,273,68,Database,58.6%,1322,true,Database;,true,false,58.59021579232615,52972,90411
1448,"Maximum 69 Number",maximum-69-number,false,Easy,3319,240,Algorithms,84.5%,1323,false,Math;Greedy;,true,false,84.54692920412137,488896,578254
1449,"Print Words Vertically",print-words-vertically,false,Medium,826,121,Algorithms,67.5%,1324,false,Array;String;Simulation;,false,false,67.4908342445488,52463,77734
1450,"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
1451,"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
1462,"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
1252,"Break a Palindrome",break-a-palindrome,false,Medium,2447,755,Algorithms,51.6%,1328,false,String;Greedy;,true,false,51.55900838902466,197041,382166
1253,"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
1255,"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
1256,"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
1454,"Remove Palindromic Subsequences",remove-palindromic-subsequences,false,Easy,1751,1803,Algorithms,77.0%,1332,false,Two Pointers;String;,true,false,77.01898242182602,153572,199395
1455,"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
1456,"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
1457,"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
1467,"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
1463,"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
1464,"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
1465,"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
1466,"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
1480,"Movie Rating",movie-rating,false,Medium,1007,242,Database,43.2%,1341,false,Database;,false,false,43.19080124045491,292194,676521
1444,"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
1445,"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
1446,"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
1447,"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
1468,"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
1469,"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
1470,"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
1471,"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
1481,"Students With Invalid Departments",students-with-invalid-departments,true,Easy,184,9,Database,89.7%,1350,true,Database;,false,false,89.72657144011093,66648,74279
1476,"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
1477,"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
1478,"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
1479,"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
1494,"Activity Participants",activity-participants,true,Medium,152,48,Database,72.0%,1355,true,Database;,true,false,71.99886520223717,35530,49348
1458,"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
1459,"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
1460,"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
1461,"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
1274,"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
1275,"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
1276,"Closest Divisors",closest-divisors,false,Medium,339,101,Algorithms,62.1%,1362,false,Math;,false,false,62.12225127523683,28985,46658
1277,"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
1495,"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
1482,"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
1483,"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
1484,"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
1485,"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
1504,"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
1472,"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
1473,"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
1474,"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
1475,"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
1490,"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
1491,"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
1492,"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
1493,"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
1509,"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
1498,"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
1496,"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
1497,"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
1285,"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
1499,"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
1518,"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
1486,"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
1487,"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
1488,"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
1489,"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
1505,"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
1284,"Four Divisors",four-divisors,false,Medium,892,223,Algorithms,56.6%,1390,false,Array;Math;,true,false,56.62218192737688,196103,346336
1507,"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
1508,"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
1523,"Capital Gain/Loss",capital-gainloss,false,Medium,930,51,Database,84.6%,1393,false,Database;,true,false,84.6482241296851,168141,198635
1510,"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
1511,"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
1512,"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
1513,"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
1536,"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
1500,"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
1502,"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
1928,"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
1929,"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
1907,"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
1949,"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
1933,"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
1935,"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
1934,"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
1936,"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
1958,"Ad-Free Sessions",ad-free-sessions,true,Easy,99,61,Database,59.0%,1809,true,Database;,false,false,58.96781553981025,19641,33308
1959,"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
1964,"Find Interview Candidates",find-interview-candidates,true,Medium,212,30,Database,60.8%,1811,true,Database;,false,false,60.78802157604315,19609,32258
1920,"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
1923,"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
1925,"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
1924,"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
1944,"Truncate Sentence",truncate-sentence,false,Easy,1231,34,Algorithms,86.8%,1816,false,Array;String;,false,false,86.78828346921459,235256,271069
1945,"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
1946,"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
1947,"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
1969,"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
1974,"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
1950,"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
1951,"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
1952,"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
1953,"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
1980,"Faulty Sensor",faulty-sensor,true,Easy,72,85,Algorithms,50.5%,1826,true,Array;Two Pointers;,false,false,50.466016633209065,7039,13948
1938,"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
1939,"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
1940,"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
1941,"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
1981,"Maximum Transaction Each Day",maximum-transaction-each-day,true,Medium,96,3,Database,82.4%,1831,true,Database;,false,false,82.44637205485876,28134,34124
1960,"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
1961,"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
1962,"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
1963,"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
1982,"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
1965,"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
1966,"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
1967,"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
1968,"Maximum Building Height",maximum-building-height,false,Hard,404,23,Algorithms,38.4%,1840,false,Array;Math;Sorting;,false,false,38.43987944162436,9693,25216
1991,"League Statistics",league-statistics,true,Medium,114,98,Database,53.5%,1841,true,Database;,true,false,53.46615099613247,16451,30769
1997,"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
1998,"Suspicious Bank Accounts",suspicious-bank-accounts,true,Medium,104,59,Database,44.2%,1843,true,Database;,true,false,44.165646674826604,15155,34314
1954,"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
1955,"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
1956,"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
1957,"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
1975,"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
1976,"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
1978,"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
1977,"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
2003,"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
2004,"Convert Date Format",convert-date-format,true,Easy,69,42,Database,85.0%,1853,true,Database;,false,false,84.95369145276528,16052,18895
1983,"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
1984,"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
1985,"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
1986,"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
2009,"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
1970,"Sorting the Sentence",sorting-the-sentence,false,Easy,2398,83,Algorithms,84.1%,1859,false,String;Sorting;,false,false,84.07236722517456,235881,280569
1971,"Incremental Memory Leak",incremental-memory-leak,false,Medium,236,93,Algorithms,72.8%,1860,false,Math;Simulation;,false,false,72.78657710700168,26332,36177
1972,"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
1326,"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
1993,"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
1994,"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
1995,"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
1996,"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
2014,"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
2019,"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
1999,"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
2000,"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
2001,"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
2002,"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
2024,"Calculate Special Bonus",calculate-special-bonus,false,Easy,1190,83,Database,57.0%,1873,false,Database;,true,false,57.00539328596338,344254,603895
2029,"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
2030,"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
1987,"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
1988,"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
1990,"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
1989,"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
2010,"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
2011,"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
2012,"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
2013,"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
2031,"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
2036,"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
2015,"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
2016,"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
2017,"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
2018,"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
2041,"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
2045,"Cutting Ribbons",cutting-ribbons,true,Medium,630,70,Algorithms,53.0%,1891,true,Array;Binary Search;,true,false,53.025042342124365,87661,165320
2046,"Page Recommendations II",page-recommendations-ii,true,Hard,93,24,Database,45.6%,1892,true,Database;,false,false,45.62694838933148,10538,23096
2005,"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
2006,"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
1311,"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
2008,"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
2025,"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
2027,"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
2026,"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
2028,"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
1312,"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
1346,"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
2321,"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
1347,"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
2336,"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
2308,"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
2309,"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
2310,"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
2311,"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
2316,"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
2317,"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
2318,"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
2319,"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
2354,"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
1392,"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
1355,"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
1375,"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
1393,"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
2369,"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
2323,"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
2324,"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
2325,"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
2326,"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
2345,"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
1354,"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
1335,"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
1433,"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
2370,"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
1416,"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
2371,"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
2327,"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
2328,"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
2329,"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
2330,"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
2383,"Add Two Integers",add-two-integers,false,Easy,2142,3226,Algorithms,88.0%,2235,false,Math;,false,false,87.95011965441778,885347,1006647
2384,"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
2385,"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
2376,"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
2350,"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
2351,"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
2352,"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
2353,"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
2361,"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
2362,"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
2363,"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
2364,"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
2007,"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
2331,"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
2332,"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
2333,"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
2334,"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
2381,"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
2382,"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
2396,"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
2341,"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
2342,"Minimum Average Difference",minimum-average-difference,false,Medium,1570,182,Algorithms,43.8%,2256,false,Array;Prefix Sum;,true,false,43.849634840270625,97868,223190
2343,"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
2344,"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
2337,"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
2338,"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
2339,"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
2340,"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
1419,"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
2346,"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
2347,"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
2348,"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
2349," 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
2405,"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
1430,"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
2358,"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
2359,"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
2360,"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
1353,"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
2355,"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
2356,"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
2357,"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
2420,"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
2365,"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
2366,"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
2367,"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
2368,"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
2425,"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
2377,"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
2378,"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
2379,"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
2380,"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
2372,"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
2373,"Apply Discount to Prices",apply-discount-to-prices,false,Medium,223,1130,Algorithms,34.1%,2288,false,String;,false,false,34.08593235112784,32066,94074
2374,"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
2375,"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
2426,"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
2431,"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
2386,"Min Max Game",min-max-game,false,Easy,591,33,Algorithms,64.3%,2293,false,Array;Simulation;,false,false,64.28854998789639,66394,103274
2387,"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
2388,"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
2389,"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
2056,"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
2440,"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
2391,"Strong Password Checker II",strong-password-checker-ii,false,Easy,386,41,Algorithms,55.4%,2299,false,String;,false,false,55.37899525957861,58061,104843
2392,"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
2853,"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
2729,"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
2820,"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
2813,"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
2804,"Compact Object",compact-object,false,Medium,230,25,JavaScript,68.0%,2705,false,,true,false,68.02474767634145,47718,70148
2756,"Buy Two Chocolates",buy-two-chocolates,false,Easy,1071,72,Algorithms,68.4%,2706,false,Array;Greedy;Sorting;,true,false,68.352696804341,224094,327850
2755,"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
2754,"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
2827,"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
2819,"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
2801,"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
2817,"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
2818,"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
2865,"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
2821,"Timeout Cancellation",timeout-cancellation,false,Easy,322,375,JavaScript,89.5%,2715,false,,true,false,89.5228397879288,101988,113924
2825,"Minimize String Length",minimize-string-length,false,Easy,378,109,Algorithms,79.1%,2716,false,Hash Table;String;,false,false,79.10052125060581,79973,101103
2785,"Semi-Ordered Permutation",semi-ordered-permutation,false,Easy,229,21,Algorithms,64.2%,2717,false,Array;Simulation;,false,false,64.2043261566344,38260,59591
2838,"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
2757,"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
2874,"Popularity Percentage",popularity-percentage,true,Hard,14,9,Database,53.3%,2720,true,Database;,true,false,53.333333333333336,3984,7470
2807,"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
2858,"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
2859,"Add Two Promises",add-two-promises,false,Easy,364,33,JavaScript,91.7%,2723,false,,true,false,91.66414050047426,187474,204523
2860,"Sort By",sort-by,false,Easy,233,49,JavaScript,83.1%,2724,false,,true,false,83.0646562739586,81256,97823
2862,"Interval Cancellation",interval-cancellation,false,Easy,217,99,JavaScript,84.8%,2725,false,,true,false,84.8233746145579,84451,99561
2863,"Calculator with Method Chaining",calculator-with-method-chaining,false,Easy,153,22,JavaScript,77.5%,2726,false,,true,false,77.53352689064013,56079,72329
2864,"Is Object Empty",is-object-empty,false,Easy,225,16,JavaScript,81.9%,2727,false,,true,false,81.90576115986265,120217,146775
2875,"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
2824,"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
2786,"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
2787,"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
2826,"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
2836,"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
2828,"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
2810,"Collecting Chocolates",collecting-chocolates,false,Medium,314,556,Algorithms,34.9%,2735,false,Array;Enumeration;,false,false,34.89837862525691,15282,43790
2839,"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
2880,"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
2885,"Count Occurrences in Text",count-occurrences-in-text,true,Medium,29,48,Database,54.5%,2738,true,Database;,true,false,54.505087881591116,11784,21620
2857,"Total Distance Traveled",total-distance-traveled,false,Easy,329,107,Algorithms,41.4%,2739,false,Math;Simulation;,false,false,41.358206320249515,63252,152937
2845,"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
2848,"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
2808,"Painting the Walls",painting-the-walls,false,Hard,1502,95,Algorithms,49.0%,2742,false,Array;Dynamic Programming;,true,false,49.000403014056644,80246,163766
2890,"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
2847,"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
2850,"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
2854,"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
2833,"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
2831,"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
2837,"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
2867,"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
2846,"Robot Collisions",robot-collisions,false,Hard,1515,114,Algorithms,61.6%,2751,false,Array;Stack;Sorting;Simulation;,true,false,61.59071865936191,191116,310300
2852,"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
2897,"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
2770,"Bind Function to Context",bind-function-to-context,true,Medium,17,0,JavaScript,87.2%,2754,true,,true,false,87.20565149136577,1111,1274
2795,"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
2806,"Query Batching",query-batching,true,Hard,15,5,JavaScript,68.0%,2756,true,,true,false,68.04511278195488,543,798
2814,"Generate Circular Array Values",generate-circular-array-values,true,Medium,11,2,JavaScript,75.5%,2757,true,,true,false,75.50585729499467,709,939
2822,"Next Day",next-day,true,Easy,13,1,JavaScript,85.9%,2758,true,,true,false,85.93500266382526,1613,1877
2851,"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
2866,"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
2873,"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
2868,"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
2849,"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
2918,"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
2870,"Longest Alternating Subarray",longest-alternating-subarray,false,Easy,247,188,Algorithms,35.2%,2765,false,Array;Enumeration;,false,false,35.22615587294285,33691,95642
2834,"Relocate Marbles",relocate-marbles,false,Medium,212,19,Algorithms,51.4%,2766,false,Array;Hash Table;Sorting;Simulation;,false,false,51.442453077434834,25517,49603
2883,"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
2889,"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
2812,"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
2855,"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
2869,"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
2878,"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
2944,"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
2768,"Array Upper Bound",array-upper-bound,true,Easy,23,2,JavaScript,82.4%,2774,true,,true,false,82.35711750088747,2320,2817
2781,"Undefined to Null",undefined-to-null,true,Medium,15,1,JavaScript,72.3%,2775,true,,true,false,72.30113636363636,1018,1408
2782,"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
2799,"Date Range Generator",date-range-generator,true,Medium,11,2,JavaScript,82.9%,2777,true,,true,false,82.87671232876713,726,876
2844,"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
2891,"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
2888,"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
2884,"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
2995,"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
3002,"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
2892,"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
2887,"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
2893,"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
2882,"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
2881,"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
2872,"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
2919,"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
2905,"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
3016,"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
3003,"Status of Flight Tickets",status-of-flight-tickets,true,Hard,13,21,Database,79.0%,2793,true,,false,false,79.00626678603402,3530,4468
2861,"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
2898,"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
2899,"Repeat String",repeat-string,true,Easy,26,2,JavaScript,93.1%,2796,true,,true,false,93.07858687815428,3873,4161
2900,"Partial Function with Placeholders",partial-function-with-placeholders,true,Easy,11,4,JavaScript,89.3%,2797,true,,false,false,89.33804951995957,1768,1979
2876,"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
2856,"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
2877,"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
3374,"Count Alternating Subarrays",count-alternating-subarrays,false,Medium,242,10,Algorithms,57.4%,3101,false,Array;Math;,false,false,57.387377130061864,45363,79047
3344,"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
3409,"Find Trending Hashtags II ",find-trending-hashtags-ii,true,Hard,11,2,Database,66.6%,3103,true,Database;,false,false,66.63914120561519,1614,2422
3410,"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
3372,"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
3346,"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
3387,"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
3348,"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
3417,"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
3379,"Score of a String",score-of-a-string,false,Easy,858,52,Algorithms,91.3%,3110,false,String;,true,false,91.3378645682489,444670,486841
3390,"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
3389,"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
3382,"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
3361,"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
3373,"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
3375,"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
3364,"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
3424,"Friday Purchase III ",friday-purchase-iii,true,Medium,6,7,Database,55.2%,3118,true,Database;,false,false,55.21472392638037,2430,4401
3425,"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
3408,"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
3405,"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
3404,"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
3386,"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
3432,"Find Longest Calls",find-longest-calls,true,Medium,7,5,Database,63.8%,3124,true,Database;,false,false,63.77754459601259,3039,4765
3433,"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
3440,"Server Utilization Time",server-utilization-time,true,Medium,10,16,Database,60.6%,3126,true,Database;,false,false,60.61899679829242,2840,4685
3398,"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
3388,"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
3406,"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
3407,"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
3397,"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
3399,"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
3394,"Minimum Array End",minimum-array-end,false,Medium,816,99,Algorithms,55.4%,3133,false,Bit Manipulation;,true,false,55.441585710123675,110372,199078
3362,"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
3441,"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
3396,"Valid Word",valid-word,false,Easy,483,170,Algorithms,50.9%,3136,false,String;,true,false,50.87086734968073,208246,409362
3384,"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
3395,"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
3402,"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
3448,"Consecutive Available Seats II",consecutive-available-seats-ii,true,Medium,13,2,Database,55.5%,3140,true,Database;,false,false,55.50635348479014,2883,5194
3449,"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
3415,"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
3419,"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
3403,"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
3411,"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
3412,"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
3383,"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
3391,"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
3431,"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
3457,"Invalid Tweets II",invalid-tweets-ii,true,Easy,18,3,Database,84.9%,3150,true,Database;,false,false,84.86634392759419,4032,4751
3429,"Special Array I",special-array-i,false,Easy,582,33,Algorithms,81.6%,3151,false,Array;,true,false,81.61228215560803,261964,320986
3427,"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
3416,"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
3414,"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
3458,"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
3465,"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
3467,"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
3428,"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
3420,"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
3434,"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
3435,"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
3446,"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
3451,"String Compression III",string-compression-iii,false,Medium,634,54,Algorithms,67.0%,3163,false,String;,true,false,67.02978087517687,202749,302476
3444,"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
3423,"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
3473,"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
3474,"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
3426,"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
3430,"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
3445,"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
3436,"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
3481,"Second Day Verification",second-day-verification,true,Easy,11,1,Database,66.7%,3172,true,Database;,false,false,66.71336018210471,3810,5711
3472,"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
3447,"Clear Digits",clear-digits,false,Easy,704,27,Algorithms,82.7%,3174,false,String;Stack;Simulation;,true,false,82.69206948417731,280381,339066
3413,"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
3456,"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
3452,"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
3450,"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
3422,"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
3442,"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
3443,"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
3488,"Find Top Scoring Students",find-top-scoring-students,true,Medium,16,3,Database,49.8%,3182,true,Database;,false,false,49.76828864614366,3007,6042
3489,"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
3421,"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
3418,"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
3437,"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
3438,"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
3503,"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
3504,"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
3476,"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
3475,"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
3477,"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
3460,"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
3471,"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
3461,"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
3464,"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
3459,"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
3505,"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
3506,"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
3469,"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
3942,"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
3912,"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
3927,"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
3916,"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
3920,"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
3934,"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
3863,"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
3908,"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
3922,"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
3949,"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
3943,"Find Overbooked Employees",find-overbooked-employees,false,Medium,46,10,Database,44.0%,3611,false,Database;,false,false,44.03396844555565,10215,23198
3931,"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
3881,"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
3939,"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
3930,"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
3960,"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
3961,"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
3936,"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
3823,"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
3919,"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
3937,"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
3918,"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
3886,"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
3941,"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
3897,"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
3971,"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
3766,"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
3948,"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
3933,"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
3882,"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
3969,"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
3929,"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
3965,"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
3958,"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
3967,"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
3955,"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
3952,"Trionic Array I",trionic-array-i,false,Easy,473,40,Algorithms,49.5%,3637,false,Array;,true,false,49.53415952022618,195174,394019
3954,"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
3944,"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
3956,"Trionic Array II",trionic-array-ii,false,Hard,383,38,Algorithms,47.3%,3640,false,Array;Dynamic Programming;,true,false,47.31655903904708,84849,179321
3992,"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
3996,"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
3973,"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
3950,"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
3959,"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
3951,"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
3987,"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
3945,"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
3963,"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
3887,"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
3889,"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
3980,"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
3974,"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
3966,"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
3975,"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
4006,"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
4025,"Find Loyal Customers",find-loyal-customers,false,Medium,44,1,Database,60.3%,3657,false,,false,false,60.33025024116212,10632,17623
3995,"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
3979,"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
3981,"Jump Game IX",jump-game-ix,false,Medium,185,14,Algorithms,24.0%,3660,false,Array;Dynamic Programming;,false,false,24.043208574201444,17094,71097
3982,"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
4017,"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
3994,"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
3877,"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
3938,"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
3983,"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
4029,"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
4008,"Restore Finishing Order",restore-finishing-order,false,Easy,121,5,Algorithms,91.2%,3668,false,Array;Hash Table;,false,false,91.17527155449662,100642,110383
3947,"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
3915,"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
3989,"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
4036,"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
4043,"Find Zombie Sessions",find-zombie-sessions,false,Hard,29,3,Database,48.5%,3673,false,,false,false,48.518284993694834,6156,12688
3998,"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
3999,"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
4000,"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
4023,"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
4011,"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
3953," 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
3991,"Generate Schedule",generate-schedule,false,Medium,50,25,Algorithms,24.3%,3680,false,Array;Math;Greedy;,false,false,24.334246858679354,4706,19339
3990,"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
4050,"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
4012,"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
3997,"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
3873,"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
4027,"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
4060,"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
4009,"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
4005,"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
3928,"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
4007,"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
4053,"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
4041,"Climbing Stairs II",climbing-stairs-ii,false,Medium,91,11,Algorithms,63.9%,3693,false,Array;Dynamic Programming;,false,false,63.93042286105993,29844,46682
4021,"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
4010,"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
4066,"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
4039,"Compute Decimal Representation",compute-decimal-representation,false,Easy,50,2,Algorithms,64.8%,3697,false,Array;Math;,false,false,64.7532058397556,61251,94592
4015,"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
3962,"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
3964,"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


================================================
FILE: data.json
================================================
[{"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,"ha